./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-60.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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-60.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 cc3a84fad616b331392c1cbee66ac380889aa15bfd2024f97a694900f4fe81e6 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 01:16:40,217 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 01:16:40,293 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 01:16:40,298 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 01:16:40,299 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 01:16:40,324 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 01:16:40,325 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 01:16:40,325 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 01:16:40,325 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 01:16:40,326 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 01:16:40,326 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 01:16:40,326 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 01:16:40,326 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 01:16:40,327 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 01:16:40,327 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 01:16:40,327 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 01:16:40,328 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 01:16:40,328 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 01:16:40,328 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 01:16:40,328 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 01:16:40,329 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 01:16:40,332 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 01:16:40,332 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 01:16:40,332 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 01:16:40,333 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 01:16:40,333 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 01:16:40,333 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 01:16:40,333 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 01:16:40,333 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 01:16:40,334 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 01:16:40,334 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 01:16:40,334 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 01:16:40,334 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:16:40,334 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 01:16:40,334 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 01:16:40,335 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 01:16:40,335 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 01:16:40,335 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 01:16:40,339 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 01:16:40,339 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 01:16:40,339 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 01:16:40,340 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 01:16:40,340 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 -> cc3a84fad616b331392c1cbee66ac380889aa15bfd2024f97a694900f4fe81e6 [2024-11-12 01:16:40,532 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 01:16:40,554 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 01:16:40,556 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 01:16:40,557 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 01:16:40,558 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 01:16:40,559 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-60.i [2024-11-12 01:16:42,110 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 01:16:42,275 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 01:16:42,275 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-60.i [2024-11-12 01:16:42,282 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f366a5be/511f1e2ef4544c62a5c742a6303145a4/FLAG28a9effdf [2024-11-12 01:16:42,292 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f366a5be/511f1e2ef4544c62a5c742a6303145a4 [2024-11-12 01:16:42,295 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 01:16:42,296 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 01:16:42,297 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 01:16:42,297 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 01:16:42,304 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 01:16:42,305 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:16:42" (1/1) ... [2024-11-12 01:16:42,310 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@413c8c58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:16:42, skipping insertion in model container [2024-11-12 01:16:42,310 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:16:42" (1/1) ... [2024-11-12 01:16:42,356 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 01:16:42,579 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-60.i[913,926] [2024-11-12 01:16:42,630 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:16:42,641 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 01:16:42,652 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-60.i[913,926] [2024-11-12 01:16:42,673 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:16:42,702 INFO L204 MainTranslator]: Completed translation [2024-11-12 01:16:42,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:16:42 WrapperNode [2024-11-12 01:16:42,702 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 01:16:42,703 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 01:16:42,706 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 01:16:42,706 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 01:16:42,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:16:42" (1/1) ... [2024-11-12 01:16:42,726 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:16:42" (1/1) ... [2024-11-12 01:16:42,754 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 157 [2024-11-12 01:16:42,754 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 01:16:42,755 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 01:16:42,755 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 01:16:42,755 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 01:16:42,763 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:16:42" (1/1) ... [2024-11-12 01:16:42,764 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:16:42" (1/1) ... [2024-11-12 01:16:42,765 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:16:42" (1/1) ... [2024-11-12 01:16:42,775 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-12 01:16:42,775 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:16:42" (1/1) ... [2024-11-12 01:16:42,776 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:16:42" (1/1) ... [2024-11-12 01:16:42,780 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:16:42" (1/1) ... [2024-11-12 01:16:42,783 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:16:42" (1/1) ... [2024-11-12 01:16:42,785 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:16:42" (1/1) ... [2024-11-12 01:16:42,786 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:16:42" (1/1) ... [2024-11-12 01:16:42,794 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 01:16:42,795 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 01:16:42,795 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 01:16:42,795 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 01:16:42,795 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:16:42" (1/1) ... [2024-11-12 01:16:42,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:16:42,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:16:42,821 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-12 01:16:42,831 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-12 01:16:42,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 01:16:42,870 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 01:16:42,870 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 01:16:42,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 01:16:42,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 01:16:42,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 01:16:42,945 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 01:16:42,949 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 01:16:43,228 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-12 01:16:43,229 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 01:16:43,244 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 01:16:43,245 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 01:16:43,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:16:43 BoogieIcfgContainer [2024-11-12 01:16:43,245 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 01:16:43,247 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 01:16:43,249 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 01:16:43,251 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 01:16:43,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:16:42" (1/3) ... [2024-11-12 01:16:43,252 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e7d65e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:16:43, skipping insertion in model container [2024-11-12 01:16:43,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:16:42" (2/3) ... [2024-11-12 01:16:43,253 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e7d65e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:16:43, skipping insertion in model container [2024-11-12 01:16:43,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:16:43" (3/3) ... [2024-11-12 01:16:43,254 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-60.i [2024-11-12 01:16:43,266 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 01:16:43,267 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 01:16:43,320 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 01:16:43,325 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;@fdbf8a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 01:16:43,325 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 01:16:43,328 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 43 states have (on average 1.372093023255814) internal successors, (59), 44 states have internal predecessors, (59), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 01:16:43,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-12 01:16:43,337 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:16:43,338 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:16:43,338 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:16:43,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:16:43,342 INFO L85 PathProgramCache]: Analyzing trace with hash -872191040, now seen corresponding path program 1 times [2024-11-12 01:16:43,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:16:43,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093829242] [2024-11-12 01:16:43,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:16:43,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:16:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:43,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:16:43,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:43,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:16:43,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:43,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:16:43,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:43,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 01:16:43,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:43,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:16:43,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:43,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 01:16:43,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:43,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 01:16:43,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:43,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 01:16:43,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:43,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 01:16:43,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:43,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 01:16:43,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:43,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 01:16:43,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:43,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 01:16:43,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:43,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 01:16:43,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:43,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 01:16:43,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:43,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 01:16:43,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:43,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 01:16:43,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:43,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 01:16:43,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:43,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 01:16:43,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:43,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 01:16:43,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:43,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 01:16:43,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:43,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 01:16:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:43,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 01:16:43,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:43,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-12 01:16:43,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:43,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 01:16:43,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:43,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-12 01:16:43,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:43,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-12 01:16:43,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:43,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 01:16:43,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:16:43,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093829242] [2024-11-12 01:16:43,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093829242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:16:43,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:16:43,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 01:16:43,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220510890] [2024-11-12 01:16:43,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:16:43,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 01:16:43,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:16:43,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 01:16:43,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 01:16:43,879 INFO L87 Difference]: Start difference. First operand has 72 states, 43 states have (on average 1.372093023255814) internal successors, (59), 44 states have internal predecessors, (59), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-12 01:16:43,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:16:43,909 INFO L93 Difference]: Finished difference Result 137 states and 242 transitions. [2024-11-12 01:16:43,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 01:16:43,910 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 161 [2024-11-12 01:16:43,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:16:43,916 INFO L225 Difference]: With dead ends: 137 [2024-11-12 01:16:43,917 INFO L226 Difference]: Without dead ends: 68 [2024-11-12 01:16:43,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 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-12 01:16:43,925 INFO L435 NwaCegarLoop]: 104 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, 104 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-12 01:16:43,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 01:16:43,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-12 01:16:43,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-12 01:16:43,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 40 states have (on average 1.3) internal successors, (52), 40 states have internal predecessors, (52), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 01:16:43,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 104 transitions. [2024-11-12 01:16:43,972 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 104 transitions. Word has length 161 [2024-11-12 01:16:43,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:16:43,973 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 104 transitions. [2024-11-12 01:16:43,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-12 01:16:43,973 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 104 transitions. [2024-11-12 01:16:43,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-12 01:16:43,978 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:16:43,978 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:16:43,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 01:16:43,979 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:16:43,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:16:43,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1466653832, now seen corresponding path program 1 times [2024-11-12 01:16:43,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:16:43,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008580627] [2024-11-12 01:16:43,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:16:43,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:16:44,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:44,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:16:44,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:44,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:16:44,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:44,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:16:44,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:44,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 01:16:44,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:44,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:16:44,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:44,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 01:16:44,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:44,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 01:16:44,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:44,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 01:16:44,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:44,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 01:16:44,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:44,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 01:16:44,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:44,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 01:16:44,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:44,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 01:16:44,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:44,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 01:16:44,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:44,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 01:16:44,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:44,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 01:16:44,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:44,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 01:16:44,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:44,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 01:16:44,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:44,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 01:16:44,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:44,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 01:16:44,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:44,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 01:16:44,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:44,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 01:16:44,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:44,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 01:16:44,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:44,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-12 01:16:44,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:44,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 01:16:44,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:44,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-12 01:16:44,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:44,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-12 01:16:44,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:44,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 01:16:44,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:16:44,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008580627] [2024-11-12 01:16:44,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008580627] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:16:44,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:16:44,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 01:16:44,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302149209] [2024-11-12 01:16:44,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:16:44,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 01:16:44,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:16:44,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 01:16:44,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 01:16:44,324 INFO L87 Difference]: Start difference. First operand 68 states and 104 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 01:16:44,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:16:44,372 INFO L93 Difference]: Finished difference Result 169 states and 256 transitions. [2024-11-12 01:16:44,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 01:16:44,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 161 [2024-11-12 01:16:44,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:16:44,377 INFO L225 Difference]: With dead ends: 169 [2024-11-12 01:16:44,377 INFO L226 Difference]: Without dead ends: 104 [2024-11-12 01:16:44,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 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-12 01:16:44,380 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 50 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 01:16:44,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 243 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 01:16:44,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-12 01:16:44,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2024-11-12 01:16:44,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 58 states have (on average 1.2413793103448276) internal successors, (72), 59 states have internal predecessors, (72), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-12 01:16:44,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 152 transitions. [2024-11-12 01:16:44,404 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 152 transitions. Word has length 161 [2024-11-12 01:16:44,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:16:44,406 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 152 transitions. [2024-11-12 01:16:44,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 01:16:44,407 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 152 transitions. [2024-11-12 01:16:44,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-12 01:16:44,409 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:16:44,409 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:16:44,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 01:16:44,409 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:16:44,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:16:44,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1143043144, now seen corresponding path program 1 times [2024-11-12 01:16:44,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:16:44,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444004480] [2024-11-12 01:16:44,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:16:44,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:16:44,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:44,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:16:44,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:44,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:16:44,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:44,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:16:44,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:44,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 01:16:44,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:44,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:16:44,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:44,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 01:16:44,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:44,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 01:16:44,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:44,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 01:16:44,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:44,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 01:16:44,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:44,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 01:16:44,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:44,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 01:16:44,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:44,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 01:16:44,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:44,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 01:16:44,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:44,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 01:16:44,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:44,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 01:16:44,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:44,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 01:16:44,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:44,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 01:16:44,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:44,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 01:16:44,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:44,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 01:16:44,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:44,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 01:16:44,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:44,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 01:16:44,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:44,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 01:16:44,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:44,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-12 01:16:44,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:44,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 01:16:44,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:44,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-12 01:16:44,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:44,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-12 01:16:44,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:44,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 01:16:44,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:16:44,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444004480] [2024-11-12 01:16:44,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444004480] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:16:44,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:16:44,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 01:16:44,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052226919] [2024-11-12 01:16:44,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:16:44,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 01:16:44,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:16:44,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 01:16:44,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 01:16:44,555 INFO L87 Difference]: Start difference. First operand 101 states and 152 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 01:16:44,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:16:44,608 INFO L93 Difference]: Finished difference Result 224 states and 337 transitions. [2024-11-12 01:16:44,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 01:16:44,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 162 [2024-11-12 01:16:44,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:16:44,612 INFO L225 Difference]: With dead ends: 224 [2024-11-12 01:16:44,612 INFO L226 Difference]: Without dead ends: 126 [2024-11-12 01:16:44,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 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-12 01:16:44,613 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 21 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 01:16:44,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 192 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 01:16:44,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-12 01:16:44,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 107. [2024-11-12 01:16:44,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 64 states have (on average 1.296875) internal successors, (83), 65 states have internal predecessors, (83), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-12 01:16:44,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 163 transitions. [2024-11-12 01:16:44,624 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 163 transitions. Word has length 162 [2024-11-12 01:16:44,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:16:44,624 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 163 transitions. [2024-11-12 01:16:44,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 01:16:44,624 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 163 transitions. [2024-11-12 01:16:44,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-12 01:16:44,626 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:16:44,626 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:16:44,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 01:16:44,626 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:16:44,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:16:44,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1376916790, now seen corresponding path program 1 times [2024-11-12 01:16:44,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:16:44,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740515029] [2024-11-12 01:16:44,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:16:44,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:16:44,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 01:16:44,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1183808114] [2024-11-12 01:16:44,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:16:44,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 01:16:44,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:16:44,796 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-12 01:16:44,798 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-12 01:16:45,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 01:16:45,057 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 01:16:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 01:16:45,148 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 01:16:45,149 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 01:16:45,149 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 01:16:45,159 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-12 01:16:45,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 01:16:45,356 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-12 01:16:45,449 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 01:16:45,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 01:16:45 BoogieIcfgContainer [2024-11-12 01:16:45,451 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 01:16:45,452 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 01:16:45,452 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 01:16:45,452 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 01:16:45,452 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:16:43" (3/4) ... [2024-11-12 01:16:45,454 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 01:16:45,455 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 01:16:45,456 INFO L158 Benchmark]: Toolchain (without parser) took 3159.95ms. Allocated memory is still 218.1MB. Free memory was 150.1MB in the beginning and 78.3MB in the end (delta: 71.8MB). Peak memory consumption was 74.3MB. Max. memory is 16.1GB. [2024-11-12 01:16:45,459 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 111.1MB. Free memory is still 76.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 01:16:45,459 INFO L158 Benchmark]: CACSL2BoogieTranslator took 406.08ms. Allocated memory is still 218.1MB. Free memory was 149.9MB in the beginning and 134.3MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 01:16:45,460 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.14ms. Allocated memory is still 218.1MB. Free memory was 134.3MB in the beginning and 131.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 01:16:45,460 INFO L158 Benchmark]: Boogie Preprocessor took 39.36ms. Allocated memory is still 218.1MB. Free memory was 131.7MB in the beginning and 128.7MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 01:16:45,460 INFO L158 Benchmark]: RCFGBuilder took 450.55ms. Allocated memory is still 218.1MB. Free memory was 128.7MB in the beginning and 176.7MB in the end (delta: -48.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 01:16:45,460 INFO L158 Benchmark]: TraceAbstraction took 2204.45ms. Allocated memory is still 218.1MB. Free memory was 176.1MB in the beginning and 78.3MB in the end (delta: 97.8MB). Peak memory consumption was 100.8MB. Max. memory is 16.1GB. [2024-11-12 01:16:45,461 INFO L158 Benchmark]: Witness Printer took 3.55ms. Allocated memory is still 218.1MB. Free memory is still 78.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 01:16:45,462 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.14ms. Allocated memory is still 111.1MB. Free memory is still 76.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 406.08ms. Allocated memory is still 218.1MB. Free memory was 149.9MB in the beginning and 134.3MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.14ms. Allocated memory is still 218.1MB. Free memory was 134.3MB in the beginning and 131.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.36ms. Allocated memory is still 218.1MB. Free memory was 131.7MB in the beginning and 128.7MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 450.55ms. Allocated memory is still 218.1MB. Free memory was 128.7MB in the beginning and 176.7MB in the end (delta: -48.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2204.45ms. Allocated memory is still 218.1MB. Free memory was 176.1MB in the beginning and 78.3MB in the end (delta: 97.8MB). Peak memory consumption was 100.8MB. Max. memory is 16.1GB. * Witness Printer took 3.55ms. Allocated memory is still 218.1MB. Free memory is still 78.3MB. 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 139, overapproximation of someBinaryDOUBLEComparisonOperation at line 139, overapproximation of someBinaryArithmeticDOUBLEoperation at line 80. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 32; [L23] unsigned char var_1_2 = 1; [L24] float var_1_3 = 10.7; [L25] float var_1_4 = 7.8; [L26] float var_1_5 = 99.5; [L27] signed short int var_1_6 = 16; [L28] signed short int var_1_7 = 256; [L29] float var_1_8 = 256.6; [L30] unsigned char var_1_9 = 50; [L31] unsigned char var_1_10 = 5; [L32] double var_1_11 = 127.75; [L33] unsigned char var_1_12 = 1; [L34] unsigned char var_1_13 = 1; [L35] unsigned char var_1_14 = 0; [L36] double var_1_15 = 15.2; [L37] double var_1_16 = 256.5; [L38] double var_1_17 = 256.5; [L39] double var_1_18 = 0.0; [L40] double var_1_19 = 9.7; [L41] unsigned long int var_1_20 = 10000000; [L42] unsigned long int var_1_21 = 4008920074; [L43] unsigned long int var_1_22 = 128; VAL [isInitial=0, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=1, var_1_3=107/10, var_1_4=39/5, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L143] isInitial = 1 [L144] FCALL initially() [L145] COND TRUE 1 [L146] FCALL updateLastVariables() [L147] CALL updateVariables() [L93] var_1_2 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_3=107/10, var_1_4=39/5, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_3=107/10, var_1_4=39/5, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L94] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_3=107/10, var_1_4=39/5, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L95] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_3=107/10, var_1_4=39/5, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_3=107/10, var_1_4=39/5, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L95] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_3=107/10, var_1_4=39/5, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L96] var_1_3 = __VERIFIER_nondet_float() [L97] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_4=39/5, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_4=39/5, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L97] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_4=39/5, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L98] var_1_4 = __VERIFIER_nondet_float() [L99] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L99] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L100] CALL assume_abort_if_not(var_1_4 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L100] RET assume_abort_if_not(var_1_4 != 0.0F) VAL [isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L101] var_1_5 = __VERIFIER_nondet_float() [L102] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L102] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L103] var_1_6 = __VERIFIER_nondet_short() [L104] CALL assume_abort_if_not(var_1_6 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=128, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=128, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L104] RET assume_abort_if_not(var_1_6 >= -1) VAL [isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=128, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L105] CALL assume_abort_if_not(var_1_6 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=128, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=128, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L105] RET assume_abort_if_not(var_1_6 <= 32766) VAL [isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=128, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L106] var_1_7 = __VERIFIER_nondet_short() [L107] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L107] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L108] CALL assume_abort_if_not(var_1_7 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L108] RET assume_abort_if_not(var_1_7 <= 32766) VAL [isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L109] var_1_10 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L110] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L111] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L111] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L112] var_1_12 = __VERIFIER_nondet_uchar() [L113] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=511/4, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=511/4, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L113] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=511/4, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L114] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L114] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L115] var_1_13 = __VERIFIER_nondet_uchar() [L116] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L116] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L117] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L117] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L118] var_1_14 = __VERIFIER_nondet_uchar() [L119] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L119] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L120] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L120] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L121] var_1_15 = __VERIFIER_nondet_double() [L122] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L122] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L123] var_1_17 = __VERIFIER_nondet_double() [L124] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L124] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L125] var_1_18 = __VERIFIER_nondet_double() [L126] CALL assume_abort_if_not((var_1_18 >= 4611686.018427382800e+12F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L126] RET assume_abort_if_not((var_1_18 >= 4611686.018427382800e+12F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L127] var_1_19 = __VERIFIER_nondet_double() [L128] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L128] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L129] var_1_21 = __VERIFIER_nondet_ulong() [L130] CALL assume_abort_if_not(var_1_21 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_22=128, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_22=128, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L130] RET assume_abort_if_not(var_1_21 >= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_22=128, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L131] CALL assume_abort_if_not(var_1_21 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_22=128, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_22=128, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L131] RET assume_abort_if_not(var_1_21 <= 4294967294) VAL [isInitial=1, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_22=128, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L132] var_1_22 = __VERIFIER_nondet_ulong() [L133] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L133] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L134] CALL assume_abort_if_not(var_1_22 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_22=0, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_22=0, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L134] RET assume_abort_if_not(var_1_22 <= 4294967294) VAL [isInitial=1, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_22=0, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L147] RET updateVariables() [L148] CALL step() [L47] COND FALSE !(\read(var_1_2)) [L54] var_1_1 = var_1_7 VAL [isInitial=1, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=129, var_1_20=10000000, var_1_21=2147483647, var_1_22=0, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L56] COND FALSE !((- var_1_5) <= var_1_4) VAL [isInitial=1, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=129, var_1_20=10000000, var_1_21=2147483647, var_1_22=0, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L61] COND FALSE !(var_1_8 < (var_1_3 + var_1_5)) [L68] var_1_9 = var_1_10 VAL [isInitial=1, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=129, var_1_20=10000000, var_1_21=2147483647, var_1_22=0, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=1] [L70] COND TRUE (var_1_8 >= var_1_3) || ((var_1_2 && var_1_12) || (var_1_13 || var_1_14)) VAL [isInitial=1, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=129, var_1_20=10000000, var_1_21=2147483647, var_1_22=0, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=1] [L71] COND FALSE !(\read(var_1_2)) [L74] var_1_11 = var_1_15 VAL [isInitial=1, var_1_10=1, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=2, var_1_16=513/2, var_1_1=129, var_1_20=10000000, var_1_21=2147483647, var_1_22=0, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=1] [L79] COND TRUE ((var_1_10 * var_1_7) + var_1_9) > var_1_1 [L80] var_1_16 = (var_1_17 - (var_1_18 - var_1_19)) VAL [isInitial=1, var_1_10=1, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=2, var_1_1=129, var_1_20=10000000, var_1_21=2147483647, var_1_22=0, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=1] [L82] COND TRUE \read(var_1_13) [L83] var_1_20 = (((((var_1_7) > (128u)) ? (var_1_7) : (128u))) + var_1_9) VAL [isInitial=1, var_1_10=1, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=2, var_1_1=129, var_1_20=130, var_1_21=2147483647, var_1_22=0, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=1] [L148] RET step() [L149] CALL, EXPR property() [L139-L140] return (((((var_1_2 ? (((var_1_3 / var_1_4) <= var_1_5) ? (var_1_1 == ((signed short int) (var_1_6 - var_1_7))) : (var_1_1 == ((signed short int) var_1_6))) : (var_1_1 == ((signed short int) var_1_7))) && (((- var_1_5) <= var_1_4) ? (((var_1_3 <= var_1_4) || var_1_2) ? (var_1_8 == ((float) 3.3f)) : 1) : 1)) && ((var_1_8 < (var_1_3 + var_1_5)) ? ((((((var_1_7) < (var_1_1)) ? (var_1_7) : (var_1_1))) > (var_1_6 * 1)) ? (var_1_9 == ((unsigned char) var_1_10)) : (var_1_9 == ((unsigned char) var_1_10))) : (var_1_9 == ((unsigned char) var_1_10)))) && (((var_1_8 >= var_1_3) || ((var_1_2 && var_1_12) || (var_1_13 || var_1_14))) ? (var_1_2 ? (var_1_11 == ((double) var_1_15)) : (var_1_11 == ((double) var_1_15))) : (var_1_11 == ((double) var_1_15)))) && ((((var_1_10 * var_1_7) + var_1_9) > var_1_1) ? (var_1_16 == ((double) (var_1_17 - (var_1_18 - var_1_19)))) : 1)) && (var_1_13 ? (var_1_20 == ((unsigned long int) (((((var_1_7) > (128u)) ? (var_1_7) : (128u))) + var_1_9))) : ((var_1_7 >= var_1_6) ? (var_1_20 == ((unsigned long int) (var_1_21 - var_1_9))) : (var_1_20 == ((unsigned long int) var_1_22)))) ; VAL [\result=0, isInitial=1, var_1_10=1, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=2, var_1_1=129, var_1_20=130, var_1_21=2147483647, var_1_22=0, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=1] [L149] RET, EXPR property() [L149] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=2, var_1_1=129, var_1_20=130, var_1_21=2147483647, var_1_22=0, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_10=1, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=2, var_1_1=129, var_1_20=130, var_1_21=2147483647, var_1_22=0, var_1_2=0, var_1_6=128, var_1_7=129, var_1_8=1283/5, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 72 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 4, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 71 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 71 mSDsluCounter, 539 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 186 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25 IncrementalHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 353 mSDtfsCounter, 25 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 190 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=3, InterpolantAutomatonStates: 8, 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, 22 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 808 NumberOfCodeBlocks, 808 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 481 ConstructedInterpolants, 0 QuantifiedInterpolants, 505 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 3900/3900 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-12 01:16:45,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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-60.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 cc3a84fad616b331392c1cbee66ac380889aa15bfd2024f97a694900f4fe81e6 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 01:16:47,412 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 01:16:47,456 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 01:16:47,463 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 01:16:47,463 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 01:16:47,487 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 01:16:47,490 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 01:16:47,490 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 01:16:47,491 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 01:16:47,492 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 01:16:47,492 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 01:16:47,492 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 01:16:47,493 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 01:16:47,493 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 01:16:47,494 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 01:16:47,494 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 01:16:47,495 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 01:16:47,495 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 01:16:47,495 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 01:16:47,495 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 01:16:47,498 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 01:16:47,499 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 01:16:47,499 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 01:16:47,499 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 01:16:47,499 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 01:16:47,499 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 01:16:47,500 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 01:16:47,500 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 01:16:47,500 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 01:16:47,500 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 01:16:47,500 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 01:16:47,500 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 01:16:47,501 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 01:16:47,501 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 01:16:47,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:16:47,501 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 01:16:47,501 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 01:16:47,501 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 01:16:47,501 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 01:16:47,502 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 01:16:47,502 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 01:16:47,503 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 01:16:47,504 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 01:16:47,504 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 01:16:47,504 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 -> cc3a84fad616b331392c1cbee66ac380889aa15bfd2024f97a694900f4fe81e6 [2024-11-12 01:16:47,764 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 01:16:47,791 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 01:16:47,795 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 01:16:47,796 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 01:16:47,797 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 01:16:47,801 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-60.i [2024-11-12 01:16:49,190 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 01:16:49,410 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 01:16:49,411 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-60.i [2024-11-12 01:16:49,419 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ff3d03cf/03f8dd6893b74d0b9be75ad7d8f896b8/FLAGa76c54c0d [2024-11-12 01:16:49,430 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ff3d03cf/03f8dd6893b74d0b9be75ad7d8f896b8 [2024-11-12 01:16:49,432 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 01:16:49,433 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 01:16:49,434 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 01:16:49,434 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 01:16:49,439 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 01:16:49,439 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:16:49" (1/1) ... [2024-11-12 01:16:49,440 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dd08b2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:16:49, skipping insertion in model container [2024-11-12 01:16:49,440 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:16:49" (1/1) ... [2024-11-12 01:16:49,461 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 01:16:49,601 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-60.i[913,926] [2024-11-12 01:16:49,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:16:49,687 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 01:16:49,695 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-60.i[913,926] [2024-11-12 01:16:49,722 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:16:49,741 INFO L204 MainTranslator]: Completed translation [2024-11-12 01:16:49,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:16:49 WrapperNode [2024-11-12 01:16:49,741 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 01:16:49,742 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 01:16:49,742 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 01:16:49,742 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 01:16:49,747 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:16:49" (1/1) ... [2024-11-12 01:16:49,761 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:16:49" (1/1) ... [2024-11-12 01:16:49,789 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 155 [2024-11-12 01:16:49,791 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 01:16:49,791 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 01:16:49,792 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 01:16:49,792 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 01:16:49,800 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:16:49" (1/1) ... [2024-11-12 01:16:49,800 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:16:49" (1/1) ... [2024-11-12 01:16:49,804 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:16:49" (1/1) ... [2024-11-12 01:16:49,818 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-12 01:16:49,818 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:16:49" (1/1) ... [2024-11-12 01:16:49,818 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:16:49" (1/1) ... [2024-11-12 01:16:49,824 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:16:49" (1/1) ... [2024-11-12 01:16:49,826 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:16:49" (1/1) ... [2024-11-12 01:16:49,828 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:16:49" (1/1) ... [2024-11-12 01:16:49,829 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:16:49" (1/1) ... [2024-11-12 01:16:49,831 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 01:16:49,832 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 01:16:49,832 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 01:16:49,832 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 01:16:49,833 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:16:49" (1/1) ... [2024-11-12 01:16:49,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:16:49,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:16:49,864 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-12 01:16:49,874 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-12 01:16:49,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 01:16:49,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 01:16:49,910 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 01:16:49,910 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 01:16:49,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 01:16:49,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 01:16:49,990 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 01:16:49,992 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 01:16:56,524 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-12 01:16:56,525 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 01:16:56,543 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 01:16:56,543 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 01:16:56,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:16:56 BoogieIcfgContainer [2024-11-12 01:16:56,544 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 01:16:56,545 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 01:16:56,545 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 01:16:56,551 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 01:16:56,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:16:49" (1/3) ... [2024-11-12 01:16:56,552 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34940a4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:16:56, skipping insertion in model container [2024-11-12 01:16:56,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:16:49" (2/3) ... [2024-11-12 01:16:56,552 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34940a4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:16:56, skipping insertion in model container [2024-11-12 01:16:56,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:16:56" (3/3) ... [2024-11-12 01:16:56,553 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-60.i [2024-11-12 01:16:56,579 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 01:16:56,579 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 01:16:56,648 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 01:16:56,653 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;@27bbdf9f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 01:16:56,654 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 01:16:56,661 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 43 states have (on average 1.372093023255814) internal successors, (59), 44 states have internal predecessors, (59), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 01:16:56,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-12 01:16:56,676 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:16:56,676 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:16:56,677 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:16:56,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:16:56,682 INFO L85 PathProgramCache]: Analyzing trace with hash -872191040, now seen corresponding path program 1 times [2024-11-12 01:16:56,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 01:16:56,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1325953562] [2024-11-12 01:16:56,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:16:56,696 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-12 01:16:56,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 01:16:56,704 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-12 01:16:56,708 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-12 01:16:57,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:57,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 01:16:57,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:16:57,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 450 proven. 0 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2024-11-12 01:16:57,253 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 01:16:57,254 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 01:16:57,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1325953562] [2024-11-12 01:16:57,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1325953562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:16:57,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:16:57,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 01:16:57,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389869658] [2024-11-12 01:16:57,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:16:57,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 01:16:57,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 01:16:57,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 01:16:57,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 01:16:57,280 INFO L87 Difference]: Start difference. First operand has 72 states, 43 states have (on average 1.372093023255814) internal successors, (59), 44 states have internal predecessors, (59), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) 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, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-12 01:16:57,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:16:57,306 INFO L93 Difference]: Finished difference Result 137 states and 242 transitions. [2024-11-12 01:16:57,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 01:16:57,308 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, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 161 [2024-11-12 01:16:57,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:16:57,314 INFO L225 Difference]: With dead ends: 137 [2024-11-12 01:16:57,314 INFO L226 Difference]: Without dead ends: 68 [2024-11-12 01:16:57,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 160 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-12 01:16:57,320 INFO L435 NwaCegarLoop]: 104 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, 104 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-12 01:16:57,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 01:16:57,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-12 01:16:57,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-12 01:16:57,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 40 states have (on average 1.3) internal successors, (52), 40 states have internal predecessors, (52), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 01:16:57,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 104 transitions. [2024-11-12 01:16:57,363 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 104 transitions. Word has length 161 [2024-11-12 01:16:57,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:16:57,364 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 104 transitions. [2024-11-12 01:16:57,365 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, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-12 01:16:57,365 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 104 transitions. [2024-11-12 01:16:57,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-12 01:16:57,368 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:16:57,368 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:16:57,389 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 (2)] Forceful destruction successful, exit code 0 [2024-11-12 01:16:57,569 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-12 01:16:57,570 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:16:57,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:16:57,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1466653832, now seen corresponding path program 1 times [2024-11-12 01:16:57,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 01:16:57,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1790350504] [2024-11-12 01:16:57,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:16:57,575 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-12 01:16:57,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 01:16:57,580 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-12 01:16:57,583 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-12 01:16:58,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:16:58,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 01:16:58,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:16:58,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 01:16:58,171 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 01:16:58,171 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 01:16:58,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1790350504] [2024-11-12 01:16:58,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1790350504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:16:58,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:16:58,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 01:16:58,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907173113] [2024-11-12 01:16:58,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:16:58,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 01:16:58,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 01:16:58,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 01:16:58,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 01:16:58,174 INFO L87 Difference]: Start difference. First operand 68 states and 104 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 01:17:02,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.80s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 01:17:02,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:17:02,136 INFO L93 Difference]: Finished difference Result 169 states and 256 transitions. [2024-11-12 01:17:02,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 01:17:02,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 161 [2024-11-12 01:17:02,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:17:02,142 INFO L225 Difference]: With dead ends: 169 [2024-11-12 01:17:02,142 INFO L226 Difference]: Without dead ends: 104 [2024-11-12 01:17:02,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 159 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-12 01:17:02,143 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 50 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-12 01:17:02,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 242 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-12 01:17:02,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-12 01:17:02,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2024-11-12 01:17:02,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 58 states have (on average 1.2413793103448276) internal successors, (72), 59 states have internal predecessors, (72), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-12 01:17:02,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 152 transitions. [2024-11-12 01:17:02,183 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 152 transitions. Word has length 161 [2024-11-12 01:17:02,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:17:02,184 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 152 transitions. [2024-11-12 01:17:02,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 01:17:02,184 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 152 transitions. [2024-11-12 01:17:02,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-12 01:17:02,186 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:17:02,192 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:17:02,208 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-12 01:17:02,392 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-12 01:17:02,393 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:17:02,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:17:02,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1143043144, now seen corresponding path program 1 times [2024-11-12 01:17:02,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 01:17:02,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1790821863] [2024-11-12 01:17:02,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:17:02,394 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-12 01:17:02,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 01:17:02,397 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-12 01:17:02,400 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-12 01:17:02,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:17:02,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 01:17:02,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:17:02,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 01:17:02,891 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 01:17:02,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 01:17:02,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1790821863] [2024-11-12 01:17:02,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1790821863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:17:02,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:17:02,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 01:17:02,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38431106] [2024-11-12 01:17:02,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:17:02,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 01:17:02,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 01:17:02,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 01:17:02,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 01:17:02,899 INFO L87 Difference]: Start difference. First operand 101 states and 152 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 01:17:07,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 01:17:09,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 01:17:09,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:17:09,217 INFO L93 Difference]: Finished difference Result 224 states and 337 transitions. [2024-11-12 01:17:09,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 01:17:09,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 162 [2024-11-12 01:17:09,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:17:09,222 INFO L225 Difference]: With dead ends: 224 [2024-11-12 01:17:09,222 INFO L226 Difference]: Without dead ends: 126 [2024-11-12 01:17:09,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 160 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-12 01:17:09,224 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 21 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2024-11-12 01:17:09,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 192 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 1 Unknown, 0 Unchecked, 6.3s Time] [2024-11-12 01:17:09,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-12 01:17:09,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 107. [2024-11-12 01:17:09,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 64 states have (on average 1.296875) internal successors, (83), 65 states have internal predecessors, (83), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-12 01:17:09,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 163 transitions. [2024-11-12 01:17:09,249 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 163 transitions. Word has length 162 [2024-11-12 01:17:09,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:17:09,250 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 163 transitions. [2024-11-12 01:17:09,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 01:17:09,250 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 163 transitions. [2024-11-12 01:17:09,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-12 01:17:09,256 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:17:09,256 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:17:09,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-12 01:17:09,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 01:17:09,457 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:17:09,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:17:09,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1376916790, now seen corresponding path program 1 times [2024-11-12 01:17:09,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 01:17:09,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1676424525] [2024-11-12 01:17:09,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:17:09,460 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-12 01:17:09,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 01:17:09,463 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 01:17:09,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-12 01:17:10,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:17:10,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-12 01:17:10,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:18:04,748 WARN L286 SmtUtils]: Spent 13.64s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)