./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-74.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-74.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 02baa2e59f749b8f6a62bf588b2331b287a06a0eaebbebe18816d2b78fb71465 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 00:17:14,109 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 00:17:14,226 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 00:17:14,232 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 00:17:14,235 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 00:17:14,282 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 00:17:14,283 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 00:17:14,283 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 00:17:14,284 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 00:17:14,288 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 00:17:14,289 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 00:17:14,289 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 00:17:14,290 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 00:17:14,290 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 00:17:14,290 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 00:17:14,290 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 00:17:14,290 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 00:17:14,291 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 00:17:14,291 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 00:17:14,291 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 00:17:14,291 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 00:17:14,294 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 00:17:14,294 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 00:17:14,294 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 00:17:14,294 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 00:17:14,295 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 00:17:14,296 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 00:17:14,296 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 00:17:14,297 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 00:17:14,297 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 00:17:14,297 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 00:17:14,297 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 00:17:14,297 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:17:14,297 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 00:17:14,298 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 00:17:14,298 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 00:17:14,298 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 00:17:14,299 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 00:17:14,299 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 00:17:14,300 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 00:17:14,300 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 00:17:14,301 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 00:17:14,301 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 -> 02baa2e59f749b8f6a62bf588b2331b287a06a0eaebbebe18816d2b78fb71465 [2024-10-13 00:17:14,558 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 00:17:14,588 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 00:17:14,592 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 00:17:14,593 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 00:17:14,593 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 00:17:14,595 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-74.i [2024-10-13 00:17:16,275 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 00:17:16,513 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 00:17:16,514 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-74.i [2024-10-13 00:17:16,529 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b636f3305/36ff5827c772413ead3a4d8618014e10/FLAG6a422257c [2024-10-13 00:17:16,875 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b636f3305/36ff5827c772413ead3a4d8618014e10 [2024-10-13 00:17:16,878 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 00:17:16,880 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 00:17:16,881 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 00:17:16,883 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 00:17:16,891 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 00:17:16,891 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:17:16" (1/1) ... [2024-10-13 00:17:16,894 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35eeecfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:16, skipping insertion in model container [2024-10-13 00:17:16,894 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:17:16" (1/1) ... [2024-10-13 00:17:16,923 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 00:17:17,080 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-74.i[917,930] [2024-10-13 00:17:17,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:17:17,157 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 00:17:17,167 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-74.i[917,930] [2024-10-13 00:17:17,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:17:17,228 INFO L204 MainTranslator]: Completed translation [2024-10-13 00:17:17,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:17 WrapperNode [2024-10-13 00:17:17,229 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 00:17:17,231 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 00:17:17,231 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 00:17:17,231 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 00:17:17,237 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:17" (1/1) ... [2024-10-13 00:17:17,248 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:17" (1/1) ... [2024-10-13 00:17:17,281 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 191 [2024-10-13 00:17:17,282 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 00:17:17,283 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 00:17:17,283 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 00:17:17,283 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 00:17:17,295 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:17" (1/1) ... [2024-10-13 00:17:17,298 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:17" (1/1) ... [2024-10-13 00:17:17,301 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:17" (1/1) ... [2024-10-13 00:17:17,322 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 00:17:17,326 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:17" (1/1) ... [2024-10-13 00:17:17,327 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:17" (1/1) ... [2024-10-13 00:17:17,336 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:17" (1/1) ... [2024-10-13 00:17:17,343 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:17" (1/1) ... [2024-10-13 00:17:17,345 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:17" (1/1) ... [2024-10-13 00:17:17,349 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:17" (1/1) ... [2024-10-13 00:17:17,352 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 00:17:17,354 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 00:17:17,354 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 00:17:17,354 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 00:17:17,355 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:17" (1/1) ... [2024-10-13 00:17:17,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:17:17,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:17:17,391 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 00:17:17,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 00:17:17,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 00:17:17,435 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 00:17:17,436 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 00:17:17,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 00:17:17,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 00:17:17,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 00:17:17,535 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 00:17:17,537 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 00:17:17,884 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-10-13 00:17:17,885 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 00:17:17,925 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 00:17:17,925 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 00:17:17,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:17:17 BoogieIcfgContainer [2024-10-13 00:17:17,926 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 00:17:17,928 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 00:17:17,928 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 00:17:17,931 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 00:17:17,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:17:16" (1/3) ... [2024-10-13 00:17:17,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3db685fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:17:17, skipping insertion in model container [2024-10-13 00:17:17,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:17" (2/3) ... [2024-10-13 00:17:17,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3db685fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:17:17, skipping insertion in model container [2024-10-13 00:17:17,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:17:17" (3/3) ... [2024-10-13 00:17:17,933 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-74.i [2024-10-13 00:17:17,947 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 00:17:17,947 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 00:17:18,045 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 00:17:18,052 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;@e90bce4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 00:17:18,053 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 00:17:18,058 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 50 states have (on average 1.4) internal successors, (70), 51 states have internal predecessors, (70), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 00:17:18,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-10-13 00:17:18,074 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:17:18,075 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:17:18,075 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:17:18,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:17:18,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1914651930, now seen corresponding path program 1 times [2024-10-13 00:17:18,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:17:18,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555858022] [2024-10-13 00:17:18,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:17:18,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:17:18,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:18,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:17:18,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:18,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:17:18,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:18,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:17:18,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:18,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:17:18,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:18,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:17:18,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:18,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:17:18,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:18,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:17:18,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:18,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:17:18,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:18,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:17:18,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:18,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:17:18,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:18,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:17:18,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:18,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:17:18,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:18,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:17:18,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:18,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:17:18,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:18,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:17:18,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:18,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:17:18,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:18,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:17:18,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:18,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 00:17:18,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:18,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:17:18,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:18,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 00:17:18,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:18,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 00:17:18,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:18,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 00:17:18,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:18,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 00:17:18,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:18,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 00:17:18,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:18,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 00:17:18,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:18,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 00:17:18,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:18,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 00:17:18,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:18,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-13 00:17:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:18,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-13 00:17:18,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:17:18,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555858022] [2024-10-13 00:17:18,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555858022] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:17:18,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:17:18,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 00:17:18,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563217623] [2024-10-13 00:17:18,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:17:18,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 00:17:18,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:17:18,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 00:17:18,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:17:18,590 INFO L87 Difference]: Start difference. First operand has 81 states, 50 states have (on average 1.4) internal successors, (70), 51 states have internal predecessors, (70), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-13 00:17:18,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:17:18,630 INFO L93 Difference]: Finished difference Result 159 states and 278 transitions. [2024-10-13 00:17:18,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 00:17:18,634 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 174 [2024-10-13 00:17:18,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:17:18,641 INFO L225 Difference]: With dead ends: 159 [2024-10-13 00:17:18,641 INFO L226 Difference]: Without dead ends: 79 [2024-10-13 00:17:18,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:17:18,649 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 00:17:18,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 00:17:18,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-13 00:17:18,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-10-13 00:17:18,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 49 states have internal predecessors, (65), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 00:17:18,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 121 transitions. [2024-10-13 00:17:18,687 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 121 transitions. Word has length 174 [2024-10-13 00:17:18,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:17:18,687 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 121 transitions. [2024-10-13 00:17:18,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-13 00:17:18,688 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 121 transitions. [2024-10-13 00:17:18,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-10-13 00:17:18,691 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:17:18,691 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:17:18,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 00:17:18,692 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:17:18,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:17:18,692 INFO L85 PathProgramCache]: Analyzing trace with hash -154168090, now seen corresponding path program 1 times [2024-10-13 00:17:18,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:17:18,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670015274] [2024-10-13 00:17:18,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:17:18,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:17:18,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:19,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:17:19,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:19,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:17:19,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:19,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:17:19,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:19,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:17:19,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:19,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:17:19,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:19,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:17:19,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:19,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:17:19,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:19,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:17:19,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:19,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:17:19,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:19,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:17:19,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:19,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:17:19,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:19,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:17:19,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:19,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:17:19,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:19,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:17:19,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:19,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:17:19,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:19,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:17:19,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:19,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:17:19,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:19,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 00:17:19,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:19,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:17:19,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:19,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 00:17:19,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:19,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 00:17:19,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:19,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 00:17:19,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:19,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 00:17:19,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:19,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 00:17:19,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:19,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 00:17:19,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:19,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 00:17:19,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:19,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 00:17:19,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:19,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-13 00:17:19,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:19,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-13 00:17:19,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:17:19,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670015274] [2024-10-13 00:17:19,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670015274] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:17:19,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:17:19,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 00:17:19,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471550556] [2024-10-13 00:17:19,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:17:19,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 00:17:19,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:17:19,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 00:17:19,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 00:17:19,843 INFO L87 Difference]: Start difference. First operand 79 states and 121 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 00:17:19,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:17:19,991 INFO L93 Difference]: Finished difference Result 184 states and 281 transitions. [2024-10-13 00:17:19,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 00:17:19,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 174 [2024-10-13 00:17:19,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:17:19,999 INFO L225 Difference]: With dead ends: 184 [2024-10-13 00:17:20,001 INFO L226 Difference]: Without dead ends: 106 [2024-10-13 00:17:20,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 00:17:20,003 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 29 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 00:17:20,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 317 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 00:17:20,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-13 00:17:20,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 95. [2024-10-13 00:17:20,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 65 states have (on average 1.4) internal successors, (91), 65 states have internal predecessors, (91), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 00:17:20,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 147 transitions. [2024-10-13 00:17:20,025 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 147 transitions. Word has length 174 [2024-10-13 00:17:20,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:17:20,027 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 147 transitions. [2024-10-13 00:17:20,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 00:17:20,031 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 147 transitions. [2024-10-13 00:17:20,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-13 00:17:20,033 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:17:20,034 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:17:20,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 00:17:20,038 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:17:20,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:17:20,038 INFO L85 PathProgramCache]: Analyzing trace with hash -2050882045, now seen corresponding path program 1 times [2024-10-13 00:17:20,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:17:20,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54544498] [2024-10-13 00:17:20,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:17:20,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:17:20,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:20,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:17:20,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:20,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:17:20,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:20,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:17:20,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:20,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:17:20,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:20,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:17:20,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:20,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:17:20,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:20,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:17:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:20,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:17:20,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:20,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:17:20,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:20,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:17:20,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:20,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:17:20,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:20,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:17:20,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:20,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:17:20,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:20,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:17:20,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:20,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:17:20,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:20,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:17:20,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:20,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:17:20,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:20,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 00:17:20,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:20,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:17:20,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:20,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 00:17:20,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:20,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 00:17:20,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:20,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 00:17:20,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:20,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 00:17:21,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:21,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 00:17:21,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:21,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 00:17:21,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:21,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 00:17:21,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:21,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 00:17:21,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:21,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-13 00:17:21,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:21,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-13 00:17:21,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:17:21,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54544498] [2024-10-13 00:17:21,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54544498] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:17:21,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:17:21,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 00:17:21,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275590295] [2024-10-13 00:17:21,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:17:21,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 00:17:21,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:17:21,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 00:17:21,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 00:17:21,037 INFO L87 Difference]: Start difference. First operand 95 states and 147 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 00:17:21,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:17:21,265 INFO L93 Difference]: Finished difference Result 201 states and 307 transitions. [2024-10-13 00:17:21,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 00:17:21,266 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 175 [2024-10-13 00:17:21,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:17:21,267 INFO L225 Difference]: With dead ends: 201 [2024-10-13 00:17:21,267 INFO L226 Difference]: Without dead ends: 107 [2024-10-13 00:17:21,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 00:17:21,269 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 69 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 00:17:21,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 371 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 00:17:21,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-13 00:17:21,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 79. [2024-10-13 00:17:21,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 49 states have internal predecessors, (64), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 00:17:21,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 120 transitions. [2024-10-13 00:17:21,276 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 120 transitions. Word has length 175 [2024-10-13 00:17:21,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:17:21,276 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 120 transitions. [2024-10-13 00:17:21,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 00:17:21,277 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 120 transitions. [2024-10-13 00:17:21,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-10-13 00:17:21,278 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:17:21,279 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:17:21,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 00:17:21,279 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:17:21,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:17:21,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1593706773, now seen corresponding path program 1 times [2024-10-13 00:17:21,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:17:21,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756468341] [2024-10-13 00:17:21,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:17:21,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:17:21,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 00:17:21,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [118170338] [2024-10-13 00:17:21,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:17:21,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 00:17:21,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:17:21,329 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 00:17:21,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 00:17:21,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 00:17:21,651 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 00:17:21,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 00:17:21,763 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 00:17:21,763 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 00:17:21,764 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 00:17:21,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 00:17:21,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 00:17:21,970 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-13 00:17:22,061 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 00:17:22,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:17:22 BoogieIcfgContainer [2024-10-13 00:17:22,064 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 00:17:22,065 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 00:17:22,065 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 00:17:22,065 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 00:17:22,066 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:17:17" (3/4) ... [2024-10-13 00:17:22,067 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 00:17:22,068 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 00:17:22,068 INFO L158 Benchmark]: Toolchain (without parser) took 5188.66ms. Allocated memory was 249.6MB in the beginning and 348.1MB in the end (delta: 98.6MB). Free memory was 179.9MB in the beginning and 285.6MB in the end (delta: -105.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 00:17:22,069 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 125.8MB. Free memory is still 90.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 00:17:22,069 INFO L158 Benchmark]: CACSL2BoogieTranslator took 348.42ms. Allocated memory is still 249.6MB. Free memory was 179.5MB in the beginning and 164.5MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 00:17:22,069 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.33ms. Allocated memory is still 249.6MB. Free memory was 164.2MB in the beginning and 161.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 00:17:22,070 INFO L158 Benchmark]: Boogie Preprocessor took 70.37ms. Allocated memory is still 249.6MB. Free memory was 161.7MB in the beginning and 158.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 00:17:22,070 INFO L158 Benchmark]: RCFGBuilder took 572.28ms. Allocated memory is still 249.6MB. Free memory was 158.6MB in the beginning and 213.6MB in the end (delta: -55.0MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. [2024-10-13 00:17:22,070 INFO L158 Benchmark]: TraceAbstraction took 4136.85ms. Allocated memory was 249.6MB in the beginning and 348.1MB in the end (delta: 98.6MB). Free memory was 212.5MB in the beginning and 285.6MB in the end (delta: -73.0MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. [2024-10-13 00:17:22,070 INFO L158 Benchmark]: Witness Printer took 3.14ms. Allocated memory is still 348.1MB. Free memory is still 285.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 00:17:22,077 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.14ms. Allocated memory is still 125.8MB. Free memory is still 90.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 348.42ms. Allocated memory is still 249.6MB. Free memory was 179.5MB in the beginning and 164.5MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.33ms. Allocated memory is still 249.6MB. Free memory was 164.2MB in the beginning and 161.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.37ms. Allocated memory is still 249.6MB. Free memory was 161.7MB in the beginning and 158.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 572.28ms. Allocated memory is still 249.6MB. Free memory was 158.6MB in the beginning and 213.6MB in the end (delta: -55.0MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. * TraceAbstraction took 4136.85ms. Allocated memory was 249.6MB in the beginning and 348.1MB in the end (delta: 98.6MB). Free memory was 212.5MB in the beginning and 285.6MB in the end (delta: -73.0MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. * Witness Printer took 3.14ms. Allocated memory is still 348.1MB. Free memory is still 285.6MB. 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 144, overapproximation of someBinaryDOUBLEComparisonOperation at line 144, overapproximation of someBinaryArithmeticFLOAToperation at line 87. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 64; [L23] signed long int var_1_2 = -1; [L24] signed long int var_1_3 = -2; [L25] unsigned char var_1_4 = 0; [L26] unsigned long int var_1_5 = 3914692693; [L27] unsigned long int var_1_6 = 32; [L28] unsigned long int var_1_7 = 1; [L29] unsigned char var_1_8 = 0; [L30] unsigned char var_1_9 = 0; [L31] unsigned char var_1_10 = 0; [L32] unsigned char var_1_11 = 50; [L33] signed long int var_1_12 = 25; [L34] signed long int var_1_13 = 1; [L35] float var_1_15 = 4.75; [L36] unsigned char var_1_16 = 100; [L37] float var_1_17 = 50.1; [L38] float var_1_18 = 100.9; [L39] float var_1_19 = 8.5; [L40] float var_1_20 = 10.625; [L41] float var_1_21 = 0.0; [L42] float var_1_22 = 7.8; [L43] float var_1_23 = 8.25; [L44] double var_1_24 = 5.5; [L148] isInitial = 1 [L149] FCALL initially() [L150] COND TRUE 1 [L151] FCALL updateLastVariables() [L152] CALL updateVariables() [L95] var_1_2 = __VERIFIER_nondet_long() [L96] CALL assume_abort_if_not(var_1_2 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=-2, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=-2, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L96] RET assume_abort_if_not(var_1_2 >= -2147483648) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=-2, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L97] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=-2, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=-2, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L97] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=-2, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L98] var_1_3 = __VERIFIER_nondet_long() [L99] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L99] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L100] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L100] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L101] var_1_4 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L102] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L103] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L103] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L104] var_1_5 = __VERIFIER_nondet_ulong() [L105] CALL assume_abort_if_not(var_1_5 >= 3221225470) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L105] RET assume_abort_if_not(var_1_5 >= 3221225470) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L106] CALL assume_abort_if_not(var_1_5 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L106] RET assume_abort_if_not(var_1_5 <= 4294967294) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L107] var_1_6 = __VERIFIER_nondet_ulong() [L108] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L108] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L109] CALL assume_abort_if_not(var_1_6 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L109] RET assume_abort_if_not(var_1_6 <= 1073741823) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L110] var_1_7 = __VERIFIER_nondet_ulong() [L111] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_8=0, var_1_9=0] [L111] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_8=0, var_1_9=0] [L112] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L112] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L113] var_1_9 = __VERIFIER_nondet_uchar() [L114] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0] [L114] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0] [L115] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L115] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L116] var_1_10 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L117] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L118] CALL assume_abort_if_not(var_1_10 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L118] RET assume_abort_if_not(var_1_10 <= 0) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L119] var_1_12 = __VERIFIER_nondet_long() [L120] CALL assume_abort_if_not(var_1_12 >= 14) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L120] RET assume_abort_if_not(var_1_12 >= 14) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L121] CALL assume_abort_if_not(var_1_12 <= 29) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L121] RET assume_abort_if_not(var_1_12 <= 29) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L122] var_1_13 = __VERIFIER_nondet_long() [L123] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L123] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L124] CALL assume_abort_if_not(var_1_13 <= 14) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L124] RET assume_abort_if_not(var_1_13 <= 14) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L125] var_1_16 = __VERIFIER_nondet_uchar() [L126] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L126] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L127] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L127] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L128] var_1_17 = __VERIFIER_nondet_float() [L129] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L129] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L130] var_1_19 = __VERIFIER_nondet_float() [L131] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L131] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L132] var_1_20 = __VERIFIER_nondet_float() [L133] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L133] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L134] var_1_21 = __VERIFIER_nondet_float() [L135] CALL assume_abort_if_not((var_1_21 >= 2305843.009213691390e+12F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L135] RET assume_abort_if_not((var_1_21 >= 2305843.009213691390e+12F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L136] var_1_22 = __VERIFIER_nondet_float() [L137] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L137] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L138] var_1_23 = __VERIFIER_nondet_float() [L139] CALL assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L139] RET assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L152] RET updateVariables() [L153] CALL step() [L48] COND FALSE !(! (var_1_2 >= var_1_3)) [L55] var_1_1 = var_1_7 VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=0, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L57] signed long int stepLocal_1 = var_1_3; [L58] signed long int stepLocal_0 = var_1_3; VAL [isInitial=1, stepLocal_0=0, stepLocal_1=0, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=0, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L59] COND FALSE !(var_1_6 < stepLocal_0) VAL [isInitial=1, stepLocal_1=0, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=0, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L64] EXPR 5u << (var_1_12 - var_1_13) VAL [isInitial=1, stepLocal_1=0, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=0, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L64] unsigned long int stepLocal_3 = 5u << (var_1_12 - var_1_13); [L65] unsigned long int stepLocal_2 = var_1_7; VAL [isInitial=1, stepLocal_1=0, stepLocal_2=0, stepLocal_3=5, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=0, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L66] COND FALSE !(! ((var_1_5 > var_1_7) || var_1_4)) [L77] var_1_11 = var_1_12 VAL [isInitial=1, stepLocal_1=0, stepLocal_2=0, stepLocal_3=5, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=0, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L79] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, stepLocal_1=0, stepLocal_2=0, stepLocal_3=5, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=0, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L84] COND FALSE !(\read(var_1_10)) [L87] var_1_18 = (((var_1_21 - var_1_22) - var_1_23) + var_1_20) VAL [isInitial=1, stepLocal_1=0, stepLocal_2=0, stepLocal_3=5, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_1=0, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L89] signed long int stepLocal_4 = var_1_12 - var_1_11; VAL [isInitial=1, stepLocal_1=0, stepLocal_2=0, stepLocal_3=5, stepLocal_4=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_1=0, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L90] COND TRUE (~ var_1_3) <= stepLocal_4 [L91] var_1_24 = var_1_22 VAL [isInitial=1, stepLocal_1=0, stepLocal_2=0, stepLocal_3=5, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_1=0, var_1_22=2, var_1_24=2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L153] RET step() [L154] CALL, EXPR property() [L144] EXPR (((! (var_1_2 >= var_1_3)) ? (var_1_4 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_6) - var_1_7))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_7))) && ((var_1_6 < var_1_3) ? ((var_1_3 <= var_1_6) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_4)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) VAL [isInitial=1, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_1=0, var_1_22=2, var_1_24=2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L144] EXPR (! ((var_1_5 > var_1_7) || var_1_4)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12)) VAL [isInitial=1, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_1=0, var_1_22=2, var_1_24=2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L144] EXPR (((! (var_1_2 >= var_1_3)) ? (var_1_4 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_6) - var_1_7))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_7))) && ((var_1_6 < var_1_3) ? ((var_1_3 <= var_1_6) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_4)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) VAL [isInitial=1, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_1=0, var_1_22=2, var_1_24=2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L144-L145] return ((((((! (var_1_2 >= var_1_3)) ? (var_1_4 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_6) - var_1_7))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_7))) && ((var_1_6 < var_1_3) ? ((var_1_3 <= var_1_6) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_4)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12)))) && (var_1_10 ? ((var_1_11 > (var_1_6 / (var_1_12 + var_1_16))) ? (var_1_15 == ((float) var_1_17)) : 1) : 1)) && (var_1_10 ? (var_1_18 == ((float) (var_1_19 + var_1_20))) : (var_1_18 == ((float) (((var_1_21 - var_1_22) - var_1_23) + var_1_20))))) && (((~ var_1_3) <= (var_1_12 - var_1_11)) ? (var_1_24 == ((double) var_1_22)) : 1) ; [L154] RET, EXPR property() [L154] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_1=0, var_1_22=2, var_1_24=2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_1=0, var_1_22=2, var_1_24=2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 81 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.9s, OverallIterations: 4, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 98 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 98 mSDsluCounter, 806 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 465 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 208 IncrementalHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 341 mSDtfsCounter, 208 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 212 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=2, InterpolantAutomatonStates: 13, 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, 39 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 875 NumberOfCodeBlocks, 875 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 520 ConstructedInterpolants, 0 QuantifiedInterpolants, 1172 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 4536/4536 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 00:17:22,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-74.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 02baa2e59f749b8f6a62bf588b2331b287a06a0eaebbebe18816d2b78fb71465 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 00:17:24,918 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 00:17:24,990 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 00:17:24,999 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 00:17:25,000 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 00:17:25,038 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 00:17:25,040 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 00:17:25,041 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 00:17:25,041 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 00:17:25,042 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 00:17:25,042 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 00:17:25,042 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 00:17:25,043 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 00:17:25,045 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 00:17:25,046 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 00:17:25,046 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 00:17:25,046 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 00:17:25,046 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 00:17:25,047 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 00:17:25,047 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 00:17:25,047 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 00:17:25,051 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 00:17:25,051 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 00:17:25,052 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 00:17:25,052 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 00:17:25,052 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 00:17:25,052 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 00:17:25,053 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 00:17:25,053 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 00:17:25,053 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 00:17:25,053 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 00:17:25,053 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 00:17:25,054 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 00:17:25,054 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 00:17:25,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:17:25,056 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 00:17:25,056 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 00:17:25,056 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 00:17:25,056 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 00:17:25,057 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 00:17:25,058 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 00:17:25,058 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 00:17:25,058 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 00:17:25,059 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 00:17:25,059 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 00:17:25,059 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 -> 02baa2e59f749b8f6a62bf588b2331b287a06a0eaebbebe18816d2b78fb71465 [2024-10-13 00:17:25,371 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 00:17:25,395 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 00:17:25,397 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 00:17:25,399 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 00:17:25,399 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 00:17:25,400 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-74.i [2024-10-13 00:17:26,873 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 00:17:27,092 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 00:17:27,095 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-74.i [2024-10-13 00:17:27,116 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09cf67f41/b7e2f91dc5904e8c9658dc3e7f022c6c/FLAGd2dc72a39 [2024-10-13 00:17:27,137 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09cf67f41/b7e2f91dc5904e8c9658dc3e7f022c6c [2024-10-13 00:17:27,140 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 00:17:27,142 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 00:17:27,144 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 00:17:27,145 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 00:17:27,151 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 00:17:27,152 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:17:27" (1/1) ... [2024-10-13 00:17:27,153 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c3cb1e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:27, skipping insertion in model container [2024-10-13 00:17:27,153 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:17:27" (1/1) ... [2024-10-13 00:17:27,182 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 00:17:27,369 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-74.i[917,930] [2024-10-13 00:17:27,445 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:17:27,469 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 00:17:27,482 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-74.i[917,930] [2024-10-13 00:17:27,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:17:27,546 INFO L204 MainTranslator]: Completed translation [2024-10-13 00:17:27,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:27 WrapperNode [2024-10-13 00:17:27,547 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 00:17:27,548 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 00:17:27,548 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 00:17:27,549 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 00:17:27,555 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:27" (1/1) ... [2024-10-13 00:17:27,572 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:27" (1/1) ... [2024-10-13 00:17:27,608 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 164 [2024-10-13 00:17:27,612 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 00:17:27,613 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 00:17:27,613 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 00:17:27,613 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 00:17:27,629 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:27" (1/1) ... [2024-10-13 00:17:27,630 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:27" (1/1) ... [2024-10-13 00:17:27,633 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:27" (1/1) ... [2024-10-13 00:17:27,656 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 00:17:27,657 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:27" (1/1) ... [2024-10-13 00:17:27,657 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:27" (1/1) ... [2024-10-13 00:17:27,670 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:27" (1/1) ... [2024-10-13 00:17:27,677 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:27" (1/1) ... [2024-10-13 00:17:27,683 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:27" (1/1) ... [2024-10-13 00:17:27,687 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:27" (1/1) ... [2024-10-13 00:17:27,692 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 00:17:27,694 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 00:17:27,694 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 00:17:27,694 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 00:17:27,694 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:27" (1/1) ... [2024-10-13 00:17:27,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:17:27,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:17:27,733 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 00:17:27,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 00:17:27,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 00:17:27,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 00:17:27,824 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 00:17:27,824 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 00:17:27,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 00:17:27,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 00:17:27,904 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 00:17:27,906 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 00:17:31,890 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-13 00:17:31,891 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 00:17:31,936 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 00:17:31,936 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 00:17:31,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:17:31 BoogieIcfgContainer [2024-10-13 00:17:31,938 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 00:17:31,940 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 00:17:31,940 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 00:17:31,945 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 00:17:31,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:17:27" (1/3) ... [2024-10-13 00:17:31,946 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e2a8f8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:17:31, skipping insertion in model container [2024-10-13 00:17:31,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:27" (2/3) ... [2024-10-13 00:17:31,946 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e2a8f8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:17:31, skipping insertion in model container [2024-10-13 00:17:31,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:17:31" (3/3) ... [2024-10-13 00:17:31,948 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-74.i [2024-10-13 00:17:31,964 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 00:17:31,965 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 00:17:32,031 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 00:17:32,039 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;@248ad6b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 00:17:32,039 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 00:17:32,042 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 42 states have internal predecessors, (57), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 00:17:32,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-13 00:17:32,052 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:17:32,053 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:17:32,055 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:17:32,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:17:32,060 INFO L85 PathProgramCache]: Analyzing trace with hash -33743380, now seen corresponding path program 1 times [2024-10-13 00:17:32,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:17:32,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1918851933] [2024-10-13 00:17:32,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:17:32,078 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:17:32,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:17:32,081 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 00:17:32,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 00:17:32,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:32,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 00:17:32,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:17:32,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 774 proven. 0 refuted. 0 times theorem prover too weak. 738 trivial. 0 not checked. [2024-10-13 00:17:32,635 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 00:17:32,635 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 00:17:32,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1918851933] [2024-10-13 00:17:32,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1918851933] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:17:32,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:17:32,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 00:17:32,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088861058] [2024-10-13 00:17:32,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:17:32,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 00:17:32,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 00:17:32,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 00:17:32,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:17:32,669 INFO L87 Difference]: Start difference. First operand has 72 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 42 states have internal predecessors, (57), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-13 00:17:35,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:17:35,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:17:35,220 INFO L93 Difference]: Finished difference Result 141 states and 252 transitions. [2024-10-13 00:17:35,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 00:17:35,254 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 171 [2024-10-13 00:17:35,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:17:35,264 INFO L225 Difference]: With dead ends: 141 [2024-10-13 00:17:35,264 INFO L226 Difference]: Without dead ends: 70 [2024-10-13 00:17:35,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:17:35,280 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-13 00:17:35,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-13 00:17:35,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-13 00:17:35,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-10-13 00:17:35,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 40 states have (on average 1.3) internal successors, (52), 40 states have internal predecessors, (52), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 00:17:35,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 108 transitions. [2024-10-13 00:17:35,386 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 108 transitions. Word has length 171 [2024-10-13 00:17:35,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:17:35,386 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 108 transitions. [2024-10-13 00:17:35,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-13 00:17:35,387 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 108 transitions. [2024-10-13 00:17:35,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-13 00:17:35,396 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:17:35,397 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:17:35,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 00:17:35,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:17:35,599 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:17:35,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:17:35,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1501020576, now seen corresponding path program 1 times [2024-10-13 00:17:35,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:17:35,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1504051084] [2024-10-13 00:17:35,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:17:35,603 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:17:35,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:17:35,606 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 00:17:35,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 00:17:35,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:35,949 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 00:17:35,954 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:17:36,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 777 proven. 36 refuted. 0 times theorem prover too weak. 699 trivial. 0 not checked. [2024-10-13 00:17:36,230 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 00:17:36,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-10-13 00:17:36,551 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 00:17:36,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1504051084] [2024-10-13 00:17:36,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1504051084] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 00:17:36,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 00:17:36,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-10-13 00:17:36,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625904020] [2024-10-13 00:17:36,552 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 00:17:36,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 00:17:36,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 00:17:36,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 00:17:36,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 00:17:36,555 INFO L87 Difference]: Start difference. First operand 70 states and 108 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2024-10-13 00:17:38,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:17:38,517 INFO L93 Difference]: Finished difference Result 146 states and 220 transitions. [2024-10-13 00:17:38,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 00:17:38,540 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) Word has length 171 [2024-10-13 00:17:38,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:17:38,542 INFO L225 Difference]: With dead ends: 146 [2024-10-13 00:17:38,542 INFO L226 Difference]: Without dead ends: 77 [2024-10-13 00:17:38,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 334 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-13 00:17:38,544 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 71 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-13 00:17:38,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 147 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-13 00:17:38,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-13 00:17:38,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2024-10-13 00:17:38,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 42 states have internal predecessors, (51), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 00:17:38,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 107 transitions. [2024-10-13 00:17:38,556 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 107 transitions. Word has length 171 [2024-10-13 00:17:38,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:17:38,557 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 107 transitions. [2024-10-13 00:17:38,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2024-10-13 00:17:38,557 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 107 transitions. [2024-10-13 00:17:38,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-13 00:17:38,559 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:17:38,559 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:17:38,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-13 00:17:38,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:17:38,764 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:17:38,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:17:38,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1558278878, now seen corresponding path program 1 times [2024-10-13 00:17:38,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:17:38,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1511588897] [2024-10-13 00:17:38,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:17:38,768 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:17:38,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:17:38,772 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 00:17:38,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 00:17:39,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:39,065 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 00:17:39,070 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:17:39,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 1005 proven. 108 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2024-10-13 00:17:39,871 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 00:17:40,160 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 00:17:40,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1511588897] [2024-10-13 00:17:40,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1511588897] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 00:17:40,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1035921747] [2024-10-13 00:17:40,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:17:40,161 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 00:17:40,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 00:17:40,164 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 00:17:40,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-10-13 00:17:41,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:41,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-13 00:17:41,463 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:17:42,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 1005 proven. 108 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2024-10-13 00:17:42,390 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 00:17:42,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1035921747] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 00:17:42,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 00:17:42,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2024-10-13 00:17:42,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067563164] [2024-10-13 00:17:42,533 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 00:17:42,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 00:17:42,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 00:17:42,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 00:17:42,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2024-10-13 00:17:42,535 INFO L87 Difference]: Start difference. First operand 73 states and 107 transitions. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 states have internal predecessors, (49), 4 states have call successors, (28), 4 states have call predecessors, (28), 6 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2024-10-13 00:17:49,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.76s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:17:53,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.47s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:17:53,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:17:53,906 INFO L93 Difference]: Finished difference Result 203 states and 275 transitions. [2024-10-13 00:17:53,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-13 00:17:53,906 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 states have internal predecessors, (49), 4 states have call successors, (28), 4 states have call predecessors, (28), 6 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) Word has length 171 [2024-10-13 00:17:53,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:17:53,909 INFO L225 Difference]: With dead ends: 203 [2024-10-13 00:17:53,910 INFO L226 Difference]: Without dead ends: 131 [2024-10-13 00:17:53,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=232, Invalid=760, Unknown=0, NotChecked=0, Total=992 [2024-10-13 00:17:53,912 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 141 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2024-10-13 00:17:53,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 319 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 10.3s Time] [2024-10-13 00:17:53,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-13 00:17:53,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 107. [2024-10-13 00:17:53,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 70 states have (on average 1.2) internal successors, (84), 71 states have internal predecessors, (84), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-13 00:17:53,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 144 transitions. [2024-10-13 00:17:53,950 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 144 transitions. Word has length 171 [2024-10-13 00:17:53,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:17:53,954 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 144 transitions. [2024-10-13 00:17:53,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 states have internal predecessors, (49), 4 states have call successors, (28), 4 states have call predecessors, (28), 6 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2024-10-13 00:17:53,954 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 144 transitions. [2024-10-13 00:17:53,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-13 00:17:53,956 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:17:53,956 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:17:53,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-13 00:17:54,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2024-10-13 00:17:54,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-13 00:17:54,358 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:17:54,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:17:54,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1558219296, now seen corresponding path program 1 times [2024-10-13 00:17:54,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:17:54,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [137302015] [2024-10-13 00:17:54,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:17:54,360 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:17:54,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:17:54,362 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 00:17:54,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-13 00:17:55,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:17:55,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-13 00:17:55,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:18:37,955 WARN L286 SmtUtils]: Spent 14.60s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)