./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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_fillercode_fillercodesize_ps-cn-25_file-4.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 cc702294ab762f82a4156ec02c3796a72ec39b54f7f827a72f56934681f39759 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 04:24:57,670 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 04:24:57,749 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 04:24:57,757 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 04:24:57,757 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 04:24:57,787 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 04:24:57,787 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 04:24:57,788 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 04:24:57,789 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 04:24:57,790 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 04:24:57,791 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 04:24:57,791 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 04:24:57,791 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 04:24:57,792 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 04:24:57,792 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 04:24:57,794 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 04:24:57,794 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 04:24:57,794 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 04:24:57,794 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 04:24:57,795 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 04:24:57,795 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 04:24:57,799 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 04:24:57,799 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 04:24:57,800 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 04:24:57,800 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 04:24:57,800 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 04:24:57,800 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 04:24:57,801 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 04:24:57,801 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 04:24:57,801 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 04:24:57,801 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 04:24:57,801 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 04:24:57,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:24:57,802 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 04:24:57,802 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 04:24:57,803 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 04:24:57,803 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 04:24:57,803 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 04:24:57,803 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 04:24:57,803 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 04:24:57,804 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 04:24:57,804 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 04:24:57,805 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 -> cc702294ab762f82a4156ec02c3796a72ec39b54f7f827a72f56934681f39759 [2024-11-10 04:24:58,104 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 04:24:58,128 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 04:24:58,133 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 04:24:58,134 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 04:24:58,134 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 04:24:58,135 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-4.i [2024-11-10 04:24:59,648 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 04:24:59,918 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 04:24:59,923 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-4.i [2024-11-10 04:24:59,939 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15ff1007d/ff9e24d610d54d79b9eeb2e291b11ec7/FLAGd57e4c7e4 [2024-11-10 04:24:59,960 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15ff1007d/ff9e24d610d54d79b9eeb2e291b11ec7 [2024-11-10 04:24:59,965 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 04:24:59,967 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 04:24:59,968 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 04:24:59,970 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 04:24:59,976 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 04:24:59,976 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:24:59" (1/1) ... [2024-11-10 04:24:59,977 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dd470c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:24:59, skipping insertion in model container [2024-11-10 04:24:59,978 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:24:59" (1/1) ... [2024-11-10 04:25:00,027 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 04:25:00,247 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_fillercode_fillercodesize_ps-cn-25_file-4.i[914,927] [2024-11-10 04:25:00,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:25:00,368 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 04:25:00,381 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_fillercode_fillercodesize_ps-cn-25_file-4.i[914,927] [2024-11-10 04:25:00,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:25:00,437 INFO L204 MainTranslator]: Completed translation [2024-11-10 04:25:00,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:25:00 WrapperNode [2024-11-10 04:25:00,438 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 04:25:00,439 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 04:25:00,440 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 04:25:00,440 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 04:25:00,447 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:25:00" (1/1) ... [2024-11-10 04:25:00,463 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:25:00" (1/1) ... [2024-11-10 04:25:00,511 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 211 [2024-11-10 04:25:00,511 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 04:25:00,512 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 04:25:00,512 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 04:25:00,512 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 04:25:00,523 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:25:00" (1/1) ... [2024-11-10 04:25:00,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:25:00" (1/1) ... [2024-11-10 04:25:00,527 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:25:00" (1/1) ... [2024-11-10 04:25:00,553 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-10 04:25:00,556 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:25:00" (1/1) ... [2024-11-10 04:25:00,556 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:25:00" (1/1) ... [2024-11-10 04:25:00,570 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:25:00" (1/1) ... [2024-11-10 04:25:00,578 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:25:00" (1/1) ... [2024-11-10 04:25:00,581 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:25:00" (1/1) ... [2024-11-10 04:25:00,583 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:25:00" (1/1) ... [2024-11-10 04:25:00,587 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 04:25:00,593 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 04:25:00,593 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 04:25:00,593 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 04:25:00,594 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:25:00" (1/1) ... [2024-11-10 04:25:00,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:25:00,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:25:00,635 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-10 04:25:00,638 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-10 04:25:00,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 04:25:00,694 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 04:25:00,694 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 04:25:00,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 04:25:00,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 04:25:00,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 04:25:00,833 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 04:25:00,836 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 04:25:01,279 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-10 04:25:01,280 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 04:25:01,298 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 04:25:01,298 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 04:25:01,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:25:01 BoogieIcfgContainer [2024-11-10 04:25:01,299 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 04:25:01,302 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 04:25:01,302 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 04:25:01,306 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 04:25:01,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 04:24:59" (1/3) ... [2024-11-10 04:25:01,308 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cc06ae9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:25:01, skipping insertion in model container [2024-11-10 04:25:01,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:25:00" (2/3) ... [2024-11-10 04:25:01,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cc06ae9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:25:01, skipping insertion in model container [2024-11-10 04:25:01,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:25:01" (3/3) ... [2024-11-10 04:25:01,312 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-4.i [2024-11-10 04:25:01,330 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 04:25:01,330 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 04:25:01,400 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 04:25:01,406 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;@2395d181, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 04:25:01,406 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 04:25:01,411 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 58 states have (on average 1.3620689655172413) internal successors, (79), 59 states have internal predecessors, (79), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-10 04:25:01,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-10 04:25:01,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:25:01,426 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 04:25:01,426 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:25:01,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:25:01,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1471072572, now seen corresponding path program 1 times [2024-11-10 04:25:01,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:25:01,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304253243] [2024-11-10 04:25:01,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:25:01,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:25:01,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:01,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:25:01,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:01,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:25:01,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:01,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:25:01,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:01,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:25:01,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:01,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:25:01,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:01,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:25:01,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:01,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:25:01,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:01,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 04:25:01,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:01,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 04:25:01,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:01,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 04:25:01,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:01,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 04:25:01,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:01,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:25:01,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:01,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 04:25:01,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:01,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:25:01,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:01,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:25:01,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:01,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:25:01,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:01,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:25:01,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:01,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:25:01,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:01,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:25:01,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:01,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:25:01,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:01,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 04:25:01,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:01,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:25:01,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:01,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:25:01,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:01,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 04:25:01,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:01,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 04:25:01,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:01,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 04:25:01,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:01,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 04:25:01,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:01,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 04:25:01,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:01,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 04:25:01,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:01,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 04:25:01,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:01,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-10 04:25:01,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:01,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-10 04:25:01,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:01,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-10 04:25:01,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:02,032 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-10 04:25:02,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:25:02,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304253243] [2024-11-10 04:25:02,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304253243] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:25:02,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:25:02,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 04:25:02,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648292407] [2024-11-10 04:25:02,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:25:02,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 04:25:02,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:25:02,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 04:25:02,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:25:02,100 INFO L87 Difference]: Start difference. First operand has 94 states, 58 states have (on average 1.3620689655172413) internal successors, (79), 59 states have internal predecessors, (79), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-10 04:25:02,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:25:02,146 INFO L93 Difference]: Finished difference Result 180 states and 316 transitions. [2024-11-10 04:25:02,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 04:25:02,149 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 209 [2024-11-10 04:25:02,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:25:02,158 INFO L225 Difference]: With dead ends: 180 [2024-11-10 04:25:02,158 INFO L226 Difference]: Without dead ends: 89 [2024-11-10 04:25:02,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 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-10 04:25:02,171 INFO L432 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-10 04:25:02,172 INFO L433 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-10 04:25:02,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-10 04:25:02,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-10 04:25:02,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 54 states have internal predecessors, (70), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-10 04:25:02,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 136 transitions. [2024-11-10 04:25:02,236 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 136 transitions. Word has length 209 [2024-11-10 04:25:02,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:25:02,237 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 136 transitions. [2024-11-10 04:25:02,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-10 04:25:02,240 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 136 transitions. [2024-11-10 04:25:02,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-10 04:25:02,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:25:02,246 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 04:25:02,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 04:25:02,247 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:25:02,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:25:02,248 INFO L85 PathProgramCache]: Analyzing trace with hash 601280196, now seen corresponding path program 1 times [2024-11-10 04:25:02,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:25:02,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411564412] [2024-11-10 04:25:02,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:25:02,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:25:02,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:03,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:25:03,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:03,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:25:03,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:03,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:25:03,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:03,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:25:03,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:03,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:25:03,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:03,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:25:03,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:03,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:25:03,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:03,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 04:25:03,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:03,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 04:25:03,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:03,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 04:25:03,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:03,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 04:25:03,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:03,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:25:03,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:03,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 04:25:03,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:03,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:25:03,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:03,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:25:03,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:03,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:25:03,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:03,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:25:03,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:03,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:25:03,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:03,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:25:03,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:03,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:25:03,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:03,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 04:25:03,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:03,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:25:03,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:03,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:25:03,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:03,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 04:25:03,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:03,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 04:25:03,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:03,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 04:25:03,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:03,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 04:25:03,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:03,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 04:25:03,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:03,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 04:25:03,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:03,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 04:25:03,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:03,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-10 04:25:03,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:03,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-10 04:25:03,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:03,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-10 04:25:03,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:03,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-10 04:25:03,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:25:03,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411564412] [2024-11-10 04:25:03,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411564412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:25:03,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:25:03,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 04:25:03,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309728059] [2024-11-10 04:25:03,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:25:03,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 04:25:03,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:25:03,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 04:25:03,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 04:25:03,597 INFO L87 Difference]: Start difference. First operand 89 states and 136 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 04:25:03,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:25:03,935 INFO L93 Difference]: Finished difference Result 292 states and 439 transitions. [2024-11-10 04:25:03,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 04:25:03,936 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 210 [2024-11-10 04:25:03,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:25:03,941 INFO L225 Difference]: With dead ends: 292 [2024-11-10 04:25:03,942 INFO L226 Difference]: Without dead ends: 206 [2024-11-10 04:25:03,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 04:25:03,945 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 188 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 04:25:03,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 545 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 04:25:03,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-10 04:25:03,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 176. [2024-11-10 04:25:03,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 107 states have (on average 1.2990654205607477) internal successors, (139), 107 states have internal predecessors, (139), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-10 04:25:03,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 271 transitions. [2024-11-10 04:25:03,980 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 271 transitions. Word has length 210 [2024-11-10 04:25:03,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:25:03,981 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 271 transitions. [2024-11-10 04:25:03,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 04:25:03,981 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 271 transitions. [2024-11-10 04:25:03,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-10 04:25:03,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:25:03,987 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 04:25:03,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 04:25:03,987 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:25:03,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:25:03,992 INFO L85 PathProgramCache]: Analyzing trace with hash 629909347, now seen corresponding path program 1 times [2024-11-10 04:25:03,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:25:03,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359176489] [2024-11-10 04:25:03,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:25:03,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:25:04,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:04,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:25:04,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:04,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:25:04,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:04,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:25:04,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:04,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:25:04,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:04,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:25:04,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:04,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:25:04,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:04,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:25:04,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:04,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 04:25:04,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:04,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 04:25:04,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:04,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 04:25:04,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:04,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 04:25:04,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:04,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:25:04,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:04,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 04:25:04,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:04,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:25:04,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:04,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:25:04,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:04,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:25:04,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:04,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:25:04,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:04,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:25:04,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:04,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:25:04,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:04,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:25:04,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:04,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 04:25:04,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:04,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:25:04,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:04,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:25:04,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:04,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 04:25:04,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:04,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 04:25:04,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:04,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 04:25:04,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:04,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 04:25:04,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:04,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 04:25:04,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:04,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 04:25:04,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:04,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 04:25:04,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:04,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-10 04:25:04,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:04,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-10 04:25:04,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:04,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-10 04:25:04,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:04,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-10 04:25:04,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:25:04,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359176489] [2024-11-10 04:25:04,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359176489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:25:04,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:25:04,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 04:25:04,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651662779] [2024-11-10 04:25:04,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:25:04,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 04:25:04,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:25:04,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 04:25:04,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 04:25:04,679 INFO L87 Difference]: Start difference. First operand 176 states and 271 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 3 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2024-11-10 04:25:04,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:25:04,957 INFO L93 Difference]: Finished difference Result 478 states and 735 transitions. [2024-11-10 04:25:04,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 04:25:04,958 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 3 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) Word has length 210 [2024-11-10 04:25:04,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:25:04,962 INFO L225 Difference]: With dead ends: 478 [2024-11-10 04:25:04,962 INFO L226 Difference]: Without dead ends: 305 [2024-11-10 04:25:04,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 69 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-10 04:25:04,964 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 311 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 04:25:04,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 243 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 04:25:04,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-10 04:25:05,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 300. [2024-11-10 04:25:05,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 189 states have (on average 1.3174603174603174) internal successors, (249), 191 states have internal predecessors, (249), 106 states have call successors, (106), 4 states have call predecessors, (106), 4 states have return successors, (106), 104 states have call predecessors, (106), 106 states have call successors, (106) [2024-11-10 04:25:05,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 461 transitions. [2024-11-10 04:25:05,035 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 461 transitions. Word has length 210 [2024-11-10 04:25:05,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:25:05,037 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 461 transitions. [2024-11-10 04:25:05,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 3 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2024-11-10 04:25:05,038 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 461 transitions. [2024-11-10 04:25:05,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-10 04:25:05,043 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:25:05,043 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 04:25:05,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 04:25:05,043 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:25:05,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:25:05,044 INFO L85 PathProgramCache]: Analyzing trace with hash -367163006, now seen corresponding path program 1 times [2024-11-10 04:25:05,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:25:05,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090335611] [2024-11-10 04:25:05,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:25:05,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:25:05,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:10,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:25:10,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:10,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:25:10,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:10,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:25:10,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:10,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:25:10,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:10,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:25:10,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:10,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:25:10,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:10,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:25:10,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:10,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 04:25:10,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:10,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 04:25:10,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:10,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 04:25:10,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:10,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 04:25:10,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:10,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:25:10,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:10,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 04:25:10,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:10,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:25:10,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:10,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:25:10,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:10,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:25:10,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:10,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:25:10,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:10,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:25:10,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:10,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:25:10,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:10,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:25:10,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:10,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 04:25:10,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:10,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:25:10,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:10,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:25:10,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:10,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 04:25:10,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:10,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 04:25:10,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:10,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 04:25:10,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:10,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 04:25:10,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:10,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 04:25:10,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:10,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 04:25:10,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:10,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 04:25:10,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:10,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-10 04:25:10,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:10,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-10 04:25:10,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:10,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-10 04:25:10,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:10,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-10 04:25:10,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:25:10,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090335611] [2024-11-10 04:25:10,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090335611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:25:10,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:25:10,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 04:25:10,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844531232] [2024-11-10 04:25:10,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:25:10,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 04:25:10,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:25:10,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 04:25:10,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-10 04:25:10,769 INFO L87 Difference]: Start difference. First operand 300 states and 461 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 04:25:12,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:25:12,241 INFO L93 Difference]: Finished difference Result 935 states and 1396 transitions. [2024-11-10 04:25:12,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 04:25:12,242 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 210 [2024-11-10 04:25:12,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:25:12,250 INFO L225 Difference]: With dead ends: 935 [2024-11-10 04:25:12,252 INFO L226 Difference]: Without dead ends: 638 [2024-11-10 04:25:12,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-10 04:25:12,255 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 177 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 04:25:12,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 760 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 04:25:12,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2024-11-10 04:25:12,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 434. [2024-11-10 04:25:12,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 288 states have (on average 1.3194444444444444) internal successors, (380), 290 states have internal predecessors, (380), 139 states have call successors, (139), 6 states have call predecessors, (139), 6 states have return successors, (139), 137 states have call predecessors, (139), 139 states have call successors, (139) [2024-11-10 04:25:12,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 658 transitions. [2024-11-10 04:25:12,357 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 658 transitions. Word has length 210 [2024-11-10 04:25:12,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:25:12,358 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 658 transitions. [2024-11-10 04:25:12,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 04:25:12,359 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 658 transitions. [2024-11-10 04:25:12,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-10 04:25:12,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:25:12,361 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 04:25:12,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 04:25:12,362 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:25:12,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:25:12,362 INFO L85 PathProgramCache]: Analyzing trace with hash -660566013, now seen corresponding path program 1 times [2024-11-10 04:25:12,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:25:12,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443618461] [2024-11-10 04:25:12,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:25:12,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:25:12,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:12,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:25:12,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:12,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:25:12,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:12,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:25:12,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:12,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:25:12,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:12,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:25:12,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:12,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:25:12,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:12,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:25:12,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:12,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 04:25:12,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:12,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 04:25:12,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:12,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 04:25:12,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:12,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 04:25:12,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:12,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:25:12,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:12,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 04:25:12,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:12,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:25:12,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:12,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:25:12,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:12,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:25:12,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:12,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:25:12,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:12,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:25:12,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:12,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:25:12,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:12,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:25:12,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:12,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 04:25:12,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:12,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:25:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:12,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:25:12,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:12,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 04:25:12,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:12,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 04:25:12,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:12,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 04:25:12,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:12,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 04:25:12,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:12,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 04:25:12,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:12,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 04:25:12,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:12,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 04:25:12,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:12,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-10 04:25:12,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:12,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-10 04:25:12,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:12,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-10 04:25:12,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:12,811 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-10 04:25:12,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:25:12,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443618461] [2024-11-10 04:25:12,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443618461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:25:12,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:25:12,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 04:25:12,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619006932] [2024-11-10 04:25:12,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:25:12,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 04:25:12,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:25:12,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 04:25:12,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:25:12,814 INFO L87 Difference]: Start difference. First operand 434 states and 658 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 04:25:12,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:25:12,923 INFO L93 Difference]: Finished difference Result 1042 states and 1592 transitions. [2024-11-10 04:25:12,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 04:25:12,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 210 [2024-11-10 04:25:12,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:25:12,932 INFO L225 Difference]: With dead ends: 1042 [2024-11-10 04:25:12,932 INFO L226 Difference]: Without dead ends: 731 [2024-11-10 04:25:12,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:25:12,936 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 67 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 04:25:12,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 269 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 04:25:12,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2024-11-10 04:25:13,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 728. [2024-11-10 04:25:13,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 472 states have (on average 1.305084745762712) internal successors, (616), 476 states have internal predecessors, (616), 245 states have call successors, (245), 10 states have call predecessors, (245), 10 states have return successors, (245), 241 states have call predecessors, (245), 245 states have call successors, (245) [2024-11-10 04:25:13,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 1106 transitions. [2024-11-10 04:25:13,090 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 1106 transitions. Word has length 210 [2024-11-10 04:25:13,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:25:13,091 INFO L471 AbstractCegarLoop]: Abstraction has 728 states and 1106 transitions. [2024-11-10 04:25:13,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 04:25:13,091 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 1106 transitions. [2024-11-10 04:25:13,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-10 04:25:13,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:25:13,094 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 04:25:13,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 04:25:13,094 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:25:13,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:25:13,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1923900804, now seen corresponding path program 1 times [2024-11-10 04:25:13,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:25:13,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11727476] [2024-11-10 04:25:13,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:25:13,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:25:13,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:13,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:25:13,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:13,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:25:13,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:13,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:25:13,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:13,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:25:13,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:13,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:25:13,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:13,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:25:13,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:13,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:25:13,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:13,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 04:25:13,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:13,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 04:25:13,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:13,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 04:25:13,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:13,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 04:25:13,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:13,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:25:13,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:13,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 04:25:13,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:13,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:25:13,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:13,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:25:13,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:13,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:25:13,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:13,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:25:13,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:13,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:25:13,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:13,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:25:13,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:13,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:25:13,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:13,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 04:25:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:13,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:25:13,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:13,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:25:13,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:13,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 04:25:13,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:13,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 04:25:13,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:13,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 04:25:13,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:13,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 04:25:13,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:13,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 04:25:13,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:13,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 04:25:13,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:13,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 04:25:13,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:13,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-10 04:25:13,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:13,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-10 04:25:13,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:13,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-10 04:25:13,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:13,539 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-10 04:25:13,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:25:13,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11727476] [2024-11-10 04:25:13,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11727476] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 04:25:13,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517840982] [2024-11-10 04:25:13,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:25:13,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:25:13,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:25:13,542 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-10 04:25:13,543 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-10 04:25:13,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:13,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 04:25:13,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:25:14,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 386 proven. 87 refuted. 0 times theorem prover too weak. 1639 trivial. 0 not checked. [2024-11-10 04:25:14,062 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:25:14,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-10 04:25:14,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517840982] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 04:25:14,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 04:25:14,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-10 04:25:14,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559438845] [2024-11-10 04:25:14,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 04:25:14,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 04:25:14,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:25:14,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 04:25:14,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 04:25:14,363 INFO L87 Difference]: Start difference. First operand 728 states and 1106 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2024-11-10 04:25:14,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:25:14,685 INFO L93 Difference]: Finished difference Result 1367 states and 2033 transitions. [2024-11-10 04:25:14,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 04:25:14,686 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) Word has length 211 [2024-11-10 04:25:14,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:25:14,692 INFO L225 Difference]: With dead ends: 1367 [2024-11-10 04:25:14,692 INFO L226 Difference]: Without dead ends: 768 [2024-11-10 04:25:14,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 484 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-10 04:25:14,695 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 77 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 04:25:14,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 207 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 04:25:14,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2024-11-10 04:25:14,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 702. [2024-11-10 04:25:14,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 437 states have (on average 1.2013729977116705) internal successors, (525), 441 states have internal predecessors, (525), 245 states have call successors, (245), 19 states have call predecessors, (245), 19 states have return successors, (245), 241 states have call predecessors, (245), 245 states have call successors, (245) [2024-11-10 04:25:14,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 1015 transitions. [2024-11-10 04:25:14,804 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 1015 transitions. Word has length 211 [2024-11-10 04:25:14,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:25:14,805 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 1015 transitions. [2024-11-10 04:25:14,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2024-11-10 04:25:14,806 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 1015 transitions. [2024-11-10 04:25:14,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-10 04:25:14,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:25:14,808 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 04:25:14,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 04:25:15,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-10 04:25:15,013 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:25:15,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:25:15,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1606668668, now seen corresponding path program 1 times [2024-11-10 04:25:15,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:25:15,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3013775] [2024-11-10 04:25:15,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:25:15,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:25:15,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:15,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:25:15,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:15,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:25:15,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:15,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:25:15,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:15,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:25:15,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:15,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:25:15,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:15,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:25:15,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:15,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:25:15,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:15,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 04:25:15,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:15,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 04:25:15,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:15,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 04:25:15,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:15,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 04:25:15,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:15,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:25:15,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:15,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 04:25:15,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:15,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:25:15,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:15,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:25:15,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:15,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:25:15,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:15,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:25:15,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:15,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:25:15,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:15,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:25:15,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:15,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:25:15,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:15,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 04:25:15,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:15,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:25:15,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:15,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:25:15,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:15,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 04:25:15,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:15,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 04:25:15,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:15,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 04:25:15,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:15,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 04:25:15,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:15,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 04:25:15,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:15,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 04:25:15,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:15,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 04:25:15,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:15,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-10 04:25:15,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:15,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-10 04:25:15,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:15,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-10 04:25:15,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:15,270 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-10 04:25:15,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:25:15,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3013775] [2024-11-10 04:25:15,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3013775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:25:15,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:25:15,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 04:25:15,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61432529] [2024-11-10 04:25:15,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:25:15,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 04:25:15,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:25:15,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 04:25:15,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 04:25:15,274 INFO L87 Difference]: Start difference. First operand 702 states and 1015 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 04:25:15,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:25:15,580 INFO L93 Difference]: Finished difference Result 1286 states and 1865 transitions. [2024-11-10 04:25:15,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 04:25:15,581 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 211 [2024-11-10 04:25:15,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:25:15,591 INFO L225 Difference]: With dead ends: 1286 [2024-11-10 04:25:15,592 INFO L226 Difference]: Without dead ends: 987 [2024-11-10 04:25:15,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 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-10 04:25:15,594 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 131 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 04:25:15,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 506 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 04:25:15,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2024-11-10 04:25:15,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 980. [2024-11-10 04:25:15,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 601 states have (on average 1.1896838602329451) internal successors, (715), 607 states have internal predecessors, (715), 351 states have call successors, (351), 27 states have call predecessors, (351), 27 states have return successors, (351), 345 states have call predecessors, (351), 351 states have call successors, (351) [2024-11-10 04:25:15,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1417 transitions. [2024-11-10 04:25:15,746 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1417 transitions. Word has length 211 [2024-11-10 04:25:15,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:25:15,747 INFO L471 AbstractCegarLoop]: Abstraction has 980 states and 1417 transitions. [2024-11-10 04:25:15,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 04:25:15,747 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1417 transitions. [2024-11-10 04:25:15,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-10 04:25:15,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:25:15,749 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 04:25:15,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 04:25:15,750 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:25:15,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:25:15,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1803182173, now seen corresponding path program 1 times [2024-11-10 04:25:15,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:25:15,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273542967] [2024-11-10 04:25:15,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:25:15,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:25:15,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:16,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:25:16,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:16,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:25:16,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:16,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:25:16,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:16,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:25:16,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:16,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:25:16,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:16,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:25:16,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:16,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:25:16,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:16,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 04:25:16,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:16,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 04:25:16,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:16,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 04:25:16,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:16,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 04:25:16,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:16,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:25:16,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:16,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 04:25:16,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:16,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:25:16,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:16,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:25:16,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:16,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:25:16,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:16,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:25:16,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:16,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:25:16,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:16,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:25:16,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:16,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:25:16,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:16,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 04:25:16,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:16,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:25:16,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:16,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:25:16,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:16,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 04:25:16,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:16,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 04:25:16,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:16,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 04:25:16,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:16,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 04:25:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:16,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 04:25:16,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:16,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 04:25:16,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:16,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 04:25:16,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:16,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-10 04:25:16,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:16,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-10 04:25:16,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:16,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-10 04:25:16,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:16,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 60 proven. 210 refuted. 0 times theorem prover too weak. 1842 trivial. 0 not checked. [2024-11-10 04:25:16,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:25:16,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273542967] [2024-11-10 04:25:16,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273542967] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 04:25:16,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835115449] [2024-11-10 04:25:16,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:25:16,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:25:16,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:25:16,906 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-10 04:25:16,908 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-10 04:25:17,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:17,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-10 04:25:17,100 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:25:20,630 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 828 proven. 402 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2024-11-10 04:25:20,631 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:25:48,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835115449] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 04:25:48,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 04:25:48,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 19] total 28 [2024-11-10 04:25:48,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909707984] [2024-11-10 04:25:48,649 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 04:25:48,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-10 04:25:48,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:25:48,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-10 04:25:48,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=432, Invalid=1289, Unknown=1, NotChecked=0, Total=1722 [2024-11-10 04:25:48,653 INFO L87 Difference]: Start difference. First operand 980 states and 1417 transitions. Second operand has 28 states, 28 states have (on average 3.9285714285714284) internal successors, (110), 26 states have internal predecessors, (110), 10 states have call successors, (66), 7 states have call predecessors, (66), 10 states have return successors, (66), 10 states have call predecessors, (66), 10 states have call successors, (66) [2024-11-10 04:25:53,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:25:53,323 INFO L93 Difference]: Finished difference Result 1709 states and 2278 transitions. [2024-11-10 04:25:53,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2024-11-10 04:25:53,324 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.9285714285714284) internal successors, (110), 26 states have internal predecessors, (110), 10 states have call successors, (66), 7 states have call predecessors, (66), 10 states have return successors, (66), 10 states have call predecessors, (66), 10 states have call successors, (66) Word has length 211 [2024-11-10 04:25:53,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:25:53,330 INFO L225 Difference]: With dead ends: 1709 [2024-11-10 04:25:53,330 INFO L226 Difference]: Without dead ends: 1114 [2024-11-10 04:25:53,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 442 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3815 ImplicationChecksByTransitivity, 26.5s TimeCoverageRelationStatistics Valid=2997, Invalid=9884, Unknown=1, NotChecked=0, Total=12882 [2024-11-10 04:25:53,336 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 788 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 1530 mSolverCounterSat, 495 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 788 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 2025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 495 IncrementalHoareTripleChecker+Valid, 1530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-10 04:25:53,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [788 Valid, 996 Invalid, 2025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [495 Valid, 1530 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-10 04:25:53,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2024-11-10 04:25:53,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 761. [2024-11-10 04:25:53,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 761 states, 494 states have (on average 1.1417004048582995) internal successors, (564), 499 states have internal predecessors, (564), 208 states have call successors, (208), 58 states have call predecessors, (208), 58 states have return successors, (208), 203 states have call predecessors, (208), 208 states have call successors, (208) [2024-11-10 04:25:53,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 980 transitions. [2024-11-10 04:25:53,467 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 980 transitions. Word has length 211 [2024-11-10 04:25:53,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:25:53,467 INFO L471 AbstractCegarLoop]: Abstraction has 761 states and 980 transitions. [2024-11-10 04:25:53,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.9285714285714284) internal successors, (110), 26 states have internal predecessors, (110), 10 states have call successors, (66), 7 states have call predecessors, (66), 10 states have return successors, (66), 10 states have call predecessors, (66), 10 states have call successors, (66) [2024-11-10 04:25:53,468 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 980 transitions. [2024-11-10 04:25:53,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-10 04:25:53,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:25:53,470 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 04:25:53,490 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-10 04:25:53,670 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,SelfDestructingSolverStorable7 [2024-11-10 04:25:53,671 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:25:53,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:25:53,673 INFO L85 PathProgramCache]: Analyzing trace with hash 923540486, now seen corresponding path program 1 times [2024-11-10 04:25:53,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:25:53,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462587096] [2024-11-10 04:25:53,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:25:53,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:25:53,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:53,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:25:53,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:53,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:25:53,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:54,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:25:54,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:54,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:25:54,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:54,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:25:54,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:54,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:25:54,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:54,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:25:54,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:54,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 04:25:54,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:54,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 04:25:54,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:54,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 04:25:54,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:54,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 04:25:54,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:54,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:25:54,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:54,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 04:25:54,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:54,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:25:54,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:54,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:25:54,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:54,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:25:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:54,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:25:54,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:54,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:25:54,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:54,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:25:54,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:54,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:25:54,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:54,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 04:25:54,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:54,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:25:54,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:54,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:25:54,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:54,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 04:25:54,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:54,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 04:25:54,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:54,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 04:25:54,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:54,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 04:25:54,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:54,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 04:25:54,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:54,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 04:25:54,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:54,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 04:25:54,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:54,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-10 04:25:54,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:54,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-10 04:25:54,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:54,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-10 04:25:54,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:54,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 3 proven. 93 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-10 04:25:54,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:25:54,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462587096] [2024-11-10 04:25:54,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462587096] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 04:25:54,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840839988] [2024-11-10 04:25:54,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:25:54,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:25:54,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:25:54,118 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-10 04:25:54,120 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-10 04:25:54,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:54,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 04:25:54,260 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:25:54,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 158 proven. 93 refuted. 0 times theorem prover too weak. 1861 trivial. 0 not checked. [2024-11-10 04:25:54,767 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:25:55,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 3 proven. 93 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-10 04:25:55,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840839988] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 04:25:55,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 04:25:55,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2024-11-10 04:25:55,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778106370] [2024-11-10 04:25:55,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 04:25:55,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 04:25:55,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:25:55,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 04:25:55,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-10 04:25:55,153 INFO L87 Difference]: Start difference. First operand 761 states and 980 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 2 states have call successors, (64), 2 states have call predecessors, (64), 4 states have return successors, (65), 2 states have call predecessors, (65), 2 states have call successors, (65) [2024-11-10 04:25:56,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:25:56,160 INFO L93 Difference]: Finished difference Result 1805 states and 2266 transitions. [2024-11-10 04:25:56,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 04:25:56,161 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 2 states have call successors, (64), 2 states have call predecessors, (64), 4 states have return successors, (65), 2 states have call predecessors, (65), 2 states have call successors, (65) Word has length 211 [2024-11-10 04:25:56,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:25:56,167 INFO L225 Difference]: With dead ends: 1805 [2024-11-10 04:25:56,168 INFO L226 Difference]: Without dead ends: 1155 [2024-11-10 04:25:56,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 482 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2024-11-10 04:25:56,170 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 138 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 04:25:56,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 698 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 04:25:56,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2024-11-10 04:25:56,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 801. [2024-11-10 04:25:56,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 801 states, 528 states have (on average 1.1325757575757576) internal successors, (598), 533 states have internal predecessors, (598), 208 states have call successors, (208), 64 states have call predecessors, (208), 64 states have return successors, (208), 203 states have call predecessors, (208), 208 states have call successors, (208) [2024-11-10 04:25:56,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1014 transitions. [2024-11-10 04:25:56,325 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1014 transitions. Word has length 211 [2024-11-10 04:25:56,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:25:56,327 INFO L471 AbstractCegarLoop]: Abstraction has 801 states and 1014 transitions. [2024-11-10 04:25:56,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 2 states have call successors, (64), 2 states have call predecessors, (64), 4 states have return successors, (65), 2 states have call predecessors, (65), 2 states have call successors, (65) [2024-11-10 04:25:56,328 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1014 transitions. [2024-11-10 04:25:56,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-10 04:25:56,329 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:25:56,330 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 04:25:56,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-10 04:25:56,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:25:56,531 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:25:56,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:25:56,532 INFO L85 PathProgramCache]: Analyzing trace with hash 952169637, now seen corresponding path program 1 times [2024-11-10 04:25:56,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:25:56,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486496249] [2024-11-10 04:25:56,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:25:56,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:25:56,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:56,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:25:56,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:56,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:25:56,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:56,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:25:56,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:56,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:25:56,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:56,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:25:56,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:56,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:25:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:56,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:25:56,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:56,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 04:25:56,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:56,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 04:25:56,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:56,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 04:25:56,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:56,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 04:25:56,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:56,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:25:56,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:56,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 04:25:56,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:56,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:25:56,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:56,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:25:56,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:56,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:25:56,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:56,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:25:56,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:56,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:25:56,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:56,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:25:56,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:56,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:25:56,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:56,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 04:25:56,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:56,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:25:56,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:56,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:25:56,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:56,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 04:25:56,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:56,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 04:25:56,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:56,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 04:25:56,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:56,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 04:25:56,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:56,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 04:25:56,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:56,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 04:25:56,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:56,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 04:25:56,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:56,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-10 04:25:56,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:56,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-10 04:25:56,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:56,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-10 04:25:56,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:25:56,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-10 04:25:56,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:25:56,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486496249] [2024-11-10 04:25:56,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486496249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:25:56,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:25:56,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 04:25:56,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615642672] [2024-11-10 04:25:56,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:25:56,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 04:25:56,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:25:56,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 04:25:56,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:25:56,696 INFO L87 Difference]: Start difference. First operand 801 states and 1014 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 04:25:56,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:25:56,806 INFO L93 Difference]: Finished difference Result 1306 states and 1646 transitions. [2024-11-10 04:25:56,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 04:25:56,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 211 [2024-11-10 04:25:56,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:25:56,812 INFO L225 Difference]: With dead ends: 1306 [2024-11-10 04:25:56,813 INFO L226 Difference]: Without dead ends: 592 [2024-11-10 04:25:56,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:25:56,816 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 121 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 04:25:56,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 123 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 04:25:56,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2024-11-10 04:25:56,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2024-11-10 04:25:56,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 388 states have (on average 1.1134020618556701) internal successors, (432), 392 states have internal predecessors, (432), 155 states have call successors, (155), 48 states have call predecessors, (155), 48 states have return successors, (155), 151 states have call predecessors, (155), 155 states have call successors, (155) [2024-11-10 04:25:56,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 742 transitions. [2024-11-10 04:25:56,914 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 742 transitions. Word has length 211 [2024-11-10 04:25:56,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:25:56,915 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 742 transitions. [2024-11-10 04:25:56,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 04:25:56,915 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 742 transitions. [2024-11-10 04:25:56,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-10 04:25:56,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:25:56,916 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 04:25:56,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 04:25:56,917 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:25:56,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:25:56,917 INFO L85 PathProgramCache]: Analyzing trace with hash 637937601, now seen corresponding path program 1 times [2024-11-10 04:25:56,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:25:56,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045255495] [2024-11-10 04:25:56,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:25:56,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:25:57,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 04:25:57,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1021018369] [2024-11-10 04:25:57,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:25:57,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:25:57,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:25:57,071 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-10 04:25:57,072 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-10 04:25:57,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 04:25:57,224 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 04:25:57,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 04:25:57,436 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 04:25:57,436 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 04:25:57,437 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 04:25:57,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 04:25:57,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:25:57,644 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:25:57,813 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 04:25:57,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 04:25:57 BoogieIcfgContainer [2024-11-10 04:25:57,818 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 04:25:57,818 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 04:25:57,818 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 04:25:57,818 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 04:25:57,819 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:25:01" (3/4) ... [2024-11-10 04:25:57,821 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 04:25:57,822 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 04:25:57,823 INFO L158 Benchmark]: Toolchain (without parser) took 57856.70ms. Allocated memory was 176.2MB in the beginning and 627.0MB in the end (delta: 450.9MB). Free memory was 100.9MB in the beginning and 536.3MB in the end (delta: -435.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 04:25:57,824 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 176.2MB. Free memory is still 147.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 04:25:57,824 INFO L158 Benchmark]: CACSL2BoogieTranslator took 470.85ms. Allocated memory is still 176.2MB. Free memory was 100.9MB in the beginning and 139.1MB in the end (delta: -38.2MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. [2024-11-10 04:25:57,824 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.89ms. Allocated memory is still 176.2MB. Free memory was 139.1MB in the beginning and 136.2MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 04:25:57,824 INFO L158 Benchmark]: Boogie Preprocessor took 79.13ms. Allocated memory is still 176.2MB. Free memory was 136.2MB in the beginning and 131.8MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 04:25:57,825 INFO L158 Benchmark]: IcfgBuilder took 706.07ms. Allocated memory is still 176.2MB. Free memory was 131.8MB in the beginning and 127.4MB in the end (delta: 4.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 04:25:57,825 INFO L158 Benchmark]: TraceAbstraction took 56515.54ms. Allocated memory was 176.2MB in the beginning and 627.0MB in the end (delta: 450.9MB). Free memory was 126.4MB in the beginning and 536.3MB in the end (delta: -409.8MB). Peak memory consumption was 41.6MB. Max. memory is 16.1GB. [2024-11-10 04:25:57,826 INFO L158 Benchmark]: Witness Printer took 4.39ms. Allocated memory is still 627.0MB. Free memory is still 536.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 04:25:57,827 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.19ms. Allocated memory is still 176.2MB. Free memory is still 147.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 470.85ms. Allocated memory is still 176.2MB. Free memory was 100.9MB in the beginning and 139.1MB in the end (delta: -38.2MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.89ms. Allocated memory is still 176.2MB. Free memory was 139.1MB in the beginning and 136.2MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.13ms. Allocated memory is still 176.2MB. Free memory was 136.2MB in the beginning and 131.8MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 706.07ms. Allocated memory is still 176.2MB. Free memory was 131.8MB in the beginning and 127.4MB in the end (delta: 4.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 56515.54ms. Allocated memory was 176.2MB in the beginning and 627.0MB in the end (delta: 450.9MB). Free memory was 126.4MB in the beginning and 536.3MB in the end (delta: -409.8MB). Peak memory consumption was 41.6MB. Max. memory is 16.1GB. * Witness Printer took 4.39ms. Allocated memory is still 627.0MB. Free memory is still 536.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 186, overapproximation of someBinaryFLOATComparisonOperation at line 64, overapproximation of someBinaryArithmeticDOUBLEoperation at line 119. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_5 = 0; [L25] unsigned short int var_1_6 = 4; [L26] unsigned short int var_1_9 = 4; [L27] unsigned short int var_1_10 = 10; [L28] double var_1_11 = 15.6; [L29] double var_1_12 = 256.4; [L30] double var_1_13 = 49.15; [L31] unsigned long int var_1_14 = 500; [L32] unsigned long int var_1_15 = 2173307753; [L33] unsigned long int var_1_16 = 3362224480; [L34] signed short int var_1_17 = 16; [L35] signed short int var_1_19 = 16; [L36] signed short int var_1_20 = 4; [L37] signed short int var_1_21 = 0; [L38] signed short int var_1_22 = -25; [L39] signed char var_1_23 = 1; [L40] signed char var_1_24 = 2; [L41] signed short int var_1_25 = -500; [L42] signed char var_1_26 = -2; [L43] float var_1_27 = 31.25; [L44] float var_1_28 = 2.95; [L45] signed char var_1_29 = 10; [L46] double var_1_30 = 0.5; [L47] unsigned char var_1_31 = 0; [L48] unsigned short int var_1_32 = 1; [L49] double var_1_33 = 3.2; [L50] unsigned char var_1_34 = 2; [L51] unsigned char var_1_35 = 4; [L52] signed long int var_1_36 = -256; [L53] unsigned short int var_1_37 = 64; [L54] unsigned short int var_1_38 = 16; [L55] unsigned short int last_1_var_1_6 = 4; [L56] unsigned short int last_1_var_1_9 = 4; [L57] unsigned long int last_1_var_1_14 = 500; [L58] signed short int last_1_var_1_17 = 16; VAL [isInitial=0, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L190] isInitial = 1 [L191] FCALL initially() [L192] COND TRUE 1 [L193] CALL updateLastVariables() [L180] last_1_var_1_6 = var_1_6 [L181] last_1_var_1_9 = var_1_9 [L182] last_1_var_1_14 = var_1_14 [L183] last_1_var_1_17 = var_1_17 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L193] RET updateLastVariables() [L194] CALL updateVariables() [L126] var_1_4 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_5=0, var_1_6=4, var_1_9=4] [L127] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_5=0, var_1_6=4, var_1_9=4] [L128] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L128] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L129] var_1_5 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_6=4, var_1_9=4] [L130] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_6=4, var_1_9=4] [L131] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L131] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L132] var_1_10 = __VERIFIER_nondet_ushort() [L133] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L133] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L134] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L134] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L135] var_1_12 = __VERIFIER_nondet_double() [L136] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L136] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L137] var_1_13 = __VERIFIER_nondet_double() [L138] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L138] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L139] var_1_15 = __VERIFIER_nondet_ulong() [L140] CALL assume_abort_if_not(var_1_15 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L140] RET assume_abort_if_not(var_1_15 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L141] CALL assume_abort_if_not(var_1_15 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L141] RET assume_abort_if_not(var_1_15 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L142] var_1_16 = __VERIFIER_nondet_ulong() [L143] CALL assume_abort_if_not(var_1_16 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L143] RET assume_abort_if_not(var_1_16 >= 3221225470) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L144] CALL assume_abort_if_not(var_1_16 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L144] RET assume_abort_if_not(var_1_16 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L145] var_1_19 = __VERIFIER_nondet_short() [L146] CALL assume_abort_if_not(var_1_19 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L146] RET assume_abort_if_not(var_1_19 >= -16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L147] CALL assume_abort_if_not(var_1_19 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L147] RET assume_abort_if_not(var_1_19 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L148] var_1_20 = __VERIFIER_nondet_short() [L149] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L149] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L150] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L150] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L151] var_1_21 = __VERIFIER_nondet_short() [L152] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L152] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L153] CALL assume_abort_if_not(var_1_21 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L153] RET assume_abort_if_not(var_1_21 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L154] var_1_22 = __VERIFIER_nondet_short() [L155] CALL assume_abort_if_not(var_1_22 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L155] RET assume_abort_if_not(var_1_22 >= -16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L156] CALL assume_abort_if_not(var_1_22 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L156] RET assume_abort_if_not(var_1_22 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L157] var_1_24 = __VERIFIER_nondet_char() [L158] CALL assume_abort_if_not(var_1_24 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L158] RET assume_abort_if_not(var_1_24 >= -127) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L159] CALL assume_abort_if_not(var_1_24 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L159] RET assume_abort_if_not(var_1_24 <= 126) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L160] var_1_27 = __VERIFIER_nondet_float() [L161] CALL assume_abort_if_not((var_1_27 >= -922337.2036854776000e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854776000e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L161] RET assume_abort_if_not((var_1_27 >= -922337.2036854776000e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854776000e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L162] var_1_28 = __VERIFIER_nondet_float() [L163] CALL assume_abort_if_not((var_1_28 >= -922337.2036854776000e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854776000e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L163] RET assume_abort_if_not((var_1_28 >= -922337.2036854776000e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854776000e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L164] var_1_29 = __VERIFIER_nondet_char() [L165] CALL assume_abort_if_not(var_1_29 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L165] RET assume_abort_if_not(var_1_29 >= -127) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L166] CALL assume_abort_if_not(var_1_29 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L166] RET assume_abort_if_not(var_1_29 <= 126) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L167] var_1_31 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L168] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L169] CALL assume_abort_if_not(var_1_31 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L169] RET assume_abort_if_not(var_1_31 <= 1) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L170] var_1_32 = __VERIFIER_nondet_ushort() [L171] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L171] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L172] CALL assume_abort_if_not(var_1_32 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L172] RET assume_abort_if_not(var_1_32 <= 65535) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L173] var_1_33 = __VERIFIER_nondet_double() [L174] CALL assume_abort_if_not((var_1_33 >= -922337.2036854765600e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854765600e+12F && var_1_33 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L174] RET assume_abort_if_not((var_1_33 >= -922337.2036854765600e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854765600e+12F && var_1_33 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L175] var_1_35 = __VERIFIER_nondet_uchar() [L176] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L176] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L177] CALL assume_abort_if_not(var_1_35 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L177] RET assume_abort_if_not(var_1_35 <= 254) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L194] RET updateVariables() [L195] CALL step() [L62] var_1_23 = var_1_24 [L63] var_1_25 = var_1_23 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L64] COND TRUE (- var_1_27) >= var_1_28 [L65] var_1_26 = ((((var_1_24) > (var_1_29)) ? (var_1_24) : (var_1_29))) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L67] COND FALSE !(\read(var_1_31)) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L72] COND FALSE !(var_1_26 < var_1_24) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L75] COND TRUE var_1_34 != ((((var_1_35) < 0 ) ? -(var_1_35) : (var_1_35))) [L76] var_1_36 = (((((var_1_34 - var_1_32)) < ((((((var_1_24 + var_1_26)) < (var_1_25)) ? ((var_1_24 + var_1_26)) : (var_1_25))))) ? ((var_1_34 - var_1_32)) : ((((((var_1_24 + var_1_26)) < (var_1_25)) ? ((var_1_24 + var_1_26)) : (var_1_25)))))) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=0, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L78] var_1_37 = var_1_34 [L79] var_1_38 = var_1_35 [L80] signed long int stepLocal_0 = last_1_var_1_9; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=0, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=2, var_1_38=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L81] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=0, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=2, var_1_38=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L86] signed long int stepLocal_3 = last_1_var_1_9; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_3=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=0, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=2, var_1_38=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L87] COND TRUE last_1_var_1_14 >= stepLocal_3 [L88] var_1_14 = (((((var_1_15) > ((var_1_16 - var_1_10))) ? (var_1_15) : ((var_1_16 - var_1_10)))) - last_1_var_1_17) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=0, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=2, var_1_38=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L90] COND TRUE var_1_6 <= var_1_14 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=0, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=2, var_1_38=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L91] COND TRUE (- var_1_14) > var_1_6 [L92] var_1_1 = 0 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=0, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=2, var_1_38=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L97] unsigned char stepLocal_2 = var_1_4; [L98] unsigned long int stepLocal_1 = var_1_14; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_1=3221225454, stepLocal_2=0, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=0, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=2, var_1_38=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L99] COND FALSE !(stepLocal_2 || var_1_1) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_1=3221225454, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=0, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=2, var_1_38=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L102] COND TRUE stepLocal_1 >= var_1_6 [L103] var_1_9 = var_1_10 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=0, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=2, var_1_38=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L108] unsigned char stepLocal_5 = var_1_1; [L109] unsigned char stepLocal_4 = var_1_1; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_4=0, stepLocal_5=0, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=0, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=2, var_1_38=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L110] COND FALSE !(stepLocal_4 && (var_1_5 && (var_1_12 < var_1_13))) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=0, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=2, var_1_38=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L117] COND TRUE var_1_14 <= var_1_14 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=0, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=2, var_1_38=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L118] COND TRUE ! var_1_1 [L119] var_1_11 = (var_1_12 - var_1_13) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=0, var_1_14=3221225454, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=0, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=2, var_1_38=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L195] RET step() [L196] CALL, EXPR property() [L186-L187] return ((((((var_1_6 <= var_1_14) ? (((- var_1_14) > var_1_6) ? (var_1_1 == ((unsigned char) 0)) : 1) : (var_1_1 == ((unsigned char) (var_1_4 || var_1_5)))) && (var_1_5 ? (((last_1_var_1_14 * (last_1_var_1_6 + last_1_var_1_17)) > last_1_var_1_9) ? (var_1_6 == ((unsigned short int) 256)) : 1) : 1)) && ((var_1_4 || var_1_1) ? (var_1_9 == ((unsigned short int) ((((32) < (var_1_10)) ? (32) : (var_1_10))))) : ((var_1_14 >= var_1_6) ? (var_1_9 == ((unsigned short int) var_1_10)) : (var_1_9 == ((unsigned short int) var_1_10))))) && ((var_1_14 <= var_1_14) ? ((! var_1_1) ? (var_1_11 == ((double) (var_1_12 - var_1_13))) : 1) : (var_1_11 == ((double) var_1_12)))) && ((last_1_var_1_14 >= last_1_var_1_9) ? (var_1_14 == ((unsigned long int) (((((var_1_15) > ((var_1_16 - var_1_10))) ? (var_1_15) : ((var_1_16 - var_1_10)))) - last_1_var_1_17))) : 1)) && ((var_1_1 && (var_1_5 && (var_1_12 < var_1_13))) ? ((var_1_1 || (last_1_var_1_17 >= ((((var_1_14) > (var_1_6)) ? (var_1_14) : (var_1_6))))) ? (var_1_17 == ((signed short int) (((((((((var_1_19) > (256)) ? (var_1_19) : (256))) + (var_1_20 - var_1_21))) < ((var_1_22 + 64))) ? ((((((var_1_19) > (256)) ? (var_1_19) : (256))) + (var_1_20 - var_1_21))) : ((var_1_22 + 64)))))) : (var_1_17 == ((signed short int) var_1_19))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_14=3221225454, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=0, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=2, var_1_38=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L196] RET, EXPR property() [L196] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_14=3221225454, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=0, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=2, var_1_38=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_14=3221225454, var_1_15=-2147483649, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=0, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=2, var_1_38=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 56.3s, OverallIterations: 11, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2002 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1998 mSDsluCounter, 4483 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2892 mSDsCounter, 796 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3113 IncrementalHoareTripleChecker+Invalid, 3909 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 796 mSolverCounterUnsat, 1591 mSDtfsCounter, 3113 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2097 GetRequests, 1925 SyntacticMatches, 4 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3907 ImplicationChecksByTransitivity, 28.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=980occurred in iteration=7, InterpolantAutomatonStates: 136, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 1022 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 43.3s InterpolantComputationTime, 3161 NumberOfCodeBlocks, 3161 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3144 ConstructedInterpolants, 0 QuantifiedInterpolants, 16776 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1473 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 15 InterpolantComputations, 7 PerfectInterpolantSequences, 30528/31680 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-10 04:25:57,963 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_fillercode_fillercodesize_ps-cn-25_file-4.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 cc702294ab762f82a4156ec02c3796a72ec39b54f7f827a72f56934681f39759 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 04:26:00,120 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 04:26:00,200 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 04:26:00,206 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 04:26:00,207 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 04:26:00,242 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 04:26:00,242 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 04:26:00,243 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 04:26:00,243 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 04:26:00,244 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 04:26:00,244 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 04:26:00,244 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 04:26:00,245 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 04:26:00,245 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 04:26:00,245 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 04:26:00,246 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 04:26:00,246 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 04:26:00,246 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 04:26:00,247 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 04:26:00,247 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 04:26:00,247 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 04:26:00,251 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 04:26:00,251 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 04:26:00,252 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 04:26:00,252 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 04:26:00,252 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 04:26:00,252 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 04:26:00,252 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 04:26:00,253 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 04:26:00,253 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 04:26:00,253 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 04:26:00,253 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 04:26:00,253 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 04:26:00,254 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 04:26:00,254 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:26:00,254 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 04:26:00,254 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 04:26:00,255 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 04:26:00,255 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 04:26:00,255 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 04:26:00,255 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 04:26:00,257 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 04:26:00,257 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 04:26:00,257 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 04:26:00,257 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 -> cc702294ab762f82a4156ec02c3796a72ec39b54f7f827a72f56934681f39759 [2024-11-10 04:26:00,594 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 04:26:00,618 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 04:26:00,623 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 04:26:00,624 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 04:26:00,628 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 04:26:00,630 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-4.i [2024-11-10 04:26:02,236 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 04:26:02,470 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 04:26:02,471 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-4.i [2024-11-10 04:26:02,483 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d61903f4/4de5260886254cc7b9c6266de32319f5/FLAG16f1852f1 [2024-11-10 04:26:02,815 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d61903f4/4de5260886254cc7b9c6266de32319f5 [2024-11-10 04:26:02,817 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 04:26:02,818 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 04:26:02,819 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 04:26:02,819 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 04:26:02,824 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 04:26:02,824 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:26:02" (1/1) ... [2024-11-10 04:26:02,825 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49108e5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:26:02, skipping insertion in model container [2024-11-10 04:26:02,825 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:26:02" (1/1) ... [2024-11-10 04:26:02,862 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 04:26:03,067 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_fillercode_fillercodesize_ps-cn-25_file-4.i[914,927] [2024-11-10 04:26:03,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:26:03,182 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 04:26:03,196 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_fillercode_fillercodesize_ps-cn-25_file-4.i[914,927] [2024-11-10 04:26:03,235 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:26:03,257 INFO L204 MainTranslator]: Completed translation [2024-11-10 04:26:03,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:26:03 WrapperNode [2024-11-10 04:26:03,258 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 04:26:03,259 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 04:26:03,259 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 04:26:03,259 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 04:26:03,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:26:03" (1/1) ... [2024-11-10 04:26:03,285 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:26:03" (1/1) ... [2024-11-10 04:26:03,326 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 205 [2024-11-10 04:26:03,330 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 04:26:03,330 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 04:26:03,330 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 04:26:03,330 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 04:26:03,346 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:26:03" (1/1) ... [2024-11-10 04:26:03,346 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:26:03" (1/1) ... [2024-11-10 04:26:03,353 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:26:03" (1/1) ... [2024-11-10 04:26:03,381 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-10 04:26:03,384 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:26:03" (1/1) ... [2024-11-10 04:26:03,385 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:26:03" (1/1) ... [2024-11-10 04:26:03,397 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:26:03" (1/1) ... [2024-11-10 04:26:03,402 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:26:03" (1/1) ... [2024-11-10 04:26:03,404 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:26:03" (1/1) ... [2024-11-10 04:26:03,410 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:26:03" (1/1) ... [2024-11-10 04:26:03,415 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 04:26:03,434 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 04:26:03,435 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 04:26:03,436 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 04:26:03,437 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:26:03" (1/1) ... [2024-11-10 04:26:03,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:26:03,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:26:03,471 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-10 04:26:03,475 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-10 04:26:03,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 04:26:03,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 04:26:03,528 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 04:26:03,528 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 04:26:03,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 04:26:03,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 04:26:03,631 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 04:26:03,634 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 04:26:04,546 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-10 04:26:04,546 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 04:26:04,562 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 04:26:04,562 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 04:26:04,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:26:04 BoogieIcfgContainer [2024-11-10 04:26:04,563 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 04:26:04,566 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 04:26:04,566 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 04:26:04,569 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 04:26:04,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 04:26:02" (1/3) ... [2024-11-10 04:26:04,570 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@170c8a75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:26:04, skipping insertion in model container [2024-11-10 04:26:04,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:26:03" (2/3) ... [2024-11-10 04:26:04,571 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@170c8a75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:26:04, skipping insertion in model container [2024-11-10 04:26:04,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:26:04" (3/3) ... [2024-11-10 04:26:04,572 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-4.i [2024-11-10 04:26:04,594 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 04:26:04,594 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 04:26:04,658 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 04:26:04,667 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;@756426c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 04:26:04,668 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 04:26:04,675 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 58 states have (on average 1.3620689655172413) internal successors, (79), 59 states have internal predecessors, (79), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-10 04:26:04,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-10 04:26:04,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:26:04,693 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 04:26:04,694 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:26:04,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:26:04,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1471072572, now seen corresponding path program 1 times [2024-11-10 04:26:04,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:26:04,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1633255467] [2024-11-10 04:26:04,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:26:04,713 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-10 04:26:04,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:26:04,716 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-10 04:26:04,718 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-10 04:26:05,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:05,105 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 04:26:05,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:26:05,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 604 proven. 0 refuted. 0 times theorem prover too weak. 1508 trivial. 0 not checked. [2024-11-10 04:26:05,197 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 04:26:05,201 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:26:05,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1633255467] [2024-11-10 04:26:05,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1633255467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:26:05,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:26:05,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 04:26:05,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682457388] [2024-11-10 04:26:05,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:26:05,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 04:26:05,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:26:05,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 04:26:05,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:26:05,240 INFO L87 Difference]: Start difference. First operand has 94 states, 58 states have (on average 1.3620689655172413) internal successors, (79), 59 states have internal predecessors, (79), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-10 04:26:05,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:26:05,288 INFO L93 Difference]: Finished difference Result 180 states and 316 transitions. [2024-11-10 04:26:05,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 04:26:05,291 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 209 [2024-11-10 04:26:05,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:26:05,302 INFO L225 Difference]: With dead ends: 180 [2024-11-10 04:26:05,302 INFO L226 Difference]: Without dead ends: 89 [2024-11-10 04:26:05,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 208 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-10 04:26:05,310 INFO L432 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-10 04:26:05,311 INFO L433 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-10 04:26:05,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-10 04:26:05,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-10 04:26:05,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 54 states have internal predecessors, (70), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-10 04:26:05,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 136 transitions. [2024-11-10 04:26:05,365 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 136 transitions. Word has length 209 [2024-11-10 04:26:05,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:26:05,366 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 136 transitions. [2024-11-10 04:26:05,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-10 04:26:05,366 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 136 transitions. [2024-11-10 04:26:05,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-10 04:26:05,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:26:05,371 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 04:26:05,380 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-10 04:26:05,571 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-10 04:26:05,572 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:26:05,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:26:05,573 INFO L85 PathProgramCache]: Analyzing trace with hash 601280196, now seen corresponding path program 1 times [2024-11-10 04:26:05,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:26:05,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [729507469] [2024-11-10 04:26:05,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:26:05,574 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-10 04:26:05,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:26:05,578 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-10 04:26:05,579 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-10 04:26:05,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:05,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 04:26:05,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:26:05,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-10 04:26:05,985 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 04:26:05,985 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:26:05,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [729507469] [2024-11-10 04:26:05,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [729507469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:26:05,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:26:05,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 04:26:05,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731095428] [2024-11-10 04:26:05,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:26:05,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 04:26:05,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:26:05,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 04:26:05,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:26:05,990 INFO L87 Difference]: Start difference. First operand 89 states and 136 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 04:26:06,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:26:06,084 INFO L93 Difference]: Finished difference Result 254 states and 389 transitions. [2024-11-10 04:26:06,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 04:26:06,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 210 [2024-11-10 04:26:06,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:26:06,089 INFO L225 Difference]: With dead ends: 254 [2024-11-10 04:26:06,090 INFO L226 Difference]: Without dead ends: 168 [2024-11-10 04:26:06,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:26:06,093 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 118 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 04:26:06,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 348 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 04:26:06,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-10 04:26:06,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 164. [2024-11-10 04:26:06,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 97 states have (on average 1.2783505154639174) internal successors, (124), 98 states have internal predecessors, (124), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 63 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-10 04:26:06,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 252 transitions. [2024-11-10 04:26:06,132 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 252 transitions. Word has length 210 [2024-11-10 04:26:06,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:26:06,133 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 252 transitions. [2024-11-10 04:26:06,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 04:26:06,135 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 252 transitions. [2024-11-10 04:26:06,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-10 04:26:06,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:26:06,138 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 04:26:06,149 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 (3)] Ended with exit code 0 [2024-11-10 04:26:06,339 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-10 04:26:06,339 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:26:06,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:26:06,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1954589893, now seen corresponding path program 1 times [2024-11-10 04:26:06,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:26:06,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1795037166] [2024-11-10 04:26:06,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:26:06,341 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-10 04:26:06,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:26:06,344 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-10 04:26:06,345 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-10 04:26:06,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:06,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 04:26:06,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:26:07,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 309 proven. 177 refuted. 0 times theorem prover too weak. 1626 trivial. 0 not checked. [2024-11-10 04:26:07,852 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:26:08,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 9 proven. 180 refuted. 0 times theorem prover too weak. 1923 trivial. 0 not checked. [2024-11-10 04:26:08,519 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:26:08,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1795037166] [2024-11-10 04:26:08,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1795037166] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 04:26:08,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 04:26:08,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2024-11-10 04:26:08,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870367318] [2024-11-10 04:26:08,521 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 04:26:08,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 04:26:08,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:26:08,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 04:26:08,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-11-10 04:26:08,526 INFO L87 Difference]: Start difference. First operand 164 states and 252 transitions. Second operand has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 3 states have call successors, (64), 3 states have call predecessors, (64), 7 states have return successors, (65), 3 states have call predecessors, (65), 3 states have call successors, (65) [2024-11-10 04:26:10,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:26:10,173 INFO L93 Difference]: Finished difference Result 378 states and 553 transitions. [2024-11-10 04:26:10,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 04:26:10,174 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 3 states have call successors, (64), 3 states have call predecessors, (64), 7 states have return successors, (65), 3 states have call predecessors, (65), 3 states have call successors, (65) Word has length 210 [2024-11-10 04:26:10,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:26:10,178 INFO L225 Difference]: With dead ends: 378 [2024-11-10 04:26:10,178 INFO L226 Difference]: Without dead ends: 217 [2024-11-10 04:26:10,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 405 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=351, Unknown=0, NotChecked=0, Total=506 [2024-11-10 04:26:10,185 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 69 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-10 04:26:10,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 431 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-10 04:26:10,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-10 04:26:10,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 188. [2024-11-10 04:26:10,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 117 states have (on average 1.1623931623931625) internal successors, (136), 118 states have internal predecessors, (136), 64 states have call successors, (64), 6 states have call predecessors, (64), 6 states have return successors, (64), 63 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-10 04:26:10,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 264 transitions. [2024-11-10 04:26:10,231 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 264 transitions. Word has length 210 [2024-11-10 04:26:10,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:26:10,232 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 264 transitions. [2024-11-10 04:26:10,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 3 states have call successors, (64), 3 states have call predecessors, (64), 7 states have return successors, (65), 3 states have call predecessors, (65), 3 states have call successors, (65) [2024-11-10 04:26:10,233 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 264 transitions. [2024-11-10 04:26:10,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-10 04:26:10,235 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:26:10,238 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 04:26:10,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-10 04:26:10,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 04:26:10,440 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:26:10,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:26:10,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1759269150, now seen corresponding path program 1 times [2024-11-10 04:26:10,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:26:10,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1783279500] [2024-11-10 04:26:10,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:26:10,445 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-10 04:26:10,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:26:10,447 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 04:26:10,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-10 04:26:10,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:26:10,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 04:26:10,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:26:11,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-10 04:26:11,183 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 04:26:11,183 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:26:11,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1783279500] [2024-11-10 04:26:11,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1783279500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:26:11,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:26:11,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 04:26:11,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927852362] [2024-11-10 04:26:11,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:26:11,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 04:26:11,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:26:11,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 04:26:11,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 04:26:11,189 INFO L87 Difference]: Start difference. First operand 188 states and 264 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33)