./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_fillercodesize_ps-cn-10_file-96.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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_fillercodesize_ps-cn-10_file-96.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 e3ddf029d6c8d316304cb4ddcdbc5422251d87289b8ada843d8e8cc5a57a2c2d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 06:11:21,424 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 06:11:21,530 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 06:11:21,536 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 06:11:21,539 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 06:11:21,571 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 06:11:21,574 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 06:11:21,574 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 06:11:21,575 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 06:11:21,576 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 06:11:21,576 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 06:11:21,577 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 06:11:21,577 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 06:11:21,578 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 06:11:21,580 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 06:11:21,580 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 06:11:21,581 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 06:11:21,581 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 06:11:21,581 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 06:11:21,582 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 06:11:21,582 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 06:11:21,587 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 06:11:21,587 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 06:11:21,588 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 06:11:21,588 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 06:11:21,588 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 06:11:21,588 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 06:11:21,589 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 06:11:21,589 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 06:11:21,589 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 06:11:21,590 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 06:11:21,590 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 06:11:21,590 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:11:21,591 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 06:11:21,591 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 06:11:21,592 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 06:11:21,592 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 06:11:21,592 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 06:11:21,593 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 06:11:21,593 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 06:11:21,593 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 06:11:21,594 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 06:11:21,594 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 -> e3ddf029d6c8d316304cb4ddcdbc5422251d87289b8ada843d8e8cc5a57a2c2d [2024-10-24 06:11:21,854 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 06:11:21,881 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 06:11:21,885 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 06:11:21,886 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 06:11:21,887 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 06:11:21,888 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-96.i [2024-10-24 06:11:23,378 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 06:11:23,586 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 06:11:23,587 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-96.i [2024-10-24 06:11:23,600 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3cba6bc0/0ffad12a992c4d3aba5cafddf6672573/FLAGca27c37ce [2024-10-24 06:11:23,953 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3cba6bc0/0ffad12a992c4d3aba5cafddf6672573 [2024-10-24 06:11:23,955 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 06:11:23,956 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 06:11:23,957 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 06:11:23,957 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 06:11:23,961 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 06:11:23,962 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:11:23" (1/1) ... [2024-10-24 06:11:23,963 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8b93aaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:23, skipping insertion in model container [2024-10-24 06:11:23,963 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:11:23" (1/1) ... [2024-10-24 06:11:23,991 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 06:11:24,194 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-96.i[915,928] [2024-10-24 06:11:24,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:11:24,335 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 06:11:24,345 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-96.i[915,928] [2024-10-24 06:11:24,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:11:24,396 INFO L204 MainTranslator]: Completed translation [2024-10-24 06:11:24,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:24 WrapperNode [2024-10-24 06:11:24,397 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 06:11:24,398 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 06:11:24,398 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 06:11:24,398 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 06:11:24,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:24" (1/1) ... [2024-10-24 06:11:24,420 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:24" (1/1) ... [2024-10-24 06:11:24,468 INFO L138 Inliner]: procedures = 26, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 207 [2024-10-24 06:11:24,468 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 06:11:24,469 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 06:11:24,469 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 06:11:24,469 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 06:11:24,480 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:24" (1/1) ... [2024-10-24 06:11:24,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:24" (1/1) ... [2024-10-24 06:11:24,484 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:24" (1/1) ... [2024-10-24 06:11:24,510 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-10-24 06:11:24,512 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:24" (1/1) ... [2024-10-24 06:11:24,512 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:24" (1/1) ... [2024-10-24 06:11:24,522 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:24" (1/1) ... [2024-10-24 06:11:24,525 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:24" (1/1) ... [2024-10-24 06:11:24,527 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:24" (1/1) ... [2024-10-24 06:11:24,529 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:24" (1/1) ... [2024-10-24 06:11:24,533 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 06:11:24,534 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 06:11:24,534 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 06:11:24,535 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 06:11:24,535 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:24" (1/1) ... [2024-10-24 06:11:24,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:11:24,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:11:24,576 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-10-24 06:11:24,581 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-10-24 06:11:24,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 06:11:24,620 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 06:11:24,621 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 06:11:24,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 06:11:24,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 06:11:24,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 06:11:24,698 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 06:11:24,700 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 06:11:25,057 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-24 06:11:25,057 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 06:11:25,118 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 06:11:25,118 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 06:11:25,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:11:25 BoogieIcfgContainer [2024-10-24 06:11:25,119 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 06:11:25,123 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 06:11:25,123 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 06:11:25,126 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 06:11:25,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 06:11:23" (1/3) ... [2024-10-24 06:11:25,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c19bb14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:11:25, skipping insertion in model container [2024-10-24 06:11:25,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:24" (2/3) ... [2024-10-24 06:11:25,129 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c19bb14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:11:25, skipping insertion in model container [2024-10-24 06:11:25,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:11:25" (3/3) ... [2024-10-24 06:11:25,131 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-96.i [2024-10-24 06:11:25,149 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 06:11:25,149 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 06:11:25,216 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 06:11:25,222 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;@741c81e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 06:11:25,223 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 06:11:25,227 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 48 states have internal predecessors, (65), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-24 06:11:25,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-10-24 06:11:25,244 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:11:25,245 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 06:11:25,246 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:11:25,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:11:25,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1549707772, now seen corresponding path program 1 times [2024-10-24 06:11:25,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:11:25,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559020182] [2024-10-24 06:11:25,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:11:25,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:11:25,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:25,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:11:25,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:25,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:11:25,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:25,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:11:25,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:25,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:11:25,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:25,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:11:25,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:25,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:11:25,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:25,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:11:25,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:25,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 06:11:25,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:25,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 06:11:25,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:25,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 06:11:25,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:25,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 06:11:25,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:25,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 06:11:25,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:25,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 06:11:25,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:25,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 06:11:25,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:25,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 06:11:25,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:25,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 06:11:25,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:25,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 06:11:25,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:25,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 06:11:25,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:25,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 06:11:25,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:25,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 06:11:25,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:25,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 06:11:25,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:25,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 06:11:25,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:25,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 06:11:25,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:25,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 06:11:25,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:25,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 06:11:25,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:25,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 06:11:25,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:25,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 06:11:25,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:25,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 06:11:25,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:25,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 06:11:25,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:25,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 06:11:25,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:25,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 06:11:25,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:25,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-24 06:11:25,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:25,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-24 06:11:25,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:25,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-24 06:11:25,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:25,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-24 06:11:25,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:25,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-24 06:11:25,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:11:25,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559020182] [2024-10-24 06:11:25,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559020182] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:11:25,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:11:25,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 06:11:25,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021992792] [2024-10-24 06:11:25,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:11:25,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 06:11:25,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:11:25,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 06:11:25,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 06:11:25,864 INFO L87 Difference]: Start difference. First operand has 85 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 48 states have internal predecessors, (65), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2024-10-24 06:11:25,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:11:25,904 INFO L93 Difference]: Finished difference Result 164 states and 297 transitions. [2024-10-24 06:11:25,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 06:11:25,906 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) Word has length 211 [2024-10-24 06:11:25,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:11:25,914 INFO L225 Difference]: With dead ends: 164 [2024-10-24 06:11:25,914 INFO L226 Difference]: Without dead ends: 80 [2024-10-24 06:11:25,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 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-10-24 06:11:25,921 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 06:11:25,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 06:11:25,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-24 06:11:25,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-10-24 06:11:25,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 43 states have internal predecessors, (52), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-24 06:11:25,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 122 transitions. [2024-10-24 06:11:25,975 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 122 transitions. Word has length 211 [2024-10-24 06:11:25,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:11:25,975 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 122 transitions. [2024-10-24 06:11:25,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2024-10-24 06:11:25,976 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 122 transitions. [2024-10-24 06:11:25,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-10-24 06:11:25,982 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:11:25,982 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 06:11:25,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 06:11:25,983 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:11:25,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:11:25,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1945529590, now seen corresponding path program 1 times [2024-10-24 06:11:25,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:11:25,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640056379] [2024-10-24 06:11:25,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:11:25,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:11:26,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:26,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:11:26,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:26,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:11:26,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:26,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:11:26,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:26,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:11:26,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:26,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:11:26,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:26,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:11:26,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:26,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:11:26,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:26,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 06:11:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:26,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 06:11:26,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:26,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 06:11:26,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:26,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 06:11:26,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:26,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 06:11:26,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:26,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 06:11:26,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:26,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 06:11:26,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:26,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 06:11:26,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:26,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 06:11:26,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:26,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 06:11:26,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:26,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 06:11:26,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:26,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 06:11:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:26,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 06:11:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:26,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 06:11:26,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:26,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 06:11:26,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:26,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 06:11:26,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:26,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 06:11:26,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:26,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 06:11:26,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:26,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 06:11:26,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:26,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 06:11:26,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:26,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 06:11:26,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:26,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 06:11:26,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:26,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 06:11:26,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:26,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 06:11:26,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:26,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-24 06:11:26,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:26,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-24 06:11:26,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:26,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-24 06:11:26,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:26,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-24 06:11:26,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:26,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-24 06:11:26,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:11:26,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640056379] [2024-10-24 06:11:26,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640056379] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:11:26,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:11:26,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 06:11:26,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605599559] [2024-10-24 06:11:26,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:11:26,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 06:11:26,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:11:26,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 06:11:26,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:11:26,495 INFO L87 Difference]: Start difference. First operand 80 states and 122 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-24 06:11:26,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:11:26,548 INFO L93 Difference]: Finished difference Result 160 states and 245 transitions. [2024-10-24 06:11:26,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 06:11:26,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 211 [2024-10-24 06:11:26,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:11:26,555 INFO L225 Difference]: With dead ends: 160 [2024-10-24 06:11:26,555 INFO L226 Difference]: Without dead ends: 81 [2024-10-24 06:11:26,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:11:26,557 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 06:11:26,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 232 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 06:11:26,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-24 06:11:26,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-10-24 06:11:26,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 44 states have internal predecessors, (53), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-24 06:11:26,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 123 transitions. [2024-10-24 06:11:26,584 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 123 transitions. Word has length 211 [2024-10-24 06:11:26,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:11:26,587 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 123 transitions. [2024-10-24 06:11:26,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-24 06:11:26,587 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 123 transitions. [2024-10-24 06:11:26,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-10-24 06:11:26,593 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:11:26,593 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 06:11:26,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 06:11:26,594 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:11:26,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:11:26,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1687364152, now seen corresponding path program 1 times [2024-10-24 06:11:26,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:11:26,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609805969] [2024-10-24 06:11:26,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:11:26,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:11:26,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:26,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:11:26,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:26,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:11:26,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:26,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:11:26,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:26,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:11:26,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:26,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:11:26,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:26,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:11:26,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:26,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:11:26,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:26,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 06:11:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:26,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 06:11:26,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:26,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 06:11:26,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:26,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 06:11:26,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:26,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 06:11:26,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:26,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 06:11:27,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:27,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 06:11:27,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:27,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 06:11:27,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:27,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 06:11:27,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:27,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 06:11:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:27,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 06:11:27,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:27,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 06:11:27,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:27,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 06:11:27,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:27,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 06:11:27,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:27,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 06:11:27,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:27,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 06:11:27,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:27,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 06:11:27,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:27,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 06:11:27,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:27,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 06:11:27,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:27,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 06:11:27,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:27,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 06:11:27,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:27,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 06:11:27,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:27,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 06:11:27,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:27,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 06:11:27,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:27,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-24 06:11:27,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:27,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-24 06:11:27,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:27,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-24 06:11:27,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:27,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-24 06:11:27,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:27,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-24 06:11:27,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:11:27,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609805969] [2024-10-24 06:11:27,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609805969] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:11:27,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:11:27,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 06:11:27,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967245691] [2024-10-24 06:11:27,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:11:27,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 06:11:27,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:11:27,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 06:11:27,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 06:11:27,163 INFO L87 Difference]: Start difference. First operand 81 states and 123 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-24 06:11:27,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:11:27,422 INFO L93 Difference]: Finished difference Result 242 states and 368 transitions. [2024-10-24 06:11:27,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 06:11:27,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 211 [2024-10-24 06:11:27,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:11:27,428 INFO L225 Difference]: With dead ends: 242 [2024-10-24 06:11:27,430 INFO L226 Difference]: Without dead ends: 162 [2024-10-24 06:11:27,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 73 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-10-24 06:11:27,435 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 66 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 06:11:27,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 349 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 06:11:27,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-10-24 06:11:27,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 148. [2024-10-24 06:11:27,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 75 states have (on average 1.16) internal successors, (87), 75 states have internal predecessors, (87), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-24 06:11:27,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 227 transitions. [2024-10-24 06:11:27,497 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 227 transitions. Word has length 211 [2024-10-24 06:11:27,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:11:27,497 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 227 transitions. [2024-10-24 06:11:27,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-24 06:11:27,498 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 227 transitions. [2024-10-24 06:11:27,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-10-24 06:11:27,501 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:11:27,502 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 06:11:27,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 06:11:27,502 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:11:27,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:11:27,503 INFO L85 PathProgramCache]: Analyzing trace with hash -986299574, now seen corresponding path program 1 times [2024-10-24 06:11:27,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:11:27,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522103047] [2024-10-24 06:11:27,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:11:27,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:11:27,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:27,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:11:27,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:27,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:11:27,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:27,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:11:27,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:27,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:11:27,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:27,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:11:27,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:27,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:11:27,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:27,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:11:27,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:27,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 06:11:27,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:27,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 06:11:27,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:27,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 06:11:27,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:27,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 06:11:27,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:28,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 06:11:28,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:28,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 06:11:28,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:28,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 06:11:28,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:28,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 06:11:28,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:28,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 06:11:28,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:28,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 06:11:28,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:28,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 06:11:28,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:28,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 06:11:28,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:28,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 06:11:28,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:28,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 06:11:28,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:28,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 06:11:28,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:28,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 06:11:28,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:28,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 06:11:28,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:28,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 06:11:28,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:28,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 06:11:28,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:28,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 06:11:28,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:28,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 06:11:28,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:28,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 06:11:28,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:28,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 06:11:28,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:28,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 06:11:28,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:28,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-24 06:11:28,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:28,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-24 06:11:28,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:28,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-24 06:11:28,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:28,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-24 06:11:28,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:28,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 30 proven. 72 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2024-10-24 06:11:28,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:11:28,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522103047] [2024-10-24 06:11:28,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522103047] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 06:11:28,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380057956] [2024-10-24 06:11:28,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:11:28,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 06:11:28,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:11:28,142 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-10-24 06:11:28,144 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-10-24 06:11:28,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:28,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-24 06:11:28,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:11:29,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 1502 proven. 177 refuted. 0 times theorem prover too weak. 701 trivial. 0 not checked. [2024-10-24 06:11:29,521 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 06:11:30,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 84 proven. 117 refuted. 0 times theorem prover too weak. 2179 trivial. 0 not checked. [2024-10-24 06:11:30,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380057956] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 06:11:30,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 06:11:30,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 9] total 21 [2024-10-24 06:11:30,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554349785] [2024-10-24 06:11:30,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 06:11:30,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-24 06:11:30,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:11:30,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-24 06:11:30,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2024-10-24 06:11:30,030 INFO L87 Difference]: Start difference. First operand 148 states and 227 transitions. Second operand has 21 states, 21 states have (on average 5.333333333333333) internal successors, (112), 21 states have internal predecessors, (112), 7 states have call successors, (83), 4 states have call predecessors, (83), 8 states have return successors, (84), 7 states have call predecessors, (84), 7 states have call successors, (84) [2024-10-24 06:11:31,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:11:31,342 INFO L93 Difference]: Finished difference Result 368 states and 518 transitions. [2024-10-24 06:11:31,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-10-24 06:11:31,343 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.333333333333333) internal successors, (112), 21 states have internal predecessors, (112), 7 states have call successors, (83), 4 states have call predecessors, (83), 8 states have return successors, (84), 7 states have call predecessors, (84), 7 states have call successors, (84) Word has length 211 [2024-10-24 06:11:31,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:11:31,349 INFO L225 Difference]: With dead ends: 368 [2024-10-24 06:11:31,349 INFO L226 Difference]: Without dead ends: 288 [2024-10-24 06:11:31,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 484 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=679, Invalid=1577, Unknown=0, NotChecked=0, Total=2256 [2024-10-24 06:11:31,356 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 191 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 06:11:31,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 512 Invalid, 974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 06:11:31,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-10-24 06:11:31,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 262. [2024-10-24 06:11:31,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 140 states have (on average 1.0928571428571427) internal successors, (153), 141 states have internal predecessors, (153), 105 states have call successors, (105), 16 states have call predecessors, (105), 16 states have return successors, (105), 104 states have call predecessors, (105), 105 states have call successors, (105) [2024-10-24 06:11:31,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 363 transitions. [2024-10-24 06:11:31,424 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 363 transitions. Word has length 211 [2024-10-24 06:11:31,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:11:31,425 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 363 transitions. [2024-10-24 06:11:31,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.333333333333333) internal successors, (112), 21 states have internal predecessors, (112), 7 states have call successors, (83), 4 states have call predecessors, (83), 8 states have return successors, (84), 7 states have call predecessors, (84), 7 states have call successors, (84) [2024-10-24 06:11:31,426 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 363 transitions. [2024-10-24 06:11:31,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-10-24 06:11:31,430 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:11:31,430 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 06:11:31,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 06:11:31,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 06:11:31,631 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:11:31,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:11:31,632 INFO L85 PathProgramCache]: Analyzing trace with hash -986239992, now seen corresponding path program 1 times [2024-10-24 06:11:31,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:11:31,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800605912] [2024-10-24 06:11:31,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:11:31,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:11:31,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 06:11:31,737 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 06:11:31,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 06:11:31,897 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 06:11:31,897 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 06:11:31,898 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 06:11:31,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 06:11:31,902 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-24 06:11:32,051 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 06:11:32,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 06:11:32 BoogieIcfgContainer [2024-10-24 06:11:32,055 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 06:11:32,056 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 06:11:32,056 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 06:11:32,056 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 06:11:32,057 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:11:25" (3/4) ... [2024-10-24 06:11:32,058 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 06:11:32,059 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 06:11:32,060 INFO L158 Benchmark]: Toolchain (without parser) took 8103.65ms. Allocated memory was 163.6MB in the beginning and 257.9MB in the end (delta: 94.4MB). Free memory was 109.4MB in the beginning and 106.0MB in the end (delta: 3.4MB). Peak memory consumption was 96.6MB. Max. memory is 16.1GB. [2024-10-24 06:11:32,060 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 94.4MB. Free memory is still 53.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 06:11:32,060 INFO L158 Benchmark]: CACSL2BoogieTranslator took 440.13ms. Allocated memory is still 163.6MB. Free memory was 109.4MB in the beginning and 129.4MB in the end (delta: -20.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-24 06:11:32,060 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.75ms. Allocated memory is still 163.6MB. Free memory was 129.4MB in the beginning and 125.3MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 06:11:32,060 INFO L158 Benchmark]: Boogie Preprocessor took 64.28ms. Allocated memory is still 163.6MB. Free memory was 125.3MB in the beginning and 119.8MB in the end (delta: 5.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 06:11:32,061 INFO L158 Benchmark]: RCFGBuilder took 584.54ms. Allocated memory is still 163.6MB. Free memory was 119.8MB in the beginning and 92.5MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-24 06:11:32,061 INFO L158 Benchmark]: TraceAbstraction took 6932.27ms. Allocated memory was 163.6MB in the beginning and 257.9MB in the end (delta: 94.4MB). Free memory was 91.7MB in the beginning and 106.0MB in the end (delta: -14.3MB). Peak memory consumption was 80.9MB. Max. memory is 16.1GB. [2024-10-24 06:11:32,061 INFO L158 Benchmark]: Witness Printer took 3.21ms. Allocated memory is still 257.9MB. Free memory is still 106.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 06:11:32,063 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.17ms. Allocated memory is still 94.4MB. Free memory is still 53.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 440.13ms. Allocated memory is still 163.6MB. Free memory was 109.4MB in the beginning and 129.4MB in the end (delta: -20.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.75ms. Allocated memory is still 163.6MB. Free memory was 129.4MB in the beginning and 125.3MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.28ms. Allocated memory is still 163.6MB. Free memory was 125.3MB in the beginning and 119.8MB in the end (delta: 5.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 584.54ms. Allocated memory is still 163.6MB. Free memory was 119.8MB in the beginning and 92.5MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 6932.27ms. Allocated memory was 163.6MB in the beginning and 257.9MB in the end (delta: 94.4MB). Free memory was 91.7MB in the beginning and 106.0MB in the end (delta: -14.3MB). Peak memory consumption was 80.9MB. Max. memory is 16.1GB. * Witness Printer took 3.21ms. Allocated memory is still 257.9MB. Free memory is still 106.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 167, overapproximation of someBinaryFLOATComparisonOperation at line 167. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 16; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_6 = 1; [L25] signed char var_1_8 = -10; [L26] unsigned short int var_1_9 = 4; [L27] signed char var_1_10 = 8; [L28] unsigned short int var_1_12 = 64314; [L29] unsigned short int var_1_13 = 26169; [L30] signed char var_1_17 = 50; [L31] signed char var_1_18 = 16; [L32] signed char var_1_19 = 5; [L33] signed char var_1_20 = 0; [L34] signed char var_1_21 = 50; [L35] signed char var_1_22 = 16; [L36] unsigned char var_1_23 = 16; [L37] unsigned char var_1_24 = 1; [L38] unsigned char var_1_25 = 0; [L39] double var_1_27 = 0.25; [L40] double var_1_28 = 10.25; [L41] double var_1_29 = 1000.25; [L42] double var_1_30 = 9.5; [L43] float var_1_31 = 63.5; [L44] unsigned short int var_1_32 = 16; [L45] unsigned short int var_1_33 = 1; [L46] unsigned short int var_1_34 = 2; [L47] unsigned char var_1_35 = 0; [L48] unsigned char var_1_36 = 0; [L49] unsigned char var_1_37 = 1; [L50] unsigned char var_1_38 = 1; [L51] unsigned char var_1_39 = 5; [L52] unsigned char var_1_40 = 0; [L53] unsigned char var_1_41 = 100; [L54] unsigned short int last_1_var_1_9 = 4; [L171] isInitial = 1 [L172] FCALL initially() [L173] COND TRUE 1 [L174] CALL updateLastVariables() [L164] last_1_var_1_9 = var_1_9 [L174] RET updateLastVariables() [L175] CALL updateVariables() [L108] var_1_4 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_6=1, var_1_8=-10, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_6=1, var_1_8=-10, var_1_9=4] [L109] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_6=1, var_1_8=-10, var_1_9=4] [L110] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=-10, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=-10, var_1_9=4] [L110] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=-10, var_1_9=4] [L111] var_1_6 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_8=-10, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_8=-10, var_1_9=4] [L112] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_8=-10, var_1_9=4] [L113] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=-10, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=-10, var_1_9=4] [L113] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=-10, var_1_9=4] [L114] var_1_8 = __VERIFIER_nondet_char() [L115] CALL assume_abort_if_not(var_1_8 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L115] RET assume_abort_if_not(var_1_8 >= -127) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L116] CALL assume_abort_if_not(var_1_8 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L116] RET assume_abort_if_not(var_1_8 <= 126) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L117] var_1_10 = __VERIFIER_nondet_char() [L118] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L118] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L119] CALL assume_abort_if_not(var_1_10 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L119] RET assume_abort_if_not(var_1_10 <= 127) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L120] var_1_12 = __VERIFIER_nondet_ushort() [L121] CALL assume_abort_if_not(var_1_12 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L121] RET assume_abort_if_not(var_1_12 >= 49150) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L122] CALL assume_abort_if_not(var_1_12 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L122] RET assume_abort_if_not(var_1_12 <= 65534) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L123] var_1_13 = __VERIFIER_nondet_ushort() [L124] CALL assume_abort_if_not(var_1_13 >= 24575) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L124] RET assume_abort_if_not(var_1_13 >= 24575) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L125] CALL assume_abort_if_not(var_1_13 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L125] RET assume_abort_if_not(var_1_13 <= 32767) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L126] var_1_18 = __VERIFIER_nondet_char() [L127] CALL assume_abort_if_not(var_1_18 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L127] RET assume_abort_if_not(var_1_18 >= -1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L128] CALL assume_abort_if_not(var_1_18 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L128] RET assume_abort_if_not(var_1_18 <= 126) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L129] var_1_19 = __VERIFIER_nondet_char() [L130] CALL assume_abort_if_not(var_1_19 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L130] RET assume_abort_if_not(var_1_19 >= -1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L131] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L131] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L132] var_1_20 = __VERIFIER_nondet_char() [L133] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L133] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L134] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L134] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L135] var_1_21 = __VERIFIER_nondet_char() [L136] CALL assume_abort_if_not(var_1_21 >= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L136] RET assume_abort_if_not(var_1_21 >= 31) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L137] CALL assume_abort_if_not(var_1_21 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L137] RET assume_abort_if_not(var_1_21 <= 63) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L138] var_1_22 = __VERIFIER_nondet_char() [L139] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L139] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L140] CALL assume_abort_if_not(var_1_22 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L140] RET assume_abort_if_not(var_1_22 <= 31) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L141] var_1_25 = __VERIFIER_nondet_uchar() [L142] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L142] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L143] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L143] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L144] var_1_28 = __VERIFIER_nondet_double() [L145] CALL assume_abort_if_not((var_1_28 >= -230584.3009213691390e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 2305843.009213691390e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L145] RET assume_abort_if_not((var_1_28 >= -230584.3009213691390e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 2305843.009213691390e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L146] var_1_29 = __VERIFIER_nondet_double() [L147] CALL assume_abort_if_not((var_1_29 >= -230584.3009213691390e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 2305843.009213691390e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L147] RET assume_abort_if_not((var_1_29 >= -230584.3009213691390e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 2305843.009213691390e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L148] var_1_30 = __VERIFIER_nondet_double() [L149] CALL assume_abort_if_not((var_1_30 >= -461168.6018427382800e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 4611686.018427382800e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L149] RET assume_abort_if_not((var_1_30 >= -461168.6018427382800e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 4611686.018427382800e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L150] var_1_33 = __VERIFIER_nondet_ushort() [L151] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L151] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L152] CALL assume_abort_if_not(var_1_33 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_33=-2, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_33=-2, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L152] RET assume_abort_if_not(var_1_33 <= 65534) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_33=-2, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L153] var_1_35 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_33=-2, var_1_34=2, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_33=-2, var_1_34=2, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L154] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_33=-2, var_1_34=2, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L155] CALL assume_abort_if_not(var_1_35 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_33=-2, var_1_34=2, var_1_35=1, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_33=-2, var_1_34=2, var_1_35=1, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L155] RET assume_abort_if_not(var_1_35 <= 1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_33=-2, var_1_34=2, var_1_35=1, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L156] var_1_37 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_37 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_33=-2, var_1_34=2, var_1_35=1, var_1_36=0, var_1_37=-255, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_33=-2, var_1_34=2, var_1_35=1, var_1_36=0, var_1_37=-255, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L157] RET assume_abort_if_not(var_1_37 >= 1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_33=-2, var_1_34=2, var_1_35=1, var_1_36=0, var_1_37=-255, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L158] CALL assume_abort_if_not(var_1_37 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_33=-2, var_1_34=2, var_1_35=1, var_1_36=0, var_1_37=-255, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_33=-2, var_1_34=2, var_1_35=1, var_1_36=0, var_1_37=-255, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L158] RET assume_abort_if_not(var_1_37 <= 1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_33=-2, var_1_34=2, var_1_35=1, var_1_36=0, var_1_37=-255, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L159] var_1_40 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_40 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_33=-2, var_1_34=2, var_1_35=1, var_1_36=0, var_1_37=-255, var_1_38=1, var_1_39=5, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_33=-2, var_1_34=2, var_1_35=1, var_1_36=0, var_1_37=-255, var_1_38=1, var_1_39=5, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L160] RET assume_abort_if_not(var_1_40 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_33=-2, var_1_34=2, var_1_35=1, var_1_36=0, var_1_37=-255, var_1_38=1, var_1_39=5, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L161] CALL assume_abort_if_not(var_1_40 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_33=-2, var_1_34=2, var_1_35=1, var_1_36=0, var_1_37=-255, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_33=-2, var_1_34=2, var_1_35=1, var_1_36=0, var_1_37=-255, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L161] RET assume_abort_if_not(var_1_40 <= 254) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_33=-2, var_1_34=2, var_1_35=1, var_1_36=0, var_1_37=-255, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L175] RET updateVariables() [L176] CALL step() [L58] var_1_32 = var_1_33 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=-2, var_1_33=-2, var_1_34=2, var_1_35=1, var_1_36=0, var_1_37=-255, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L59] COND TRUE \read(var_1_35) [L60] var_1_34 = var_1_33 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=-2, var_1_33=-2, var_1_34=-2, var_1_35=1, var_1_36=0, var_1_37=-255, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L62] var_1_36 = var_1_37 [L63] var_1_38 = 1 [L64] var_1_39 = var_1_40 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=-2, var_1_33=-2, var_1_34=-2, var_1_35=1, var_1_36=-255, var_1_37=-255, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L65] EXPR (-1000000000 + var_1_32) & var_1_40 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=-2, var_1_33=-2, var_1_34=-2, var_1_35=1, var_1_36=-255, var_1_37=-255, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L65] COND FALSE !(((-1000000000 + var_1_32) & var_1_40) > var_1_33) [L68] COND FALSE !((- last_1_var_1_9) < (last_1_var_1_9 + -500)) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=-2, var_1_33=-2, var_1_34=-2, var_1_35=1, var_1_36=-255, var_1_37=-255, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L71] var_1_17 = (((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) - (var_1_20 + (var_1_21 - var_1_22))) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=-1, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=-2, var_1_33=-2, var_1_34=-2, var_1_35=1, var_1_36=-255, var_1_37=-255, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L72] COND TRUE \read(var_1_4) [L73] var_1_24 = (! var_1_25) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=-1, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=-2, var_1_33=-2, var_1_34=-2, var_1_35=1, var_1_36=-255, var_1_37=-255, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L77] var_1_31 = var_1_30 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=-1, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=64320, var_1_31=64320, var_1_32=-2, var_1_33=-2, var_1_34=-2, var_1_35=1, var_1_36=-255, var_1_37=-255, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L78] COND FALSE !(var_1_23 < var_1_23) [L89] var_1_1 = var_1_8 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=-1, var_1_18=126, var_1_19=93, var_1_1=126, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=64320, var_1_31=64320, var_1_32=-2, var_1_33=-2, var_1_34=-2, var_1_35=1, var_1_36=-255, var_1_37=-255, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L91] signed char stepLocal_0 = var_1_1; VAL [isInitial=1, last_1_var_1_9=4, stepLocal_0=126, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=-1, var_1_18=126, var_1_19=93, var_1_1=126, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=64320, var_1_31=64320, var_1_32=-2, var_1_33=-2, var_1_34=-2, var_1_35=1, var_1_36=-255, var_1_37=-255, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L92] COND FALSE !(stepLocal_0 < (-1 - var_1_10)) [L99] var_1_9 = var_1_13 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=-1, var_1_18=126, var_1_19=93, var_1_1=126, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=64320, var_1_31=64320, var_1_32=-2, var_1_33=-2, var_1_34=-2, var_1_35=1, var_1_36=-255, var_1_37=-255, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=32767] [L101] COND FALSE !(var_1_9 < (var_1_21 + var_1_23)) [L104] var_1_27 = var_1_28 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=-1, var_1_18=126, var_1_19=93, var_1_1=126, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=64319, var_1_28=64319, var_1_30=64320, var_1_31=64320, var_1_32=-2, var_1_33=-2, var_1_34=-2, var_1_35=1, var_1_36=-255, var_1_37=-255, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=32767] [L176] RET step() [L177] CALL, EXPR property() [L167-L168] return (((((((var_1_23 < var_1_23) ? ((var_1_24 && var_1_24) ? (var_1_24 ? ((var_1_24 && (var_1_24 || var_1_24)) ? (var_1_1 == ((signed char) -5)) : 1) : 1) : (var_1_1 == ((signed char) var_1_8))) : (var_1_1 == ((signed char) var_1_8))) && ((var_1_1 < (-1 - var_1_10)) ? (var_1_24 ? (var_1_9 == ((unsigned short int) (var_1_10 + ((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))))) : (var_1_9 == ((unsigned short int) ((var_1_12 - var_1_10) - ((var_1_13 - var_1_23) - ((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23)))))))) : (var_1_9 == ((unsigned short int) var_1_13)))) && (var_1_17 == ((signed char) (((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) - (var_1_20 + (var_1_21 - var_1_22)))))) && (((- last_1_var_1_9) < (last_1_var_1_9 + -500)) ? (var_1_23 == ((unsigned char) var_1_20)) : 1)) && (var_1_4 ? (var_1_24 == ((unsigned char) (! var_1_25))) : (var_1_24 == ((unsigned char) (var_1_6 && ((var_1_10 >= var_1_17) && var_1_25)))))) && ((var_1_9 < (var_1_21 + var_1_23)) ? (var_1_27 == ((double) ((var_1_28 + var_1_29) + var_1_30))) : (var_1_27 == ((double) var_1_28)))) && (var_1_31 == ((float) var_1_30)) ; [L177] RET, EXPR property() [L177] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=-1, var_1_18=126, var_1_19=93, var_1_1=126, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=64319, var_1_28=64319, var_1_30=64320, var_1_31=64320, var_1_32=-2, var_1_33=-2, var_1_34=-2, var_1_35=1, var_1_36=-255, var_1_37=-255, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=32767] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=-1, var_1_18=126, var_1_19=93, var_1_1=126, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=64319, var_1_28=64319, var_1_30=64320, var_1_31=64320, var_1_32=-2, var_1_33=-2, var_1_34=-2, var_1_35=1, var_1_36=-255, var_1_37=-255, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=32767] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.7s, OverallIterations: 5, TraceHistogramMax: 35, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 269 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 257 mSDsluCounter, 1212 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 708 mSDsCounter, 318 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 791 IncrementalHoareTripleChecker+Invalid, 1109 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 318 mSolverCounterUnsat, 504 mSDtfsCounter, 791 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 787 GetRequests, 737 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=262occurred in iteration=4, InterpolantAutomatonStates: 49, 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, 4 MinimizatonAttempts, 40 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 1266 NumberOfCodeBlocks, 1266 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 1260 ConstructedInterpolants, 0 QuantifiedInterpolants, 4375 SizeOfPredicates, 6 NumberOfNonLiveVariables, 470 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 13914/14280 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-10-24 06:11:32,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_fillercodesize_ps-cn-10_file-96.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 e3ddf029d6c8d316304cb4ddcdbc5422251d87289b8ada843d8e8cc5a57a2c2d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 06:11:34,403 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 06:11:34,495 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 06:11:34,500 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 06:11:34,500 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 06:11:34,534 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 06:11:34,537 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 06:11:34,537 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 06:11:34,538 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 06:11:34,538 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 06:11:34,539 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 06:11:34,539 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 06:11:34,540 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 06:11:34,542 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 06:11:34,542 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 06:11:34,543 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 06:11:34,543 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 06:11:34,543 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 06:11:34,544 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 06:11:34,544 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 06:11:34,544 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 06:11:34,549 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 06:11:34,549 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 06:11:34,549 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 06:11:34,550 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 06:11:34,550 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 06:11:34,551 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 06:11:34,552 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 06:11:34,552 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 06:11:34,552 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 06:11:34,552 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 06:11:34,553 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 06:11:34,553 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 06:11:34,553 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 06:11:34,554 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:11:34,554 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 06:11:34,555 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 06:11:34,556 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 06:11:34,556 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 06:11:34,556 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 06:11:34,556 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 06:11:34,557 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 06:11:34,557 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 06:11:34,557 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 06:11:34,557 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 06:11:34,558 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 -> e3ddf029d6c8d316304cb4ddcdbc5422251d87289b8ada843d8e8cc5a57a2c2d [2024-10-24 06:11:34,939 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 06:11:34,967 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 06:11:34,969 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 06:11:34,970 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 06:11:34,971 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 06:11:34,973 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-96.i [2024-10-24 06:11:36,640 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 06:11:36,917 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 06:11:36,921 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-96.i [2024-10-24 06:11:36,930 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5130915f/68bbe4327a8b4349a5914124e94983ec/FLAG9feb62a49 [2024-10-24 06:11:36,942 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5130915f/68bbe4327a8b4349a5914124e94983ec [2024-10-24 06:11:36,944 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 06:11:36,945 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 06:11:36,947 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 06:11:36,947 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 06:11:36,953 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 06:11:36,954 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:11:36" (1/1) ... [2024-10-24 06:11:36,955 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41705d17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:36, skipping insertion in model container [2024-10-24 06:11:36,955 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:11:36" (1/1) ... [2024-10-24 06:11:36,985 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 06:11:37,177 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-96.i[915,928] [2024-10-24 06:11:37,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:11:37,280 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 06:11:37,294 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-96.i[915,928] [2024-10-24 06:11:37,342 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:11:37,371 INFO L204 MainTranslator]: Completed translation [2024-10-24 06:11:37,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:37 WrapperNode [2024-10-24 06:11:37,371 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 06:11:37,373 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 06:11:37,373 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 06:11:37,373 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 06:11:37,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:37" (1/1) ... [2024-10-24 06:11:37,399 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:37" (1/1) ... [2024-10-24 06:11:37,444 INFO L138 Inliner]: procedures = 27, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 191 [2024-10-24 06:11:37,445 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 06:11:37,446 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 06:11:37,446 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 06:11:37,446 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 06:11:37,462 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:37" (1/1) ... [2024-10-24 06:11:37,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:37" (1/1) ... [2024-10-24 06:11:37,468 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:37" (1/1) ... [2024-10-24 06:11:37,486 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-10-24 06:11:37,490 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:37" (1/1) ... [2024-10-24 06:11:37,491 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:37" (1/1) ... [2024-10-24 06:11:37,503 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:37" (1/1) ... [2024-10-24 06:11:37,511 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:37" (1/1) ... [2024-10-24 06:11:37,517 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:37" (1/1) ... [2024-10-24 06:11:37,523 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:37" (1/1) ... [2024-10-24 06:11:37,530 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 06:11:37,535 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 06:11:37,535 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 06:11:37,535 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 06:11:37,536 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:37" (1/1) ... [2024-10-24 06:11:37,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:11:37,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:11:37,572 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-10-24 06:11:37,579 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-10-24 06:11:37,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 06:11:37,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 06:11:37,655 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 06:11:37,655 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 06:11:37,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 06:11:37,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 06:11:37,764 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 06:11:37,766 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 06:11:40,974 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-24 06:11:40,974 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 06:11:41,045 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 06:11:41,046 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 06:11:41,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:11:41 BoogieIcfgContainer [2024-10-24 06:11:41,046 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 06:11:41,048 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 06:11:41,049 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 06:11:41,052 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 06:11:41,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 06:11:36" (1/3) ... [2024-10-24 06:11:41,053 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@269e2eb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:11:41, skipping insertion in model container [2024-10-24 06:11:41,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:37" (2/3) ... [2024-10-24 06:11:41,053 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@269e2eb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:11:41, skipping insertion in model container [2024-10-24 06:11:41,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:11:41" (3/3) ... [2024-10-24 06:11:41,055 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-96.i [2024-10-24 06:11:41,071 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 06:11:41,071 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 06:11:41,152 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 06:11:41,163 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;@7d7792e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 06:11:41,163 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 06:11:41,168 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-24 06:11:41,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-24 06:11:41,187 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:11:41,188 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 06:11:41,188 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:11:41,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:11:41,197 INFO L85 PathProgramCache]: Analyzing trace with hash 116231618, now seen corresponding path program 1 times [2024-10-24 06:11:41,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:11:41,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1963788252] [2024-10-24 06:11:41,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:11:41,216 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:11:41,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:11:41,220 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 06:11:41,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 06:11:41,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:41,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 06:11:41,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:11:41,689 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 1124 proven. 0 refuted. 0 times theorem prover too weak. 1256 trivial. 0 not checked. [2024-10-24 06:11:41,690 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:11:41,695 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:11:41,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1963788252] [2024-10-24 06:11:41,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1963788252] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:11:41,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:11:41,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 06:11:41,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460478416] [2024-10-24 06:11:41,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:11:41,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 06:11:41,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:11:41,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 06:11:41,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 06:11:41,738 INFO L87 Difference]: Start difference. First operand has 82 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-10-24 06:11:42,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 06:11:42,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:11:42,880 INFO L93 Difference]: Finished difference Result 158 states and 287 transitions. [2024-10-24 06:11:42,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 06:11:42,912 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 210 [2024-10-24 06:11:42,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:11:42,919 INFO L225 Difference]: With dead ends: 158 [2024-10-24 06:11:42,919 INFO L226 Difference]: Without dead ends: 77 [2024-10-24 06:11:42,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 209 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-10-24 06:11:42,926 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 06:11:42,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 06:11:42,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-24 06:11:42,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-10-24 06:11:42,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 40 states have (on average 1.2) internal successors, (48), 40 states have internal predecessors, (48), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-24 06:11:42,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 118 transitions. [2024-10-24 06:11:42,979 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 118 transitions. Word has length 210 [2024-10-24 06:11:42,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:11:42,979 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 118 transitions. [2024-10-24 06:11:42,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-10-24 06:11:42,980 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 118 transitions. [2024-10-24 06:11:42,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-24 06:11:42,985 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:11:42,985 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 06:11:42,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 06:11:43,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:11:43,187 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:11:43,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:11:43,188 INFO L85 PathProgramCache]: Analyzing trace with hash -173631492, now seen corresponding path program 1 times [2024-10-24 06:11:43,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:11:43,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1846027776] [2024-10-24 06:11:43,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:11:43,189 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:11:43,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:11:43,194 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 06:11:43,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 06:11:43,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:43,551 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 06:11:43,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:11:44,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-24 06:11:44,367 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:11:44,368 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:11:44,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1846027776] [2024-10-24 06:11:44,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1846027776] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:11:44,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:11:44,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 06:11:44,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883836866] [2024-10-24 06:11:44,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:11:44,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 06:11:44,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:11:44,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 06:11:44,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 06:11:44,374 INFO L87 Difference]: Start difference. First operand 77 states and 118 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-24 06:11:45,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 06:11:48,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 06:11:48,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:11:48,762 INFO L93 Difference]: Finished difference Result 230 states and 353 transitions. [2024-10-24 06:11:48,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 06:11:48,791 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 210 [2024-10-24 06:11:48,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:11:48,799 INFO L225 Difference]: With dead ends: 230 [2024-10-24 06:11:48,800 INFO L226 Difference]: Without dead ends: 154 [2024-10-24 06:11:48,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 207 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-10-24 06:11:48,810 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 56 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-24 06:11:48,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 337 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-10-24 06:11:48,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-10-24 06:11:48,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 140. [2024-10-24 06:11:48,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 67 states have (on average 1.1492537313432836) internal successors, (77), 67 states have internal predecessors, (77), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-24 06:11:48,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 217 transitions. [2024-10-24 06:11:48,859 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 217 transitions. Word has length 210 [2024-10-24 06:11:48,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:11:48,860 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 217 transitions. [2024-10-24 06:11:48,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-24 06:11:48,860 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 217 transitions. [2024-10-24 06:11:48,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-24 06:11:48,867 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:11:48,868 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 06:11:48,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 06:11:49,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:11:49,069 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:11:49,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:11:49,070 INFO L85 PathProgramCache]: Analyzing trace with hash 527433086, now seen corresponding path program 1 times [2024-10-24 06:11:49,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:11:49,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [276742850] [2024-10-24 06:11:49,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:11:49,071 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:11:49,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:11:49,073 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 06:11:49,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 06:11:49,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:49,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-24 06:11:49,369 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:11:51,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 1464 proven. 180 refuted. 0 times theorem prover too weak. 736 trivial. 0 not checked. [2024-10-24 06:11:51,356 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 06:11:51,599 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:11:51,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [276742850] [2024-10-24 06:11:51,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [276742850] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 06:11:51,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [491104074] [2024-10-24 06:11:51,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:11:51,600 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 06:11:51,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 06:11:51,604 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 06:11:51,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-10-24 06:11:52,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:52,180 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 06:11:52,187 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:11:52,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 1014 proven. 72 refuted. 0 times theorem prover too weak. 1294 trivial. 0 not checked. [2024-10-24 06:11:52,749 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 06:11:53,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [491104074] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 06:11:53,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 06:11:53,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 13 [2024-10-24 06:11:53,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379325062] [2024-10-24 06:11:53,105 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 06:11:53,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 06:11:53,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:11:53,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 06:11:53,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2024-10-24 06:11:53,110 INFO L87 Difference]: Start difference. First operand 140 states and 217 transitions. Second operand has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 4 states have call successors, (58), 4 states have call predecessors, (58), 7 states have return successors, (59), 4 states have call predecessors, (59), 4 states have call successors, (59) [2024-10-24 06:11:55,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 06:11:56,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 06:11:58,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 06:11:59,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:11:59,530 INFO L93 Difference]: Finished difference Result 340 states and 489 transitions. [2024-10-24 06:11:59,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-24 06:11:59,532 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 4 states have call successors, (58), 4 states have call predecessors, (58), 7 states have return successors, (59), 4 states have call predecessors, (59), 4 states have call successors, (59) Word has length 210 [2024-10-24 06:11:59,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:11:59,538 INFO L225 Difference]: With dead ends: 340 [2024-10-24 06:11:59,538 INFO L226 Difference]: Without dead ends: 264 [2024-10-24 06:11:59,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 438 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=351, Invalid=909, Unknown=0, NotChecked=0, Total=1260 [2024-10-24 06:11:59,541 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 116 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2024-10-24 06:11:59,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 472 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2024-10-24 06:11:59,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-10-24 06:11:59,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 242. [2024-10-24 06:11:59,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 123 states have (on average 1.089430894308943) internal successors, (134), 124 states have internal predecessors, (134), 105 states have call successors, (105), 13 states have call predecessors, (105), 13 states have return successors, (105), 104 states have call predecessors, (105), 105 states have call successors, (105) [2024-10-24 06:11:59,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 344 transitions. [2024-10-24 06:11:59,588 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 344 transitions. Word has length 210 [2024-10-24 06:11:59,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:11:59,589 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 344 transitions. [2024-10-24 06:11:59,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 4 states have call successors, (58), 4 states have call predecessors, (58), 7 states have return successors, (59), 4 states have call predecessors, (59), 4 states have call successors, (59) [2024-10-24 06:11:59,589 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 344 transitions. [2024-10-24 06:11:59,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-24 06:11:59,595 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:11:59,595 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 06:11:59,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 06:11:59,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2024-10-24 06:11:59,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-24 06:11:59,997 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:11:59,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:11:59,997 INFO L85 PathProgramCache]: Analyzing trace with hash 527492668, now seen corresponding path program 1 times [2024-10-24 06:11:59,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:11:59,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [919855309] [2024-10-24 06:11:59,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:11:59,998 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:11:59,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:12:00,002 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 06:12:00,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-24 06:12:00,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:12:00,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 06:12:00,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:12:00,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-24 06:12:00,332 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:12:00,332 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:12:00,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [919855309] [2024-10-24 06:12:00,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [919855309] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:12:00,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:12:00,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 06:12:00,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520551766] [2024-10-24 06:12:00,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:12:00,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 06:12:00,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:12:00,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 06:12:00,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:12:00,334 INFO L87 Difference]: Start difference. First operand 242 states and 344 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-24 06:12:01,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:12:01,384 INFO L93 Difference]: Finished difference Result 417 states and 586 transitions. [2024-10-24 06:12:01,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 06:12:01,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 210 [2024-10-24 06:12:01,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:12:01,393 INFO L225 Difference]: With dead ends: 417 [2024-10-24 06:12:01,394 INFO L226 Difference]: Without dead ends: 250 [2024-10-24 06:12:01,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:12:01,397 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 93 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 06:12:01,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 272 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 06:12:01,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-10-24 06:12:01,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 234. [2024-10-24 06:12:01,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 122 states have (on average 1.0737704918032787) internal successors, (131), 123 states have internal predecessors, (131), 97 states have call successors, (97), 14 states have call predecessors, (97), 14 states have return successors, (97), 96 states have call predecessors, (97), 97 states have call successors, (97) [2024-10-24 06:12:01,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 325 transitions. [2024-10-24 06:12:01,449 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 325 transitions. Word has length 210 [2024-10-24 06:12:01,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:12:01,450 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 325 transitions. [2024-10-24 06:12:01,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-24 06:12:01,450 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 325 transitions. [2024-10-24 06:12:01,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-24 06:12:01,453 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:12:01,453 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 06:12:01,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-24 06:12:01,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:12:01,654 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:12:01,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:12:01,655 INFO L85 PathProgramCache]: Analyzing trace with hash 785658106, now seen corresponding path program 1 times [2024-10-24 06:12:01,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:12:01,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [724745691] [2024-10-24 06:12:01,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:12:01,656 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:12:01,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:12:01,657 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 06:12:01,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-24 06:12:01,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:12:01,962 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-10-24 06:12:01,981 INFO L278 TraceCheckSpWp]: Computing forward predicates...