./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-72.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-72.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8a6b1e16ae829d5686c91b3f759f297edb0ae10a608027b90b675b6283e6173a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:51:52,217 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:51:52,288 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:51:52,292 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:51:52,293 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:51:52,311 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:51:52,312 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:51:52,312 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:51:52,313 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:51:52,313 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:51:52,313 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:51:52,314 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:51:52,314 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:51:52,315 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:51:52,315 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:51:52,315 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:51:52,316 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:51:52,316 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:51:52,316 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:51:52,317 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:51:52,317 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:51:52,317 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:51:52,318 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:51:52,318 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:51:52,319 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:51:52,319 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:51:52,319 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:51:52,319 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:51:52,320 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:51:52,320 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:51:52,320 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:51:52,321 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:51:52,321 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:51:52,321 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:51:52,322 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:51:52,322 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:51:52,322 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:51:52,322 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:51:52,323 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:51:52,323 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:51:52,323 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:51:52,325 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:51:52,326 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8a6b1e16ae829d5686c91b3f759f297edb0ae10a608027b90b675b6283e6173a [2024-10-24 11:51:52,585 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:51:52,610 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:51:52,614 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:51:52,615 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:51:52,616 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:51:52,617 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-72.i [2024-10-24 11:51:54,081 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:51:54,301 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:51:54,302 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-72.i [2024-10-24 11:51:54,313 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45048d1e8/159265f6c7b7494eab3c0c9c73905207/FLAGe395a0d6c [2024-10-24 11:51:54,326 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45048d1e8/159265f6c7b7494eab3c0c9c73905207 [2024-10-24 11:51:54,329 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:51:54,330 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:51:54,331 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:51:54,331 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:51:54,336 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:51:54,338 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:51:54" (1/1) ... [2024-10-24 11:51:54,339 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d79d38e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:51:54, skipping insertion in model container [2024-10-24 11:51:54,339 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:51:54" (1/1) ... [2024-10-24 11:51:54,362 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:51:54,534 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-72.i[916,929] [2024-10-24 11:51:54,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:51:54,709 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:51:54,721 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-72.i[916,929] [2024-10-24 11:51:54,760 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:51:54,792 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:51:54,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:51:54 WrapperNode [2024-10-24 11:51:54,792 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:51:54,793 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:51:54,793 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:51:54,793 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:51:54,800 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:51:54" (1/1) ... [2024-10-24 11:51:54,819 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:51:54" (1/1) ... [2024-10-24 11:51:54,857 INFO L138 Inliner]: procedures = 29, calls = 167, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 534 [2024-10-24 11:51:54,858 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:51:54,859 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:51:54,859 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:51:54,863 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:51:54,872 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:51:54" (1/1) ... [2024-10-24 11:51:54,872 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:51:54" (1/1) ... [2024-10-24 11:51:54,878 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:51:54" (1/1) ... [2024-10-24 11:51:54,906 INFO L175 MemorySlicer]: Split 138 memory accesses to 2 slices as follows [2, 136]. 99 percent of accesses are in the largest equivalence class. The 19 initializations are split as follows [2, 17]. The 18 writes are split as follows [0, 18]. [2024-10-24 11:51:54,907 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:51:54" (1/1) ... [2024-10-24 11:51:54,907 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:51:54" (1/1) ... [2024-10-24 11:51:54,929 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:51:54" (1/1) ... [2024-10-24 11:51:54,939 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:51:54" (1/1) ... [2024-10-24 11:51:54,942 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:51:54" (1/1) ... [2024-10-24 11:51:54,944 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:51:54" (1/1) ... [2024-10-24 11:51:54,953 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:51:54,954 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:51:54,954 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:51:54,954 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:51:54,955 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:51:54" (1/1) ... [2024-10-24 11:51:54,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:51:54,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:51:55,005 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 11:51:55,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 11:51:55,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:51:55,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-24 11:51:55,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-24 11:51:55,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 11:51:55,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 11:51:55,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-24 11:51:55,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-24 11:51:55,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 11:51:55,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 11:51:55,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-24 11:51:55,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-24 11:51:55,071 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:51:55,071 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:51:55,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:51:55,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 11:51:55,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:51:55,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:51:55,199 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:51:55,201 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:51:55,750 INFO L? ?]: Removed 139 outVars from TransFormulas that were not future-live. [2024-10-24 11:51:55,751 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:51:55,790 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:51:55,790 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:51:55,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:51:55 BoogieIcfgContainer [2024-10-24 11:51:55,791 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:51:55,793 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:51:55,793 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:51:55,796 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:51:55,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:51:54" (1/3) ... [2024-10-24 11:51:55,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5370f7b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:51:55, skipping insertion in model container [2024-10-24 11:51:55,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:51:54" (2/3) ... [2024-10-24 11:51:55,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5370f7b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:51:55, skipping insertion in model container [2024-10-24 11:51:55,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:51:55" (3/3) ... [2024-10-24 11:51:55,803 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-72.i [2024-10-24 11:51:55,818 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:51:55,818 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:51:55,879 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:51:55,885 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7929aef6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:51:55,885 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:51:55,890 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 101 states have (on average 1.4455445544554455) internal successors, (146), 102 states have internal predecessors, (146), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 11:51:55,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-24 11:51:55,903 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:51:55,904 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:51:55,905 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:51:55,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:51:55,909 INFO L85 PathProgramCache]: Analyzing trace with hash -881856283, now seen corresponding path program 1 times [2024-10-24 11:51:55,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:51:55,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141933428] [2024-10-24 11:51:55,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:51:55,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:51:56,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:56,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:51:56,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:56,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:51:56,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:56,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:51:56,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:56,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:51:56,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:56,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:51:56,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:56,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:51:56,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:56,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:51:56,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:56,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:51:56,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:56,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:51:56,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:56,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:51:56,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:56,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:51:56,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:56,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:51:56,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:56,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:51:56,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:56,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:51:56,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:56,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:51:56,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:56,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:51:56,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:56,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:51:56,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:56,364 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:51:56,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:51:56,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141933428] [2024-10-24 11:51:56,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141933428] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:51:56,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:51:56,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:51:56,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995657876] [2024-10-24 11:51:56,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:51:56,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:51:56,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:51:56,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:51:56,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:51:56,407 INFO L87 Difference]: Start difference. First operand has 121 states, 101 states have (on average 1.4455445544554455) internal successors, (146), 102 states have internal predecessors, (146), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 11:51:56,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:51:56,530 INFO L93 Difference]: Finished difference Result 239 states and 375 transitions. [2024-10-24 11:51:56,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:51:56,532 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 144 [2024-10-24 11:51:56,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:51:56,550 INFO L225 Difference]: With dead ends: 239 [2024-10-24 11:51:56,551 INFO L226 Difference]: Without dead ends: 119 [2024-10-24 11:51:56,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:51:56,558 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:51:56,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 171 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:51:56,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-24 11:51:56,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-10-24 11:51:56,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 100 states have (on average 1.41) internal successors, (141), 100 states have internal predecessors, (141), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 11:51:56,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 175 transitions. [2024-10-24 11:51:56,610 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 175 transitions. Word has length 144 [2024-10-24 11:51:56,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:51:56,610 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 175 transitions. [2024-10-24 11:51:56,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 11:51:56,612 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 175 transitions. [2024-10-24 11:51:56,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-24 11:51:56,616 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:51:56,616 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:51:56,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:51:56,617 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:51:56,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:51:56,618 INFO L85 PathProgramCache]: Analyzing trace with hash 2029423183, now seen corresponding path program 1 times [2024-10-24 11:51:56,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:51:56,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909555335] [2024-10-24 11:51:56,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:51:56,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:51:56,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:57,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:51:57,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:57,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:51:57,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:57,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:51:57,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:57,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:51:57,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:57,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:51:57,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:57,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:51:57,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:57,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:51:57,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:57,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:51:57,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:57,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:51:57,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:57,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:51:57,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:57,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:51:57,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:57,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:51:57,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:57,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:51:57,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:57,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:51:57,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:57,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:51:57,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:57,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:51:57,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:57,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:51:57,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:57,144 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:51:57,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:51:57,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909555335] [2024-10-24 11:51:57,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909555335] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:51:57,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:51:57,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:51:57,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363893472] [2024-10-24 11:51:57,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:51:57,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:51:57,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:51:57,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:51:57,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:51:57,152 INFO L87 Difference]: Start difference. First operand 119 states and 175 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:51:57,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:51:57,220 INFO L93 Difference]: Finished difference Result 239 states and 352 transitions. [2024-10-24 11:51:57,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:51:57,221 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 144 [2024-10-24 11:51:57,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:51:57,224 INFO L225 Difference]: With dead ends: 239 [2024-10-24 11:51:57,224 INFO L226 Difference]: Without dead ends: 121 [2024-10-24 11:51:57,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:51:57,226 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 0 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:51:57,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 500 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:51:57,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-24 11:51:57,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-10-24 11:51:57,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 102 states have (on average 1.4019607843137254) internal successors, (143), 102 states have internal predecessors, (143), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 11:51:57,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 177 transitions. [2024-10-24 11:51:57,240 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 177 transitions. Word has length 144 [2024-10-24 11:51:57,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:51:57,242 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 177 transitions. [2024-10-24 11:51:57,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:51:57,242 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 177 transitions. [2024-10-24 11:51:57,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-24 11:51:57,245 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:51:57,245 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:51:57,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:51:57,245 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:51:57,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:51:57,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1957780412, now seen corresponding path program 1 times [2024-10-24 11:51:57,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:51:57,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962489251] [2024-10-24 11:51:57,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:51:57,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:51:57,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:57,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:51:57,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:57,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:51:57,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:57,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:51:57,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:57,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:51:57,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:57,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:51:57,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:57,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:51:57,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:57,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:51:57,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:57,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:51:57,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:57,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:51:57,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:57,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:51:57,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:57,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:51:57,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:57,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:51:57,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:57,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:51:57,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:57,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:51:57,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:57,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:51:57,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:57,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:51:57,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:57,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:51:57,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:57,477 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:51:57,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:51:57,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962489251] [2024-10-24 11:51:57,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962489251] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:51:57,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:51:57,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:51:57,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82797900] [2024-10-24 11:51:57,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:51:57,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:51:57,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:51:57,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:51:57,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:51:57,481 INFO L87 Difference]: Start difference. First operand 121 states and 177 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:51:57,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:51:57,538 INFO L93 Difference]: Finished difference Result 244 states and 357 transitions. [2024-10-24 11:51:57,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:51:57,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2024-10-24 11:51:57,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:51:57,545 INFO L225 Difference]: With dead ends: 244 [2024-10-24 11:51:57,545 INFO L226 Difference]: Without dead ends: 124 [2024-10-24 11:51:57,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:51:57,546 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 1 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:51:57,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 497 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:51:57,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-24 11:51:57,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2024-10-24 11:51:57,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 104 states have (on average 1.3942307692307692) internal successors, (145), 104 states have internal predecessors, (145), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 11:51:57,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 179 transitions. [2024-10-24 11:51:57,569 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 179 transitions. Word has length 146 [2024-10-24 11:51:57,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:51:57,570 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 179 transitions. [2024-10-24 11:51:57,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:51:57,570 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 179 transitions. [2024-10-24 11:51:57,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-24 11:51:57,574 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:51:57,574 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:51:57,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 11:51:57,575 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:51:57,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:51:57,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1527840258, now seen corresponding path program 1 times [2024-10-24 11:51:57,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:51:57,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138706364] [2024-10-24 11:51:57,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:51:57,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:51:57,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:57,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:51:57,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:57,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:51:57,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:57,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:51:57,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:57,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:51:57,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:57,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:51:57,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:57,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:51:57,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:57,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:51:57,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:57,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:51:57,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:57,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:51:57,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:57,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:51:57,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:57,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:51:57,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:57,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:51:57,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:57,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:51:57,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:57,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:51:57,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:57,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:51:57,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:57,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:51:57,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:57,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:51:57,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:57,760 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:51:57,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:51:57,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138706364] [2024-10-24 11:51:57,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138706364] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:51:57,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:51:57,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:51:57,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384815467] [2024-10-24 11:51:57,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:51:57,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:51:57,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:51:57,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:51:57,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:51:57,765 INFO L87 Difference]: Start difference. First operand 123 states and 179 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:51:57,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:51:57,833 INFO L93 Difference]: Finished difference Result 248 states and 361 transitions. [2024-10-24 11:51:57,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:51:57,834 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2024-10-24 11:51:57,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:51:57,835 INFO L225 Difference]: With dead ends: 248 [2024-10-24 11:51:57,836 INFO L226 Difference]: Without dead ends: 126 [2024-10-24 11:51:57,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:51:57,843 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 1 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:51:57,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 498 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:51:57,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-10-24 11:51:57,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2024-10-24 11:51:57,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 106 states have (on average 1.3867924528301887) internal successors, (147), 106 states have internal predecessors, (147), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 11:51:57,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 181 transitions. [2024-10-24 11:51:57,853 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 181 transitions. Word has length 146 [2024-10-24 11:51:57,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:51:57,853 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 181 transitions. [2024-10-24 11:51:57,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:51:57,854 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 181 transitions. [2024-10-24 11:51:57,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-24 11:51:57,855 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:51:57,855 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:51:57,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 11:51:57,856 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:51:57,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:51:57,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1585098560, now seen corresponding path program 1 times [2024-10-24 11:51:57,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:51:57,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144093583] [2024-10-24 11:51:57,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:51:57,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:51:57,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:58,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:51:58,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:58,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:51:58,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:58,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:51:58,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:58,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:51:58,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:58,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:51:58,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:58,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:51:58,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:58,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:51:58,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:58,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:51:58,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:58,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:51:58,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:58,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:51:58,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:58,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:51:58,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:58,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:51:58,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:58,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:51:58,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:58,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:51:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:58,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:51:58,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:58,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:51:58,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:58,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:51:58,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:58,064 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:51:58,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:51:58,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144093583] [2024-10-24 11:51:58,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144093583] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:51:58,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:51:58,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:51:58,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105624394] [2024-10-24 11:51:58,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:51:58,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:51:58,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:51:58,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:51:58,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:51:58,070 INFO L87 Difference]: Start difference. First operand 125 states and 181 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:51:58,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:51:58,106 INFO L93 Difference]: Finished difference Result 252 states and 365 transitions. [2024-10-24 11:51:58,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:51:58,107 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2024-10-24 11:51:58,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:51:58,110 INFO L225 Difference]: With dead ends: 252 [2024-10-24 11:51:58,111 INFO L226 Difference]: Without dead ends: 128 [2024-10-24 11:51:58,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:51:58,114 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 1 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:51:58,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 501 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:51:58,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-24 11:51:58,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2024-10-24 11:51:58,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 108 states have (on average 1.3796296296296295) internal successors, (149), 108 states have internal predecessors, (149), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 11:51:58,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 183 transitions. [2024-10-24 11:51:58,128 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 183 transitions. Word has length 146 [2024-10-24 11:51:58,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:51:58,130 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 183 transitions. [2024-10-24 11:51:58,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:51:58,130 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 183 transitions. [2024-10-24 11:51:58,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-24 11:51:58,132 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:51:58,133 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:51:58,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 11:51:58,133 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:51:58,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:51:58,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1585158142, now seen corresponding path program 1 times [2024-10-24 11:51:58,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:51:58,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998643157] [2024-10-24 11:51:58,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:51:58,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:51:58,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:51:58,260 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 11:51:58,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:51:58,400 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 11:51:58,400 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 11:51:58,401 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:51:58,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 11:51:58,405 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-24 11:51:58,499 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:51:58,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:51:58 BoogieIcfgContainer [2024-10-24 11:51:58,504 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:51:58,505 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:51:58,505 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:51:58,505 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:51:58,506 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:51:55" (3/4) ... [2024-10-24 11:51:58,508 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 11:51:58,509 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:51:58,509 INFO L158 Benchmark]: Toolchain (without parser) took 4179.40ms. Allocated memory was 182.5MB in the beginning and 228.6MB in the end (delta: 46.1MB). Free memory was 123.6MB in the beginning and 86.7MB in the end (delta: 36.8MB). Peak memory consumption was 83.4MB. Max. memory is 16.1GB. [2024-10-24 11:51:58,509 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory is still 49.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:51:58,510 INFO L158 Benchmark]: CACSL2BoogieTranslator took 461.78ms. Allocated memory is still 182.5MB. Free memory was 123.2MB in the beginning and 146.7MB in the end (delta: -23.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 11:51:58,510 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.94ms. Allocated memory is still 182.5MB. Free memory was 146.7MB in the beginning and 143.3MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:51:58,510 INFO L158 Benchmark]: Boogie Preprocessor took 94.50ms. Allocated memory is still 182.5MB. Free memory was 142.5MB in the beginning and 138.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:51:58,510 INFO L158 Benchmark]: RCFGBuilder took 837.02ms. Allocated memory is still 182.5MB. Free memory was 138.3MB in the beginning and 100.5MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-10-24 11:51:58,511 INFO L158 Benchmark]: TraceAbstraction took 2711.40ms. Allocated memory was 182.5MB in the beginning and 228.6MB in the end (delta: 46.1MB). Free memory was 100.5MB in the beginning and 86.7MB in the end (delta: 13.8MB). Peak memory consumption was 62.7MB. Max. memory is 16.1GB. [2024-10-24 11:51:58,511 INFO L158 Benchmark]: Witness Printer took 4.11ms. Allocated memory is still 228.6MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:51:58,512 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory is still 49.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 461.78ms. Allocated memory is still 182.5MB. Free memory was 123.2MB in the beginning and 146.7MB in the end (delta: -23.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.94ms. Allocated memory is still 182.5MB. Free memory was 146.7MB in the beginning and 143.3MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 94.50ms. Allocated memory is still 182.5MB. Free memory was 142.5MB in the beginning and 138.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 837.02ms. Allocated memory is still 182.5MB. Free memory was 138.3MB in the beginning and 100.5MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2711.40ms. Allocated memory was 182.5MB in the beginning and 228.6MB in the end (delta: 46.1MB). Free memory was 100.5MB in the beginning and 86.7MB in the end (delta: 13.8MB). Peak memory consumption was 62.7MB. Max. memory is 16.1GB. * Witness Printer took 4.11ms. Allocated memory is still 228.6MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 105, overapproximation of someBinaryDOUBLEComparisonOperation at line 118. Possible FailurePath: [L41] unsigned char isInitial = 0; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 1, 0, 2, -16, -2, -10, 4, 256.4, 0.25, 100000000000.2, 50.5, 9.5, 100000000000.4, 4, 10000 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 1, 0, 2, -16, -2, -10, 4, 256.4, 0.25, 100000000000.2, 50.5, 9.5, 100000000000.4, 4, 10000 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 1, 0, 2, -16, -2, -10, 4, 256.4, 0.25, 100000000000.2, 50.5, 9.5, 100000000000.4, 4, 10000 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 1, 0, 2, -16, -2, -10, 4, 256.4, 0.25, 100000000000.2, 50.5, 9.5, 100000000000.4, 4, 10000 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 1, 0, 2, -16, -2, -10, 4, 256.4, 0.25, 100000000000.2, 50.5, 9.5, 100000000000.4, 4, 10000 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 1, 0, 2, -16, -2, -10, 4, 256.4, 0.25, 100000000000.2, 50.5, 9.5, 100000000000.4, 4, 10000 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 1, 0, 2, -16, -2, -10, 4, 256.4, 0.25, 100000000000.2, 50.5, 9.5, 100000000000.4, 4, 10000 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 1, 0, 2, -16, -2, -10, 4, 256.4, 0.25, 100000000000.2, 50.5, 9.5, 100000000000.4, 4, 10000 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 1, 0, 2, -16, -2, -10, 4, 256.4, 0.25, 100000000000.2, 50.5, 9.5, 100000000000.4, 4, 10000 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 1, 0, 2, -16, -2, -10, 4, 256.4, 0.25, 100000000000.2, 50.5, 9.5, 100000000000.4, 4, 10000 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 1, 0, 2, -16, -2, -10, 4, 256.4, 0.25, 100000000000.2, 50.5, 9.5, 100000000000.4, 4, 10000 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 1, 0, 2, -16, -2, -10, 4, 256.4, 0.25, 100000000000.2, 50.5, 9.5, 100000000000.4, 4, 10000 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 1, 0, 2, -16, -2, -10, 4, 256.4, 0.25, 100000000000.2, 50.5, 9.5, 100000000000.4, 4, 10000 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 1, 0, 2, -16, -2, -10, 4, 256.4, 0.25, 100000000000.2, 50.5, 9.5, 100000000000.4, 4, 10000 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 1, 0, 2, -16, -2, -10, 4, 256.4, 0.25, 100000000000.2, 50.5, 9.5, 100000000000.4, 4, 10000 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 1, 0, 2, -16, -2, -10, 4, 256.4, 0.25, 100000000000.2, 50.5, 9.5, 100000000000.4, 4, 10000 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 1, 0, 2, -16, -2, -10, 4, 256.4, 0.25, 100000000000.2, 50.5, 9.5, 100000000000.4, 4, 10000 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 1, 0, 2, -16, -2, -10, 4, 256.4, 0.25, 100000000000.2, 50.5, 9.5, 100000000000.4, 4, 10000 }; [L61] unsigned char last_1_WrapperStruct00_var_1_1 = 1; [L62] double last_1_WrapperStruct00_var_1_15 = 256.4; [L122] isInitial = 1 [L123] FCALL initially() [L124] COND TRUE 1 [L125] CALL updateLastVariables() [L114] EXPR WrapperStruct00.var_1_1 [L114] last_1_WrapperStruct00_var_1_1 = WrapperStruct00.var_1_1 [L115] EXPR WrapperStruct00.var_1_15 [L115] last_1_WrapperStruct00_var_1_15 = WrapperStruct00.var_1_15 [L125] RET updateLastVariables() [L126] CALL updateVariables() [L85] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L86] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L86] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L86] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L87] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L87] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L87] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L88] WrapperStruct00.var_1_8 = __VERIFIER_nondet_uchar() [L89] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L90] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L91] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L92] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L93] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L94] WrapperStruct00.var_1_12 = __VERIFIER_nondet_char() [L95] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= -63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= -63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L96] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L97] WrapperStruct00.var_1_13 = __VERIFIER_nondet_char() [L98] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= -63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= -63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L99] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L100] WrapperStruct00.var_1_14 = __VERIFIER_nondet_char() [L101] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L102] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L103] WrapperStruct00.var_1_16 = __VERIFIER_nondet_float() [L104] EXPR WrapperStruct00.var_1_16 [L104] EXPR WrapperStruct00.var_1_16 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L104] EXPR WrapperStruct00.var_1_16 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F [L104] EXPR WrapperStruct00.var_1_16 [L104] EXPR WrapperStruct00.var_1_16 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L104] EXPR (WrapperStruct00.var_1_16 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L104] EXPR (WrapperStruct00.var_1_16 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L104] CALL assume_abort_if_not((WrapperStruct00.var_1_16 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L104] RET assume_abort_if_not((WrapperStruct00.var_1_16 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L105] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_16 != 0.0F) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_16 != 0.0F) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L106] WrapperStruct00.var_1_17 = __VERIFIER_nondet_double() [L107] EXPR WrapperStruct00.var_1_17 [L107] EXPR WrapperStruct00.var_1_17 >= 0.0F && WrapperStruct00.var_1_17 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L107] EXPR WrapperStruct00.var_1_17 >= 0.0F && WrapperStruct00.var_1_17 <= -1.0e-20F [L107] EXPR WrapperStruct00.var_1_17 [L107] EXPR WrapperStruct00.var_1_17 >= 0.0F && WrapperStruct00.var_1_17 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L107] EXPR (WrapperStruct00.var_1_17 >= 0.0F && WrapperStruct00.var_1_17 <= -1.0e-20F) || (WrapperStruct00.var_1_17 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_17 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L107] EXPR (WrapperStruct00.var_1_17 >= 0.0F && WrapperStruct00.var_1_17 <= -1.0e-20F) || (WrapperStruct00.var_1_17 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_17 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L107] CALL assume_abort_if_not((WrapperStruct00.var_1_17 >= 0.0F && WrapperStruct00.var_1_17 <= -1.0e-20F) || (WrapperStruct00.var_1_17 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_17 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L107] RET assume_abort_if_not((WrapperStruct00.var_1_17 >= 0.0F && WrapperStruct00.var_1_17 <= -1.0e-20F) || (WrapperStruct00.var_1_17 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_17 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L108] WrapperStruct00.var_1_18 = __VERIFIER_nondet_double() [L109] EXPR WrapperStruct00.var_1_18 [L109] EXPR WrapperStruct00.var_1_18 >= 0.0F && WrapperStruct00.var_1_18 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L109] EXPR WrapperStruct00.var_1_18 >= 0.0F && WrapperStruct00.var_1_18 <= -1.0e-20F [L109] EXPR WrapperStruct00.var_1_18 [L109] EXPR WrapperStruct00.var_1_18 >= 0.0F && WrapperStruct00.var_1_18 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L109] EXPR (WrapperStruct00.var_1_18 >= 0.0F && WrapperStruct00.var_1_18 <= -1.0e-20F) || (WrapperStruct00.var_1_18 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_18 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L109] EXPR (WrapperStruct00.var_1_18 >= 0.0F && WrapperStruct00.var_1_18 <= -1.0e-20F) || (WrapperStruct00.var_1_18 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_18 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L109] CALL assume_abort_if_not((WrapperStruct00.var_1_18 >= 0.0F && WrapperStruct00.var_1_18 <= -1.0e-20F) || (WrapperStruct00.var_1_18 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_18 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L109] RET assume_abort_if_not((WrapperStruct00.var_1_18 >= 0.0F && WrapperStruct00.var_1_18 <= -1.0e-20F) || (WrapperStruct00.var_1_18 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_18 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L110] WrapperStruct00.var_1_19 = __VERIFIER_nondet_double() [L111] EXPR WrapperStruct00.var_1_19 [L111] EXPR WrapperStruct00.var_1_19 >= 0.0F && WrapperStruct00.var_1_19 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L111] EXPR WrapperStruct00.var_1_19 >= 0.0F && WrapperStruct00.var_1_19 <= -1.0e-20F [L111] EXPR WrapperStruct00.var_1_19 [L111] EXPR WrapperStruct00.var_1_19 >= 0.0F && WrapperStruct00.var_1_19 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L111] EXPR (WrapperStruct00.var_1_19 >= 0.0F && WrapperStruct00.var_1_19 <= -1.0e-20F) || (WrapperStruct00.var_1_19 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_19 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L111] EXPR (WrapperStruct00.var_1_19 >= 0.0F && WrapperStruct00.var_1_19 <= -1.0e-20F) || (WrapperStruct00.var_1_19 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_19 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L111] CALL assume_abort_if_not((WrapperStruct00.var_1_19 >= 0.0F && WrapperStruct00.var_1_19 <= -1.0e-20F) || (WrapperStruct00.var_1_19 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_19 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L111] RET assume_abort_if_not((WrapperStruct00.var_1_19 >= 0.0F && WrapperStruct00.var_1_19 <= -1.0e-20F) || (WrapperStruct00.var_1_19 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_19 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L126] RET updateVariables() [L127] CALL step() [L66] WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L66] COND FALSE !(WrapperStruct00.var_1_9) [L69] EXPR WrapperStruct00.var_1_12 [L69] EXPR WrapperStruct00.var_1_13 [L69] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L69] EXPR (((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) < ((10 - WrapperStruct00.var_1_14))) ? ((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) : ((10 - WrapperStruct00.var_1_14)) [L69] EXPR WrapperStruct00.var_1_12 [L69] EXPR WrapperStruct00.var_1_13 [L69] EXPR (((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) < ((10 - WrapperStruct00.var_1_14))) ? ((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) : ((10 - WrapperStruct00.var_1_14)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L69] WrapperStruct00.var_1_11 = (((((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) < ((10 - WrapperStruct00.var_1_14))) ? ((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) : ((10 - WrapperStruct00.var_1_14)))) [L70] EXPR WrapperStruct00.var_1_19 [L70] WrapperStruct00.var_1_20 = WrapperStruct00.var_1_19 [L71] WrapperStruct00.var_1_21 = 1 [L72] WrapperStruct00.var_1_22 = 10 [L73] EXPR WrapperStruct00.var_1_20 [L73] EXPR WrapperStruct00.var_1_20 [L73] EXPR WrapperStruct00.var_1_16 [L73] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L73] COND FALSE !((WrapperStruct00.var_1_20 + (WrapperStruct00.var_1_20 / WrapperStruct00.var_1_16)) == WrapperStruct00.var_1_20) [L80] EXPR WrapperStruct00.var_1_20 [L80] EXPR WrapperStruct00.var_1_15 [L80] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L80] EXPR ((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15) [L80] EXPR WrapperStruct00.var_1_15 [L80] EXPR ((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L80] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L80] COND FALSE !(WrapperStruct00.var_1_20 < (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) * WrapperStruct00.var_1_15)) [L127] RET step() [L128] CALL, EXPR property() [L118] EXPR WrapperStruct00.var_1_20 [L118] EXPR WrapperStruct00.var_1_15 [L118] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L118] EXPR ((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15) [L118] EXPR WrapperStruct00.var_1_15 [L118] EXPR ((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L118] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L118] EXPR (WrapperStruct00.var_1_20 < (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) * WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 && ((last_1_WrapperStruct00_var_1_1 || WrapperStruct00.var_1_8) && WrapperStruct00.var_1_9)))) : 1 [L118] EXPR WrapperStruct00.var_1_1 [L118] EXPR WrapperStruct00.var_1_6 [L118] EXPR WrapperStruct00.var_1_6 && ((last_1_WrapperStruct00_var_1_1 || WrapperStruct00.var_1_8) && WrapperStruct00.var_1_9) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L118] EXPR WrapperStruct00.var_1_6 && ((last_1_WrapperStruct00_var_1_1 || WrapperStruct00.var_1_8) && WrapperStruct00.var_1_9) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L118] EXPR (WrapperStruct00.var_1_20 < (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) * WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 && ((last_1_WrapperStruct00_var_1_1 || WrapperStruct00.var_1_8) && WrapperStruct00.var_1_9)))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L118] EXPR ((WrapperStruct00.var_1_20 < (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) * WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 && ((last_1_WrapperStruct00_var_1_1 || WrapperStruct00.var_1_8) && WrapperStruct00.var_1_9)))) : 1) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_10 == ((unsigned long int) 2u)) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L118] EXPR ((WrapperStruct00.var_1_20 < (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) * WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 && ((last_1_WrapperStruct00_var_1_1 || WrapperStruct00.var_1_8) && WrapperStruct00.var_1_9)))) : 1) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_10 == ((unsigned long int) 2u)) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L118] EXPR (((WrapperStruct00.var_1_20 < (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) * WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 && ((last_1_WrapperStruct00_var_1_1 || WrapperStruct00.var_1_8) && WrapperStruct00.var_1_9)))) : 1) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_10 == ((unsigned long int) 2u)) : 1)) && (WrapperStruct00.var_1_11 == ((signed char) (((((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) < ((10 - WrapperStruct00.var_1_14))) ? ((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) : ((10 - WrapperStruct00.var_1_14)))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L118] EXPR (((WrapperStruct00.var_1_20 < (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) * WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 && ((last_1_WrapperStruct00_var_1_1 || WrapperStruct00.var_1_8) && WrapperStruct00.var_1_9)))) : 1) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_10 == ((unsigned long int) 2u)) : 1)) && (WrapperStruct00.var_1_11 == ((signed char) (((((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) < ((10 - WrapperStruct00.var_1_14))) ? ((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) : ((10 - WrapperStruct00.var_1_14)))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L118] EXPR ((((WrapperStruct00.var_1_20 < (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) * WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 && ((last_1_WrapperStruct00_var_1_1 || WrapperStruct00.var_1_8) && WrapperStruct00.var_1_9)))) : 1) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_10 == ((unsigned long int) 2u)) : 1)) && (WrapperStruct00.var_1_11 == ((signed char) (((((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) < ((10 - WrapperStruct00.var_1_14))) ? ((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) : ((10 - WrapperStruct00.var_1_14))))))) && (((WrapperStruct00.var_1_20 + (WrapperStruct00.var_1_20 / WrapperStruct00.var_1_16)) == WrapperStruct00.var_1_20) ? ((WrapperStruct00.var_1_20 >= last_1_WrapperStruct00_var_1_15) ? (WrapperStruct00.var_1_15 == ((double) (WrapperStruct00.var_1_17 - (((((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_19)) < (9.9999999999995E12)) ? ((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_19)) : (9.9999999999995E12)))))) : (WrapperStruct00.var_1_15 == ((double) ((((WrapperStruct00.var_1_17) < ((5.75 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_17) : ((5.75 + WrapperStruct00.var_1_19))))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L118] EXPR ((((WrapperStruct00.var_1_20 < (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) * WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 && ((last_1_WrapperStruct00_var_1_1 || WrapperStruct00.var_1_8) && WrapperStruct00.var_1_9)))) : 1) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_10 == ((unsigned long int) 2u)) : 1)) && (WrapperStruct00.var_1_11 == ((signed char) (((((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) < ((10 - WrapperStruct00.var_1_14))) ? ((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) : ((10 - WrapperStruct00.var_1_14))))))) && (((WrapperStruct00.var_1_20 + (WrapperStruct00.var_1_20 / WrapperStruct00.var_1_16)) == WrapperStruct00.var_1_20) ? ((WrapperStruct00.var_1_20 >= last_1_WrapperStruct00_var_1_15) ? (WrapperStruct00.var_1_15 == ((double) (WrapperStruct00.var_1_17 - (((((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_19)) < (9.9999999999995E12)) ? ((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_19)) : (9.9999999999995E12)))))) : (WrapperStruct00.var_1_15 == ((double) ((((WrapperStruct00.var_1_17) < ((5.75 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_17) : ((5.75 + WrapperStruct00.var_1_19))))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L118] EXPR (((((WrapperStruct00.var_1_20 < (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) * WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 && ((last_1_WrapperStruct00_var_1_1 || WrapperStruct00.var_1_8) && WrapperStruct00.var_1_9)))) : 1) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_10 == ((unsigned long int) 2u)) : 1)) && (WrapperStruct00.var_1_11 == ((signed char) (((((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) < ((10 - WrapperStruct00.var_1_14))) ? ((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) : ((10 - WrapperStruct00.var_1_14))))))) && (((WrapperStruct00.var_1_20 + (WrapperStruct00.var_1_20 / WrapperStruct00.var_1_16)) == WrapperStruct00.var_1_20) ? ((WrapperStruct00.var_1_20 >= last_1_WrapperStruct00_var_1_15) ? (WrapperStruct00.var_1_15 == ((double) (WrapperStruct00.var_1_17 - (((((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_19)) < (9.9999999999995E12)) ? ((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_19)) : (9.9999999999995E12)))))) : (WrapperStruct00.var_1_15 == ((double) ((((WrapperStruct00.var_1_17) < ((5.75 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_17) : ((5.75 + WrapperStruct00.var_1_19))))))) : 1)) && (WrapperStruct00.var_1_20 == ((double) WrapperStruct00.var_1_19)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L118] EXPR (((((WrapperStruct00.var_1_20 < (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) * WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 && ((last_1_WrapperStruct00_var_1_1 || WrapperStruct00.var_1_8) && WrapperStruct00.var_1_9)))) : 1) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_10 == ((unsigned long int) 2u)) : 1)) && (WrapperStruct00.var_1_11 == ((signed char) (((((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) < ((10 - WrapperStruct00.var_1_14))) ? ((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) : ((10 - WrapperStruct00.var_1_14))))))) && (((WrapperStruct00.var_1_20 + (WrapperStruct00.var_1_20 / WrapperStruct00.var_1_16)) == WrapperStruct00.var_1_20) ? ((WrapperStruct00.var_1_20 >= last_1_WrapperStruct00_var_1_15) ? (WrapperStruct00.var_1_15 == ((double) (WrapperStruct00.var_1_17 - (((((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_19)) < (9.9999999999995E12)) ? ((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_19)) : (9.9999999999995E12)))))) : (WrapperStruct00.var_1_15 == ((double) ((((WrapperStruct00.var_1_17) < ((5.75 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_17) : ((5.75 + WrapperStruct00.var_1_19))))))) : 1)) && (WrapperStruct00.var_1_20 == ((double) WrapperStruct00.var_1_19)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L118] EXPR ((((((WrapperStruct00.var_1_20 < (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) * WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 && ((last_1_WrapperStruct00_var_1_1 || WrapperStruct00.var_1_8) && WrapperStruct00.var_1_9)))) : 1) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_10 == ((unsigned long int) 2u)) : 1)) && (WrapperStruct00.var_1_11 == ((signed char) (((((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) < ((10 - WrapperStruct00.var_1_14))) ? ((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) : ((10 - WrapperStruct00.var_1_14))))))) && (((WrapperStruct00.var_1_20 + (WrapperStruct00.var_1_20 / WrapperStruct00.var_1_16)) == WrapperStruct00.var_1_20) ? ((WrapperStruct00.var_1_20 >= last_1_WrapperStruct00_var_1_15) ? (WrapperStruct00.var_1_15 == ((double) (WrapperStruct00.var_1_17 - (((((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_19)) < (9.9999999999995E12)) ? ((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_19)) : (9.9999999999995E12)))))) : (WrapperStruct00.var_1_15 == ((double) ((((WrapperStruct00.var_1_17) < ((5.75 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_17) : ((5.75 + WrapperStruct00.var_1_19))))))) : 1)) && (WrapperStruct00.var_1_20 == ((double) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_21 == ((signed char) 1)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L118] EXPR ((((((WrapperStruct00.var_1_20 < (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) * WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 && ((last_1_WrapperStruct00_var_1_1 || WrapperStruct00.var_1_8) && WrapperStruct00.var_1_9)))) : 1) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_10 == ((unsigned long int) 2u)) : 1)) && (WrapperStruct00.var_1_11 == ((signed char) (((((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) < ((10 - WrapperStruct00.var_1_14))) ? ((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) : ((10 - WrapperStruct00.var_1_14))))))) && (((WrapperStruct00.var_1_20 + (WrapperStruct00.var_1_20 / WrapperStruct00.var_1_16)) == WrapperStruct00.var_1_20) ? ((WrapperStruct00.var_1_20 >= last_1_WrapperStruct00_var_1_15) ? (WrapperStruct00.var_1_15 == ((double) (WrapperStruct00.var_1_17 - (((((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_19)) < (9.9999999999995E12)) ? ((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_19)) : (9.9999999999995E12)))))) : (WrapperStruct00.var_1_15 == ((double) ((((WrapperStruct00.var_1_17) < ((5.75 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_17) : ((5.75 + WrapperStruct00.var_1_19))))))) : 1)) && (WrapperStruct00.var_1_20 == ((double) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_21 == ((signed char) 1)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L118] EXPR (((((((WrapperStruct00.var_1_20 < (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) * WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 && ((last_1_WrapperStruct00_var_1_1 || WrapperStruct00.var_1_8) && WrapperStruct00.var_1_9)))) : 1) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_10 == ((unsigned long int) 2u)) : 1)) && (WrapperStruct00.var_1_11 == ((signed char) (((((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) < ((10 - WrapperStruct00.var_1_14))) ? ((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) : ((10 - WrapperStruct00.var_1_14))))))) && (((WrapperStruct00.var_1_20 + (WrapperStruct00.var_1_20 / WrapperStruct00.var_1_16)) == WrapperStruct00.var_1_20) ? ((WrapperStruct00.var_1_20 >= last_1_WrapperStruct00_var_1_15) ? (WrapperStruct00.var_1_15 == ((double) (WrapperStruct00.var_1_17 - (((((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_19)) < (9.9999999999995E12)) ? ((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_19)) : (9.9999999999995E12)))))) : (WrapperStruct00.var_1_15 == ((double) ((((WrapperStruct00.var_1_17) < ((5.75 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_17) : ((5.75 + WrapperStruct00.var_1_19))))))) : 1)) && (WrapperStruct00.var_1_20 == ((double) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_21 == ((signed char) 1))) && (WrapperStruct00.var_1_22 == ((unsigned short int) 10)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L118] EXPR (((((((WrapperStruct00.var_1_20 < (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) * WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 && ((last_1_WrapperStruct00_var_1_1 || WrapperStruct00.var_1_8) && WrapperStruct00.var_1_9)))) : 1) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_10 == ((unsigned long int) 2u)) : 1)) && (WrapperStruct00.var_1_11 == ((signed char) (((((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) < ((10 - WrapperStruct00.var_1_14))) ? ((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) : ((10 - WrapperStruct00.var_1_14))))))) && (((WrapperStruct00.var_1_20 + (WrapperStruct00.var_1_20 / WrapperStruct00.var_1_16)) == WrapperStruct00.var_1_20) ? ((WrapperStruct00.var_1_20 >= last_1_WrapperStruct00_var_1_15) ? (WrapperStruct00.var_1_15 == ((double) (WrapperStruct00.var_1_17 - (((((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_19)) < (9.9999999999995E12)) ? ((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_19)) : (9.9999999999995E12)))))) : (WrapperStruct00.var_1_15 == ((double) ((((WrapperStruct00.var_1_17) < ((5.75 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_17) : ((5.75 + WrapperStruct00.var_1_19))))))) : 1)) && (WrapperStruct00.var_1_20 == ((double) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_21 == ((signed char) 1))) && (WrapperStruct00.var_1_22 == ((unsigned short int) 10)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L118-L119] return (((((((WrapperStruct00.var_1_20 < (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) * WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 && ((last_1_WrapperStruct00_var_1_1 || WrapperStruct00.var_1_8) && WrapperStruct00.var_1_9)))) : 1) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_10 == ((unsigned long int) 2u)) : 1)) && (WrapperStruct00.var_1_11 == ((signed char) (((((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) < ((10 - WrapperStruct00.var_1_14))) ? ((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) : ((10 - WrapperStruct00.var_1_14))))))) && (((WrapperStruct00.var_1_20 + (WrapperStruct00.var_1_20 / WrapperStruct00.var_1_16)) == WrapperStruct00.var_1_20) ? ((WrapperStruct00.var_1_20 >= last_1_WrapperStruct00_var_1_15) ? (WrapperStruct00.var_1_15 == ((double) (WrapperStruct00.var_1_17 - (((((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_19)) < (9.9999999999995E12)) ? ((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_19)) : (9.9999999999995E12)))))) : (WrapperStruct00.var_1_15 == ((double) ((((WrapperStruct00.var_1_17) < ((5.75 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_17) : ((5.75 + WrapperStruct00.var_1_19))))))) : 1)) && (WrapperStruct00.var_1_20 == ((double) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_21 == ((signed char) 1))) && (WrapperStruct00.var_1_22 == ((unsigned short int) 10)) ; [L128] RET, EXPR property() [L128] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 121 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 6, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3 mSDsluCounter, 2167 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1322 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 101 IncrementalHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 845 mSDtfsCounter, 101 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 206 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127occurred in iteration=5, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 872 NumberOfCodeBlocks, 872 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 721 ConstructedInterpolants, 0 QuantifiedInterpolants, 730 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 2720/2720 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 11:51:58,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-72.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8a6b1e16ae829d5686c91b3f759f297edb0ae10a608027b90b675b6283e6173a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:52:00,713 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:52:00,797 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 11:52:00,801 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:52:00,803 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:52:00,834 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:52:00,836 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:52:00,837 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:52:00,838 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:52:00,839 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:52:00,840 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:52:00,840 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:52:00,841 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:52:00,841 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:52:00,841 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:52:00,843 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:52:00,844 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:52:00,844 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:52:00,844 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:52:00,844 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:52:00,845 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:52:00,847 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:52:00,847 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:52:00,847 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 11:52:00,847 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 11:52:00,847 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:52:00,848 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 11:52:00,848 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:52:00,848 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:52:00,848 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:52:00,848 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:52:00,849 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:52:00,849 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:52:00,849 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:52:00,849 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:52:00,849 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:52:00,850 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:52:00,850 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:52:00,850 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 11:52:00,852 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 11:52:00,852 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:52:00,852 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:52:00,852 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:52:00,852 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:52:00,853 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 11:52:00,853 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8a6b1e16ae829d5686c91b3f759f297edb0ae10a608027b90b675b6283e6173a [2024-10-24 11:52:01,191 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:52:01,216 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:52:01,221 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:52:01,223 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:52:01,223 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:52:01,224 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-72.i [2024-10-24 11:52:02,823 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:52:03,044 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:52:03,046 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-72.i [2024-10-24 11:52:03,060 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f3c2112a/b81d2dcf31164392b2c9b6ac2842ccda/FLAGf6b951b3e [2024-10-24 11:52:03,401 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f3c2112a/b81d2dcf31164392b2c9b6ac2842ccda [2024-10-24 11:52:03,403 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:52:03,404 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:52:03,405 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:52:03,405 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:52:03,412 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:52:03,413 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:52:03" (1/1) ... [2024-10-24 11:52:03,414 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@751cd124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:03, skipping insertion in model container [2024-10-24 11:52:03,414 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:52:03" (1/1) ... [2024-10-24 11:52:03,439 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:52:03,639 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-72.i[916,929] [2024-10-24 11:52:03,725 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:52:03,744 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:52:03,756 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-72.i[916,929] [2024-10-24 11:52:03,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:52:03,845 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:52:03,847 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:03 WrapperNode [2024-10-24 11:52:03,847 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:52:03,848 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:52:03,848 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:52:03,849 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:52:03,855 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:03" (1/1) ... [2024-10-24 11:52:03,880 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:03" (1/1) ... [2024-10-24 11:52:03,925 INFO L138 Inliner]: procedures = 39, calls = 167, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 531 [2024-10-24 11:52:03,926 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:52:03,927 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:52:03,927 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:52:03,927 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:52:03,940 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:03" (1/1) ... [2024-10-24 11:52:03,941 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:03" (1/1) ... [2024-10-24 11:52:03,948 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:03" (1/1) ... [2024-10-24 11:52:03,973 INFO L175 MemorySlicer]: Split 138 memory accesses to 2 slices as follows [2, 136]. 99 percent of accesses are in the largest equivalence class. The 19 initializations are split as follows [2, 17]. The 18 writes are split as follows [0, 18]. [2024-10-24 11:52:03,974 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:03" (1/1) ... [2024-10-24 11:52:03,974 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:03" (1/1) ... [2024-10-24 11:52:04,017 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:03" (1/1) ... [2024-10-24 11:52:04,021 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:03" (1/1) ... [2024-10-24 11:52:04,026 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:03" (1/1) ... [2024-10-24 11:52:04,033 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:03" (1/1) ... [2024-10-24 11:52:04,041 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:52:04,042 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:52:04,042 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:52:04,042 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:52:04,043 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:03" (1/1) ... [2024-10-24 11:52:04,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:52:04,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:52:04,077 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 11:52:04,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 11:52:04,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:52:04,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-24 11:52:04,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-24 11:52:04,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-24 11:52:04,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-24 11:52:04,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 11:52:04,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 11:52:04,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-24 11:52:04,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-24 11:52:04,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 11:52:04,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 11:52:04,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-24 11:52:04,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-24 11:52:04,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-24 11:52:04,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-24 11:52:04,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-24 11:52:04,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-24 11:52:04,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-24 11:52:04,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-24 11:52:04,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-24 11:52:04,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-24 11:52:04,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-24 11:52:04,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-24 11:52:04,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-24 11:52:04,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-24 11:52:04,130 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:52:04,130 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:52:04,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:52:04,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:52:04,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-24 11:52:04,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-24 11:52:04,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-24 11:52:04,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-24 11:52:04,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-24 11:52:04,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-24 11:52:04,280 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:52:04,283 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:52:33,217 INFO L? ?]: Removed 146 outVars from TransFormulas that were not future-live. [2024-10-24 11:52:33,217 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:52:33,293 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:52:33,294 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:52:33,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:52:33 BoogieIcfgContainer [2024-10-24 11:52:33,294 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:52:33,299 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:52:33,299 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:52:33,302 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:52:33,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:52:03" (1/3) ... [2024-10-24 11:52:33,303 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c8c8b1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:52:33, skipping insertion in model container [2024-10-24 11:52:33,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:03" (2/3) ... [2024-10-24 11:52:33,303 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c8c8b1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:52:33, skipping insertion in model container [2024-10-24 11:52:33,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:52:33" (3/3) ... [2024-10-24 11:52:33,304 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-72.i [2024-10-24 11:52:33,320 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:52:33,320 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:52:33,378 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:52:33,385 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@68831297, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:52:33,387 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:52:33,391 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 101 states have (on average 1.4455445544554455) internal successors, (146), 102 states have internal predecessors, (146), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 11:52:33,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-24 11:52:33,406 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:52:33,407 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:52:33,408 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:52:33,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:52:33,413 INFO L85 PathProgramCache]: Analyzing trace with hash -881856283, now seen corresponding path program 1 times [2024-10-24 11:52:33,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:52:33,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [376308201] [2024-10-24 11:52:33,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:52:33,430 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:52:33,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:52:33,433 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:52:33,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 11:52:34,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:34,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 11:52:34,643 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:52:34,701 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-10-24 11:52:34,702 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:52:34,702 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:52:34,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [376308201] [2024-10-24 11:52:34,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [376308201] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:52:34,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:52:34,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:52:34,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406879857] [2024-10-24 11:52:34,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:52:34,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:52:34,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:52:34,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:52:34,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:52:34,737 INFO L87 Difference]: Start difference. First operand has 121 states, 101 states have (on average 1.4455445544554455) internal successors, (146), 102 states have internal predecessors, (146), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 11:52:34,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:52:34,843 INFO L93 Difference]: Finished difference Result 239 states and 375 transitions. [2024-10-24 11:52:34,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:52:34,846 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 144 [2024-10-24 11:52:34,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:52:34,856 INFO L225 Difference]: With dead ends: 239 [2024-10-24 11:52:34,856 INFO L226 Difference]: Without dead ends: 119 [2024-10-24 11:52:34,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:52:34,865 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:52:34,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 171 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:52:34,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-24 11:52:34,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-10-24 11:52:34,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 100 states have (on average 1.41) internal successors, (141), 100 states have internal predecessors, (141), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 11:52:34,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 175 transitions. [2024-10-24 11:52:34,918 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 175 transitions. Word has length 144 [2024-10-24 11:52:34,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:52:34,918 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 175 transitions. [2024-10-24 11:52:34,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 11:52:34,919 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 175 transitions. [2024-10-24 11:52:34,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-24 11:52:34,924 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:52:34,925 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:52:34,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 11:52:35,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:52:35,127 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:52:35,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:52:35,127 INFO L85 PathProgramCache]: Analyzing trace with hash 2029423183, now seen corresponding path program 1 times [2024-10-24 11:52:35,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:52:35,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [666532388] [2024-10-24 11:52:35,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:52:35,129 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:52:35,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:52:35,131 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:52:35,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 11:52:36,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:36,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:52:36,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:52:36,600 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:52:36,600 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:52:36,601 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:52:36,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [666532388] [2024-10-24 11:52:36,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [666532388] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:52:36,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:52:36,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:52:36,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865307693] [2024-10-24 11:52:36,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:52:36,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:52:36,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:52:36,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:52:36,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:52:36,610 INFO L87 Difference]: Start difference. First operand 119 states and 175 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:52:36,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:52:36,912 INFO L93 Difference]: Finished difference Result 239 states and 352 transitions. [2024-10-24 11:52:36,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:52:36,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 144 [2024-10-24 11:52:36,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:52:36,916 INFO L225 Difference]: With dead ends: 239 [2024-10-24 11:52:36,916 INFO L226 Difference]: Without dead ends: 121 [2024-10-24 11:52:36,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:52:36,918 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 0 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:52:36,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 500 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:52:36,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-24 11:52:36,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-10-24 11:52:36,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 102 states have (on average 1.4019607843137254) internal successors, (143), 102 states have internal predecessors, (143), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 11:52:36,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 177 transitions. [2024-10-24 11:52:36,932 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 177 transitions. Word has length 144 [2024-10-24 11:52:36,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:52:36,934 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 177 transitions. [2024-10-24 11:52:36,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:52:36,934 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 177 transitions. [2024-10-24 11:52:36,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-24 11:52:36,936 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:52:36,937 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:52:36,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-24 11:52:37,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:52:37,138 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:52:37,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:52:37,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1957780412, now seen corresponding path program 1 times [2024-10-24 11:52:37,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:52:37,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1751268468] [2024-10-24 11:52:37,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:52:37,140 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:52:37,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:52:37,141 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:52:37,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 11:52:38,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:38,340 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 11:52:38,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:52:38,803 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:52:38,804 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:52:38,804 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:52:38,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1751268468] [2024-10-24 11:52:38,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1751268468] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:52:38,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:52:38,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:52:38,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137139228] [2024-10-24 11:52:38,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:52:38,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:52:38,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:52:38,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:52:38,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:52:38,807 INFO L87 Difference]: Start difference. First operand 121 states and 177 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:52:39,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:52:39,686 INFO L93 Difference]: Finished difference Result 248 states and 363 transitions. [2024-10-24 11:52:39,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:52:39,687 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2024-10-24 11:52:39,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:52:39,689 INFO L225 Difference]: With dead ends: 248 [2024-10-24 11:52:39,689 INFO L226 Difference]: Without dead ends: 128 [2024-10-24 11:52:39,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:52:39,691 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 1 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 11:52:39,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 807 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 11:52:39,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-24 11:52:39,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2024-10-24 11:52:39,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 108 states have (on average 1.3796296296296295) internal successors, (149), 108 states have internal predecessors, (149), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 11:52:39,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 183 transitions. [2024-10-24 11:52:39,705 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 183 transitions. Word has length 146 [2024-10-24 11:52:39,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:52:39,706 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 183 transitions. [2024-10-24 11:52:39,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:52:39,706 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 183 transitions. [2024-10-24 11:52:39,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-24 11:52:39,708 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:52:39,709 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:52:39,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 11:52:39,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:52:39,910 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:52:39,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:52:39,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1527840258, now seen corresponding path program 1 times [2024-10-24 11:52:39,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:52:39,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [605387613] [2024-10-24 11:52:39,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:52:39,911 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:52:39,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:52:39,914 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:52:39,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 11:52:41,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:41,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 11:52:41,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:52:41,753 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:52:41,754 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:52:41,754 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:52:41,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [605387613] [2024-10-24 11:52:41,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [605387613] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:52:41,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:52:41,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:52:41,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912495321] [2024-10-24 11:52:41,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:52:41,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:52:41,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:52:41,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:52:41,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:52:41,757 INFO L87 Difference]: Start difference. First operand 127 states and 183 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:52:42,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:52:42,705 INFO L93 Difference]: Finished difference Result 256 states and 369 transitions. [2024-10-24 11:52:42,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:52:42,706 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2024-10-24 11:52:42,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:52:42,708 INFO L225 Difference]: With dead ends: 256 [2024-10-24 11:52:42,708 INFO L226 Difference]: Without dead ends: 130 [2024-10-24 11:52:42,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:52:42,710 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 1 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 11:52:42,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 957 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 11:52:42,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-24 11:52:42,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2024-10-24 11:52:42,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 110 states have (on average 1.3727272727272728) internal successors, (151), 110 states have internal predecessors, (151), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 11:52:42,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 185 transitions. [2024-10-24 11:52:42,720 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 185 transitions. Word has length 146 [2024-10-24 11:52:42,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:52:42,720 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 185 transitions. [2024-10-24 11:52:42,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:52:42,721 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 185 transitions. [2024-10-24 11:52:42,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-24 11:52:42,723 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:52:42,723 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:52:42,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-24 11:52:42,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:52:42,924 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:52:42,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:52:42,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1585098560, now seen corresponding path program 1 times [2024-10-24 11:52:42,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:52:42,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1381987868] [2024-10-24 11:52:42,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:52:42,926 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:52:42,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:52:42,929 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:52:42,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-24 11:52:44,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:44,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 11:52:44,152 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:52:45,026 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:52:45,027 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:52:45,027 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:52:45,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1381987868] [2024-10-24 11:52:45,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1381987868] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:52:45,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:52:45,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:52:45,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362833893] [2024-10-24 11:52:45,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:52:45,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:52:45,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:52:45,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:52:45,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:52:45,034 INFO L87 Difference]: Start difference. First operand 129 states and 185 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:52:46,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:52:46,230 INFO L93 Difference]: Finished difference Result 260 states and 373 transitions. [2024-10-24 11:52:46,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:52:46,231 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2024-10-24 11:52:46,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:52:46,232 INFO L225 Difference]: With dead ends: 260 [2024-10-24 11:52:46,232 INFO L226 Difference]: Without dead ends: 132 [2024-10-24 11:52:46,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:52:46,233 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 1 mSDsluCounter, 949 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:52:46,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1110 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 11:52:46,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-24 11:52:46,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2024-10-24 11:52:46,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 112 states have (on average 1.3660714285714286) internal successors, (153), 112 states have internal predecessors, (153), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 11:52:46,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 187 transitions. [2024-10-24 11:52:46,253 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 187 transitions. Word has length 146 [2024-10-24 11:52:46,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:52:46,254 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 187 transitions. [2024-10-24 11:52:46,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:52:46,254 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 187 transitions. [2024-10-24 11:52:46,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-24 11:52:46,256 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:52:46,256 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:52:46,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-24 11:52:46,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:52:46,458 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:52:46,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:52:46,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1585158142, now seen corresponding path program 1 times [2024-10-24 11:52:46,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:52:46,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1152380257] [2024-10-24 11:52:46,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:52:46,459 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:52:46,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:52:46,460 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:52:46,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-24 11:52:47,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:47,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 11:52:47,564 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:52:49,928 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:52:49,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-10-24 11:52:50,181 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2024-10-24 11:52:50,181 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:52:50,181 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:52:50,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1152380257] [2024-10-24 11:52:50,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1152380257] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:52:50,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:52:50,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:52:50,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516242769] [2024-10-24 11:52:50,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:52:50,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:52:50,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:52:50,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:52:50,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:52:50,184 INFO L87 Difference]: Start difference. First operand 131 states and 187 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 11:52:56,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 11:53:00,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 11:53:04,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:53:08,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 11:53:12,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:53:16,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:53:20,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:53:24,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:53:27,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers []