./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-53.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-53.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 539063f6ba473db54ff36149ccd453fdab8b89daa6bb5c4360e0c863033e7c3e --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 19:36:27,917 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:36:27,957 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 19:36:27,960 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:36:27,960 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:36:27,979 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:36:27,981 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:36:27,981 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:36:27,982 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:36:27,985 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:36:27,985 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:36:27,985 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:36:27,986 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:36:27,999 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:36:28,000 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:36:28,001 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:36:28,002 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:36:28,002 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:36:28,002 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:36:28,002 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:36:28,002 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:36:28,003 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:36:28,003 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:36:28,003 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:36:28,003 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:36:28,004 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:36:28,004 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:36:28,004 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:36:28,004 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:36:28,004 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:36:28,004 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:36:28,005 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:36:28,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:36:28,005 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:36:28,005 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:36:28,005 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:36:28,005 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 19:36:28,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 19:36:28,006 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:36:28,006 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:36:28,006 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:36:28,008 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:36:28,008 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 -> 539063f6ba473db54ff36149ccd453fdab8b89daa6bb5c4360e0c863033e7c3e [2024-11-08 19:36:28,217 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:36:28,241 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:36:28,244 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:36:28,245 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:36:28,245 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:36:28,246 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-53.i [2024-11-08 19:36:29,437 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:36:29,573 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:36:29,573 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-53.i [2024-11-08 19:36:29,580 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d830da0da/9d018d7ef5da4f938f37d383e91abe73/FLAG65aa30222 [2024-11-08 19:36:29,590 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d830da0da/9d018d7ef5da4f938f37d383e91abe73 [2024-11-08 19:36:29,592 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:36:29,593 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:36:29,594 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:36:29,595 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:36:29,600 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:36:29,600 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:36:29" (1/1) ... [2024-11-08 19:36:29,610 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a7cecb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:36:29, skipping insertion in model container [2024-11-08 19:36:29,610 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:36:29" (1/1) ... [2024-11-08 19:36:29,633 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:36:29,764 WARN L250 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_codestructure_normal_file-53.i[913,926] [2024-11-08 19:36:29,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:36:29,819 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:36:29,827 WARN L250 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_codestructure_normal_file-53.i[913,926] [2024-11-08 19:36:29,846 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:36:29,860 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:36:29,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:36:29 WrapperNode [2024-11-08 19:36:29,860 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:36:29,861 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:36:29,861 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:36:29,861 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:36:29,866 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:36:29" (1/1) ... [2024-11-08 19:36:29,874 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:36:29" (1/1) ... [2024-11-08 19:36:29,908 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 205 [2024-11-08 19:36:29,909 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:36:29,913 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:36:29,913 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:36:29,914 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:36:29,923 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:36:29" (1/1) ... [2024-11-08 19:36:29,927 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:36:29" (1/1) ... [2024-11-08 19:36:29,933 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:36:29" (1/1) ... [2024-11-08 19:36:29,944 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 19:36:29,944 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:36:29" (1/1) ... [2024-11-08 19:36:29,945 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:36:29" (1/1) ... [2024-11-08 19:36:29,950 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:36:29" (1/1) ... [2024-11-08 19:36:29,957 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:36:29" (1/1) ... [2024-11-08 19:36:29,958 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:36:29" (1/1) ... [2024-11-08 19:36:29,959 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:36:29" (1/1) ... [2024-11-08 19:36:29,961 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:36:29,962 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:36:29,962 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:36:29,962 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:36:29,963 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:36:29" (1/1) ... [2024-11-08 19:36:29,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:36:29,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:36:29,998 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-11-08 19:36:30,001 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-11-08 19:36:30,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:36:30,039 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 19:36:30,040 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 19:36:30,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 19:36:30,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:36:30,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:36:30,106 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:36:30,108 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:36:30,410 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-08 19:36:30,411 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:36:30,423 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:36:30,424 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:36:30,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:36:30 BoogieIcfgContainer [2024-11-08 19:36:30,424 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:36:30,426 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:36:30,426 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:36:30,428 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:36:30,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:36:29" (1/3) ... [2024-11-08 19:36:30,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1da39bb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:36:30, skipping insertion in model container [2024-11-08 19:36:30,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:36:29" (2/3) ... [2024-11-08 19:36:30,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1da39bb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:36:30, skipping insertion in model container [2024-11-08 19:36:30,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:36:30" (3/3) ... [2024-11-08 19:36:30,432 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-53.i [2024-11-08 19:36:30,445 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:36:30,445 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:36:30,486 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:36:30,492 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;@1560f3ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:36:30,492 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:36:30,495 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 60 states have internal predecessors, (82), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-08 19:36:30,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-08 19:36:30,511 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:36:30,512 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 19:36:30,513 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:36:30,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:36:30,518 INFO L85 PathProgramCache]: Analyzing trace with hash 966952253, now seen corresponding path program 1 times [2024-11-08 19:36:30,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:36:30,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163669046] [2024-11-08 19:36:30,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:36:30,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:36:30,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:30,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:36:30,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:30,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:36:30,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:30,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:36:30,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:30,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:36:30,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:30,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:36:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:30,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:36:30,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:30,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:36:30,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:30,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:36:30,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:30,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:36:30,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:30,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:36:30,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:30,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:36:30,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:30,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:36:30,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:30,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:36:30,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:30,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 19:36:30,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:30,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:36:30,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:30,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 19:36:30,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:30,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 19:36:30,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:30,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 19:36:30,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:30,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 19:36:30,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:30,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 19:36:30,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:30,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 19:36:30,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:30,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 19:36:30,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:30,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 19:36:30,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:30,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 19:36:30,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:30,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 19:36:30,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:30,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 19:36:30,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:30,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 19:36:30,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:30,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 19:36:30,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:30,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-08 19:36:30,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:30,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-08 19:36:30,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:36:30,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163669046] [2024-11-08 19:36:30,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163669046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:36:30,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:36:30,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:36:30,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16608577] [2024-11-08 19:36:30,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:36:30,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 19:36:30,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:36:30,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 19:36:30,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:36:30,946 INFO L87 Difference]: Start difference. First operand has 91 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 60 states have internal predecessors, (82), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-08 19:36:30,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:36:30,978 INFO L93 Difference]: Finished difference Result 175 states and 303 transitions. [2024-11-08 19:36:30,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 19:36:30,980 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 180 [2024-11-08 19:36:30,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:36:30,992 INFO L225 Difference]: With dead ends: 175 [2024-11-08 19:36:31,010 INFO L226 Difference]: Without dead ends: 87 [2024-11-08 19:36:31,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 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-11-08 19:36:31,017 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:36:31,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:36:31,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-08 19:36:31,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-08 19:36:31,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 56 states have internal predecessors, (75), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-08 19:36:31,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 133 transitions. [2024-11-08 19:36:31,067 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 133 transitions. Word has length 180 [2024-11-08 19:36:31,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:36:31,068 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 133 transitions. [2024-11-08 19:36:31,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-08 19:36:31,069 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 133 transitions. [2024-11-08 19:36:31,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-08 19:36:31,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:36:31,072 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 19:36:31,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 19:36:31,073 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:36:31,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:36:31,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1536917491, now seen corresponding path program 1 times [2024-11-08 19:36:31,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:36:31,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148481762] [2024-11-08 19:36:31,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:36:31,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:36:31,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:31,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:36:31,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:31,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:36:31,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:31,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:36:31,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:31,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:36:31,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:31,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:36:31,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:31,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:36:31,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:31,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:36:31,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:31,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:36:31,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:31,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:36:31,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:31,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:36:31,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:31,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:36:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:31,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:36:31,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:31,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:36:31,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:31,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 19:36:31,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:31,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:36:31,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:31,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 19:36:31,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:31,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 19:36:31,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:31,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 19:36:31,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:31,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 19:36:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:31,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 19:36:31,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:31,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 19:36:31,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:31,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 19:36:31,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:31,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 19:36:31,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:31,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 19:36:31,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:31,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 19:36:31,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:31,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 19:36:31,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:31,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 19:36:31,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:31,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 19:36:31,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:31,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-08 19:36:31,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:31,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-08 19:36:31,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:36:31,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148481762] [2024-11-08 19:36:31,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148481762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:36:31,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:36:31,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:36:31,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454204555] [2024-11-08 19:36:31,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:36:31,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:36:31,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:36:31,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:36:31,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:36:31,315 INFO L87 Difference]: Start difference. First operand 87 states and 133 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 19:36:31,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:36:31,379 INFO L93 Difference]: Finished difference Result 246 states and 378 transitions. [2024-11-08 19:36:31,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:36:31,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 180 [2024-11-08 19:36:31,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:36:31,384 INFO L225 Difference]: With dead ends: 246 [2024-11-08 19:36:31,384 INFO L226 Difference]: Without dead ends: 162 [2024-11-08 19:36:31,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:36:31,389 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 124 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:36:31,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 235 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:36:31,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-08 19:36:31,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2024-11-08 19:36:31,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 99 states have (on average 1.292929292929293) internal successors, (128), 99 states have internal predecessors, (128), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-08 19:36:31,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 244 transitions. [2024-11-08 19:36:31,422 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 244 transitions. Word has length 180 [2024-11-08 19:36:31,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:36:31,423 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 244 transitions. [2024-11-08 19:36:31,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 19:36:31,423 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 244 transitions. [2024-11-08 19:36:31,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-08 19:36:31,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:36:31,427 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 19:36:31,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 19:36:31,427 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:36:31,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:36:31,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1838778427, now seen corresponding path program 1 times [2024-11-08 19:36:31,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:36:31,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412342673] [2024-11-08 19:36:31,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:36:31,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:36:31,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 19:36:31,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [370096833] [2024-11-08 19:36:31,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:36:31,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:36:31,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:36:31,579 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:36:31,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 19:36:31,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:31,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-08 19:36:31,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:36:32,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 720 proven. 0 refuted. 0 times theorem prover too weak. 904 trivial. 0 not checked. [2024-11-08 19:36:32,683 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:36:32,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:36:32,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412342673] [2024-11-08 19:36:32,684 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 19:36:32,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370096833] [2024-11-08 19:36:32,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370096833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:36:32,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:36:32,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 19:36:32,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834918150] [2024-11-08 19:36:32,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:36:32,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 19:36:32,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:36:32,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 19:36:32,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:36:32,690 INFO L87 Difference]: Start difference. First operand 160 states and 244 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 3 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2024-11-08 19:36:33,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:36:33,376 INFO L93 Difference]: Finished difference Result 406 states and 609 transitions. [2024-11-08 19:36:33,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 19:36:33,377 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 3 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) Word has length 182 [2024-11-08 19:36:33,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:36:33,381 INFO L225 Difference]: With dead ends: 406 [2024-11-08 19:36:33,381 INFO L226 Difference]: Without dead ends: 249 [2024-11-08 19:36:33,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-08 19:36:33,383 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 256 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 19:36:33,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 271 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 19:36:33,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-11-08 19:36:33,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 166. [2024-11-08 19:36:33,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 105 states have (on average 1.3047619047619048) internal successors, (137), 105 states have internal predecessors, (137), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-08 19:36:33,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 253 transitions. [2024-11-08 19:36:33,424 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 253 transitions. Word has length 182 [2024-11-08 19:36:33,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:36:33,428 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 253 transitions. [2024-11-08 19:36:33,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 3 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2024-11-08 19:36:33,428 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 253 transitions. [2024-11-08 19:36:33,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-08 19:36:33,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:36:33,430 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 19:36:33,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 19:36:33,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:36:33,632 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:36:33,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:36:33,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1580612989, now seen corresponding path program 1 times [2024-11-08 19:36:33,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:36:33,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469461053] [2024-11-08 19:36:33,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:36:33,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:36:33,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 19:36:33,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1530116548] [2024-11-08 19:36:33,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:36:33,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:36:33,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:36:33,721 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:36:33,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 19:36:33,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:36:33,946 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 19:36:33,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:36:34,046 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 19:36:34,046 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 19:36:34,047 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 19:36:34,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 19:36:34,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-08 19:36:34,252 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-08 19:36:34,338 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 19:36:34,340 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 07:36:34 BoogieIcfgContainer [2024-11-08 19:36:34,340 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 19:36:34,340 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 19:36:34,340 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 19:36:34,340 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 19:36:34,341 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:36:30" (3/4) ... [2024-11-08 19:36:34,342 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 19:36:34,343 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 19:36:34,344 INFO L158 Benchmark]: Toolchain (without parser) took 4750.45ms. Allocated memory was 138.4MB in the beginning and 268.4MB in the end (delta: 130.0MB). Free memory was 68.9MB in the beginning and 167.8MB in the end (delta: -99.0MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. [2024-11-08 19:36:34,344 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 138.4MB. Free memory was 104.9MB in the beginning and 104.8MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:36:34,344 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.02ms. Allocated memory was 138.4MB in the beginning and 222.3MB in the end (delta: 83.9MB). Free memory was 68.7MB in the beginning and 183.6MB in the end (delta: -114.9MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2024-11-08 19:36:34,344 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.01ms. Allocated memory is still 222.3MB. Free memory was 183.6MB in the beginning and 180.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 19:36:34,344 INFO L158 Benchmark]: Boogie Preprocessor took 48.24ms. Allocated memory is still 222.3MB. Free memory was 180.5MB in the beginning and 177.3MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 19:36:34,345 INFO L158 Benchmark]: RCFGBuilder took 461.98ms. Allocated memory is still 222.3MB. Free memory was 177.3MB in the beginning and 154.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-08 19:36:34,345 INFO L158 Benchmark]: TraceAbstraction took 3914.10ms. Allocated memory was 222.3MB in the beginning and 268.4MB in the end (delta: 46.1MB). Free memory was 153.3MB in the beginning and 168.9MB in the end (delta: -15.6MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-08 19:36:34,345 INFO L158 Benchmark]: Witness Printer took 3.00ms. Allocated memory is still 268.4MB. Free memory was 168.9MB in the beginning and 167.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:36:34,346 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.10ms. Allocated memory is still 138.4MB. Free memory was 104.9MB in the beginning and 104.8MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 266.02ms. Allocated memory was 138.4MB in the beginning and 222.3MB in the end (delta: 83.9MB). Free memory was 68.7MB in the beginning and 183.6MB in the end (delta: -114.9MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.01ms. Allocated memory is still 222.3MB. Free memory was 183.6MB in the beginning and 180.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.24ms. Allocated memory is still 222.3MB. Free memory was 180.5MB in the beginning and 177.3MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 461.98ms. Allocated memory is still 222.3MB. Free memory was 177.3MB in the beginning and 154.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 3914.10ms. Allocated memory was 222.3MB in the beginning and 268.4MB in the end (delta: 46.1MB). Free memory was 153.3MB in the beginning and 168.9MB in the end (delta: -15.6MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Witness Printer took 3.00ms. Allocated memory is still 268.4MB. Free memory was 168.9MB in the beginning and 167.8MB in the end (delta: 1.0MB). 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 132, overapproximation of someBinaryArithmeticFLOAToperation at line 59, overapproximation of someUnaryFLOAToperation at line 59. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] signed char var_1_2 = -64; [L24] signed char var_1_3 = -1; [L25] signed long int var_1_4 = 0; [L26] signed long int var_1_5 = 4; [L27] signed long int var_1_6 = 4; [L28] unsigned char var_1_7 = 1; [L29] unsigned char var_1_8 = 0; [L30] unsigned long int var_1_9 = 10; [L31] float var_1_10 = 99.5; [L32] float var_1_11 = 5.6; [L33] float var_1_12 = 255.5; [L34] float var_1_13 = 31.25; [L35] signed short int var_1_14 = 32; [L36] unsigned long int var_1_15 = 16; [L37] unsigned char var_1_16 = 1; [L38] unsigned char var_1_17 = 5; [L39] unsigned char var_1_18 = 50; [L40] unsigned char var_1_19 = 50; [L41] signed char var_1_20 = 1; [L42] signed char var_1_21 = -10; [L43] float var_1_22 = 0.5; [L44] signed char var_1_23 = 100; VAL [isInitial=0, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=-64, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L136] isInitial = 1 [L137] FCALL initially() [L138] COND TRUE 1 [L139] FCALL updateLastVariables() [L140] CALL updateVariables() [L84] var_1_2 = __VERIFIER_nondet_char() [L85] CALL assume_abort_if_not(var_1_2 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L85] RET assume_abort_if_not(var_1_2 >= -128) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L86] CALL assume_abort_if_not(var_1_2 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L86] RET assume_abort_if_not(var_1_2 <= 127) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L87] var_1_3 = __VERIFIER_nondet_char() [L88] CALL assume_abort_if_not(var_1_3 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L88] RET assume_abort_if_not(var_1_3 >= -128) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L89] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L89] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L90] var_1_4 = __VERIFIER_nondet_long() [L91] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L91] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L92] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L92] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L93] var_1_5 = __VERIFIER_nondet_long() [L94] CALL assume_abort_if_not(var_1_5 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L94] RET assume_abort_if_not(var_1_5 >= -1) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L95] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L95] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L96] var_1_6 = __VERIFIER_nondet_long() [L97] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=10] [L97] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=10] [L98] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=10] [L98] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=10] [L99] var_1_7 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_8=0, var_1_9=10] [L100] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_8=0, var_1_9=10] [L101] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=10] [L101] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=10] [L102] var_1_8 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_8 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L103] RET assume_abort_if_not(var_1_8 >= 1) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L104] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L104] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L105] var_1_11 = __VERIFIER_nondet_float() [L106] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L106] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L107] var_1_12 = __VERIFIER_nondet_float() [L108] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L108] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L109] var_1_13 = __VERIFIER_nondet_float() [L110] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L110] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L111] var_1_15 = __VERIFIER_nondet_ulong() [L112] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L112] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L113] CALL assume_abort_if_not(var_1_15 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L113] RET assume_abort_if_not(var_1_15 <= 4294967295) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L114] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=4294967307, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=4294967307, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L114] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=4294967307, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L115] var_1_17 = __VERIFIER_nondet_uchar() [L116] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=4294967307, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=4294967307, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L116] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=4294967307, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L117] CALL assume_abort_if_not(var_1_17 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=4294967307, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=4294967307, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L117] RET assume_abort_if_not(var_1_17 <= 255) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=4294967307, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L118] CALL assume_abort_if_not(var_1_17 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=4294967307, var_1_16=1, var_1_17=12, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=4294967307, var_1_16=1, var_1_17=12, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L118] RET assume_abort_if_not(var_1_17 != 0) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=4294967307, var_1_16=1, var_1_17=12, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L119] var_1_18 = __VERIFIER_nondet_uchar() [L120] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=4294967307, var_1_16=1, var_1_17=12, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=4294967307, var_1_16=1, var_1_17=12, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L120] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=4294967307, var_1_16=1, var_1_17=12, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L121] CALL assume_abort_if_not(var_1_18 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=4294967307, var_1_16=1, var_1_17=12, var_1_18=-256, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=4294967307, var_1_16=1, var_1_17=12, var_1_18=-256, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L121] RET assume_abort_if_not(var_1_18 <= 254) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=4294967307, var_1_16=1, var_1_17=12, var_1_18=-256, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L122] var_1_19 = __VERIFIER_nondet_uchar() [L123] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=4294967307, var_1_16=1, var_1_17=12, var_1_18=-256, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=4294967307, var_1_16=1, var_1_17=12, var_1_18=-256, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L123] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=4294967307, var_1_16=1, var_1_17=12, var_1_18=-256, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L124] CALL assume_abort_if_not(var_1_19 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=4294967307, var_1_16=1, var_1_17=12, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=4294967307, var_1_16=1, var_1_17=12, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L124] RET assume_abort_if_not(var_1_19 <= 254) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=4294967307, var_1_16=1, var_1_17=12, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L125] var_1_21 = __VERIFIER_nondet_char() [L126] CALL assume_abort_if_not(var_1_21 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=4294967307, var_1_16=1, var_1_17=12, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=4294967307, var_1_16=1, var_1_17=12, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L126] RET assume_abort_if_not(var_1_21 >= -127) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=4294967307, var_1_16=1, var_1_17=12, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L127] CALL assume_abort_if_not(var_1_21 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=4294967307, var_1_16=1, var_1_17=12, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=4294967307, var_1_16=1, var_1_17=12, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L127] RET assume_abort_if_not(var_1_21 <= 126) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=4294967307, var_1_16=1, var_1_17=12, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L140] RET updateVariables() [L141] CALL step() [L48] COND FALSE !((var_1_2 * var_1_3) == var_1_4) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=4294967307, var_1_16=1, var_1_17=12, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L53] COND FALSE !((var_1_1 || (var_1_6 <= var_1_2)) || (var_1_3 != var_1_4)) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=4294967307, var_1_16=1, var_1_17=12, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L58] COND TRUE (! var_1_1) || var_1_8 [L59] var_1_10 = (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))) VAL [isInitial=1, var_1_10=2, var_1_13=0, var_1_14=32, var_1_15=4294967307, var_1_16=1, var_1_17=12, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L67] COND FALSE !(\read(var_1_1)) VAL [isInitial=1, var_1_10=2, var_1_13=0, var_1_14=32, var_1_15=4294967307, var_1_16=1, var_1_17=12, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L70] EXPR (var_1_9 / var_1_15) & var_1_6 VAL [isInitial=1, var_1_10=2, var_1_13=0, var_1_14=32, var_1_15=4294967307, var_1_16=1, var_1_17=12, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L70] COND FALSE !(((var_1_9 / var_1_15) & var_1_6) >= var_1_4) [L73] var_1_14 = -128 VAL [isInitial=1, var_1_10=2, var_1_13=0, var_1_14=-128, var_1_15=4294967307, var_1_16=1, var_1_17=12, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L76] EXPR 256u << var_1_2 VAL [isInitial=1, var_1_10=2, var_1_13=0, var_1_14=-128, var_1_15=4294967307, var_1_16=1, var_1_17=12, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L76] COND TRUE (((((var_1_15) > (var_1_9)) ? (var_1_15) : (var_1_9))) / var_1_17) <= (256u << var_1_2) [L77] var_1_16 = ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))) VAL [isInitial=1, var_1_10=2, var_1_13=0, var_1_14=-128, var_1_15=4294967307, var_1_16=0, var_1_17=12, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L79] var_1_20 = var_1_21 [L80] var_1_22 = var_1_12 [L81] var_1_23 = var_1_21 VAL [isInitial=1, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=-128, var_1_15=4294967307, var_1_16=0, var_1_17=12, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=-127, var_1_21=-127, var_1_22=3, var_1_23=-127, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L141] RET step() [L142] CALL, EXPR property() [L132] EXPR (((((var_1_2 * var_1_3) == var_1_4) ? (((var_1_4 > (var_1_5 - var_1_6)) && var_1_7) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_6 <= var_1_2)) || (var_1_3 != var_1_4)) ? ((((((var_1_6) < (0)) ? (var_1_6) : (0))) <= (-5 + var_1_5)) ? (var_1_9 == ((unsigned long int) var_1_6)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_4 != var_1_6)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))))) : ((((var_1_9 / var_1_15) & var_1_6) >= var_1_4) ? (var_1_14 == ((signed short int) var_1_3)) : (var_1_14 == ((signed short int) -128)))) VAL [isInitial=1, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=-128, var_1_15=4294967307, var_1_16=0, var_1_17=12, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=-127, var_1_21=-127, var_1_22=3, var_1_23=-127, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L132] EXPR ((((((var_1_2 * var_1_3) == var_1_4) ? (((var_1_4 > (var_1_5 - var_1_6)) && var_1_7) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_6 <= var_1_2)) || (var_1_3 != var_1_4)) ? ((((((var_1_6) < (0)) ? (var_1_6) : (0))) <= (-5 + var_1_5)) ? (var_1_9 == ((unsigned long int) var_1_6)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_4 != var_1_6)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))))) : ((((var_1_9 / var_1_15) & var_1_6) >= var_1_4) ? (var_1_14 == ((signed short int) var_1_3)) : (var_1_14 == ((signed short int) -128))))) && (((((((var_1_15) > (var_1_9)) ? (var_1_15) : (var_1_9))) / var_1_17) <= (256u << var_1_2)) ? (var_1_16 == ((unsigned char) ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) : 1) VAL [isInitial=1, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=-128, var_1_15=4294967307, var_1_16=0, var_1_17=12, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=-127, var_1_21=-127, var_1_22=3, var_1_23=-127, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L132-L133] return (((((((((var_1_2 * var_1_3) == var_1_4) ? (((var_1_4 > (var_1_5 - var_1_6)) && var_1_7) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_6 <= var_1_2)) || (var_1_3 != var_1_4)) ? ((((((var_1_6) < (0)) ? (var_1_6) : (0))) <= (-5 + var_1_5)) ? (var_1_9 == ((unsigned long int) var_1_6)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_4 != var_1_6)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))))) : ((((var_1_9 / var_1_15) & var_1_6) >= var_1_4) ? (var_1_14 == ((signed short int) var_1_3)) : (var_1_14 == ((signed short int) -128))))) && (((((((var_1_15) > (var_1_9)) ? (var_1_15) : (var_1_9))) / var_1_17) <= (256u << var_1_2)) ? (var_1_16 == ((unsigned char) ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) : 1)) && (var_1_20 == ((signed char) var_1_21))) && (var_1_22 == ((float) var_1_12))) && (var_1_23 == ((signed char) var_1_21)) ; [L142] RET, EXPR property() [L142] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=-128, var_1_15=4294967307, var_1_16=0, var_1_17=12, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=-127, var_1_21=-127, var_1_22=3, var_1_23=-127, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L19] reach_error() VAL [isInitial=1, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=-128, var_1_15=4294967307, var_1_16=0, var_1_17=12, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=-127, var_1_21=-127, var_1_22=3, var_1_23=-127, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 91 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 4, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 380 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 380 mSDsluCounter, 639 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 275 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 222 IncrementalHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 364 mSDtfsCounter, 222 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 334 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166occurred in iteration=3, InterpolantAutomatonStates: 11, 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, 3 MinimizatonAttempts, 85 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1088 NumberOfCodeBlocks, 1088 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 539 ConstructedInterpolants, 0 QuantifiedInterpolants, 2186 SizeOfPredicates, 3 NumberOfNonLiveVariables, 403 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 4872/4872 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-11-08 19:36:34,372 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/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-53.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 539063f6ba473db54ff36149ccd453fdab8b89daa6bb5c4360e0c863033e7c3e --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 19:36:36,084 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:36:36,138 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 19:36:36,142 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:36:36,142 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:36:36,164 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:36:36,165 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:36:36,165 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:36:36,165 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:36:36,165 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:36:36,165 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:36:36,166 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:36:36,166 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:36:36,167 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:36:36,168 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:36:36,168 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:36:36,168 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:36:36,171 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:36:36,171 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:36:36,171 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:36:36,171 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:36:36,171 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:36:36,172 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:36:36,172 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 19:36:36,172 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 19:36:36,172 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:36:36,172 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 19:36:36,172 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:36:36,172 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:36:36,172 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:36:36,173 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:36:36,173 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:36:36,173 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:36:36,173 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:36:36,178 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:36:36,179 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:36:36,180 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:36:36,180 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:36:36,181 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 19:36:36,181 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 19:36:36,181 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:36:36,182 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:36:36,182 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:36:36,182 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:36:36,182 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 -> 539063f6ba473db54ff36149ccd453fdab8b89daa6bb5c4360e0c863033e7c3e [2024-11-08 19:36:36,440 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:36:36,461 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:36:36,463 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:36:36,464 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:36:36,464 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:36:36,465 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-53.i [2024-11-08 19:36:37,767 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:36:37,929 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:36:37,930 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-53.i [2024-11-08 19:36:37,940 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35b186c80/d3a89e8e6dcc4ec3a99a86987117c731/FLAGeb9bab567 [2024-11-08 19:36:37,956 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35b186c80/d3a89e8e6dcc4ec3a99a86987117c731 [2024-11-08 19:36:37,958 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:36:37,959 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:36:37,962 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:36:37,963 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:36:37,967 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:36:37,967 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:36:37" (1/1) ... [2024-11-08 19:36:37,968 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e75793 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:36:37, skipping insertion in model container [2024-11-08 19:36:37,968 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:36:37" (1/1) ... [2024-11-08 19:36:37,992 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:36:38,148 WARN L250 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_codestructure_normal_file-53.i[913,926] [2024-11-08 19:36:38,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:36:38,226 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:36:38,236 WARN L250 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_codestructure_normal_file-53.i[913,926] [2024-11-08 19:36:38,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:36:38,276 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:36:38,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:36:38 WrapperNode [2024-11-08 19:36:38,276 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:36:38,277 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:36:38,277 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:36:38,277 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:36:38,281 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:36:38" (1/1) ... [2024-11-08 19:36:38,292 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:36:38" (1/1) ... [2024-11-08 19:36:38,315 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 152 [2024-11-08 19:36:38,315 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:36:38,316 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:36:38,316 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:36:38,316 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:36:38,328 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:36:38" (1/1) ... [2024-11-08 19:36:38,328 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:36:38" (1/1) ... [2024-11-08 19:36:38,331 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:36:38" (1/1) ... [2024-11-08 19:36:38,339 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 19:36:38,339 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:36:38" (1/1) ... [2024-11-08 19:36:38,339 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:36:38" (1/1) ... [2024-11-08 19:36:38,347 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:36:38" (1/1) ... [2024-11-08 19:36:38,350 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:36:38" (1/1) ... [2024-11-08 19:36:38,352 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:36:38" (1/1) ... [2024-11-08 19:36:38,357 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:36:38" (1/1) ... [2024-11-08 19:36:38,359 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:36:38,361 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:36:38,361 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:36:38,362 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:36:38,363 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:36:38" (1/1) ... [2024-11-08 19:36:38,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:36:38,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:36:38,397 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-11-08 19:36:38,402 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-11-08 19:36:38,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:36:38,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 19:36:38,434 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 19:36:38,434 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 19:36:38,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:36:38,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:36:38,510 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:36:38,512 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:36:38,926 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-08 19:36:38,926 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:36:38,934 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:36:38,935 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:36:38,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:36:38 BoogieIcfgContainer [2024-11-08 19:36:38,935 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:36:38,937 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:36:38,937 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:36:38,939 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:36:38,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:36:37" (1/3) ... [2024-11-08 19:36:38,940 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e80f4f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:36:38, skipping insertion in model container [2024-11-08 19:36:38,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:36:38" (2/3) ... [2024-11-08 19:36:38,941 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e80f4f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:36:38, skipping insertion in model container [2024-11-08 19:36:38,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:36:38" (3/3) ... [2024-11-08 19:36:38,943 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-53.i [2024-11-08 19:36:38,955 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:36:38,955 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:36:39,003 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:36:39,009 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;@46c9e5c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:36:39,009 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:36:39,012 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 42 states have internal predecessors, (55), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-08 19:36:39,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-08 19:36:39,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:36:39,022 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 19:36:39,023 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:36:39,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:36:39,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1456352961, now seen corresponding path program 1 times [2024-11-08 19:36:39,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:36:39,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [753281914] [2024-11-08 19:36:39,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:36:39,036 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-11-08 19:36:39,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:36:39,039 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-11-08 19:36:39,039 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-11-08 19:36:39,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:39,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 19:36:39,302 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:36:39,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 644 proven. 0 refuted. 0 times theorem prover too weak. 980 trivial. 0 not checked. [2024-11-08 19:36:39,343 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:36:39,344 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:36:39,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [753281914] [2024-11-08 19:36:39,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [753281914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:36:39,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:36:39,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:36:39,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641261732] [2024-11-08 19:36:39,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:36:39,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 19:36:39,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:36:39,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 19:36:39,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:36:39,369 INFO L87 Difference]: Start difference. First operand has 73 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 42 states have internal predecessors, (55), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-08 19:36:39,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:36:39,397 INFO L93 Difference]: Finished difference Result 139 states and 249 transitions. [2024-11-08 19:36:39,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 19:36:39,402 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 175 [2024-11-08 19:36:39,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:36:39,409 INFO L225 Difference]: With dead ends: 139 [2024-11-08 19:36:39,409 INFO L226 Difference]: Without dead ends: 69 [2024-11-08 19:36:39,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 174 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-11-08 19:36:39,416 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:36:39,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:36:39,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-08 19:36:39,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-08 19:36:39,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-08 19:36:39,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 106 transitions. [2024-11-08 19:36:39,461 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 106 transitions. Word has length 175 [2024-11-08 19:36:39,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:36:39,461 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 106 transitions. [2024-11-08 19:36:39,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-08 19:36:39,462 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 106 transitions. [2024-11-08 19:36:39,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-08 19:36:39,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:36:39,467 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 19:36:39,477 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-11-08 19:36:39,668 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-11-08 19:36:39,669 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:36:39,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:36:39,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1992612427, now seen corresponding path program 1 times [2024-11-08 19:36:39,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:36:39,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1612851222] [2024-11-08 19:36:39,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:36:39,670 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-11-08 19:36:39,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:36:39,671 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-11-08 19:36:39,672 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-11-08 19:36:39,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:39,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 19:36:39,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:36:40,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-08 19:36:40,274 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:36:40,274 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:36:40,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1612851222] [2024-11-08 19:36:40,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1612851222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:36:40,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:36:40,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:36:40,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545548760] [2024-11-08 19:36:40,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:36:40,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:36:40,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:36:40,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:36:40,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:36:40,278 INFO L87 Difference]: Start difference. First operand 69 states and 106 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 19:36:40,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:36:40,486 INFO L93 Difference]: Finished difference Result 199 states and 308 transitions. [2024-11-08 19:36:40,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:36:40,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 175 [2024-11-08 19:36:40,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:36:40,499 INFO L225 Difference]: With dead ends: 199 [2024-11-08 19:36:40,499 INFO L226 Difference]: Without dead ends: 133 [2024-11-08 19:36:40,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:36:40,501 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 17 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 19:36:40,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 194 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 19:36:40,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-08 19:36:40,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2024-11-08 19:36:40,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 70 states have (on average 1.2285714285714286) internal successors, (86), 70 states have internal predecessors, (86), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-08 19:36:40,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 202 transitions. [2024-11-08 19:36:40,524 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 202 transitions. Word has length 175 [2024-11-08 19:36:40,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:36:40,525 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 202 transitions. [2024-11-08 19:36:40,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 19:36:40,525 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 202 transitions. [2024-11-08 19:36:40,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-08 19:36:40,527 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:36:40,527 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 19:36:40,535 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-11-08 19:36:40,727 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-11-08 19:36:40,728 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:36:40,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:36:40,728 INFO L85 PathProgramCache]: Analyzing trace with hash -314384374, now seen corresponding path program 1 times [2024-11-08 19:36:40,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:36:40,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1150446333] [2024-11-08 19:36:40,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:36:40,729 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-11-08 19:36:40,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:36:40,731 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-11-08 19:36:40,731 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-11-08 19:36:40,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:40,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-08 19:36:40,914 INFO L278 TraceCheckSpWp]: Computing forward predicates...