./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-40.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-40.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 83e6a5fc52c7b932388db74a3265271ec19421eb7c3c3913e89558f5e921b8d3 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 20:39:32,353 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 20:39:32,413 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 20:39:32,417 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 20:39:32,418 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 20:39:32,447 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 20:39:32,448 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 20:39:32,448 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 20:39:32,449 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 20:39:32,449 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 20:39:32,450 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 20:39:32,450 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 20:39:32,451 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 20:39:32,454 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 20:39:32,455 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 20:39:32,455 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 20:39:32,455 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 20:39:32,456 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 20:39:32,456 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 20:39:32,456 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 20:39:32,457 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 20:39:32,458 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 20:39:32,458 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 20:39:32,458 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 20:39:32,458 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 20:39:32,459 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 20:39:32,459 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 20:39:32,459 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 20:39:32,460 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 20:39:32,460 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 20:39:32,460 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 20:39:32,460 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 20:39:32,461 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:39:32,462 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 20:39:32,462 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 20:39:32,462 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 20:39:32,463 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 20:39:32,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 20:39:32,464 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 20:39:32,464 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 20:39:32,464 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 20:39:32,464 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 20:39:32,465 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 -> 83e6a5fc52c7b932388db74a3265271ec19421eb7c3c3913e89558f5e921b8d3 [2024-11-08 20:39:32,695 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 20:39:32,717 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 20:39:32,720 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 20:39:32,721 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 20:39:32,722 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 20:39:32,723 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-40.i [2024-11-08 20:39:34,162 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 20:39:34,383 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 20:39:34,384 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-40.i [2024-11-08 20:39:34,400 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ae1bf09f/39712d077cc5402d984efc1141680633/FLAGde3196cbf [2024-11-08 20:39:34,739 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ae1bf09f/39712d077cc5402d984efc1141680633 [2024-11-08 20:39:34,743 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 20:39:34,746 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 20:39:34,749 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 20:39:34,750 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 20:39:34,755 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 20:39:34,756 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:39:34" (1/1) ... [2024-11-08 20:39:34,757 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61bce2aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:34, skipping insertion in model container [2024-11-08 20:39:34,757 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:39:34" (1/1) ... [2024-11-08 20:39:34,789 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 20:39:34,966 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-40.i[915,928] [2024-11-08 20:39:35,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:39:35,041 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 20:39:35,053 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-40.i[915,928] [2024-11-08 20:39:35,080 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:39:35,099 INFO L204 MainTranslator]: Completed translation [2024-11-08 20:39:35,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:35 WrapperNode [2024-11-08 20:39:35,100 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 20:39:35,101 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 20:39:35,101 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 20:39:35,101 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 20:39:35,108 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:35" (1/1) ... [2024-11-08 20:39:35,125 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:35" (1/1) ... [2024-11-08 20:39:35,224 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 168 [2024-11-08 20:39:35,224 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 20:39:35,225 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 20:39:35,227 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 20:39:35,227 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 20:39:35,235 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:35" (1/1) ... [2024-11-08 20:39:35,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:35" (1/1) ... [2024-11-08 20:39:35,239 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:35" (1/1) ... [2024-11-08 20:39:35,254 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 20:39:35,255 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:35" (1/1) ... [2024-11-08 20:39:35,255 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:35" (1/1) ... [2024-11-08 20:39:35,264 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:35" (1/1) ... [2024-11-08 20:39:35,267 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:35" (1/1) ... [2024-11-08 20:39:35,270 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:35" (1/1) ... [2024-11-08 20:39:35,272 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:35" (1/1) ... [2024-11-08 20:39:35,277 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 20:39:35,278 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 20:39:35,278 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 20:39:35,278 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 20:39:35,279 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:35" (1/1) ... [2024-11-08 20:39:35,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:39:35,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:39:35,312 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 20:39:35,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 20:39:35,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 20:39:35,354 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 20:39:35,355 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 20:39:35,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 20:39:35,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 20:39:35,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 20:39:35,427 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 20:39:35,429 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 20:39:35,795 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-08 20:39:35,796 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 20:39:35,811 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 20:39:35,812 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 20:39:35,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:39:35 BoogieIcfgContainer [2024-11-08 20:39:35,812 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 20:39:35,814 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 20:39:35,816 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 20:39:35,819 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 20:39:35,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 08:39:34" (1/3) ... [2024-11-08 20:39:35,821 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32a1c5ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:39:35, skipping insertion in model container [2024-11-08 20:39:35,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:35" (2/3) ... [2024-11-08 20:39:35,821 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32a1c5ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:39:35, skipping insertion in model container [2024-11-08 20:39:35,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:39:35" (3/3) ... [2024-11-08 20:39:35,823 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-40.i [2024-11-08 20:39:35,839 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 20:39:35,839 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 20:39:35,915 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 20:39:35,923 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;@737b3768, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 20:39:35,923 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 20:39:35,927 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 48 states have internal predecessors, (66), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 20:39:35,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 20:39:35,941 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:39:35,942 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:39:35,942 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:39:35,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:39:35,946 INFO L85 PathProgramCache]: Analyzing trace with hash -147971958, now seen corresponding path program 1 times [2024-11-08 20:39:35,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:39:35,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691590669] [2024-11-08 20:39:35,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:39:35,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:39:36,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:39:36,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:39:36,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 20:39:36,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:39:36,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 20:39:36,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:39:36,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 20:39:36,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:39:36,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 20:39:36,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:39:36,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 20:39:36,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:39:36,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:39:36,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:39:36,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:39:36,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 20:39:36,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:39:36,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:39:36,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:39:36,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:39:36,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 20:39:36,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 20:39:36,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 20:39:36,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 20:39:36,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:39:36,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691590669] [2024-11-08 20:39:36,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691590669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:39:36,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:39:36,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 20:39:36,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895416467] [2024-11-08 20:39:36,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:39:36,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 20:39:36,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:39:36,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 20:39:36,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:39:36,468 INFO L87 Difference]: Start difference. First operand has 73 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 48 states have internal predecessors, (66), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-08 20:39:36,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:39:36,504 INFO L93 Difference]: Finished difference Result 139 states and 241 transitions. [2024-11-08 20:39:36,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 20:39:36,506 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 151 [2024-11-08 20:39:36,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:39:36,513 INFO L225 Difference]: With dead ends: 139 [2024-11-08 20:39:36,514 INFO L226 Difference]: Without dead ends: 69 [2024-11-08 20:39:36,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:39:36,521 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:39:36,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:39:36,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-08 20:39:36,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-08 20:39:36,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 44 states have internal predecessors, (58), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 20:39:36,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 104 transitions. [2024-11-08 20:39:36,579 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 104 transitions. Word has length 151 [2024-11-08 20:39:36,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:39:36,580 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 104 transitions. [2024-11-08 20:39:36,580 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-08 20:39:36,581 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 104 transitions. [2024-11-08 20:39:36,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-08 20:39:36,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:39:36,588 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:39:36,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 20:39:36,588 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:39:36,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:39:36,590 INFO L85 PathProgramCache]: Analyzing trace with hash -509668076, now seen corresponding path program 1 times [2024-11-08 20:39:36,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:39:36,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694932244] [2024-11-08 20:39:36,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:39:36,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:39:36,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:39:36,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:39:36,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 20:39:36,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:39:36,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 20:39:36,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:39:36,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 20:39:36,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:39:36,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:36,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 20:39:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:39:37,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 20:39:37,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:39:37,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:39:37,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:39:37,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:39:37,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 20:39:37,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:39:37,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:39:37,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:39:37,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:39:37,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 20:39:37,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 20:39:37,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 20:39:37,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 20:39:37,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:39:37,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694932244] [2024-11-08 20:39:37,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694932244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:39:37,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:39:37,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 20:39:37,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796082895] [2024-11-08 20:39:37,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:39:37,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 20:39:37,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:39:37,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 20:39:37,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:39:37,086 INFO L87 Difference]: Start difference. First operand 69 states and 104 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 20:39:37,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:39:37,122 INFO L93 Difference]: Finished difference Result 135 states and 205 transitions. [2024-11-08 20:39:37,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 20:39:37,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 152 [2024-11-08 20:39:37,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:39:37,126 INFO L225 Difference]: With dead ends: 135 [2024-11-08 20:39:37,128 INFO L226 Difference]: Without dead ends: 69 [2024-11-08 20:39:37,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:39:37,130 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:39:37,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 200 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:39:37,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-08 20:39:37,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-08 20:39:37,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 44 states have internal predecessors, (57), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 20:39:37,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 103 transitions. [2024-11-08 20:39:37,151 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 103 transitions. Word has length 152 [2024-11-08 20:39:37,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:39:37,154 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 103 transitions. [2024-11-08 20:39:37,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 20:39:37,154 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 103 transitions. [2024-11-08 20:39:37,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-08 20:39:37,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:39:37,158 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:39:37,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 20:39:37,159 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:39:37,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:39:37,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1319014702, now seen corresponding path program 1 times [2024-11-08 20:39:37,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:39:37,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786676412] [2024-11-08 20:39:37,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:39:37,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:39:37,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:39:37,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:39:37,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 20:39:37,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:39:37,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 20:39:37,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:39:37,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 20:39:37,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:39:37,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 20:39:37,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:39:37,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 20:39:37,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:39:37,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:39:37,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:39:37,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:39:37,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 20:39:38,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:38,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:39:38,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:38,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:39:38,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:38,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:39:38,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:38,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:39:38,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:38,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 20:39:38,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:38,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 20:39:38,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:38,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 20:39:38,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:38,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 20:39:38,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:39:38,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786676412] [2024-11-08 20:39:38,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786676412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:39:38,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:39:38,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 20:39:38,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751826314] [2024-11-08 20:39:38,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:39:38,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 20:39:38,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:39:38,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 20:39:38,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:39:38,040 INFO L87 Difference]: Start difference. First operand 69 states and 103 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 20:39:38,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:39:38,396 INFO L93 Difference]: Finished difference Result 215 states and 312 transitions. [2024-11-08 20:39:38,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 20:39:38,398 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 152 [2024-11-08 20:39:38,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:39:38,400 INFO L225 Difference]: With dead ends: 215 [2024-11-08 20:39:38,404 INFO L226 Difference]: Without dead ends: 149 [2024-11-08 20:39:38,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 20:39:38,406 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 113 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 20:39:38,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 295 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 20:39:38,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-08 20:39:38,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 102. [2024-11-08 20:39:38,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 67 states have (on average 1.2686567164179106) internal successors, (85), 68 states have internal predecessors, (85), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-08 20:39:38,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 149 transitions. [2024-11-08 20:39:38,438 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 149 transitions. Word has length 152 [2024-11-08 20:39:38,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:39:38,439 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 149 transitions. [2024-11-08 20:39:38,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 20:39:38,440 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 149 transitions. [2024-11-08 20:39:38,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-08 20:39:38,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:39:38,442 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:39:38,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 20:39:38,442 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:39:38,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:39:38,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1317167660, now seen corresponding path program 1 times [2024-11-08 20:39:38,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:39:38,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056872553] [2024-11-08 20:39:38,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:39:38,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:39:38,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 20:39:38,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [933773320] [2024-11-08 20:39:38,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:39:38,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 20:39:38,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:39:38,590 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 20:39:38,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 20:39:38,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 20:39:38,994 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 20:39:39,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 20:39:39,141 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 20:39:39,142 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 20:39:39,143 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 20:39:39,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 20:39:39,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 20:39:39,349 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-08 20:39:39,469 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 20:39:39,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 08:39:39 BoogieIcfgContainer [2024-11-08 20:39:39,473 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 20:39:39,473 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 20:39:39,473 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 20:39:39,474 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 20:39:39,474 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:39:35" (3/4) ... [2024-11-08 20:39:39,477 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 20:39:39,478 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 20:39:39,479 INFO L158 Benchmark]: Toolchain (without parser) took 4732.59ms. Allocated memory was 176.2MB in the beginning and 247.5MB in the end (delta: 71.3MB). Free memory was 105.8MB in the beginning and 176.7MB in the end (delta: -70.9MB). Peak memory consumption was 1.6MB. Max. memory is 16.1GB. [2024-11-08 20:39:39,479 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 176.2MB. Free memory was 132.6MB in the beginning and 132.4MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 20:39:39,479 INFO L158 Benchmark]: CACSL2BoogieTranslator took 351.23ms. Allocated memory is still 176.2MB. Free memory was 105.5MB in the beginning and 89.2MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 20:39:39,480 INFO L158 Benchmark]: Boogie Procedure Inliner took 123.29ms. Allocated memory is still 176.2MB. Free memory was 89.0MB in the beginning and 144.5MB in the end (delta: -55.4MB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. [2024-11-08 20:39:39,480 INFO L158 Benchmark]: Boogie Preprocessor took 52.03ms. Allocated memory is still 176.2MB. Free memory was 144.5MB in the beginning and 137.4MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-08 20:39:39,480 INFO L158 Benchmark]: RCFGBuilder took 534.31ms. Allocated memory is still 176.2MB. Free memory was 137.4MB in the beginning and 112.3MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-08 20:39:39,481 INFO L158 Benchmark]: TraceAbstraction took 3658.71ms. Allocated memory was 176.2MB in the beginning and 247.5MB in the end (delta: 71.3MB). Free memory was 111.6MB in the beginning and 177.7MB in the end (delta: -66.1MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2024-11-08 20:39:39,481 INFO L158 Benchmark]: Witness Printer took 4.72ms. Allocated memory is still 247.5MB. Free memory is still 176.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 20:39:39,483 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 176.2MB. Free memory was 132.6MB in the beginning and 132.4MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 351.23ms. Allocated memory is still 176.2MB. Free memory was 105.5MB in the beginning and 89.2MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 123.29ms. Allocated memory is still 176.2MB. Free memory was 89.0MB in the beginning and 144.5MB in the end (delta: -55.4MB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.03ms. Allocated memory is still 176.2MB. Free memory was 144.5MB in the beginning and 137.4MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 534.31ms. Allocated memory is still 176.2MB. Free memory was 137.4MB in the beginning and 112.3MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3658.71ms. Allocated memory was 176.2MB in the beginning and 247.5MB in the end (delta: 71.3MB). Free memory was 111.6MB in the beginning and 177.7MB in the end (delta: -66.1MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * Witness Printer took 4.72ms. Allocated memory is still 247.5MB. Free memory is still 176.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 157, overapproximation of someBinaryDOUBLEComparisonOperation at line 157, overapproximation of someUnaryDOUBLEoperation at line 35. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 128; [L23] signed short int var_1_4 = -200; [L24] unsigned short int var_1_8 = 5; [L25] unsigned char var_1_9 = 1; [L26] unsigned char var_1_10 = 0; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 16; [L29] unsigned char var_1_15 = 50; [L30] unsigned short int var_1_16 = 1; [L31] float var_1_17 = 25.4; [L32] float var_1_20 = 1.6; [L33] unsigned short int var_1_21 = 0; [L34] float var_1_24 = 128.5; [L35] double var_1_25 = -0.5; [L36] signed long int var_1_26 = 4; [L37] signed char var_1_27 = 2; [L38] signed char var_1_28 = -16; [L39] signed char var_1_29 = 0; [L40] unsigned char var_1_30 = 0; [L41] float var_1_31 = 127.75; [L42] float var_1_32 = 15.5; [L43] unsigned long int var_1_33 = 16; [L44] signed long int var_1_34 = 256; [L45] unsigned char var_1_35 = 0; [L46] signed short int var_1_36 = 8; [L47] signed long int var_1_37 = 256; [L48] unsigned long int var_1_38 = 500; [L49] unsigned char last_1_var_1_9 = 1; [L50] float last_1_var_1_24 = 128.5; VAL [isInitial=0, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-200, var_1_8=5, var_1_9=1] [L161] isInitial = 1 [L162] FCALL initially() [L163] COND TRUE 1 [L164] CALL updateLastVariables() [L153] last_1_var_1_9 = var_1_9 [L154] last_1_var_1_24 = var_1_24 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-200, var_1_8=5, var_1_9=1] [L164] RET updateLastVariables() [L165] CALL updateVariables() [L116] var_1_4 = __VERIFIER_nondet_short() [L117] CALL assume_abort_if_not(var_1_4 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=5, var_1_9=1] [L117] RET assume_abort_if_not(var_1_4 >= -32768) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=5, var_1_9=1] [L118] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=5, var_1_9=1] [L118] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=5, var_1_9=1] [L119] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=5, var_1_9=1] [L119] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=5, var_1_9=1] [L120] var_1_8 = __VERIFIER_nondet_ushort() [L121] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_9=1] [L121] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_9=1] [L122] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L122] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L123] var_1_10 = __VERIFIER_nondet_uchar() [L124] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L124] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L125] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L125] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L126] var_1_11 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L127] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L128] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L128] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L129] var_1_15 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L130] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L131] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L131] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L132] var_1_20 = __VERIFIER_nondet_float() [L133] CALL assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L133] RET assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L134] var_1_28 = __VERIFIER_nondet_char() [L135] CALL assume_abort_if_not(var_1_28 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L135] RET assume_abort_if_not(var_1_28 >= -126) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L136] CALL assume_abort_if_not(var_1_28 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L136] RET assume_abort_if_not(var_1_28 <= 126) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L137] var_1_29 = __VERIFIER_nondet_char() [L138] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L138] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L139] CALL assume_abort_if_not(var_1_29 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L139] RET assume_abort_if_not(var_1_29 <= 126) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L140] var_1_32 = __VERIFIER_nondet_float() [L141] CALL assume_abort_if_not((var_1_32 >= -922337.2036854765600e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854765600e+12F && var_1_32 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L141] RET assume_abort_if_not((var_1_32 >= -922337.2036854765600e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854765600e+12F && var_1_32 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L142] var_1_35 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L143] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L144] CALL assume_abort_if_not(var_1_35 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L144] RET assume_abort_if_not(var_1_35 <= 1) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L145] var_1_36 = __VERIFIER_nondet_short() [L146] CALL assume_abort_if_not(var_1_36 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=2, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=2, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L146] RET assume_abort_if_not(var_1_36 >= -1) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=2, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L147] CALL assume_abort_if_not(var_1_36 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=2, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=2, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L147] RET assume_abort_if_not(var_1_36 <= 32767) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=2, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L148] var_1_37 = __VERIFIER_nondet_long() [L149] CALL assume_abort_if_not(var_1_37 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L149] RET assume_abort_if_not(var_1_37 >= -2147483647) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L150] CALL assume_abort_if_not(var_1_37 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L150] RET assume_abort_if_not(var_1_37 <= 2147483646) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L165] RET updateVariables() [L166] CALL step() [L54] var_1_27 = (((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))) - var_1_29) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L55] COND TRUE -32 <= var_1_28 [L56] var_1_30 = var_1_29 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L58] var_1_31 = var_1_32 [L59] var_1_33 = var_1_30 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=256, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L60] COND FALSE !(var_1_31 > var_1_32) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=256, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L65] COND TRUE ((var_1_36 - var_1_29) * var_1_27) > var_1_28 [L66] var_1_34 = var_1_30 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L71] COND FALSE !(var_1_34 < var_1_37) [L74] var_1_38 = var_1_30 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=0, var_1_4=16, var_1_8=0, var_1_9=1] [L76] COND FALSE !((last_1_var_1_9 && var_1_11) && (50 > var_1_8)) [L83] var_1_12 = var_1_15 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=4, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=0, var_1_4=16, var_1_8=0, var_1_9=1] [L85] unsigned char stepLocal_1 = var_1_10; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_1=1, var_1_10=1, var_1_11=0, var_1_12=4, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=0, var_1_4=16, var_1_8=0, var_1_9=1] [L86] COND TRUE (var_1_12 != var_1_4) || stepLocal_1 [L87] var_1_9 = var_1_11 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=4, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=0, var_1_4=16, var_1_8=0, var_1_9=0] [L89] var_1_26 = var_1_12 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=4, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=0, var_1_4=16, var_1_8=0, var_1_9=0] [L90] COND FALSE !((var_1_9 && var_1_11) && var_1_9) [L93] var_1_21 = ((23370 - var_1_15) + var_1_12) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=4, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=0, var_1_4=16, var_1_8=0, var_1_9=0] [L95] signed long int stepLocal_2 = -4; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_2=-4, var_1_10=1, var_1_11=0, var_1_12=4, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=0, var_1_4=16, var_1_8=0, var_1_9=0] [L96] COND FALSE !(! (-4 < var_1_12)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_2=-4, var_1_10=1, var_1_11=0, var_1_12=4, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=0, var_1_4=16, var_1_8=0, var_1_9=0] [L99] COND FALSE !(stepLocal_2 > var_1_21) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=4, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=0, var_1_4=16, var_1_8=0, var_1_9=0] [L103] var_1_16 = (((((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) < (var_1_15)) ? ((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) : (var_1_15))) [L104] var_1_25 = var_1_20 [L105] unsigned short int stepLocal_0 = var_1_16; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_0=4, var_1_10=1, var_1_11=0, var_1_12=4, var_1_15=4, var_1_16=4, var_1_17=127/5, var_1_1=128, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=0, var_1_4=16, var_1_8=0, var_1_9=0] [L106] COND TRUE ((var_1_16 * var_1_16) / var_1_4) <= stepLocal_0 [L107] var_1_1 = var_1_12 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=4, var_1_15=4, var_1_16=4, var_1_17=127/5, var_1_1=4, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=0, var_1_4=16, var_1_8=0, var_1_9=0] [L111] COND FALSE !((var_1_16 - ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) < (var_1_12 - var_1_16)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=4, var_1_15=4, var_1_16=4, var_1_17=127/5, var_1_1=4, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=0, var_1_4=16, var_1_8=0, var_1_9=0] [L166] RET step() [L167] CALL, EXPR property() [L157-L158] return (((((((((((var_1_16 * var_1_16) / var_1_4) <= var_1_16) ? (var_1_1 == ((unsigned short int) var_1_12)) : (var_1_1 == ((unsigned short int) (var_1_12 + var_1_12)))) && (((var_1_12 != var_1_4) || var_1_10) ? (var_1_9 == ((unsigned char) var_1_11)) : 1)) && (((last_1_var_1_9 && var_1_11) && (50 > var_1_8)) ? (((- last_1_var_1_24) < last_1_var_1_24) ? (last_1_var_1_9 ? (var_1_12 == ((unsigned char) 5)) : 1) : 1) : (var_1_12 == ((unsigned char) var_1_15)))) && (var_1_16 == ((unsigned short int) (((((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) < (var_1_15)) ? ((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) : (var_1_15)))))) && (((var_1_16 - ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) < (var_1_12 - var_1_16)) ? (var_1_17 == ((float) var_1_20)) : 1)) && (((var_1_9 && var_1_11) && var_1_9) ? (var_1_21 == ((unsigned short int) (var_1_26 + (var_1_15 + ((((var_1_12) > (var_1_12)) ? (var_1_12) : (var_1_12))))))) : (var_1_21 == ((unsigned short int) ((23370 - var_1_15) + var_1_12))))) && ((! (-4 < var_1_12)) ? (var_1_24 == ((float) var_1_20)) : ((-4 > var_1_21) ? (var_1_24 == ((float) 10.6f)) : 1))) && (var_1_25 == ((double) var_1_20))) && (var_1_26 == ((signed long int) var_1_12)) ; VAL [\result=0, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=4, var_1_15=4, var_1_16=4, var_1_17=127/5, var_1_1=4, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=0, var_1_4=16, var_1_8=0, var_1_9=0] [L167] RET, EXPR property() [L167] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=4, var_1_15=4, var_1_16=4, var_1_17=127/5, var_1_1=4, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=0, var_1_4=16, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=4, var_1_15=4, var_1_16=4, var_1_17=127/5, var_1_1=4, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=0, var_1_4=16, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 73 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 4, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 113 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 113 mSDsluCounter, 599 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 274 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 108 IncrementalHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 325 mSDtfsCounter, 108 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 176 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=3, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 47 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 759 NumberOfCodeBlocks, 759 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 452 ConstructedInterpolants, 0 QuantifiedInterpolants, 576 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 3036/3036 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 20:39:39,521 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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-40.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 83e6a5fc52c7b932388db74a3265271ec19421eb7c3c3913e89558f5e921b8d3 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 20:39:41,835 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 20:39:41,917 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 20:39:41,924 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 20:39:41,925 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 20:39:41,962 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 20:39:41,963 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 20:39:41,963 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 20:39:41,964 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 20:39:41,965 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 20:39:41,965 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 20:39:41,965 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 20:39:41,966 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 20:39:41,966 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 20:39:41,967 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 20:39:41,967 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 20:39:41,969 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 20:39:41,969 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 20:39:41,969 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 20:39:41,969 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 20:39:41,970 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 20:39:41,973 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 20:39:41,974 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 20:39:41,974 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 20:39:41,974 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 20:39:41,974 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 20:39:41,975 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 20:39:41,975 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 20:39:41,975 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 20:39:41,975 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 20:39:41,976 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 20:39:41,976 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 20:39:41,976 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 20:39:41,976 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 20:39:41,977 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:39:41,977 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 20:39:41,977 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 20:39:41,978 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 20:39:41,978 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 20:39:41,978 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 20:39:41,978 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 20:39:41,980 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 20:39:41,980 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 20:39:41,980 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 20:39:41,981 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 -> 83e6a5fc52c7b932388db74a3265271ec19421eb7c3c3913e89558f5e921b8d3 [2024-11-08 20:39:42,329 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 20:39:42,355 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 20:39:42,359 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 20:39:42,360 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 20:39:42,360 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 20:39:42,362 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-40.i [2024-11-08 20:39:43,889 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 20:39:44,113 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 20:39:44,117 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-40.i [2024-11-08 20:39:44,137 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ba3f5abd/dba994a9f44b4acaa12e2bbcf322fb30/FLAGbc9ef5dd6 [2024-11-08 20:39:44,458 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ba3f5abd/dba994a9f44b4acaa12e2bbcf322fb30 [2024-11-08 20:39:44,461 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 20:39:44,463 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 20:39:44,464 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 20:39:44,464 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 20:39:44,468 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 20:39:44,468 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:39:44" (1/1) ... [2024-11-08 20:39:44,469 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77d1bfd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:44, skipping insertion in model container [2024-11-08 20:39:44,470 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:39:44" (1/1) ... [2024-11-08 20:39:44,503 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 20:39:44,719 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-40.i[915,928] [2024-11-08 20:39:44,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:39:44,830 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 20:39:44,843 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-40.i[915,928] [2024-11-08 20:39:44,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:39:44,903 INFO L204 MainTranslator]: Completed translation [2024-11-08 20:39:44,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:44 WrapperNode [2024-11-08 20:39:44,904 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 20:39:44,905 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 20:39:44,905 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 20:39:44,905 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 20:39:44,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:44" (1/1) ... [2024-11-08 20:39:44,931 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:44" (1/1) ... [2024-11-08 20:39:44,968 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 163 [2024-11-08 20:39:44,969 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 20:39:44,969 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 20:39:44,970 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 20:39:44,970 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 20:39:44,989 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:44" (1/1) ... [2024-11-08 20:39:44,989 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:44" (1/1) ... [2024-11-08 20:39:44,992 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:44" (1/1) ... [2024-11-08 20:39:45,013 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 20:39:45,013 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:44" (1/1) ... [2024-11-08 20:39:45,013 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:44" (1/1) ... [2024-11-08 20:39:45,027 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:44" (1/1) ... [2024-11-08 20:39:45,034 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:44" (1/1) ... [2024-11-08 20:39:45,039 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:44" (1/1) ... [2024-11-08 20:39:45,041 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:44" (1/1) ... [2024-11-08 20:39:45,048 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 20:39:45,053 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 20:39:45,053 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 20:39:45,053 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 20:39:45,065 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:44" (1/1) ... [2024-11-08 20:39:45,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:39:45,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:39:45,104 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 20:39:45,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 20:39:45,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 20:39:45,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 20:39:45,160 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 20:39:45,160 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 20:39:45,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 20:39:45,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 20:39:45,251 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 20:39:45,254 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 20:39:46,039 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-08 20:39:46,040 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 20:39:46,056 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 20:39:46,056 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 20:39:46,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:39:46 BoogieIcfgContainer [2024-11-08 20:39:46,057 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 20:39:46,071 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 20:39:46,071 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 20:39:46,075 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 20:39:46,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 08:39:44" (1/3) ... [2024-11-08 20:39:46,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73ae2ded and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:39:46, skipping insertion in model container [2024-11-08 20:39:46,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:44" (2/3) ... [2024-11-08 20:39:46,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73ae2ded and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:39:46, skipping insertion in model container [2024-11-08 20:39:46,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:39:46" (3/3) ... [2024-11-08 20:39:46,079 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-40.i [2024-11-08 20:39:46,095 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 20:39:46,096 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 20:39:46,170 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 20:39:46,179 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;@113b2ba3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 20:39:46,180 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 20:39:46,185 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 48 states have internal predecessors, (66), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 20:39:46,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 20:39:46,203 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:39:46,205 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:39:46,206 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:39:46,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:39:46,212 INFO L85 PathProgramCache]: Analyzing trace with hash -147971958, now seen corresponding path program 1 times [2024-11-08 20:39:46,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:39:46,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1519646033] [2024-11-08 20:39:46,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:39:46,230 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:39:46,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:39:46,234 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 20:39:46,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 20:39:46,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:46,520 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 20:39:46,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:39:46,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 464 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2024-11-08 20:39:46,599 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 20:39:46,600 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:39:46,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1519646033] [2024-11-08 20:39:46,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1519646033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:39:46,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:39:46,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 20:39:46,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572025204] [2024-11-08 20:39:46,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:39:46,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 20:39:46,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:39:46,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 20:39:46,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:39:46,637 INFO L87 Difference]: Start difference. First operand has 73 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 48 states have internal predecessors, (66), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-08 20:39:46,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:39:46,679 INFO L93 Difference]: Finished difference Result 139 states and 241 transitions. [2024-11-08 20:39:46,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 20:39:46,683 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 151 [2024-11-08 20:39:46,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:39:46,691 INFO L225 Difference]: With dead ends: 139 [2024-11-08 20:39:46,691 INFO L226 Difference]: Without dead ends: 69 [2024-11-08 20:39:46,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:39:46,702 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:39:46,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:39:46,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-08 20:39:46,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-08 20:39:46,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 44 states have internal predecessors, (58), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 20:39:46,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 104 transitions. [2024-11-08 20:39:46,759 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 104 transitions. Word has length 151 [2024-11-08 20:39:46,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:39:46,760 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 104 transitions. [2024-11-08 20:39:46,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-08 20:39:46,761 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 104 transitions. [2024-11-08 20:39:46,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-08 20:39:46,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:39:46,767 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:39:46,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 20:39:46,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:39:46,969 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:39:46,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:39:46,970 INFO L85 PathProgramCache]: Analyzing trace with hash -509668076, now seen corresponding path program 1 times [2024-11-08 20:39:46,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:39:46,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [392423713] [2024-11-08 20:39:46,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:39:46,971 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:39:46,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:39:46,974 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 20:39:46,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 20:39:47,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:47,270 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 20:39:47,282 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:39:47,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 20:39:47,364 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 20:39:47,364 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:39:47,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [392423713] [2024-11-08 20:39:47,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [392423713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:39:47,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:39:47,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 20:39:47,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128071496] [2024-11-08 20:39:47,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:39:47,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 20:39:47,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:39:47,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 20:39:47,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:39:47,373 INFO L87 Difference]: Start difference. First operand 69 states and 104 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 20:39:47,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:39:47,598 INFO L93 Difference]: Finished difference Result 135 states and 205 transitions. [2024-11-08 20:39:47,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 20:39:47,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 152 [2024-11-08 20:39:47,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:39:47,610 INFO L225 Difference]: With dead ends: 135 [2024-11-08 20:39:47,610 INFO L226 Difference]: Without dead ends: 69 [2024-11-08 20:39:47,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:39:47,612 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 20:39:47,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 200 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 20:39:47,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-08 20:39:47,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-08 20:39:47,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 44 states have internal predecessors, (57), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 20:39:47,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 103 transitions. [2024-11-08 20:39:47,627 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 103 transitions. Word has length 152 [2024-11-08 20:39:47,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:39:47,630 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 103 transitions. [2024-11-08 20:39:47,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 20:39:47,631 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 103 transitions. [2024-11-08 20:39:47,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-08 20:39:47,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:39:47,634 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:39:47,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-08 20:39:47,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:39:47,836 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:39:47,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:39:47,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1319014702, now seen corresponding path program 1 times [2024-11-08 20:39:47,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:39:47,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [790614051] [2024-11-08 20:39:47,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:39:47,837 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:39:47,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:39:47,839 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 20:39:47,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 20:39:48,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:48,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 20:39:48,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:39:48,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 20:39:48,378 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 20:39:48,378 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:39:48,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [790614051] [2024-11-08 20:39:48,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [790614051] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:39:48,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:39:48,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 20:39:48,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752571857] [2024-11-08 20:39:48,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:39:48,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 20:39:48,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:39:48,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 20:39:48,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:39:48,383 INFO L87 Difference]: Start difference. First operand 69 states and 103 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 20:39:49,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:39:49,718 INFO L93 Difference]: Finished difference Result 282 states and 417 transitions. [2024-11-08 20:39:49,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 20:39:49,719 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 152 [2024-11-08 20:39:49,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:39:49,725 INFO L225 Difference]: With dead ends: 282 [2024-11-08 20:39:49,726 INFO L226 Difference]: Without dead ends: 216 [2024-11-08 20:39:49,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-08 20:39:49,730 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 247 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 20:39:49,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 416 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 20:39:49,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-08 20:39:49,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 128. [2024-11-08 20:39:49,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 78 states have (on average 1.2307692307692308) internal successors, (96), 79 states have internal predecessors, (96), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 20:39:49,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 188 transitions. [2024-11-08 20:39:49,770 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 188 transitions. Word has length 152 [2024-11-08 20:39:49,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:39:49,771 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 188 transitions. [2024-11-08 20:39:49,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 20:39:49,771 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 188 transitions. [2024-11-08 20:39:49,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-08 20:39:49,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:39:49,773 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:39:49,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-08 20:39:49,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:39:49,974 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:39:49,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:39:49,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1317167660, now seen corresponding path program 1 times [2024-11-08 20:39:49,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:39:49,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [829084260] [2024-11-08 20:39:49,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:39:49,976 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:39:49,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:39:49,979 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 20:39:49,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 20:39:50,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:50,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-08 20:39:50,256 INFO L278 TraceCheckSpWp]: Computing forward predicates...