./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-54.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-54.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 013cee657358eefc857795aa5f6e32aab15d5145c28e4306b26dd7ea01ffb375 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 04:04:03,135 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 04:04:03,188 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 04:04:03,190 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 04:04:03,191 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 04:04:03,217 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 04:04:03,217 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 04:04:03,218 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 04:04:03,218 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 04:04:03,218 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 04:04:03,219 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 04:04:03,219 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 04:04:03,219 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 04:04:03,219 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 04:04:03,220 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 04:04:03,220 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 04:04:03,220 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 04:04:03,222 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 04:04:03,223 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 04:04:03,223 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 04:04:03,223 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 04:04:03,224 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 04:04:03,224 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 04:04:03,224 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 04:04:03,224 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 04:04:03,224 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 04:04:03,224 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 04:04:03,225 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 04:04:03,225 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 04:04:03,225 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 04:04:03,225 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 04:04:03,225 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 04:04:03,226 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 04:04:03,226 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 04:04:03,227 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 04:04:03,227 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 04:04:03,227 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 04:04:03,227 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 04:04:03,227 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 04:04:03,227 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 04:04:03,227 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 04:04:03,228 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 04:04:03,228 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 -> 013cee657358eefc857795aa5f6e32aab15d5145c28e4306b26dd7ea01ffb375 [2024-11-20 04:04:03,455 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 04:04:03,475 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 04:04:03,478 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 04:04:03,479 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 04:04:03,479 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 04:04:03,480 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-54.i [2024-11-20 04:04:04,704 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 04:04:04,861 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 04:04:04,861 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-54.i [2024-11-20 04:04:04,884 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64551eea3/bf63a210b17f442dbbfa7df19adf040f/FLAGbc889bf9e [2024-11-20 04:04:05,265 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64551eea3/bf63a210b17f442dbbfa7df19adf040f [2024-11-20 04:04:05,267 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 04:04:05,268 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 04:04:05,269 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 04:04:05,269 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 04:04:05,273 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 04:04:05,274 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:04:05" (1/1) ... [2024-11-20 04:04:05,274 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51e855c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:04:05, skipping insertion in model container [2024-11-20 04:04:05,275 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:04:05" (1/1) ... [2024-11-20 04:04:05,292 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 04:04:05,432 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_fillercodestructure_filler-pe-ci_file-54.i[919,932] [2024-11-20 04:04:05,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 04:04:05,513 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 04:04:05,522 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_fillercodestructure_filler-pe-ci_file-54.i[919,932] [2024-11-20 04:04:05,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 04:04:05,579 INFO L204 MainTranslator]: Completed translation [2024-11-20 04:04:05,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:04:05 WrapperNode [2024-11-20 04:04:05,581 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 04:04:05,582 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 04:04:05,583 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 04:04:05,583 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 04:04:05,589 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:04:05" (1/1) ... [2024-11-20 04:04:05,597 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:04:05" (1/1) ... [2024-11-20 04:04:05,628 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 199 [2024-11-20 04:04:05,630 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 04:04:05,631 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 04:04:05,631 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 04:04:05,631 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 04:04:05,642 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:04:05" (1/1) ... [2024-11-20 04:04:05,642 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:04:05" (1/1) ... [2024-11-20 04:04:05,645 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:04:05" (1/1) ... [2024-11-20 04:04:05,663 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-20 04:04:05,663 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:04:05" (1/1) ... [2024-11-20 04:04:05,664 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:04:05" (1/1) ... [2024-11-20 04:04:05,669 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:04:05" (1/1) ... [2024-11-20 04:04:05,672 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:04:05" (1/1) ... [2024-11-20 04:04:05,673 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:04:05" (1/1) ... [2024-11-20 04:04:05,674 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:04:05" (1/1) ... [2024-11-20 04:04:05,676 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 04:04:05,677 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 04:04:05,677 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 04:04:05,677 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 04:04:05,678 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:04:05" (1/1) ... [2024-11-20 04:04:05,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 04:04:05,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:04:05,710 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-20 04:04:05,716 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-20 04:04:05,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 04:04:05,748 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 04:04:05,749 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 04:04:05,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 04:04:05,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 04:04:05,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 04:04:05,819 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 04:04:05,821 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 04:04:06,101 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-20 04:04:06,101 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 04:04:06,115 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 04:04:06,115 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 04:04:06,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:04:06 BoogieIcfgContainer [2024-11-20 04:04:06,115 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 04:04:06,117 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 04:04:06,117 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 04:04:06,120 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 04:04:06,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 04:04:05" (1/3) ... [2024-11-20 04:04:06,120 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1256154 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:04:06, skipping insertion in model container [2024-11-20 04:04:06,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:04:05" (2/3) ... [2024-11-20 04:04:06,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1256154 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:04:06, skipping insertion in model container [2024-11-20 04:04:06,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:04:06" (3/3) ... [2024-11-20 04:04:06,123 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-54.i [2024-11-20 04:04:06,135 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 04:04:06,136 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 04:04:06,188 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 04:04:06,193 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;@4be0d35c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 04:04:06,193 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 04:04:06,196 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 57 states have (on average 1.456140350877193) internal successors, (83), 58 states have internal predecessors, (83), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-20 04:04:06,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-20 04:04:06,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:04:06,209 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:04:06,209 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:04:06,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:04:06,213 INFO L85 PathProgramCache]: Analyzing trace with hash 756435362, now seen corresponding path program 1 times [2024-11-20 04:04:06,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:04:06,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575165209] [2024-11-20 04:04:06,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:04:06,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:04:06,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:06,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:04:06,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:06,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:04:06,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:06,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:04:06,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:06,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:04:06,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:06,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:04:06,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:06,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:04:06,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:06,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 04:04:06,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:06,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:04:06,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:06,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 04:04:06,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:06,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 04:04:06,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:06,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 04:04:06,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:06,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 04:04:06,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:06,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 04:04:06,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:06,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 04:04:06,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:06,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 04:04:06,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:06,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:04:06,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:06,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 04:04:06,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:06,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 04:04:06,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:06,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 04:04:06,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:06,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 04:04:06,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:06,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 04:04:06,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:06,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 04:04:06,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:06,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 04:04:06,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:06,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 04:04:06,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:06,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 04:04:06,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:06,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-20 04:04:06,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:04:06,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575165209] [2024-11-20 04:04:06,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575165209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:04:06,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:04:06,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 04:04:06,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830801334] [2024-11-20 04:04:06,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:04:06,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 04:04:06,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:04:06,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 04:04:06,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 04:04:06,665 INFO L87 Difference]: Start difference. First operand has 85 states, 57 states have (on average 1.456140350877193) internal successors, (83), 58 states have internal predecessors, (83), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-20 04:04:06,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:04:06,690 INFO L93 Difference]: Finished difference Result 163 states and 285 transitions. [2024-11-20 04:04:06,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 04:04:06,693 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 167 [2024-11-20 04:04:06,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:04:06,698 INFO L225 Difference]: With dead ends: 163 [2024-11-20 04:04:06,699 INFO L226 Difference]: Without dead ends: 81 [2024-11-20 04:04:06,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 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-20 04:04:06,706 INFO L432 NwaCegarLoop]: 126 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, 126 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-20 04:04:06,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 04:04:06,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-20 04:04:06,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-20 04:04:06,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 54 states have internal predecessors, (76), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-20 04:04:06,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 126 transitions. [2024-11-20 04:04:06,740 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 126 transitions. Word has length 167 [2024-11-20 04:04:06,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:04:06,742 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 126 transitions. [2024-11-20 04:04:06,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-20 04:04:06,743 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 126 transitions. [2024-11-20 04:04:06,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-20 04:04:06,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:04:06,747 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:04:06,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 04:04:06,747 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:04:06,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:04:06,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1461536544, now seen corresponding path program 1 times [2024-11-20 04:04:06,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:04:06,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430474905] [2024-11-20 04:04:06,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:04:06,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:04:06,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:07,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:04:07,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:07,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:04:07,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:07,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:04:07,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:07,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:04:07,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:07,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:04:07,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:07,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:04:07,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:07,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 04:04:07,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:07,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:04:07,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:07,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 04:04:07,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:07,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 04:04:07,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:07,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 04:04:07,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:07,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 04:04:07,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:07,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 04:04:07,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:07,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 04:04:07,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:07,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 04:04:07,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:07,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:04:07,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:07,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 04:04:07,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:07,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 04:04:07,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:07,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 04:04:07,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:07,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 04:04:07,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:07,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 04:04:07,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:07,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 04:04:07,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:07,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 04:04:07,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:07,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 04:04:07,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:07,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 04:04:07,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:07,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-20 04:04:07,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:04:07,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430474905] [2024-11-20 04:04:07,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430474905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:04:07,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:04:07,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 04:04:07,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497063032] [2024-11-20 04:04:07,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:04:07,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 04:04:07,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:04:07,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 04:04:07,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 04:04:07,171 INFO L87 Difference]: Start difference. First operand 81 states and 126 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-20 04:04:07,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:04:07,302 INFO L93 Difference]: Finished difference Result 200 states and 303 transitions. [2024-11-20 04:04:07,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 04:04:07,302 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 167 [2024-11-20 04:04:07,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:04:07,308 INFO L225 Difference]: With dead ends: 200 [2024-11-20 04:04:07,308 INFO L226 Difference]: Without dead ends: 122 [2024-11-20 04:04:07,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 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-20 04:04:07,309 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 69 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 04:04:07,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 319 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 04:04:07,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-20 04:04:07,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 99. [2024-11-20 04:04:07,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 69 states have (on average 1.4057971014492754) internal successors, (97), 70 states have internal predecessors, (97), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-20 04:04:07,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 151 transitions. [2024-11-20 04:04:07,338 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 151 transitions. Word has length 167 [2024-11-20 04:04:07,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:04:07,338 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 151 transitions. [2024-11-20 04:04:07,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-20 04:04:07,339 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 151 transitions. [2024-11-20 04:04:07,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-20 04:04:07,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:04:07,342 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:04:07,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 04:04:07,342 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:04:07,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:04:07,343 INFO L85 PathProgramCache]: Analyzing trace with hash -200664608, now seen corresponding path program 1 times [2024-11-20 04:04:07,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:04:07,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865053299] [2024-11-20 04:04:07,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:04:07,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:04:07,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:07,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:04:07,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:07,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:04:07,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:07,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:04:07,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:07,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:04:07,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:07,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:04:07,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:07,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:04:07,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:07,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 04:04:07,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:07,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:04:07,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:07,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 04:04:07,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:07,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 04:04:07,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:07,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 04:04:07,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:07,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 04:04:07,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:07,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 04:04:07,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:07,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 04:04:07,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:07,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 04:04:07,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:07,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:04:07,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:07,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 04:04:07,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:07,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 04:04:07,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:07,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 04:04:07,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:07,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 04:04:07,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:07,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 04:04:07,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:07,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 04:04:07,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:07,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 04:04:07,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:07,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 04:04:07,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:07,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 04:04:07,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:07,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-20 04:04:07,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:04:07,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865053299] [2024-11-20 04:04:07,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865053299] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:04:07,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:04:07,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 04:04:07,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430611942] [2024-11-20 04:04:07,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:04:07,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 04:04:07,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:04:07,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 04:04:07,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 04:04:07,738 INFO L87 Difference]: Start difference. First operand 99 states and 151 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-20 04:04:07,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:04:07,888 INFO L93 Difference]: Finished difference Result 289 states and 443 transitions. [2024-11-20 04:04:07,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 04:04:07,889 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 167 [2024-11-20 04:04:07,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:04:07,896 INFO L225 Difference]: With dead ends: 289 [2024-11-20 04:04:07,896 INFO L226 Difference]: Without dead ends: 193 [2024-11-20 04:04:07,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 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-20 04:04:07,898 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 87 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 04:04:07,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 361 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 04:04:07,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-20 04:04:07,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 150. [2024-11-20 04:04:07,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 93 states have (on average 1.3010752688172043) internal successors, (121), 94 states have internal predecessors, (121), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-20 04:04:07,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 225 transitions. [2024-11-20 04:04:07,934 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 225 transitions. Word has length 167 [2024-11-20 04:04:07,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:04:07,935 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 225 transitions. [2024-11-20 04:04:07,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-20 04:04:07,935 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 225 transitions. [2024-11-20 04:04:07,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-20 04:04:07,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:04:07,940 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:04:07,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 04:04:07,940 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:04:07,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:04:07,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1833825476, now seen corresponding path program 1 times [2024-11-20 04:04:07,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:04:07,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096366382] [2024-11-20 04:04:07,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:04:07,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:04:08,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:08,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:04:08,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:08,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:04:08,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:08,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:04:08,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:08,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:04:08,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:08,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:04:08,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:08,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:04:08,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:08,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 04:04:08,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:08,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:04:08,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:08,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 04:04:08,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:08,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 04:04:08,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:08,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 04:04:08,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:08,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 04:04:08,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:08,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 04:04:08,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:08,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 04:04:08,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:08,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 04:04:08,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:08,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:04:08,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:08,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 04:04:08,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:08,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 04:04:08,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:08,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 04:04:08,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:08,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 04:04:08,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:08,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 04:04:08,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:08,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 04:04:08,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:08,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 04:04:08,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:08,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 04:04:08,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:08,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 04:04:08,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:08,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-20 04:04:08,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:04:08,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096366382] [2024-11-20 04:04:08,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096366382] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:04:08,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:04:08,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 04:04:08,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811990358] [2024-11-20 04:04:08,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:04:08,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 04:04:08,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:04:08,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 04:04:08,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 04:04:08,191 INFO L87 Difference]: Start difference. First operand 150 states and 225 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-20 04:04:08,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:04:08,242 INFO L93 Difference]: Finished difference Result 251 states and 382 transitions. [2024-11-20 04:04:08,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 04:04:08,243 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 168 [2024-11-20 04:04:08,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:04:08,245 INFO L225 Difference]: With dead ends: 251 [2024-11-20 04:04:08,245 INFO L226 Difference]: Without dead ends: 155 [2024-11-20 04:04:08,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 04:04:08,250 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 3 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 04:04:08,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 330 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 04:04:08,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-20 04:04:08,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 152. [2024-11-20 04:04:08,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 95 states have (on average 1.305263157894737) internal successors, (124), 96 states have internal predecessors, (124), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-20 04:04:08,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 228 transitions. [2024-11-20 04:04:08,273 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 228 transitions. Word has length 168 [2024-11-20 04:04:08,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:04:08,274 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 228 transitions. [2024-11-20 04:04:08,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-20 04:04:08,274 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 228 transitions. [2024-11-20 04:04:08,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-20 04:04:08,275 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:04:08,276 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:04:08,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 04:04:08,276 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:04:08,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:04:08,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1781083450, now seen corresponding path program 1 times [2024-11-20 04:04:08,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:04:08,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524439912] [2024-11-20 04:04:08,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:04:08,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:04:08,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:08,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:04:08,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:08,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:04:08,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:08,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:04:08,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:08,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:04:08,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:08,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:04:08,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:08,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:04:08,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:08,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 04:04:08,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:08,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:04:08,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:08,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 04:04:08,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:08,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 04:04:08,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:08,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 04:04:08,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:08,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 04:04:08,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:08,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 04:04:08,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:08,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 04:04:08,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:08,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 04:04:08,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:08,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:04:08,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:08,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 04:04:08,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:08,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 04:04:08,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:08,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 04:04:08,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:08,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 04:04:08,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:08,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 04:04:08,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:08,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 04:04:08,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:08,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 04:04:08,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:08,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 04:04:08,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:08,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 04:04:08,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:08,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 27 proven. 45 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-20 04:04:08,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:04:08,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524439912] [2024-11-20 04:04:08,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524439912] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 04:04:08,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755218918] [2024-11-20 04:04:08,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:04:08,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:04:08,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:04:08,572 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-20 04:04:08,575 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-20 04:04:08,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:08,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 04:04:08,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:04:08,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 582 proven. 45 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2024-11-20 04:04:08,917 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 04:04:09,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 27 proven. 45 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-20 04:04:09,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755218918] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 04:04:09,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 04:04:09,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-20 04:04:09,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693487340] [2024-11-20 04:04:09,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 04:04:09,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 04:04:09,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:04:09,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 04:04:09,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 04:04:09,130 INFO L87 Difference]: Start difference. First operand 152 states and 228 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2024-11-20 04:04:09,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:04:09,329 INFO L93 Difference]: Finished difference Result 262 states and 389 transitions. [2024-11-20 04:04:09,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 04:04:09,330 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) Word has length 168 [2024-11-20 04:04:09,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:04:09,332 INFO L225 Difference]: With dead ends: 262 [2024-11-20 04:04:09,332 INFO L226 Difference]: Without dead ends: 164 [2024-11-20 04:04:09,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 382 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-20 04:04:09,334 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 52 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 04:04:09,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 287 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 04:04:09,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-20 04:04:09,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 160. [2024-11-20 04:04:09,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 101 states have (on average 1.2673267326732673) internal successors, (128), 102 states have internal predecessors, (128), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-20 04:04:09,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 232 transitions. [2024-11-20 04:04:09,358 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 232 transitions. Word has length 168 [2024-11-20 04:04:09,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:04:09,359 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 232 transitions. [2024-11-20 04:04:09,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2024-11-20 04:04:09,359 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 232 transitions. [2024-11-20 04:04:09,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-20 04:04:09,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:04:09,361 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:04:09,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-20 04:04:09,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:04:09,566 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:04:09,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:04:09,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1704537220, now seen corresponding path program 1 times [2024-11-20 04:04:09,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:04:09,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342975258] [2024-11-20 04:04:09,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:04:09,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:04:09,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 04:04:09,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1671543236] [2024-11-20 04:04:09,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:04:09,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:04:09,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:04:09,696 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-20 04:04:09,697 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-20 04:04:09,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:04:09,856 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-20 04:04:09,864 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:04:18,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 715 proven. 312 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2024-11-20 04:04:18,690 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 04:04:53,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:04:53,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342975258] [2024-11-20 04:04:53,126 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-20 04:04:53,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671543236] [2024-11-20 04:04:53,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671543236] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 04:04:53,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-20 04:04:53,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2024-11-20 04:04:53,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868873444] [2024-11-20 04:04:53,127 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-20 04:04:53,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-20 04:04:53,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:04:53,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-20 04:04:53,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=1539, Unknown=0, NotChecked=0, Total=1892 [2024-11-20 04:04:53,129 INFO L87 Difference]: Start difference. First operand 160 states and 232 transitions. Second operand has 30 states, 30 states have (on average 2.6333333333333333) internal successors, (79), 28 states have internal predecessors, (79), 9 states have call successors, (25), 9 states have call predecessors, (25), 12 states have return successors, (25), 9 states have call predecessors, (25), 9 states have call successors, (25) [2024-11-20 04:04:59,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-20 04:05:20,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:05:20,249 INFO L93 Difference]: Finished difference Result 551 states and 762 transitions. [2024-11-20 04:05:20,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-11-20 04:05:20,249 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.6333333333333333) internal successors, (79), 28 states have internal predecessors, (79), 9 states have call successors, (25), 9 states have call predecessors, (25), 12 states have return successors, (25), 9 states have call predecessors, (25), 9 states have call successors, (25) Word has length 168 [2024-11-20 04:05:20,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:05:20,254 INFO L225 Difference]: With dead ends: 551 [2024-11-20 04:05:20,254 INFO L226 Difference]: Without dead ends: 449 [2024-11-20 04:05:20,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 865 ImplicationChecksByTransitivity, 36.2s TimeCoverageRelationStatistics Valid=611, Invalid=2581, Unknown=0, NotChecked=0, Total=3192 [2024-11-20 04:05:20,258 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 696 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 1246 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 1258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1246 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.4s IncrementalHoareTripleChecker+Time [2024-11-20 04:05:20,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 593 Invalid, 1258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1246 Invalid, 1 Unknown, 0 Unchecked, 17.4s Time] [2024-11-20 04:05:20,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2024-11-20 04:05:20,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 216. [2024-11-20 04:05:20,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 145 states have (on average 1.193103448275862) internal successors, (173), 145 states have internal predecessors, (173), 50 states have call successors, (50), 20 states have call predecessors, (50), 20 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-20 04:05:20,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 273 transitions. [2024-11-20 04:05:20,300 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 273 transitions. Word has length 168 [2024-11-20 04:05:20,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:05:20,300 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 273 transitions. [2024-11-20 04:05:20,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.6333333333333333) internal successors, (79), 28 states have internal predecessors, (79), 9 states have call successors, (25), 9 states have call predecessors, (25), 12 states have return successors, (25), 9 states have call predecessors, (25), 9 states have call successors, (25) [2024-11-20 04:05:20,302 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 273 transitions. [2024-11-20 04:05:20,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-20 04:05:20,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:05:20,303 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:05:20,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-20 04:05:20,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-20 04:05:20,507 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:05:20,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:05:20,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1117731206, now seen corresponding path program 1 times [2024-11-20 04:05:20,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:05:20,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157469347] [2024-11-20 04:05:20,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:05:20,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:05:20,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:21,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:05:21,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:21,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:05:21,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:21,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:05:21,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:21,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:05:21,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:21,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:05:21,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:21,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:05:21,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:21,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 04:05:21,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:21,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:05:21,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:21,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 04:05:21,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:21,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 04:05:21,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:21,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 04:05:21,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:21,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 04:05:21,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:21,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 04:05:21,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:21,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 04:05:21,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:21,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 04:05:21,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:21,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:05:21,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:21,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 04:05:21,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:21,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 04:05:21,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:21,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 04:05:21,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:21,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 04:05:21,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:21,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 04:05:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:21,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 04:05:21,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:21,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 04:05:21,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:21,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 04:05:21,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:21,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 04:05:21,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:21,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 42 proven. 96 refuted. 0 times theorem prover too weak. 1062 trivial. 0 not checked. [2024-11-20 04:05:21,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:05:21,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157469347] [2024-11-20 04:05:21,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157469347] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 04:05:21,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023162192] [2024-11-20 04:05:21,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:05:21,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:05:21,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:05:21,251 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-20 04:05:21,251 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-20 04:05:21,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:21,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-20 04:05:21,352 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:05:22,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 652 proven. 144 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2024-11-20 04:05:22,355 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 04:05:26,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023162192] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 04:05:26,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 04:05:26,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16] total 22 [2024-11-20 04:05:26,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684925763] [2024-11-20 04:05:26,724 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 04:05:26,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-20 04:05:26,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:05:26,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-20 04:05:26,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=824, Unknown=0, NotChecked=0, Total=1056 [2024-11-20 04:05:26,726 INFO L87 Difference]: Start difference. First operand 216 states and 273 transitions. Second operand has 22 states, 22 states have (on average 4.2272727272727275) internal successors, (93), 21 states have internal predecessors, (93), 7 states have call successors, (49), 5 states have call predecessors, (49), 7 states have return successors, (49), 6 states have call predecessors, (49), 7 states have call successors, (49) [2024-11-20 04:05:28,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:05:28,707 INFO L93 Difference]: Finished difference Result 669 states and 878 transitions. [2024-11-20 04:05:28,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-11-20 04:05:28,707 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.2272727272727275) internal successors, (93), 21 states have internal predecessors, (93), 7 states have call successors, (49), 5 states have call predecessors, (49), 7 states have return successors, (49), 6 states have call predecessors, (49), 7 states have call successors, (49) Word has length 168 [2024-11-20 04:05:28,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:05:28,709 INFO L225 Difference]: With dead ends: 669 [2024-11-20 04:05:28,709 INFO L226 Difference]: Without dead ends: 539 [2024-11-20 04:05:28,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=680, Invalid=2626, Unknown=0, NotChecked=0, Total=3306 [2024-11-20 04:05:28,711 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 1004 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 1752 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1018 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 1815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-20 04:05:28,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1018 Valid, 838 Invalid, 1815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1752 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-20 04:05:28,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2024-11-20 04:05:28,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 313. [2024-11-20 04:05:28,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 216 states have (on average 1.2037037037037037) internal successors, (260), 217 states have internal predecessors, (260), 65 states have call successors, (65), 31 states have call predecessors, (65), 31 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-20 04:05:28,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 390 transitions. [2024-11-20 04:05:28,749 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 390 transitions. Word has length 168 [2024-11-20 04:05:28,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:05:28,750 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 390 transitions. [2024-11-20 04:05:28,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.2272727272727275) internal successors, (93), 21 states have internal predecessors, (93), 7 states have call successors, (49), 5 states have call predecessors, (49), 7 states have return successors, (49), 6 states have call predecessors, (49), 7 states have call successors, (49) [2024-11-20 04:05:28,750 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 390 transitions. [2024-11-20 04:05:28,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-20 04:05:28,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:05:28,751 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:05:28,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-20 04:05:28,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:05:28,956 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:05:28,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:05:28,956 INFO L85 PathProgramCache]: Analyzing trace with hash -289607486, now seen corresponding path program 1 times [2024-11-20 04:05:28,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:05:28,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518914616] [2024-11-20 04:05:28,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:05:28,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:05:29,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 04:05:29,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [866057450] [2024-11-20 04:05:29,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:05:29,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:05:29,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:05:29,037 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-20 04:05:29,038 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-20 04:05:29,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 04:05:29,136 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 04:05:29,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 04:05:29,276 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 04:05:29,278 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 04:05:29,279 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 04:05:29,290 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-20 04:05:29,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:05:29,485 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:05:29,572 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 04:05:29,577 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 04:05:29 BoogieIcfgContainer [2024-11-20 04:05:29,577 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 04:05:29,577 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 04:05:29,577 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 04:05:29,577 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 04:05:29,578 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:04:06" (3/4) ... [2024-11-20 04:05:29,580 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 04:05:29,580 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 04:05:29,581 INFO L158 Benchmark]: Toolchain (without parser) took 84312.83ms. Allocated memory was 169.9MB in the beginning and 331.4MB in the end (delta: 161.5MB). Free memory was 141.5MB in the beginning and 212.0MB in the end (delta: -70.4MB). Peak memory consumption was 91.0MB. Max. memory is 16.1GB. [2024-11-20 04:05:29,581 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 169.9MB. Free memory is still 142.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 04:05:29,581 INFO L158 Benchmark]: CACSL2BoogieTranslator took 312.82ms. Allocated memory is still 169.9MB. Free memory was 140.8MB in the beginning and 124.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 04:05:29,581 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.82ms. Allocated memory is still 169.9MB. Free memory was 124.0MB in the beginning and 121.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 04:05:29,582 INFO L158 Benchmark]: Boogie Preprocessor took 45.86ms. Allocated memory is still 169.9MB. Free memory was 121.1MB in the beginning and 117.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 04:05:29,582 INFO L158 Benchmark]: RCFGBuilder took 438.36ms. Allocated memory is still 169.9MB. Free memory was 117.7MB in the beginning and 94.6MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-20 04:05:29,582 INFO L158 Benchmark]: TraceAbstraction took 83459.74ms. Allocated memory was 169.9MB in the beginning and 331.4MB in the end (delta: 161.5MB). Free memory was 93.9MB in the beginning and 212.0MB in the end (delta: -118.1MB). Peak memory consumption was 42.8MB. Max. memory is 16.1GB. [2024-11-20 04:05:29,582 INFO L158 Benchmark]: Witness Printer took 3.26ms. Allocated memory is still 331.4MB. Free memory is still 212.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 04:05:29,583 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.15ms. Allocated memory is still 169.9MB. Free memory is still 142.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 312.82ms. Allocated memory is still 169.9MB. Free memory was 140.8MB in the beginning and 124.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.82ms. Allocated memory is still 169.9MB. Free memory was 124.0MB in the beginning and 121.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.86ms. Allocated memory is still 169.9MB. Free memory was 121.1MB in the beginning and 117.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 438.36ms. Allocated memory is still 169.9MB. Free memory was 117.7MB in the beginning and 94.6MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 83459.74ms. Allocated memory was 169.9MB in the beginning and 331.4MB in the end (delta: 161.5MB). Free memory was 93.9MB in the beginning and 212.0MB in the end (delta: -118.1MB). Peak memory consumption was 42.8MB. Max. memory is 16.1GB. * Witness Printer took 3.26ms. Allocated memory is still 331.4MB. Free memory is still 212.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 168, overapproximation of someBinaryFLOATComparisonOperation at line 168, overapproximation of someUnaryFLOAToperation at line 94. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -4; [L23] signed short int var_1_4 = 256; [L24] signed short int var_1_5 = 0; [L25] signed short int var_1_6 = 25; [L26] signed short int var_1_8 = 100; [L27] unsigned char var_1_9 = 1; [L28] signed short int var_1_10 = -4; [L29] unsigned char var_1_11 = 0; [L30] unsigned char var_1_12 = 0; [L31] unsigned char var_1_13 = 1; [L32] unsigned long int var_1_14 = 64; [L33] double var_1_15 = 10.3; [L34] double var_1_16 = 128.6; [L35] unsigned long int var_1_17 = 2600113953; [L36] float var_1_18 = 8.25; [L37] float var_1_19 = 31.5; [L38] float var_1_20 = 2.625; [L39] float var_1_21 = 999999999999999.2; [L40] float var_1_22 = 127.5; [L41] float var_1_23 = 4.8; [L42] float var_1_25 = 1000000.2; [L43] unsigned short int var_1_33 = 1; [L44] signed long int var_1_35 = 10; [L45] signed char var_1_36 = -16; [L46] signed char var_1_38 = 32; [L47] signed char var_1_39 = 5; [L48] signed long int var_1_40 = 32; [L49] signed char var_1_43 = -100; [L50] unsigned char last_1_var_1_9 = 1; VAL [isInitial=0, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=256, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L172] isInitial = 1 [L173] FCALL initially() [L174] COND TRUE 1 [L175] CALL updateLastVariables() [L165] last_1_var_1_9 = var_1_9 VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=256, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L175] RET updateLastVariables() [L176] CALL updateVariables() [L123] var_1_4 = __VERIFIER_nondet_short() [L124] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L124] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L125] CALL assume_abort_if_not(var_1_4 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L125] RET assume_abort_if_not(var_1_4 <= 16383) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L126] var_1_5 = __VERIFIER_nondet_short() [L127] CALL assume_abort_if_not(var_1_5 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L127] RET assume_abort_if_not(var_1_5 >= -1) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L128] CALL assume_abort_if_not(var_1_5 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L128] RET assume_abort_if_not(var_1_5 <= 32766) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L129] var_1_8 = __VERIFIER_nondet_short() [L130] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L130] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L131] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L131] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L132] var_1_10 = __VERIFIER_nondet_short() [L133] CALL assume_abort_if_not(var_1_10 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L133] RET assume_abort_if_not(var_1_10 >= -32768) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L134] CALL assume_abort_if_not(var_1_10 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L134] RET assume_abort_if_not(var_1_10 <= 32767) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L135] CALL assume_abort_if_not(var_1_10 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L135] RET assume_abort_if_not(var_1_10 != 0) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L136] var_1_11 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L137] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L138] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L138] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L139] var_1_12 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L140] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L141] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L141] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L142] var_1_15 = __VERIFIER_nondet_double() [L143] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L143] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L144] var_1_16 = __VERIFIER_nondet_double() [L145] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L145] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L146] var_1_17 = __VERIFIER_nondet_ulong() [L147] CALL assume_abort_if_not(var_1_17 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L147] RET assume_abort_if_not(var_1_17 >= 2147483647) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L148] CALL assume_abort_if_not(var_1_17 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L148] RET assume_abort_if_not(var_1_17 <= 4294967294) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L149] var_1_19 = __VERIFIER_nondet_float() [L150] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L150] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L151] var_1_20 = __VERIFIER_nondet_float() [L152] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_1=-4, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_1=-4, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L152] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_1=-4, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L153] var_1_21 = __VERIFIER_nondet_float() [L154] CALL assume_abort_if_not((var_1_21 >= -230584.3009213691390e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 2305843.009213691390e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_1=-4, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_1=-4, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L154] RET assume_abort_if_not((var_1_21 >= -230584.3009213691390e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 2305843.009213691390e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_1=-4, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L155] var_1_22 = __VERIFIER_nondet_float() [L156] CALL assume_abort_if_not((var_1_22 >= -230584.3009213691390e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L156] RET assume_abort_if_not((var_1_22 >= -230584.3009213691390e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L157] var_1_38 = __VERIFIER_nondet_char() [L158] CALL assume_abort_if_not(var_1_38 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L158] RET assume_abort_if_not(var_1_38 >= -127) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L159] CALL assume_abort_if_not(var_1_38 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L159] RET assume_abort_if_not(var_1_38 <= 126) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=5, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L160] var_1_39 = __VERIFIER_nondet_char() [L161] CALL assume_abort_if_not(var_1_39 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L161] RET assume_abort_if_not(var_1_39 >= -127) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L162] CALL assume_abort_if_not(var_1_39 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L162] RET assume_abort_if_not(var_1_39 <= 126) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L176] RET updateVariables() [L177] CALL step() [L54] COND TRUE \read(last_1_var_1_9) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=0, var_1_9=1] [L55] COND FALSE !(var_1_5 == var_1_4) [L58] var_1_6 = var_1_8 VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=0, var_1_8=0, var_1_9=1] [L63] COND FALSE !(-32 >= (var_1_5 - var_1_8)) [L70] var_1_18 = var_1_19 VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2147483649, var_1_18=2, var_1_19=2, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=0, var_1_8=0, var_1_9=1] [L72] COND TRUE var_1_18 < ((((var_1_18) > ((var_1_15 - var_1_16))) ? (var_1_18) : ((var_1_15 - var_1_16)))) [L73] var_1_14 = (var_1_17 - (var_1_8 + var_1_4)) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-2147483650, var_1_17=-2147483649, var_1_18=2, var_1_19=2, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=0, var_1_8=0, var_1_9=1] [L75] unsigned long int stepLocal_0 = var_1_14; VAL [isInitial=1, last_1_var_1_9=1, stepLocal_0=-2147483650, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-2147483650, var_1_17=-2147483649, var_1_18=2, var_1_19=2, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=0, var_1_8=0, var_1_9=1] [L76] COND FALSE !(((var_1_8 % var_1_10) * (8 + var_1_14)) >= stepLocal_0) [L79] var_1_9 = (! var_1_12) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-2147483650, var_1_17=-2147483649, var_1_18=2, var_1_19=2, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=0, var_1_8=0, var_1_9=1] [L81] COND TRUE var_1_18 > var_1_18 [L82] var_1_1 = ((((((2 + var_1_4)) < (var_1_5)) ? ((2 + var_1_4)) : (var_1_5))) - 2) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-2147483650, var_1_17=-2147483649, var_1_18=2, var_1_19=2, var_1_1=-2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=0, var_1_8=0, var_1_9=1] [L86] unsigned long int stepLocal_1 = (((var_1_14) < (var_1_5)) ? (var_1_14) : (var_1_5)); VAL [isInitial=1, last_1_var_1_9=1, stepLocal_1=0, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-2147483650, var_1_17=-2147483649, var_1_18=2, var_1_19=2, var_1_1=-2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=0, var_1_8=0, var_1_9=1] [L87] COND TRUE ((var_1_8 * var_1_1) + var_1_4) >= stepLocal_1 [L88] var_1_13 = var_1_12 VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-2147483650, var_1_17=-2147483649, var_1_18=2, var_1_19=2, var_1_1=-2, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=0, var_1_8=0, var_1_9=1] [L90] COND TRUE var_1_8 > -64 [L91] var_1_23 = ((((49.2f) > (63.125f)) ? (49.2f) : (63.125f))) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-2147483650, var_1_17=-2147483649, var_1_18=2, var_1_19=2, var_1_1=-2, var_1_23=246/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=0, var_1_8=0, var_1_9=1] [L93] COND TRUE var_1_4 >= var_1_8 [L94] var_1_25 = (((((((((((9.999999999999962E13f) < (var_1_19)) ? (9.999999999999962E13f) : (var_1_19))) < 0 ) ? -((((9.999999999999962E13f) < (var_1_19)) ? (9.999999999999962E13f) : (var_1_19))) : ((((9.999999999999962E13f) < (var_1_19)) ? (9.999999999999962E13f) : (var_1_19)))))) > (((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))))) ? ((((((((9.999999999999962E13f) < (var_1_19)) ? (9.999999999999962E13f) : (var_1_19))) < 0 ) ? -((((9.999999999999962E13f) < (var_1_19)) ? (9.999999999999962E13f) : (var_1_19))) : ((((9.999999999999962E13f) < (var_1_19)) ? (9.999999999999962E13f) : (var_1_19)))))) : (((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22)))))) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-2147483650, var_1_17=-2147483649, var_1_18=2, var_1_19=2, var_1_1=-2, var_1_22=0, var_1_23=246/5, var_1_25=3, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=0, var_1_8=0, var_1_9=1] [L98] var_1_33 = var_1_8 VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-2147483650, var_1_17=-2147483649, var_1_18=2, var_1_19=2, var_1_1=-2, var_1_22=0, var_1_23=246/5, var_1_25=3, var_1_33=0, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=0, var_1_8=0, var_1_9=1] [L99] EXPR var_1_14 >> var_1_8 VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-2147483650, var_1_17=-2147483649, var_1_18=2, var_1_19=2, var_1_1=-2, var_1_22=0, var_1_23=246/5, var_1_25=3, var_1_33=0, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=0, var_1_8=0, var_1_9=1] [L99] EXPR var_1_5 ^ (var_1_14 >> var_1_8) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-2147483650, var_1_17=-2147483649, var_1_18=2, var_1_19=2, var_1_1=-2, var_1_22=0, var_1_23=246/5, var_1_25=3, var_1_33=0, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=0, var_1_8=0, var_1_9=1] [L99] COND FALSE !((var_1_5 ^ (var_1_14 >> var_1_8)) < var_1_14) [L102] COND FALSE !(! var_1_11) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-2147483650, var_1_17=-2147483649, var_1_18=2, var_1_19=2, var_1_1=-2, var_1_22=0, var_1_23=246/5, var_1_25=3, var_1_33=0, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=0, var_1_8=0, var_1_9=1] [L105] COND TRUE var_1_14 >= var_1_5 VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-2147483650, var_1_17=-2147483649, var_1_18=2, var_1_19=2, var_1_1=-2, var_1_22=0, var_1_23=246/5, var_1_25=3, var_1_33=0, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=0, var_1_8=0, var_1_9=1] [L106] COND TRUE var_1_22 >= (var_1_16 - var_1_15) [L107] var_1_40 = ((((((((((-4) < 0 ) ? -(-4) : (-4))) < 0 ) ? -((((-4) < 0 ) ? -(-4) : (-4))) : ((((-4) < 0 ) ? -(-4) : (-4))))) < 0 ) ? -(((((((-4) < 0 ) ? -(-4) : (-4))) < 0 ) ? -((((-4) < 0 ) ? -(-4) : (-4))) : ((((-4) < 0 ) ? -(-4) : (-4))))) : (((((((-4) < 0 ) ? -(-4) : (-4))) < 0 ) ? -((((-4) < 0 ) ? -(-4) : (-4))) : ((((-4) < 0 ) ? -(-4) : (-4))))))) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-2147483650, var_1_17=-2147483649, var_1_18=2, var_1_19=2, var_1_1=-2, var_1_22=0, var_1_23=246/5, var_1_25=3, var_1_33=0, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=4, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=0, var_1_8=0, var_1_9=1] [L114] COND FALSE !((var_1_38 < var_1_8) && (var_1_21 != var_1_16)) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-2147483650, var_1_17=-2147483649, var_1_18=2, var_1_19=2, var_1_1=-2, var_1_22=0, var_1_23=246/5, var_1_25=3, var_1_33=0, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=4, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=0, var_1_8=0, var_1_9=1] [L177] RET step() [L178] CALL, EXPR property() [L168-L169] return ((((((var_1_18 > var_1_18) ? (var_1_1 == ((signed short int) ((((((2 + var_1_4)) < (var_1_5)) ? ((2 + var_1_4)) : (var_1_5))) - 2))) : (var_1_1 == ((signed short int) var_1_4))) && (last_1_var_1_9 ? ((var_1_5 == var_1_4) ? (var_1_6 == ((signed short int) ((((((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))) < ((var_1_4 - var_1_8))) ? (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))) : ((var_1_4 - var_1_8)))))) : (var_1_6 == ((signed short int) var_1_8))) : (var_1_6 == ((signed short int) var_1_4)))) && ((((var_1_8 % var_1_10) * (8 + var_1_14)) >= var_1_14) ? (var_1_9 == ((unsigned char) ((! var_1_11) || var_1_12))) : (var_1_9 == ((unsigned char) (! var_1_12))))) && ((((var_1_8 * var_1_1) + var_1_4) >= ((((var_1_14) < (var_1_5)) ? (var_1_14) : (var_1_5)))) ? (var_1_13 == ((unsigned char) var_1_12)) : 1)) && ((var_1_18 < ((((var_1_18) > ((var_1_15 - var_1_16))) ? (var_1_18) : ((var_1_15 - var_1_16))))) ? (var_1_14 == ((unsigned long int) (var_1_17 - (var_1_8 + var_1_4)))) : 1)) && ((-32 >= (var_1_5 - var_1_8)) ? ((var_1_10 > var_1_6) ? (var_1_18 == ((float) ((var_1_19 - var_1_20) + (var_1_21 + var_1_22)))) : (var_1_18 == ((float) var_1_20))) : (var_1_18 == ((float) var_1_19))) ; VAL [\result=0, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-2147483650, var_1_17=-2147483649, var_1_18=2, var_1_19=2, var_1_1=-2, var_1_22=0, var_1_23=246/5, var_1_25=3, var_1_33=0, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=4, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=0, var_1_8=0, var_1_9=1] [L178] RET, EXPR property() [L178] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-2147483650, var_1_17=-2147483649, var_1_18=2, var_1_19=2, var_1_1=-2, var_1_22=0, var_1_23=246/5, var_1_25=3, var_1_33=0, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=4, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=0, var_1_8=0, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-2147483650, var_1_17=-2147483649, var_1_18=2, var_1_19=2, var_1_1=-2, var_1_22=0, var_1_23=246/5, var_1_25=3, var_1_33=0, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=4, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=0, var_1_8=0, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 83.3s, OverallIterations: 8, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 29.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 1936 SdHoareTripleChecker+Valid, 18.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1911 mSDsluCounter, 2854 SdHoareTripleChecker+Invalid, 18.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2044 mSDsCounter, 162 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3337 IncrementalHoareTripleChecker+Invalid, 3500 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 162 mSolverCounterUnsat, 810 mSDtfsCounter, 3337 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1234 GetRequests, 1106 SyntacticMatches, 1 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1607 ImplicationChecksByTransitivity, 41.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=313occurred in iteration=7, InterpolantAutomatonStates: 102, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 532 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 51.1s InterpolantComputationTime, 2013 NumberOfCodeBlocks, 2013 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1667 ConstructedInterpolants, 7 QuantifiedInterpolants, 9474 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1174 ConjunctsInSsa, 95 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 11313/12000 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-20 04:05:29,692 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-54.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 013cee657358eefc857795aa5f6e32aab15d5145c28e4306b26dd7ea01ffb375 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 04:05:31,381 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 04:05:31,440 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 04:05:31,445 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 04:05:31,445 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 04:05:31,475 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 04:05:31,477 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 04:05:31,477 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 04:05:31,477 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 04:05:31,477 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 04:05:31,478 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 04:05:31,478 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 04:05:31,478 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 04:05:31,479 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 04:05:31,479 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 04:05:31,479 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 04:05:31,479 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 04:05:31,480 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 04:05:31,480 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 04:05:31,480 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 04:05:31,480 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 04:05:31,483 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 04:05:31,484 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 04:05:31,484 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 04:05:31,484 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 04:05:31,484 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 04:05:31,484 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 04:05:31,484 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 04:05:31,485 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 04:05:31,485 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 04:05:31,485 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 04:05:31,485 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 04:05:31,485 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 04:05:31,486 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 04:05:31,486 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 04:05:31,486 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 04:05:31,486 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 04:05:31,486 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 04:05:31,486 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 04:05:31,487 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 04:05:31,487 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 04:05:31,489 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 04:05:31,489 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 04:05:31,490 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 04:05:31,490 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 -> 013cee657358eefc857795aa5f6e32aab15d5145c28e4306b26dd7ea01ffb375 [2024-11-20 04:05:31,726 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 04:05:31,742 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 04:05:31,745 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 04:05:31,746 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 04:05:31,746 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 04:05:31,747 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-54.i [2024-11-20 04:05:33,064 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 04:05:33,247 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 04:05:33,248 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-54.i [2024-11-20 04:05:33,258 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2682ce73/ba991682108b4db680eba0d25d28faab/FLAGa1b1621be [2024-11-20 04:05:33,273 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2682ce73/ba991682108b4db680eba0d25d28faab [2024-11-20 04:05:33,275 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 04:05:33,277 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 04:05:33,278 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 04:05:33,278 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 04:05:33,283 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 04:05:33,283 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:05:33" (1/1) ... [2024-11-20 04:05:33,284 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10251fd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:33, skipping insertion in model container [2024-11-20 04:05:33,284 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:05:33" (1/1) ... [2024-11-20 04:05:33,311 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 04:05:33,454 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_fillercodestructure_filler-pe-ci_file-54.i[919,932] [2024-11-20 04:05:33,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 04:05:33,543 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 04:05:33,556 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_fillercodestructure_filler-pe-ci_file-54.i[919,932] [2024-11-20 04:05:33,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 04:05:33,616 INFO L204 MainTranslator]: Completed translation [2024-11-20 04:05:33,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:33 WrapperNode [2024-11-20 04:05:33,617 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 04:05:33,617 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 04:05:33,618 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 04:05:33,618 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 04:05:33,623 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:33" (1/1) ... [2024-11-20 04:05:33,633 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:33" (1/1) ... [2024-11-20 04:05:33,669 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 175 [2024-11-20 04:05:33,669 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 04:05:33,670 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 04:05:33,670 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 04:05:33,670 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 04:05:33,683 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:33" (1/1) ... [2024-11-20 04:05:33,684 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:33" (1/1) ... [2024-11-20 04:05:33,687 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:33" (1/1) ... [2024-11-20 04:05:33,702 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-20 04:05:33,703 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:33" (1/1) ... [2024-11-20 04:05:33,703 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:33" (1/1) ... [2024-11-20 04:05:33,719 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:33" (1/1) ... [2024-11-20 04:05:33,722 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:33" (1/1) ... [2024-11-20 04:05:33,729 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:33" (1/1) ... [2024-11-20 04:05:33,730 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:33" (1/1) ... [2024-11-20 04:05:33,737 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 04:05:33,738 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 04:05:33,738 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 04:05:33,738 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 04:05:33,739 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:33" (1/1) ... [2024-11-20 04:05:33,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 04:05:33,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:05:33,772 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-20 04:05:33,775 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-20 04:05:33,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 04:05:33,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 04:05:33,807 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 04:05:33,808 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 04:05:33,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 04:05:33,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 04:05:33,871 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 04:05:33,873 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation