./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-69.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_loopvsstraightlinecode_100-1loop_file-69.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 0c87eeba4dcda455a6c9da98fd9c5772c12d1f9d0079ace848b4f4280aa9227e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 05:02:10,773 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 05:02:10,845 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 05:02:10,849 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 05:02:10,854 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 05:02:10,877 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 05:02:10,878 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 05:02:10,878 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 05:02:10,879 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 05:02:10,879 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 05:02:10,879 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 05:02:10,880 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 05:02:10,880 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 05:02:10,881 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 05:02:10,882 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 05:02:10,882 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 05:02:10,882 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 05:02:10,883 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 05:02:10,883 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 05:02:10,883 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 05:02:10,884 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 05:02:10,884 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 05:02:10,884 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 05:02:10,885 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 05:02:10,885 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 05:02:10,885 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 05:02:10,886 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 05:02:10,886 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 05:02:10,886 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 05:02:10,886 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 05:02:10,887 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 05:02:10,887 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 05:02:10,887 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:02:10,888 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 05:02:10,888 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 05:02:10,888 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 05:02:10,888 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 05:02:10,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 05:02:10,889 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 05:02:10,889 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 05:02:10,889 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 05:02:10,890 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 05:02:10,890 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 -> 0c87eeba4dcda455a6c9da98fd9c5772c12d1f9d0079ace848b4f4280aa9227e [2024-11-12 05:02:11,169 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 05:02:11,197 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 05:02:11,204 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 05:02:11,208 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 05:02:11,208 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 05:02:11,209 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-69.i [2024-11-12 05:02:12,649 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 05:02:12,872 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 05:02:12,873 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-69.i [2024-11-12 05:02:12,884 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c788cd828/1662c5c147cf4991a3f73fc65ffc89e1/FLAG73cccede3 [2024-11-12 05:02:12,899 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c788cd828/1662c5c147cf4991a3f73fc65ffc89e1 [2024-11-12 05:02:12,902 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 05:02:12,903 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 05:02:12,905 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 05:02:12,905 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 05:02:12,912 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 05:02:12,913 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:02:12" (1/1) ... [2024-11-12 05:02:12,915 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9d0ec26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:02:12, skipping insertion in model container [2024-11-12 05:02:12,915 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:02:12" (1/1) ... [2024-11-12 05:02:12,948 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 05:02:13,216 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_loopvsstraightlinecode_100-1loop_file-69.i[916,929] [2024-11-12 05:02:13,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:02:13,344 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 05:02:13,358 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_loopvsstraightlinecode_100-1loop_file-69.i[916,929] [2024-11-12 05:02:13,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:02:13,430 INFO L204 MainTranslator]: Completed translation [2024-11-12 05:02:13,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:02:13 WrapperNode [2024-11-12 05:02:13,431 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 05:02:13,432 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 05:02:13,433 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 05:02:13,433 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 05:02:13,441 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:02:13" (1/1) ... [2024-11-12 05:02:13,456 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:02:13" (1/1) ... [2024-11-12 05:02:13,503 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 258 [2024-11-12 05:02:13,503 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 05:02:13,504 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 05:02:13,504 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 05:02:13,504 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 05:02:13,515 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:02:13" (1/1) ... [2024-11-12 05:02:13,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:02:13" (1/1) ... [2024-11-12 05:02:13,522 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:02:13" (1/1) ... [2024-11-12 05:02:13,563 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 05:02:13,563 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:02:13" (1/1) ... [2024-11-12 05:02:13,564 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:02:13" (1/1) ... [2024-11-12 05:02:13,572 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:02:13" (1/1) ... [2024-11-12 05:02:13,579 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:02:13" (1/1) ... [2024-11-12 05:02:13,583 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:02:13" (1/1) ... [2024-11-12 05:02:13,586 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:02:13" (1/1) ... [2024-11-12 05:02:13,591 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 05:02:13,592 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 05:02:13,592 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 05:02:13,592 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 05:02:13,593 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:02:13" (1/1) ... [2024-11-12 05:02:13,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:02:13,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:02:13,633 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 05:02:13,639 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 05:02:13,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 05:02:13,679 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 05:02:13,679 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 05:02:13,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 05:02:13,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 05:02:13,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 05:02:13,748 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 05:02:13,750 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 05:02:14,236 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-12 05:02:14,236 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 05:02:14,255 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 05:02:14,256 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 05:02:14,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:02:14 BoogieIcfgContainer [2024-11-12 05:02:14,257 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 05:02:14,260 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 05:02:14,261 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 05:02:14,264 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 05:02:14,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:02:12" (1/3) ... [2024-11-12 05:02:14,265 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49174535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:02:14, skipping insertion in model container [2024-11-12 05:02:14,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:02:13" (2/3) ... [2024-11-12 05:02:14,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49174535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:02:14, skipping insertion in model container [2024-11-12 05:02:14,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:02:14" (3/3) ... [2024-11-12 05:02:14,268 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-69.i [2024-11-12 05:02:14,285 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 05:02:14,286 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 05:02:14,358 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 05:02:14,367 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;@ad1c450, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 05:02:14,367 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 05:02:14,372 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 78 states have (on average 1.5) internal successors, (117), 79 states have internal predecessors, (117), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-12 05:02:14,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-12 05:02:14,391 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:02:14,392 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:02:14,392 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:02:14,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:02:14,398 INFO L85 PathProgramCache]: Analyzing trace with hash 2078723797, now seen corresponding path program 1 times [2024-11-12 05:02:14,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:02:14,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139766512] [2024-11-12 05:02:14,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:02:14,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:02:14,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:14,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:02:14,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:14,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:02:14,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:14,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:02:14,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:14,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:02:14,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:14,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:02:14,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:14,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:02:14,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:14,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:02:14,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:14,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:02:14,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:14,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:02:14,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:14,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:02:14,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:14,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:02:14,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:14,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 05:02:14,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:14,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 05:02:14,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:14,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:02:14,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:14,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 05:02:14,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:14,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 05:02:14,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:14,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 05:02:14,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:14,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 05:02:14,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:14,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 05:02:14,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:14,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 05:02:14,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:14,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 05:02:14,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:14,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 05:02:14,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:14,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 05:02:14,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:14,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 05:02:14,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:14,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 05:02:14,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:14,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 05:02:14,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:14,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 05:02:14,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:14,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 05:02:14,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:14,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-12 05:02:14,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:02:14,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139766512] [2024-11-12 05:02:14,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139766512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:02:14,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:02:14,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 05:02:14,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582804318] [2024-11-12 05:02:14,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:02:14,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 05:02:14,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:02:15,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 05:02:15,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:02:15,030 INFO L87 Difference]: Start difference. First operand has 109 states, 78 states have (on average 1.5) internal successors, (117), 79 states have internal predecessors, (117), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-12 05:02:15,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:02:15,077 INFO L93 Difference]: Finished difference Result 215 states and 371 transitions. [2024-11-12 05:02:15,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 05:02:15,081 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 181 [2024-11-12 05:02:15,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:02:15,088 INFO L225 Difference]: With dead ends: 215 [2024-11-12 05:02:15,088 INFO L226 Difference]: Without dead ends: 105 [2024-11-12 05:02:15,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 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 05:02:15,100 INFO L435 NwaCegarLoop]: 168 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, 168 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 05:02:15,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:02:15,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-12 05:02:15,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-12 05:02:15,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 75 states have (on average 1.44) internal successors, (108), 75 states have internal predecessors, (108), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-12 05:02:15,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 164 transitions. [2024-11-12 05:02:15,158 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 164 transitions. Word has length 181 [2024-11-12 05:02:15,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:02:15,159 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 164 transitions. [2024-11-12 05:02:15,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-12 05:02:15,159 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 164 transitions. [2024-11-12 05:02:15,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-12 05:02:15,167 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:02:15,167 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:02:15,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 05:02:15,168 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:02:15,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:02:15,169 INFO L85 PathProgramCache]: Analyzing trace with hash -340898151, now seen corresponding path program 1 times [2024-11-12 05:02:15,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:02:15,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149866694] [2024-11-12 05:02:15,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:02:15,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:02:15,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:15,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:02:15,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:15,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:02:15,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:15,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:02:15,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:15,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:02:15,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:15,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:02:15,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:15,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:02:15,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:15,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:02:15,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:16,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:02:16,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:16,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:02:16,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:16,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:02:16,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:16,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:02:16,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:16,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 05:02:16,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:16,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 05:02:16,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:16,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:02:16,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:16,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 05:02:16,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:16,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 05:02:16,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:16,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 05:02:16,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:16,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 05:02:16,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:16,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 05:02:16,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:16,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 05:02:16,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:16,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 05:02:16,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:16,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 05:02:16,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:16,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 05:02:16,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:16,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 05:02:16,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:16,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 05:02:16,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:16,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 05:02:16,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:16,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 05:02:16,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:16,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 05:02:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:16,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-12 05:02:16,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:02:16,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149866694] [2024-11-12 05:02:16,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149866694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:02:16,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:02:16,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 05:02:16,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666100576] [2024-11-12 05:02:16,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:02:16,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 05:02:16,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:02:16,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 05:02:16,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 05:02:16,147 INFO L87 Difference]: Start difference. First operand 105 states and 164 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 05:02:16,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:02:16,444 INFO L93 Difference]: Finished difference Result 311 states and 489 transitions. [2024-11-12 05:02:16,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 05:02:16,445 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 181 [2024-11-12 05:02:16,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:02:16,449 INFO L225 Difference]: With dead ends: 311 [2024-11-12 05:02:16,449 INFO L226 Difference]: Without dead ends: 209 [2024-11-12 05:02:16,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 05:02:16,451 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 120 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 05:02:16,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 559 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 05:02:16,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-12 05:02:16,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 164. [2024-11-12 05:02:16,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 105 states have (on average 1.4) internal successors, (147), 105 states have internal predecessors, (147), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-12 05:02:16,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 259 transitions. [2024-11-12 05:02:16,499 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 259 transitions. Word has length 181 [2024-11-12 05:02:16,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:02:16,500 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 259 transitions. [2024-11-12 05:02:16,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 05:02:16,504 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 259 transitions. [2024-11-12 05:02:16,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-12 05:02:16,507 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:02:16,507 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:02:16,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 05:02:16,510 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:02:16,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:02:16,511 INFO L85 PathProgramCache]: Analyzing trace with hash 775949579, now seen corresponding path program 1 times [2024-11-12 05:02:16,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:02:16,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592148036] [2024-11-12 05:02:16,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:02:16,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:02:16,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:17,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:02:17,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:17,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:02:17,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:17,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:02:17,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:17,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:02:17,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:17,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:02:17,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:17,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:02:17,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:17,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:02:17,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:17,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:02:17,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:17,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:02:17,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:17,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:02:17,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:17,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:02:17,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:17,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 05:02:17,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:17,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 05:02:17,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:17,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:02:17,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:17,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 05:02:17,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:17,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 05:02:17,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:17,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 05:02:17,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:17,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 05:02:17,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:17,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 05:02:17,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:17,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 05:02:17,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:17,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 05:02:17,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:17,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 05:02:17,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:17,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 05:02:17,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:17,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 05:02:17,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:17,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 05:02:17,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:17,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 05:02:17,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:17,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 05:02:17,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:17,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 05:02:17,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:17,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-12 05:02:17,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:02:17,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592148036] [2024-11-12 05:02:17,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592148036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:02:17,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:02:17,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 05:02:17,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535905506] [2024-11-12 05:02:17,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:02:17,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 05:02:17,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:02:17,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 05:02:17,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 05:02:17,319 INFO L87 Difference]: Start difference. First operand 164 states and 259 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 05:02:17,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:02:17,652 INFO L93 Difference]: Finished difference Result 417 states and 647 transitions. [2024-11-12 05:02:17,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 05:02:17,653 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 182 [2024-11-12 05:02:17,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:02:17,658 INFO L225 Difference]: With dead ends: 417 [2024-11-12 05:02:17,658 INFO L226 Difference]: Without dead ends: 312 [2024-11-12 05:02:17,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 05:02:17,660 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 252 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 05:02:17,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 416 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 05:02:17,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-11-12 05:02:17,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 306. [2024-11-12 05:02:17,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 214 states have (on average 1.397196261682243) internal successors, (299), 215 states have internal predecessors, (299), 86 states have call successors, (86), 5 states have call predecessors, (86), 5 states have return successors, (86), 85 states have call predecessors, (86), 86 states have call successors, (86) [2024-11-12 05:02:17,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 471 transitions. [2024-11-12 05:02:17,730 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 471 transitions. Word has length 182 [2024-11-12 05:02:17,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:02:17,731 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 471 transitions. [2024-11-12 05:02:17,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 05:02:17,731 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 471 transitions. [2024-11-12 05:02:17,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-12 05:02:17,734 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:02:17,734 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:02:17,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 05:02:17,735 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:02:17,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:02:17,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1034115017, now seen corresponding path program 1 times [2024-11-12 05:02:17,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:02:17,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56620527] [2024-11-12 05:02:17,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:02:17,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:02:17,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:18,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:02:18,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:18,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:02:18,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:18,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:02:18,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:18,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:02:18,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:18,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:02:18,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:18,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:02:18,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:18,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:02:18,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:18,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:02:18,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:18,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:02:18,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:18,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:02:18,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:18,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:02:18,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:18,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 05:02:18,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:18,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 05:02:18,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:18,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:02:18,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:18,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 05:02:18,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:18,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 05:02:18,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:18,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 05:02:18,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:18,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 05:02:18,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:18,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 05:02:18,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:18,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 05:02:18,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:18,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 05:02:18,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:18,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 05:02:18,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:18,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 05:02:18,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:18,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 05:02:18,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:18,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 05:02:18,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:18,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 05:02:18,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:18,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 05:02:18,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:18,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 05:02:18,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:18,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-12 05:02:18,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:02:18,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56620527] [2024-11-12 05:02:18,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56620527] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:02:18,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:02:18,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 05:02:18,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806627005] [2024-11-12 05:02:18,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:02:18,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 05:02:18,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:02:18,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 05:02:18,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 05:02:18,666 INFO L87 Difference]: Start difference. First operand 306 states and 471 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 05:02:18,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:02:18,894 INFO L93 Difference]: Finished difference Result 550 states and 843 transitions. [2024-11-12 05:02:18,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 05:02:18,895 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 182 [2024-11-12 05:02:18,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:02:18,902 INFO L225 Difference]: With dead ends: 550 [2024-11-12 05:02:18,902 INFO L226 Difference]: Without dead ends: 313 [2024-11-12 05:02:18,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-12 05:02:18,906 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 195 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 05:02:18,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 575 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 05:02:18,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-11-12 05:02:18,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 310. [2024-11-12 05:02:18,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 217 states have (on average 1.3824884792626728) internal successors, (300), 218 states have internal predecessors, (300), 86 states have call successors, (86), 6 states have call predecessors, (86), 6 states have return successors, (86), 85 states have call predecessors, (86), 86 states have call successors, (86) [2024-11-12 05:02:18,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 472 transitions. [2024-11-12 05:02:18,944 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 472 transitions. Word has length 182 [2024-11-12 05:02:18,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:02:18,945 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 472 transitions. [2024-11-12 05:02:18,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 05:02:18,946 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 472 transitions. [2024-11-12 05:02:18,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-12 05:02:18,947 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:02:18,948 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:02:18,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 05:02:18,948 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:02:18,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:02:18,949 INFO L85 PathProgramCache]: Analyzing trace with hash 575977129, now seen corresponding path program 1 times [2024-11-12 05:02:18,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:02:18,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592880763] [2024-11-12 05:02:18,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:02:18,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:02:19,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:19,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:02:19,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:19,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:02:19,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:19,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:02:19,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:19,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:02:19,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:19,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:02:19,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:19,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:02:19,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:19,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:02:19,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:19,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:02:19,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:19,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:02:19,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:19,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:02:19,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:19,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:02:19,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:19,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 05:02:19,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:19,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 05:02:19,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:19,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:02:19,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:19,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 05:02:19,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:19,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 05:02:19,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:19,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 05:02:19,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:19,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 05:02:19,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:19,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 05:02:19,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:19,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 05:02:19,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:19,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 05:02:19,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:19,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 05:02:19,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:19,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 05:02:19,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:19,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 05:02:19,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:19,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 05:02:19,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:19,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 05:02:19,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:19,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 05:02:19,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:19,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 05:02:19,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:19,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 18 proven. 63 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-12 05:02:19,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:02:19,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592880763] [2024-11-12 05:02:19,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592880763] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 05:02:19,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2147446205] [2024-11-12 05:02:19,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:02:19,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:02:19,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:02:19,459 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 05:02:19,461 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 05:02:19,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:19,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 05:02:19,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:02:19,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 543 proven. 63 refuted. 0 times theorem prover too weak. 906 trivial. 0 not checked. [2024-11-12 05:02:19,953 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 05:02:20,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 18 proven. 63 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-12 05:02:20,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2147446205] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 05:02:20,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 05:02:20,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2024-11-12 05:02:20,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353764683] [2024-11-12 05:02:20,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 05:02:20,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 05:02:20,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:02:20,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 05:02:20,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-12 05:02:20,259 INFO L87 Difference]: Start difference. First operand 310 states and 472 transitions. Second operand has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 3 states have call successors, (70), 2 states have call predecessors, (70), 4 states have return successors, (71), 3 states have call predecessors, (71), 3 states have call successors, (71) [2024-11-12 05:02:20,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:02:20,550 INFO L93 Difference]: Finished difference Result 575 states and 860 transitions. [2024-11-12 05:02:20,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 05:02:20,551 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 3 states have call successors, (70), 2 states have call predecessors, (70), 4 states have return successors, (71), 3 states have call predecessors, (71), 3 states have call successors, (71) Word has length 183 [2024-11-12 05:02:20,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:02:20,555 INFO L225 Difference]: With dead ends: 575 [2024-11-12 05:02:20,555 INFO L226 Difference]: Without dead ends: 332 [2024-11-12 05:02:20,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 417 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2024-11-12 05:02:20,557 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 173 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 05:02:20,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 386 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 05:02:20,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-11-12 05:02:20,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 308. [2024-11-12 05:02:20,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 212 states have (on average 1.3113207547169812) internal successors, (278), 214 states have internal predecessors, (278), 86 states have call successors, (86), 9 states have call predecessors, (86), 9 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2024-11-12 05:02:20,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 450 transitions. [2024-11-12 05:02:20,605 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 450 transitions. Word has length 183 [2024-11-12 05:02:20,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:02:20,606 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 450 transitions. [2024-11-12 05:02:20,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 3 states have call successors, (70), 2 states have call predecessors, (70), 4 states have return successors, (71), 3 states have call predecessors, (71), 3 states have call successors, (71) [2024-11-12 05:02:20,607 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 450 transitions. [2024-11-12 05:02:20,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-12 05:02:20,609 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:02:20,609 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:02:20,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 05:02:20,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:02:20,810 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:02:20,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:02:20,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1231369022, now seen corresponding path program 1 times [2024-11-12 05:02:20,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:02:20,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136866937] [2024-11-12 05:02:20,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:02:20,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:02:20,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:21,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:02:21,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:21,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:02:21,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:21,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:02:21,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:21,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:02:21,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:21,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:02:21,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:21,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:02:21,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:21,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:02:21,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:21,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:02:21,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:21,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:02:21,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:21,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:02:21,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:21,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:02:21,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:21,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 05:02:21,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:21,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 05:02:21,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:21,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:02:21,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:21,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 05:02:21,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:21,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 05:02:21,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:21,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 05:02:21,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:21,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 05:02:21,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:21,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 05:02:21,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:21,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 05:02:21,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:21,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 05:02:21,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:21,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 05:02:21,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:21,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 05:02:21,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:21,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 05:02:21,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:21,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 05:02:21,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:21,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 05:02:21,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:21,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 05:02:21,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:21,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 05:02:21,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:21,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 63 proven. 18 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-12 05:02:21,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:02:21,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136866937] [2024-11-12 05:02:21,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136866937] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 05:02:21,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853900090] [2024-11-12 05:02:21,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:02:21,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:02:21,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:02:21,179 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 05:02:21,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 05:02:21,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:21,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 05:02:21,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:02:21,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 573 proven. 18 refuted. 0 times theorem prover too weak. 921 trivial. 0 not checked. [2024-11-12 05:02:21,456 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 05:02:21,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 63 proven. 18 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-12 05:02:21,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853900090] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 05:02:21,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 05:02:21,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-12 05:02:21,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587773115] [2024-11-12 05:02:21,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 05:02:21,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 05:02:21,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:02:21,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 05:02:21,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 05:02:21,689 INFO L87 Difference]: Start difference. First operand 308 states and 450 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-12 05:02:21,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:02:21,928 INFO L93 Difference]: Finished difference Result 587 states and 843 transitions. [2024-11-12 05:02:21,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 05:02:21,929 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 184 [2024-11-12 05:02:21,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:02:21,932 INFO L225 Difference]: With dead ends: 587 [2024-11-12 05:02:21,933 INFO L226 Difference]: Without dead ends: 338 [2024-11-12 05:02:21,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 420 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-12 05:02:21,934 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 115 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 05:02:21,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 323 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 05:02:21,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2024-11-12 05:02:21,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 320. [2024-11-12 05:02:21,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 221 states have (on average 1.2895927601809956) internal successors, (285), 223 states have internal predecessors, (285), 86 states have call successors, (86), 12 states have call predecessors, (86), 12 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2024-11-12 05:02:21,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 457 transitions. [2024-11-12 05:02:21,992 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 457 transitions. Word has length 184 [2024-11-12 05:02:21,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:02:21,993 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 457 transitions. [2024-11-12 05:02:21,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-12 05:02:21,993 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 457 transitions. [2024-11-12 05:02:21,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-12 05:02:21,995 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:02:21,995 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:02:22,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-12 05:02:22,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-12 05:02:22,197 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:02:22,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:02:22,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1012231106, now seen corresponding path program 1 times [2024-11-12 05:02:22,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:02:22,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102823880] [2024-11-12 05:02:22,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:02:22,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:02:22,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:22,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:02:22,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:22,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:02:22,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:22,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:02:22,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:22,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:02:22,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:22,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:02:22,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:22,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:02:22,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:22,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:02:22,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:22,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:02:22,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:22,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:02:22,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:22,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:02:22,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:22,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:02:22,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:22,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 05:02:22,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:22,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 05:02:22,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:22,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:02:22,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:22,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 05:02:22,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:22,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 05:02:22,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:22,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 05:02:22,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:22,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 05:02:22,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:22,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 05:02:22,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:22,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 05:02:22,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:22,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 05:02:22,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:22,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 05:02:22,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:22,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 05:02:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:22,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 05:02:22,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:22,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 05:02:22,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:22,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 05:02:22,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:22,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 05:02:22,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:22,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 05:02:22,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:22,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 63 proven. 18 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-12 05:02:22,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:02:22,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102823880] [2024-11-12 05:02:22,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102823880] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 05:02:22,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22385285] [2024-11-12 05:02:22,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:02:22,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:02:22,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:02:22,723 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 05:02:22,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 05:02:22,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:22,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 05:02:22,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:02:23,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 573 proven. 18 refuted. 0 times theorem prover too weak. 921 trivial. 0 not checked. [2024-11-12 05:02:23,072 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 05:02:23,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 63 proven. 18 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-12 05:02:23,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22385285] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 05:02:23,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 05:02:23,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2024-11-12 05:02:23,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566996088] [2024-11-12 05:02:23,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 05:02:23,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 05:02:23,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:02:23,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 05:02:23,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-12 05:02:23,257 INFO L87 Difference]: Start difference. First operand 320 states and 457 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-12 05:02:23,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:02:23,771 INFO L93 Difference]: Finished difference Result 599 states and 850 transitions. [2024-11-12 05:02:23,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-12 05:02:23,772 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 184 [2024-11-12 05:02:23,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:02:23,775 INFO L225 Difference]: With dead ends: 599 [2024-11-12 05:02:23,775 INFO L226 Difference]: Without dead ends: 342 [2024-11-12 05:02:23,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 420 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-11-12 05:02:23,777 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 439 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 05:02:23,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 479 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 05:02:23,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-11-12 05:02:23,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 320. [2024-11-12 05:02:23,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 221 states have (on average 1.2895927601809956) internal successors, (285), 223 states have internal predecessors, (285), 86 states have call successors, (86), 12 states have call predecessors, (86), 12 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2024-11-12 05:02:23,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 457 transitions. [2024-11-12 05:02:23,828 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 457 transitions. Word has length 184 [2024-11-12 05:02:23,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:02:23,828 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 457 transitions. [2024-11-12 05:02:23,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-12 05:02:23,830 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 457 transitions. [2024-11-12 05:02:23,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-12 05:02:23,832 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:02:23,832 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:02:23,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-12 05:02:24,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:02:24,034 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:02:24,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:02:24,035 INFO L85 PathProgramCache]: Analyzing trace with hash -793376388, now seen corresponding path program 1 times [2024-11-12 05:02:24,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:02:24,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961002531] [2024-11-12 05:02:24,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:02:24,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:02:24,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:24,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:02:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:24,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:02:24,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:24,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:02:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:24,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:02:24,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:24,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:02:24,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:24,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:02:24,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:24,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:02:24,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:24,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:02:24,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:24,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:02:24,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:24,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:02:24,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:24,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:02:24,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:24,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 05:02:24,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:24,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 05:02:24,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:24,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:02:24,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:24,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 05:02:24,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:24,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 05:02:24,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:24,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 05:02:24,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:24,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 05:02:24,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:24,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 05:02:24,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:24,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 05:02:24,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:24,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 05:02:24,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:24,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 05:02:24,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:24,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 05:02:24,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:24,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 05:02:24,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:24,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 05:02:24,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:24,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 05:02:24,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:24,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 05:02:24,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:24,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 05:02:24,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:24,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 129 proven. 27 refuted. 0 times theorem prover too weak. 1356 trivial. 0 not checked. [2024-11-12 05:02:24,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:02:24,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961002531] [2024-11-12 05:02:24,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961002531] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 05:02:24,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478493925] [2024-11-12 05:02:24,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:02:24,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:02:24,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:02:24,802 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 05:02:24,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-12 05:02:24,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:24,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-12 05:02:24,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:02:25,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 599 proven. 27 refuted. 0 times theorem prover too weak. 886 trivial. 0 not checked. [2024-11-12 05:02:25,190 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 05:02:25,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 129 proven. 30 refuted. 0 times theorem prover too weak. 1353 trivial. 0 not checked. [2024-11-12 05:02:25,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478493925] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 05:02:25,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 05:02:25,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2024-11-12 05:02:25,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897574101] [2024-11-12 05:02:25,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 05:02:25,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-12 05:02:25,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:02:25,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-12 05:02:25,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-12 05:02:25,593 INFO L87 Difference]: Start difference. First operand 320 states and 457 transitions. Second operand has 15 states, 15 states have (on average 4.6) internal successors, (69), 15 states have internal predecessors, (69), 3 states have call successors, (34), 3 states have call predecessors, (34), 7 states have return successors, (36), 3 states have call predecessors, (36), 3 states have call successors, (36) [2024-11-12 05:02:26,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:02:26,799 INFO L93 Difference]: Finished difference Result 748 states and 1041 transitions. [2024-11-12 05:02:26,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-11-12 05:02:26,800 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.6) internal successors, (69), 15 states have internal predecessors, (69), 3 states have call successors, (34), 3 states have call predecessors, (34), 7 states have return successors, (36), 3 states have call predecessors, (36), 3 states have call successors, (36) Word has length 184 [2024-11-12 05:02:26,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:02:26,807 INFO L225 Difference]: With dead ends: 748 [2024-11-12 05:02:26,807 INFO L226 Difference]: Without dead ends: 491 [2024-11-12 05:02:26,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 418 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=578, Invalid=1584, Unknown=0, NotChecked=0, Total=2162 [2024-11-12 05:02:26,810 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 811 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 445 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 445 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 05:02:26,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [857 Valid, 1151 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [445 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 05:02:26,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2024-11-12 05:02:26,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 450. [2024-11-12 05:02:26,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 314 states have (on average 1.2770700636942676) internal successors, (401), 316 states have internal predecessors, (401), 114 states have call successors, (114), 21 states have call predecessors, (114), 21 states have return successors, (114), 112 states have call predecessors, (114), 114 states have call successors, (114) [2024-11-12 05:02:26,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 629 transitions. [2024-11-12 05:02:26,871 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 629 transitions. Word has length 184 [2024-11-12 05:02:26,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:02:26,872 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 629 transitions. [2024-11-12 05:02:26,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.6) internal successors, (69), 15 states have internal predecessors, (69), 3 states have call successors, (34), 3 states have call predecessors, (34), 7 states have return successors, (36), 3 states have call predecessors, (36), 3 states have call successors, (36) [2024-11-12 05:02:26,872 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 629 transitions. [2024-11-12 05:02:26,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-12 05:02:26,874 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:02:26,874 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:02:26,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-12 05:02:27,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:02:27,079 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:02:27,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:02:27,079 INFO L85 PathProgramCache]: Analyzing trace with hash 926124969, now seen corresponding path program 1 times [2024-11-12 05:02:27,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:02:27,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775583925] [2024-11-12 05:02:27,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:02:27,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:02:27,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:27,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:02:27,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:27,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:02:27,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:27,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:02:27,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:27,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:02:27,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:27,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:02:27,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:27,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:02:27,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:27,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:02:27,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:27,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:02:27,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:27,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:02:27,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:27,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:02:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:27,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:02:27,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:27,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 05:02:27,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:27,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 05:02:27,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:27,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:02:27,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:27,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 05:02:27,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:27,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 05:02:27,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:27,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 05:02:27,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:27,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 05:02:27,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:27,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 05:02:27,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:27,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 05:02:27,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:27,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 05:02:27,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:27,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 05:02:27,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:27,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 05:02:27,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:27,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 05:02:27,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:27,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 05:02:27,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:27,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 05:02:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:27,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 05:02:27,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:27,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 05:02:27,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:27,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-12 05:02:27,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:02:27,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775583925] [2024-11-12 05:02:27,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775583925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:02:27,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:02:27,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 05:02:27,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568494617] [2024-11-12 05:02:27,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:02:27,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 05:02:27,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:02:27,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 05:02:27,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 05:02:27,554 INFO L87 Difference]: Start difference. First operand 450 states and 629 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 05:02:27,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:02:27,844 INFO L93 Difference]: Finished difference Result 932 states and 1309 transitions. [2024-11-12 05:02:27,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 05:02:27,845 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 185 [2024-11-12 05:02:27,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:02:27,851 INFO L225 Difference]: With dead ends: 932 [2024-11-12 05:02:27,851 INFO L226 Difference]: Without dead ends: 549 [2024-11-12 05:02:27,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 05:02:27,853 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 97 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 05:02:27,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 428 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 05:02:27,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2024-11-12 05:02:27,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 456. [2024-11-12 05:02:27,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 320 states have (on average 1.28125) internal successors, (410), 321 states have internal predecessors, (410), 114 states have call successors, (114), 21 states have call predecessors, (114), 21 states have return successors, (114), 113 states have call predecessors, (114), 114 states have call successors, (114) [2024-11-12 05:02:27,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 638 transitions. [2024-11-12 05:02:27,921 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 638 transitions. Word has length 185 [2024-11-12 05:02:27,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:02:27,922 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 638 transitions. [2024-11-12 05:02:27,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 05:02:27,922 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 638 transitions. [2024-11-12 05:02:27,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-12 05:02:27,925 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:02:27,925 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:02:27,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 05:02:27,925 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:02:27,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:02:27,926 INFO L85 PathProgramCache]: Analyzing trace with hash 97394706, now seen corresponding path program 1 times [2024-11-12 05:02:27,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:02:27,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735629478] [2024-11-12 05:02:27,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:02:27,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:02:28,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 05:02:28,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1329219866] [2024-11-12 05:02:28,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:02:28,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:02:28,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:02:28,046 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 05:02:28,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-12 05:02:28,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 05:02:28,184 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 05:02:28,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 05:02:28,333 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 05:02:28,334 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 05:02:28,335 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 05:02:28,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-12 05:02:28,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-12 05:02:28,540 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:02:28,678 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 05:02:28,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:02:28 BoogieIcfgContainer [2024-11-12 05:02:28,681 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 05:02:28,682 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 05:02:28,682 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 05:02:28,682 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 05:02:28,682 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:02:14" (3/4) ... [2024-11-12 05:02:28,685 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 05:02:28,686 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 05:02:28,687 INFO L158 Benchmark]: Toolchain (without parser) took 15783.72ms. Allocated memory was 161.5MB in the beginning and 362.8MB in the end (delta: 201.3MB). Free memory was 87.8MB in the beginning and 196.1MB in the end (delta: -108.3MB). Peak memory consumption was 91.6MB. Max. memory is 16.1GB. [2024-11-12 05:02:28,687 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 161.5MB. Free memory is still 134.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:02:28,687 INFO L158 Benchmark]: CACSL2BoogieTranslator took 526.67ms. Allocated memory is still 161.5MB. Free memory was 87.8MB in the beginning and 118.6MB in the end (delta: -30.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-12 05:02:28,688 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.26ms. Allocated memory is still 161.5MB. Free memory was 118.6MB in the beginning and 114.7MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 05:02:28,688 INFO L158 Benchmark]: Boogie Preprocessor took 87.20ms. Allocated memory is still 161.5MB. Free memory was 114.7MB in the beginning and 109.6MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 05:02:28,688 INFO L158 Benchmark]: RCFGBuilder took 665.27ms. Allocated memory is still 161.5MB. Free memory was 109.6MB in the beginning and 78.2MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-12 05:02:28,688 INFO L158 Benchmark]: TraceAbstraction took 14421.06ms. Allocated memory was 161.5MB in the beginning and 362.8MB in the end (delta: 201.3MB). Free memory was 77.6MB in the beginning and 197.1MB in the end (delta: -119.6MB). Peak memory consumption was 84.1MB. Max. memory is 16.1GB. [2024-11-12 05:02:28,689 INFO L158 Benchmark]: Witness Printer took 4.86ms. Allocated memory is still 362.8MB. Free memory was 197.1MB in the beginning and 196.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:02:28,690 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.20ms. Allocated memory is still 161.5MB. Free memory is still 134.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 526.67ms. Allocated memory is still 161.5MB. Free memory was 87.8MB in the beginning and 118.6MB in the end (delta: -30.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.26ms. Allocated memory is still 161.5MB. Free memory was 118.6MB in the beginning and 114.7MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.20ms. Allocated memory is still 161.5MB. Free memory was 114.7MB in the beginning and 109.6MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 665.27ms. Allocated memory is still 161.5MB. Free memory was 109.6MB in the beginning and 78.2MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 14421.06ms. Allocated memory was 161.5MB in the beginning and 362.8MB in the end (delta: 201.3MB). Free memory was 77.6MB in the beginning and 197.1MB in the end (delta: -119.6MB). Peak memory consumption was 84.1MB. Max. memory is 16.1GB. * Witness Printer took 4.86ms. Allocated memory is still 362.8MB. Free memory was 197.1MB in the beginning and 196.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 201, overapproximation of someBinaryDOUBLEComparisonOperation at line 201, overapproximation of bitwiseOr at line 201. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 2; [L23] unsigned char var_1_2 = 1; [L24] unsigned short int var_1_3 = 47136; [L25] unsigned short int var_1_4 = 10; [L26] unsigned long int var_1_6 = 1660677957; [L27] unsigned long int var_1_7 = 128; [L28] float var_1_9 = 9.4; [L29] float var_1_12 = 16.2; [L30] float var_1_13 = 127.9; [L31] float var_1_14 = 15.5; [L32] unsigned long int var_1_15 = 100; [L33] signed char var_1_16 = 64; [L34] float var_1_17 = 9.7; [L35] signed char var_1_18 = -64; [L36] signed char var_1_19 = -4; [L37] unsigned short int var_1_20 = 64; [L38] unsigned short int var_1_21 = 1; [L39] signed char var_1_22 = 2; [L40] unsigned long int var_1_23 = 8; [L41] unsigned char var_1_24 = 0; [L42] unsigned char var_1_25 = 0; [L43] unsigned char var_1_26 = 0; [L44] unsigned char var_1_27 = 0; [L45] unsigned char var_1_28 = 0; [L46] float last_1_var_1_9 = 9.4; [L47] float last_1_var_1_14 = 15.5; [L48] unsigned long int last_1_var_1_15 = 100; [L49] unsigned short int last_1_var_1_20 = 64; [L50] unsigned long int last_1_var_1_23 = 8; [L51] unsigned char last_1_var_1_24 = 0; VAL [isInitial=0, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=47136, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L205] isInitial = 1 [L206] FCALL initially() [L207] int k_loop; [L208] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=47136, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L208] COND TRUE k_loop < 1 [L209] CALL updateLastVariables() [L193] last_1_var_1_9 = var_1_9 [L194] last_1_var_1_14 = var_1_14 [L195] last_1_var_1_15 = var_1_15 [L196] last_1_var_1_20 = var_1_20 [L197] last_1_var_1_23 = var_1_23 [L198] last_1_var_1_24 = var_1_24 VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=47136, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L209] RET updateLastVariables() [L210] CALL updateVariables() [L148] var_1_2 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_3=47136, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_3=47136, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L149] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_3=47136, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L150] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=47136, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=47136, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L150] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=47136, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L151] var_1_3 = __VERIFIER_nondet_ushort() [L152] CALL assume_abort_if_not(var_1_3 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L152] RET assume_abort_if_not(var_1_3 >= 32767) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L153] CALL assume_abort_if_not(var_1_3 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L153] RET assume_abort_if_not(var_1_3 <= 65535) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L154] var_1_4 = __VERIFIER_nondet_ushort() [L155] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L155] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L156] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L156] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L157] var_1_6 = __VERIFIER_nondet_ulong() [L158] CALL assume_abort_if_not(var_1_6 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=128, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=128, var_1_9=47/5] [L158] RET assume_abort_if_not(var_1_6 >= 1073741823) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=128, var_1_9=47/5] [L159] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=128, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=128, var_1_9=47/5] [L159] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=128, var_1_9=47/5] [L160] var_1_7 = __VERIFIER_nondet_ulong() [L161] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_9=47/5] [L161] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_9=47/5] [L162] CALL assume_abort_if_not(var_1_7 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L162] RET assume_abort_if_not(var_1_7 <= 1073741823) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L163] var_1_12 = __VERIFIER_nondet_float() [L164] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L164] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L165] var_1_13 = __VERIFIER_nondet_float() [L166] CALL assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L166] RET assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L167] var_1_17 = __VERIFIER_nondet_float() [L168] CALL assume_abort_if_not((var_1_17 >= -922337.2036854776000e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854776000e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L168] RET assume_abort_if_not((var_1_17 >= -922337.2036854776000e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854776000e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L169] CALL assume_abort_if_not(var_1_17 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L169] RET assume_abort_if_not(var_1_17 != 0.0F) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L170] var_1_18 = __VERIFIER_nondet_char() [L171] CALL assume_abort_if_not(var_1_18 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L171] RET assume_abort_if_not(var_1_18 >= -127) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L172] CALL assume_abort_if_not(var_1_18 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L172] RET assume_abort_if_not(var_1_18 <= 126) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L173] var_1_19 = __VERIFIER_nondet_char() [L174] CALL assume_abort_if_not(var_1_19 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L174] RET assume_abort_if_not(var_1_19 >= -127) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L175] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L175] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L176] var_1_21 = __VERIFIER_nondet_ushort() [L177] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L177] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L178] CALL assume_abort_if_not(var_1_21 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L178] RET assume_abort_if_not(var_1_21 <= 32767) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L179] var_1_25 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L180] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L181] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L181] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L182] var_1_26 = __VERIFIER_nondet_uchar() [L183] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L183] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L184] CALL assume_abort_if_not(var_1_26 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L184] RET assume_abort_if_not(var_1_26 <= 0) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L185] var_1_27 = __VERIFIER_nondet_uchar() [L186] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L186] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L187] CALL assume_abort_if_not(var_1_27 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L187] RET assume_abort_if_not(var_1_27 <= 0) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L188] var_1_28 = __VERIFIER_nondet_uchar() [L189] CALL assume_abort_if_not(var_1_28 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L189] RET assume_abort_if_not(var_1_28 >= 1) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L190] CALL assume_abort_if_not(var_1_28 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L190] RET assume_abort_if_not(var_1_28 <= 1) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L210] RET updateVariables() [L211] CALL step() [L55] unsigned long int stepLocal_0 = var_1_6 * last_1_var_1_23; VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=8589934584, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L56] COND FALSE !(\read(last_1_var_1_24)) [L63] var_1_20 = var_1_21 VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=8589934584, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L65] COND TRUE last_1_var_1_14 >= (var_1_13 * last_1_var_1_9) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=8589934584, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L66] COND TRUE \read(var_1_2) [L67] var_1_24 = var_1_25 VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=8589934584, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L80] COND FALSE !(var_1_24 && (var_1_20 < (3349670375u - var_1_4))) [L87] var_1_15 = var_1_20 VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=8589934584, var_1_14=31/2, var_1_15=0, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L89] EXPR var_1_6 | ((((64u) < 0 ) ? -(64u) : (64u))) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=8589934584, var_1_14=31/2, var_1_15=0, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L89] COND FALSE !(last_1_var_1_15 >= (var_1_6 | ((((64u) < 0 ) ? -(64u) : (64u))))) [L96] var_1_14 = var_1_12 VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=8589934584, var_1_12=2, var_1_14=2, var_1_15=0, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L98] unsigned short int stepLocal_3 = var_1_21; VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=8589934584, stepLocal_3=0, var_1_12=2, var_1_14=2, var_1_15=0, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L99] COND TRUE var_1_14 < (9999.6f + var_1_12) [L100] var_1_23 = var_1_20 VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=8589934584, stepLocal_3=0, var_1_12=2, var_1_14=2, var_1_15=0, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L112] COND FALSE !((256.2 * var_1_14) < var_1_14) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=8589934584, stepLocal_3=0, var_1_12=2, var_1_14=2, var_1_15=0, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L117] COND FALSE !(var_1_24 && ((var_1_3 - var_1_4) <= var_1_23)) [L120] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=8589934584, stepLocal_3=0, var_1_12=2, var_1_14=2, var_1_15=0, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L122] COND FALSE !(var_1_13 >= var_1_14) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=8589934584, stepLocal_3=0, var_1_12=2, var_1_14=2, var_1_15=0, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L131] signed char stepLocal_2 = var_1_19; [L132] unsigned long int stepLocal_1 = var_1_6; VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=8589934584, stepLocal_1=1073741823, stepLocal_2=0, stepLocal_3=0, var_1_12=2, var_1_14=2, var_1_15=0, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L133] COND TRUE var_1_12 <= var_1_14 [L134] var_1_22 = var_1_19 VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=8589934584, stepLocal_1=1073741823, stepLocal_2=0, stepLocal_3=0, var_1_12=2, var_1_14=2, var_1_15=0, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L211] RET step() [L212] CALL, EXPR property() [L201] EXPR (((var_1_24 && ((var_1_3 - var_1_4) <= var_1_23)) ? (var_1_1 == ((unsigned long int) ((((((var_1_3 + var_1_4)) > ((var_1_6 - var_1_20))) ? ((var_1_3 + var_1_4)) : ((var_1_6 - var_1_20)))) + var_1_20))) : (var_1_1 == ((unsigned long int) var_1_4))) && (((256.2 * var_1_14) < var_1_14) ? (var_1_24 ? (var_1_9 == ((float) (var_1_12 + var_1_13))) : 1) : 1)) && ((last_1_var_1_15 >= (var_1_6 | ((((64u) < 0 ) ? -(64u) : (64u))))) ? (((8 + 5) < var_1_6) ? (var_1_14 == ((float) var_1_13)) : (var_1_14 == ((float) var_1_13))) : (var_1_14 == ((float) var_1_12))) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=2, var_1_14=2, var_1_15=0, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L201] EXPR var_1_6 | ((((64u) < 0 ) ? -(64u) : (64u))) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=2, var_1_14=2, var_1_15=0, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L201] EXPR (((var_1_24 && ((var_1_3 - var_1_4) <= var_1_23)) ? (var_1_1 == ((unsigned long int) ((((((var_1_3 + var_1_4)) > ((var_1_6 - var_1_20))) ? ((var_1_3 + var_1_4)) : ((var_1_6 - var_1_20)))) + var_1_20))) : (var_1_1 == ((unsigned long int) var_1_4))) && (((256.2 * var_1_14) < var_1_14) ? (var_1_24 ? (var_1_9 == ((float) (var_1_12 + var_1_13))) : 1) : 1)) && ((last_1_var_1_15 >= (var_1_6 | ((((64u) < 0 ) ? -(64u) : (64u))))) ? (((8 + 5) < var_1_6) ? (var_1_14 == ((float) var_1_13)) : (var_1_14 == ((float) var_1_13))) : (var_1_14 == ((float) var_1_12))) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=2, var_1_14=2, var_1_15=0, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L201] EXPR ((((((((var_1_24 && ((var_1_3 - var_1_4) <= var_1_23)) ? (var_1_1 == ((unsigned long int) ((((((var_1_3 + var_1_4)) > ((var_1_6 - var_1_20))) ? ((var_1_3 + var_1_4)) : ((var_1_6 - var_1_20)))) + var_1_20))) : (var_1_1 == ((unsigned long int) var_1_4))) && (((256.2 * var_1_14) < var_1_14) ? (var_1_24 ? (var_1_9 == ((float) (var_1_12 + var_1_13))) : 1) : 1)) && ((last_1_var_1_15 >= (var_1_6 | ((((64u) < 0 ) ? -(64u) : (64u))))) ? (((8 + 5) < var_1_6) ? (var_1_14 == ((float) var_1_13)) : (var_1_14 == ((float) var_1_13))) : (var_1_14 == ((float) var_1_12)))) && ((var_1_24 && (var_1_20 < (3349670375u - var_1_4))) ? ((var_1_3 > var_1_4) ? (var_1_15 == ((unsigned long int) (4063422496u - 64u))) : (var_1_15 == ((unsigned long int) var_1_20))) : (var_1_15 == ((unsigned long int) var_1_20)))) && ((var_1_13 >= var_1_14) ? ((((- var_1_9) * (var_1_14 * var_1_13)) < var_1_12) ? (((- var_1_14) <= (((((var_1_9) > (4.375f)) ? (var_1_9) : (4.375f))) * (var_1_9 / var_1_17))) ? (var_1_16 == ((signed char) ((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))))) : (var_1_16 == ((signed char) 1))) : 1) : 1)) && (last_1_var_1_24 ? (((var_1_6 * last_1_var_1_23) < var_1_7) ? (var_1_20 == ((unsigned short int) (var_1_4 + var_1_21))) : (var_1_20 == ((unsigned short int) var_1_4))) : (var_1_20 == ((unsigned short int) var_1_21)))) && ((var_1_12 <= var_1_14) ? (var_1_22 == ((signed char) var_1_19)) : (((((((var_1_3 * var_1_16)) < (var_1_20)) ? ((var_1_3 * var_1_16)) : (var_1_20))) > var_1_6) ? ((var_1_19 <= var_1_6) ? (var_1_22 == ((signed char) var_1_18)) : (var_1_22 == ((signed char) var_1_19))) : (var_1_22 == ((signed char) var_1_18))))) && ((var_1_14 < (9999.6f + var_1_12)) ? (var_1_23 == ((unsigned long int) var_1_20)) : ((var_1_14 <= (- (- var_1_14))) ? ((var_1_21 != (- (last_1_var_1_23 & var_1_20))) ? (var_1_23 == ((unsigned long int) var_1_20)) : (var_1_23 == ((unsigned long int) var_1_20))) : (var_1_23 == ((unsigned long int) var_1_3)))) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=2, var_1_14=2, var_1_15=0, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L201-L202] return (((((((((var_1_24 && ((var_1_3 - var_1_4) <= var_1_23)) ? (var_1_1 == ((unsigned long int) ((((((var_1_3 + var_1_4)) > ((var_1_6 - var_1_20))) ? ((var_1_3 + var_1_4)) : ((var_1_6 - var_1_20)))) + var_1_20))) : (var_1_1 == ((unsigned long int) var_1_4))) && (((256.2 * var_1_14) < var_1_14) ? (var_1_24 ? (var_1_9 == ((float) (var_1_12 + var_1_13))) : 1) : 1)) && ((last_1_var_1_15 >= (var_1_6 | ((((64u) < 0 ) ? -(64u) : (64u))))) ? (((8 + 5) < var_1_6) ? (var_1_14 == ((float) var_1_13)) : (var_1_14 == ((float) var_1_13))) : (var_1_14 == ((float) var_1_12)))) && ((var_1_24 && (var_1_20 < (3349670375u - var_1_4))) ? ((var_1_3 > var_1_4) ? (var_1_15 == ((unsigned long int) (4063422496u - 64u))) : (var_1_15 == ((unsigned long int) var_1_20))) : (var_1_15 == ((unsigned long int) var_1_20)))) && ((var_1_13 >= var_1_14) ? ((((- var_1_9) * (var_1_14 * var_1_13)) < var_1_12) ? (((- var_1_14) <= (((((var_1_9) > (4.375f)) ? (var_1_9) : (4.375f))) * (var_1_9 / var_1_17))) ? (var_1_16 == ((signed char) ((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))))) : (var_1_16 == ((signed char) 1))) : 1) : 1)) && (last_1_var_1_24 ? (((var_1_6 * last_1_var_1_23) < var_1_7) ? (var_1_20 == ((unsigned short int) (var_1_4 + var_1_21))) : (var_1_20 == ((unsigned short int) var_1_4))) : (var_1_20 == ((unsigned short int) var_1_21)))) && ((var_1_12 <= var_1_14) ? (var_1_22 == ((signed char) var_1_19)) : (((((((var_1_3 * var_1_16)) < (var_1_20)) ? ((var_1_3 * var_1_16)) : (var_1_20))) > var_1_6) ? ((var_1_19 <= var_1_6) ? (var_1_22 == ((signed char) var_1_18)) : (var_1_22 == ((signed char) var_1_19))) : (var_1_22 == ((signed char) var_1_18))))) && ((var_1_14 < (9999.6f + var_1_12)) ? (var_1_23 == ((unsigned long int) var_1_20)) : ((var_1_14 <= (- (- var_1_14))) ? ((var_1_21 != (- (last_1_var_1_23 & var_1_20))) ? (var_1_23 == ((unsigned long int) var_1_20)) : (var_1_23 == ((unsigned long int) var_1_20))) : (var_1_23 == ((unsigned long int) var_1_3))))) && ((last_1_var_1_14 >= (var_1_13 * last_1_var_1_9)) ? (var_1_2 ? (var_1_24 == ((unsigned char) var_1_25)) : (var_1_24 == ((unsigned char) (var_1_25 || var_1_26)))) : (var_1_25 ? (var_1_24 == ((unsigned char) (var_1_26 && var_1_27))) : ((last_1_var_1_15 == last_1_var_1_20) ? (var_1_24 == ((unsigned char) var_1_28)) : 1))) ; [L212] RET, EXPR property() [L212] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=2, var_1_14=2, var_1_15=0, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=2, var_1_14=2, var_1_15=0, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 109 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.2s, OverallIterations: 10, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2296 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2202 mSDsluCounter, 4485 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3076 mSDsCounter, 859 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1495 IncrementalHoareTripleChecker+Invalid, 2354 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 859 mSolverCounterUnsat, 1409 mSDtfsCounter, 1495 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2102 GetRequests, 1999 SyntacticMatches, 6 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 722 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=456occurred in iteration=9, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 252 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 2755 NumberOfCodeBlocks, 2755 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3099 ConstructedInterpolants, 0 QuantifiedInterpolants, 7230 SizeOfPredicates, 7 NumberOfNonLiveVariables, 1711 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 17 InterpolantComputations, 5 PerfectInterpolantSequences, 25323/25704 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 05:02:28,730 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_loopvsstraightlinecode_100-1loop_file-69.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 0c87eeba4dcda455a6c9da98fd9c5772c12d1f9d0079ace848b4f4280aa9227e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 05:02:30,961 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 05:02:31,052 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 05:02:31,060 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 05:02:31,061 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 05:02:31,093 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 05:02:31,094 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 05:02:31,094 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 05:02:31,095 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 05:02:31,096 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 05:02:31,096 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 05:02:31,096 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 05:02:31,097 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 05:02:31,098 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 05:02:31,100 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 05:02:31,100 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 05:02:31,100 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 05:02:31,101 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 05:02:31,101 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 05:02:31,101 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 05:02:31,101 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 05:02:31,102 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 05:02:31,102 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 05:02:31,103 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 05:02:31,103 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 05:02:31,103 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 05:02:31,103 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 05:02:31,104 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 05:02:31,104 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 05:02:31,104 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 05:02:31,104 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 05:02:31,105 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 05:02:31,109 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 05:02:31,109 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 05:02:31,109 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:02:31,110 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 05:02:31,110 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 05:02:31,110 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 05:02:31,110 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 05:02:31,111 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 05:02:31,111 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 05:02:31,113 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 05:02:31,113 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 05:02:31,113 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 05:02:31,113 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 -> 0c87eeba4dcda455a6c9da98fd9c5772c12d1f9d0079ace848b4f4280aa9227e [2024-11-12 05:02:31,452 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 05:02:31,477 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 05:02:31,481 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 05:02:31,482 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 05:02:31,483 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 05:02:31,484 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-69.i [2024-11-12 05:02:33,089 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 05:02:33,313 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 05:02:33,316 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-69.i [2024-11-12 05:02:33,332 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9b7da6f9/e26fdeb530da477eb8b3926e563bed71/FLAG6d021b490 [2024-11-12 05:02:33,673 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9b7da6f9/e26fdeb530da477eb8b3926e563bed71 [2024-11-12 05:02:33,675 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 05:02:33,677 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 05:02:33,678 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 05:02:33,678 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 05:02:33,683 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 05:02:33,684 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:02:33" (1/1) ... [2024-11-12 05:02:33,685 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c999629 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:02:33, skipping insertion in model container [2024-11-12 05:02:33,685 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:02:33" (1/1) ... [2024-11-12 05:02:33,717 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 05:02:33,916 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_loopvsstraightlinecode_100-1loop_file-69.i[916,929] [2024-11-12 05:02:34,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:02:34,042 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 05:02:34,055 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_loopvsstraightlinecode_100-1loop_file-69.i[916,929] [2024-11-12 05:02:34,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:02:34,136 INFO L204 MainTranslator]: Completed translation [2024-11-12 05:02:34,136 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:02:34 WrapperNode [2024-11-12 05:02:34,136 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 05:02:34,137 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 05:02:34,138 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 05:02:34,138 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 05:02:34,145 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:02:34" (1/1) ... [2024-11-12 05:02:34,165 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:02:34" (1/1) ... [2024-11-12 05:02:34,206 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 200 [2024-11-12 05:02:34,206 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 05:02:34,207 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 05:02:34,207 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 05:02:34,207 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 05:02:34,220 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:02:34" (1/1) ... [2024-11-12 05:02:34,221 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:02:34" (1/1) ... [2024-11-12 05:02:34,225 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:02:34" (1/1) ... [2024-11-12 05:02:34,249 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 05:02:34,249 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:02:34" (1/1) ... [2024-11-12 05:02:34,251 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:02:34" (1/1) ... [2024-11-12 05:02:34,265 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:02:34" (1/1) ... [2024-11-12 05:02:34,272 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:02:34" (1/1) ... [2024-11-12 05:02:34,275 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:02:34" (1/1) ... [2024-11-12 05:02:34,281 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:02:34" (1/1) ... [2024-11-12 05:02:34,284 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 05:02:34,288 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 05:02:34,288 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 05:02:34,288 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 05:02:34,289 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:02:34" (1/1) ... [2024-11-12 05:02:34,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:02:34,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:02:34,325 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 05:02:34,328 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 05:02:34,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 05:02:34,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 05:02:34,398 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 05:02:34,398 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 05:02:34,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 05:02:34,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 05:02:34,516 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 05:02:34,519 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 05:02:47,045 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-12 05:02:47,045 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 05:02:47,064 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 05:02:47,066 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 05:02:47,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:02:47 BoogieIcfgContainer [2024-11-12 05:02:47,066 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 05:02:47,068 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 05:02:47,069 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 05:02:47,073 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 05:02:47,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:02:33" (1/3) ... [2024-11-12 05:02:47,074 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c70c56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:02:47, skipping insertion in model container [2024-11-12 05:02:47,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:02:34" (2/3) ... [2024-11-12 05:02:47,075 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c70c56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:02:47, skipping insertion in model container [2024-11-12 05:02:47,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:02:47" (3/3) ... [2024-11-12 05:02:47,076 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-69.i [2024-11-12 05:02:47,094 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 05:02:47,095 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 05:02:47,173 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 05:02:47,180 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;@1bb37618, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 05:02:47,182 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 05:02:47,186 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-12 05:02:47,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-12 05:02:47,202 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:02:47,203 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:02:47,203 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:02:47,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:02:47,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1771173860, now seen corresponding path program 1 times [2024-11-12 05:02:47,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:02:47,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [23896976] [2024-11-12 05:02:47,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:02:47,230 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 05:02:47,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:02:47,236 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 05:02:47,237 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 05:02:48,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:48,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 05:02:48,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:02:48,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 614 proven. 0 refuted. 0 times theorem prover too weak. 898 trivial. 0 not checked. [2024-11-12 05:02:48,129 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 05:02:48,130 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 05:02:48,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [23896976] [2024-11-12 05:02:48,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [23896976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:02:48,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:02:48,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 05:02:48,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889507661] [2024-11-12 05:02:48,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:02:48,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 05:02:48,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 05:02:48,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 05:02:48,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:02:48,163 INFO L87 Difference]: Start difference. First operand has 87 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-12 05:02:48,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:02:48,197 INFO L93 Difference]: Finished difference Result 171 states and 303 transitions. [2024-11-12 05:02:48,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 05:02:48,200 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 176 [2024-11-12 05:02:48,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:02:48,206 INFO L225 Difference]: With dead ends: 171 [2024-11-12 05:02:48,207 INFO L226 Difference]: Without dead ends: 83 [2024-11-12 05:02:48,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 175 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 05:02:48,217 INFO L435 NwaCegarLoop]: 136 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, 136 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 05:02:48,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:02:48,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-12 05:02:48,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-12 05:02:48,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 53 states have internal predecessors, (76), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-12 05:02:48,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 132 transitions. [2024-11-12 05:02:48,264 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 132 transitions. Word has length 176 [2024-11-12 05:02:48,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:02:48,264 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 132 transitions. [2024-11-12 05:02:48,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-12 05:02:48,265 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 132 transitions. [2024-11-12 05:02:48,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-12 05:02:48,269 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:02:48,270 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:02:48,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 05:02:48,471 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 05:02:48,471 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:02:48,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:02:48,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1654570456, now seen corresponding path program 1 times [2024-11-12 05:02:48,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:02:48,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [116561055] [2024-11-12 05:02:48,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:02:48,474 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 05:02:48,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:02:48,478 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 05:02:48,479 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 05:02:49,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:49,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 05:02:49,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:02:50,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 573 proven. 18 refuted. 0 times theorem prover too weak. 921 trivial. 0 not checked. [2024-11-12 05:02:50,426 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 05:02:52,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 63 proven. 18 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-12 05:02:52,685 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 05:02:52,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [116561055] [2024-11-12 05:02:52,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [116561055] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 05:02:52,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 05:02:52,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-12 05:02:52,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400249330] [2024-11-12 05:02:52,687 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 05:02:52,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 05:02:52,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 05:02:52,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 05:02:52,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 05:02:52,690 INFO L87 Difference]: Start difference. First operand 83 states and 132 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-12 05:02:58,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 05:03:02,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 05:03:07,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 05:03:07,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:03:07,013 INFO L93 Difference]: Finished difference Result 171 states and 268 transitions. [2024-11-12 05:03:07,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 05:03:07,099 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 176 [2024-11-12 05:03:07,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:03:07,102 INFO L225 Difference]: With dead ends: 171 [2024-11-12 05:03:07,102 INFO L226 Difference]: Without dead ends: 91 [2024-11-12 05:03:07,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 344 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-12 05:03:07,104 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 150 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 45 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:03:07,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 234 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 153 Invalid, 3 Unknown, 0 Unchecked, 14.0s Time] [2024-11-12 05:03:07,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-12 05:03:07,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2024-11-12 05:03:07,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-12 05:03:07,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 134 transitions. [2024-11-12 05:03:07,121 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 134 transitions. Word has length 176 [2024-11-12 05:03:07,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:03:07,122 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 134 transitions. [2024-11-12 05:03:07,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-12 05:03:07,122 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 134 transitions. [2024-11-12 05:03:07,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-12 05:03:07,125 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:03:07,126 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:03:07,153 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 05:03:07,326 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 05:03:07,327 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:03:07,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:03:07,328 INFO L85 PathProgramCache]: Analyzing trace with hash -2066407720, now seen corresponding path program 1 times [2024-11-12 05:03:07,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:03:07,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1138394742] [2024-11-12 05:03:07,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:03:07,329 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 05:03:07,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:03:07,332 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 05:03:07,333 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 05:03:08,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:03:08,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 05:03:08,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:03:09,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 573 proven. 18 refuted. 0 times theorem prover too weak. 921 trivial. 0 not checked. [2024-11-12 05:03:09,380 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 05:03:11,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 63 proven. 18 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-12 05:03:11,811 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 05:03:11,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1138394742] [2024-11-12 05:03:11,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1138394742] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 05:03:11,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 05:03:11,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-12 05:03:11,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357663079] [2024-11-12 05:03:11,812 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 05:03:11,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 05:03:11,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 05:03:11,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 05:03:11,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-12 05:03:11,815 INFO L87 Difference]: Start difference. First operand 87 states and 134 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-12 05:03:18,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 05:03:22,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 05:03:26,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 05:03:31,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 05:03:35,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []