./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-54.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-54.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 83604eaba023e80a74c2adeaae77fd22a53b798f0a7ca2c7b67374de35192140 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 08:35:48,031 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 08:35:48,104 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 08:35:48,108 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 08:35:48,109 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 08:35:48,128 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 08:35:48,130 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 08:35:48,130 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 08:35:48,131 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 08:35:48,133 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 08:35:48,134 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 08:35:48,134 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 08:35:48,134 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 08:35:48,134 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 08:35:48,135 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 08:35:48,135 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 08:35:48,135 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 08:35:48,135 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 08:35:48,135 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 08:35:48,135 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 08:35:48,135 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 08:35:48,137 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 08:35:48,137 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 08:35:48,137 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 08:35:48,138 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 08:35:48,138 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 08:35:48,138 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 08:35:48,138 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 08:35:48,138 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 08:35:48,138 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 08:35:48,139 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 08:35:48,139 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 08:35:48,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 08:35:48,139 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 08:35:48,139 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 08:35:48,139 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 08:35:48,139 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 08:35:48,140 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 08:35:48,140 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 08:35:48,140 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 08:35:48,140 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 08:35:48,141 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 08:35:48,142 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 -> 83604eaba023e80a74c2adeaae77fd22a53b798f0a7ca2c7b67374de35192140 [2024-10-14 08:35:48,332 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 08:35:48,350 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 08:35:48,353 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 08:35:48,354 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 08:35:48,354 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 08:35:48,355 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-54.i [2024-10-14 08:35:49,674 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 08:35:49,831 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 08:35:49,832 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-54.i [2024-10-14 08:35:49,842 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/062fa325e/c13e7b2755054793b82ae77fb4a7e6be/FLAGc3650708c [2024-10-14 08:35:50,218 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/062fa325e/c13e7b2755054793b82ae77fb4a7e6be [2024-10-14 08:35:50,220 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 08:35:50,221 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 08:35:50,222 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 08:35:50,222 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 08:35:50,226 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 08:35:50,227 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:35:50" (1/1) ... [2024-10-14 08:35:50,229 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50bac310 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:35:50, skipping insertion in model container [2024-10-14 08:35:50,229 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:35:50" (1/1) ... [2024-10-14 08:35:50,251 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 08:35:50,357 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-54.i[915,928] [2024-10-14 08:35:50,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 08:35:50,430 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 08:35:50,443 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-54.i[915,928] [2024-10-14 08:35:50,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 08:35:50,498 INFO L204 MainTranslator]: Completed translation [2024-10-14 08:35:50,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:35:50 WrapperNode [2024-10-14 08:35:50,501 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 08:35:50,503 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 08:35:50,504 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 08:35:50,504 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 08:35:50,510 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:35:50" (1/1) ... [2024-10-14 08:35:50,518 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:35:50" (1/1) ... [2024-10-14 08:35:50,551 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 190 [2024-10-14 08:35:50,551 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 08:35:50,553 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 08:35:50,553 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 08:35:50,553 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 08:35:50,561 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:35:50" (1/1) ... [2024-10-14 08:35:50,562 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:35:50" (1/1) ... [2024-10-14 08:35:50,564 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:35:50" (1/1) ... [2024-10-14 08:35:50,575 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-14 08:35:50,575 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:35:50" (1/1) ... [2024-10-14 08:35:50,576 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:35:50" (1/1) ... [2024-10-14 08:35:50,582 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:35:50" (1/1) ... [2024-10-14 08:35:50,587 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:35:50" (1/1) ... [2024-10-14 08:35:50,589 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:35:50" (1/1) ... [2024-10-14 08:35:50,594 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:35:50" (1/1) ... [2024-10-14 08:35:50,600 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 08:35:50,601 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 08:35:50,601 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 08:35:50,601 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 08:35:50,604 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:35:50" (1/1) ... [2024-10-14 08:35:50,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 08:35:50,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 08:35:50,644 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-14 08:35:50,646 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-14 08:35:50,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 08:35:50,685 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 08:35:50,686 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 08:35:50,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 08:35:50,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 08:35:50,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 08:35:50,752 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 08:35:50,754 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 08:35:51,044 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-14 08:35:51,044 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 08:35:51,135 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 08:35:51,135 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 08:35:51,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:35:51 BoogieIcfgContainer [2024-10-14 08:35:51,135 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 08:35:51,142 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 08:35:51,142 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 08:35:51,146 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 08:35:51,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 08:35:50" (1/3) ... [2024-10-14 08:35:51,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47c9805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:35:51, skipping insertion in model container [2024-10-14 08:35:51,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:35:50" (2/3) ... [2024-10-14 08:35:51,148 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47c9805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:35:51, skipping insertion in model container [2024-10-14 08:35:51,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:35:51" (3/3) ... [2024-10-14 08:35:51,149 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-54.i [2024-10-14 08:35:51,162 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 08:35:51,162 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 08:35:51,205 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 08:35:51,210 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;@52f70bd5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 08:35:51,210 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 08:35:51,214 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 48 states have internal predecessors, (69), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 08:35:51,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-14 08:35:51,228 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:35:51,229 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 08:35:51,229 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:35:51,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:35:51,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1194292048, now seen corresponding path program 1 times [2024-10-14 08:35:51,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 08:35:51,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810640836] [2024-10-14 08:35:51,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:35:51,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 08:35:51,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:35:51,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 08:35:51,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:35:51,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 08:35:51,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:35:51,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 08:35:51,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:35:51,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 08:35:51,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:35:51,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 08:35:51,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:35:51,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 08:35:51,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:35:51,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 08:35:51,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:35:51,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 08:35:51,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:35:51,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 08:35:51,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:35:51,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 08:35:51,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:35:51,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 08:35:51,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:35:51,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 08:35:51,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:35:51,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 08:35:51,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:35:51,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 08:35:51,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:35:51,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 08:35:51,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:35:51,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 08:35:51,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:35:51,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 08:35:51,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:35:51,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 08:35:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:35:51,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 08:35:51,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:35:51,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 08:35:51,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:35:51,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 08:35:51,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:35:51,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 08:35:51,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:35:51,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-14 08:35:51,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:35:51,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-14 08:35:51,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:35:51,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-14 08:35:51,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:35:51,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 08:35:51,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:35:51,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 08:35:51,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 08:35:51,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810640836] [2024-10-14 08:35:51,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810640836] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:35:51,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:35:51,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 08:35:51,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440923431] [2024-10-14 08:35:51,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:35:51,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 08:35:51,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 08:35:51,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 08:35:51,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 08:35:51,684 INFO L87 Difference]: Start difference. First operand has 76 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 48 states have internal predecessors, (69), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-14 08:35:51,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:35:51,724 INFO L93 Difference]: Finished difference Result 149 states and 266 transitions. [2024-10-14 08:35:51,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 08:35:51,728 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 164 [2024-10-14 08:35:51,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:35:51,735 INFO L225 Difference]: With dead ends: 149 [2024-10-14 08:35:51,735 INFO L226 Difference]: Without dead ends: 74 [2024-10-14 08:35:51,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 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-14 08:35:51,740 INFO L432 NwaCegarLoop]: 113 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, 113 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-14 08:35:51,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 08:35:51,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-14 08:35:51,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-10-14 08:35:51,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 46 states have (on average 1.391304347826087) internal successors, (64), 46 states have internal predecessors, (64), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 08:35:51,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 116 transitions. [2024-10-14 08:35:51,782 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 116 transitions. Word has length 164 [2024-10-14 08:35:51,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:35:51,783 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 116 transitions. [2024-10-14 08:35:51,784 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-14 08:35:51,784 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 116 transitions. [2024-10-14 08:35:51,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-14 08:35:51,789 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:35:51,789 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 08:35:51,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 08:35:51,790 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:35:51,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:35:51,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1478249676, now seen corresponding path program 1 times [2024-10-14 08:35:51,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 08:35:51,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563245350] [2024-10-14 08:35:51,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:35:51,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 08:35:51,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:35:52,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 08:35:52,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:35:52,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 08:35:52,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:35:52,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 08:35:52,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:35:52,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 08:35:52,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:35:52,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 08:35:52,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:35:52,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 08:35:52,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:35:52,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 08:35:52,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:35:52,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 08:35:52,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:35:52,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 08:35:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:35:52,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 08:35:52,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:35:52,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 08:35:52,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:35:52,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 08:35:52,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:35:52,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 08:35:52,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:35:52,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 08:35:52,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:35:52,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 08:35:52,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:35:52,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 08:35:52,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:35:52,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 08:35:52,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:35:52,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 08:35:52,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:35:52,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 08:35:52,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:35:52,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 08:35:52,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:35:52,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 08:35:52,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:35:52,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 08:35:52,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:35:52,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-14 08:35:52,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:35:52,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-14 08:35:52,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:35:52,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-14 08:35:52,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:35:52,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 08:35:52,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:35:52,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 08:35:52,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 08:35:52,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563245350] [2024-10-14 08:35:52,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563245350] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:35:52,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:35:52,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 08:35:52,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984671810] [2024-10-14 08:35:52,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:35:52,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 08:35:52,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 08:35:52,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 08:35:52,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 08:35:52,288 INFO L87 Difference]: Start difference. First operand 74 states and 116 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 08:35:52,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:35:52,437 INFO L93 Difference]: Finished difference Result 221 states and 347 transitions. [2024-10-14 08:35:52,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 08:35:52,437 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 164 [2024-10-14 08:35:52,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:35:52,442 INFO L225 Difference]: With dead ends: 221 [2024-10-14 08:35:52,442 INFO L226 Difference]: Without dead ends: 148 [2024-10-14 08:35:52,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 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-14 08:35:52,443 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 90 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 08:35:52,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 334 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 08:35:52,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-10-14 08:35:52,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 133. [2024-10-14 08:35:52,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 78 states have (on average 1.3461538461538463) internal successors, (105), 78 states have internal predecessors, (105), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-14 08:35:52,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 209 transitions. [2024-10-14 08:35:52,473 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 209 transitions. Word has length 164 [2024-10-14 08:35:52,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:35:52,474 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 209 transitions. [2024-10-14 08:35:52,474 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 08:35:52,474 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 209 transitions. [2024-10-14 08:35:52,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-14 08:35:52,476 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:35:52,476 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 08:35:52,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 08:35:52,477 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:35:52,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:35:52,477 INFO L85 PathProgramCache]: Analyzing trace with hash -332394153, now seen corresponding path program 1 times [2024-10-14 08:35:52,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 08:35:52,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114304319] [2024-10-14 08:35:52,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:35:52,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 08:35:52,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 08:35:52,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2051472110] [2024-10-14 08:35:52,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:35:52,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 08:35:52,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 08:35:52,679 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-14 08:35:52,680 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-14 08:35:53,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 08:35:53,488 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 08:35:53,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 08:35:53,678 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 08:35:53,678 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 08:35:53,679 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 08:35:53,691 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-14 08:35:53,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 08:35:53,885 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-14 08:35:53,977 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 08:35:53,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 08:35:53 BoogieIcfgContainer [2024-10-14 08:35:53,980 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 08:35:53,980 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 08:35:53,980 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 08:35:53,980 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 08:35:53,981 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:35:51" (3/4) ... [2024-10-14 08:35:53,982 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 08:35:53,983 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 08:35:53,984 INFO L158 Benchmark]: Toolchain (without parser) took 3762.67ms. Allocated memory was 176.2MB in the beginning and 262.1MB in the end (delta: 86.0MB). Free memory was 119.4MB in the beginning and 142.9MB in the end (delta: -23.5MB). Peak memory consumption was 62.6MB. Max. memory is 16.1GB. [2024-10-14 08:35:53,984 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 176.2MB. Free memory is still 137.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 08:35:53,984 INFO L158 Benchmark]: CACSL2BoogieTranslator took 279.79ms. Allocated memory is still 176.2MB. Free memory was 118.9MB in the beginning and 103.8MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 08:35:53,984 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.31ms. Allocated memory is still 176.2MB. Free memory was 103.8MB in the beginning and 100.6MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 08:35:53,985 INFO L158 Benchmark]: Boogie Preprocessor took 47.86ms. Allocated memory is still 176.2MB. Free memory was 100.6MB in the beginning and 97.0MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 08:35:53,985 INFO L158 Benchmark]: RCFGBuilder took 534.07ms. Allocated memory was 176.2MB in the beginning and 262.1MB in the end (delta: 86.0MB). Free memory was 97.0MB in the beginning and 229.8MB in the end (delta: -132.9MB). Peak memory consumption was 36.3MB. Max. memory is 16.1GB. [2024-10-14 08:35:53,985 INFO L158 Benchmark]: TraceAbstraction took 2838.12ms. Allocated memory is still 262.1MB. Free memory was 229.8MB in the beginning and 144.0MB in the end (delta: 85.8MB). Peak memory consumption was 82.9MB. Max. memory is 16.1GB. [2024-10-14 08:35:53,985 INFO L158 Benchmark]: Witness Printer took 3.05ms. Allocated memory is still 262.1MB. Free memory was 144.0MB in the beginning and 142.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 08:35:53,989 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 176.2MB. Free memory is still 137.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 279.79ms. Allocated memory is still 176.2MB. Free memory was 118.9MB in the beginning and 103.8MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.31ms. Allocated memory is still 176.2MB. Free memory was 103.8MB in the beginning and 100.6MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.86ms. Allocated memory is still 176.2MB. Free memory was 100.6MB in the beginning and 97.0MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 534.07ms. Allocated memory was 176.2MB in the beginning and 262.1MB in the end (delta: 86.0MB). Free memory was 97.0MB in the beginning and 229.8MB in the end (delta: -132.9MB). Peak memory consumption was 36.3MB. Max. memory is 16.1GB. * TraceAbstraction took 2838.12ms. Allocated memory is still 262.1MB. Free memory was 229.8MB in the beginning and 144.0MB in the end (delta: 85.8MB). Peak memory consumption was 82.9MB. Max. memory is 16.1GB. * Witness Printer took 3.05ms. Allocated memory is still 262.1MB. Free memory was 144.0MB in the beginning and 142.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 161, overapproximation of someBinaryFLOATComparisonOperation at line 161. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -4; [L23] signed short int var_1_4 = 256; [L24] signed short int var_1_5 = 0; [L25] signed short int var_1_6 = 25; [L26] signed short int var_1_8 = 100; [L27] unsigned char var_1_9 = 1; [L28] signed short int var_1_10 = -4; [L29] unsigned char var_1_11 = 0; [L30] unsigned char var_1_12 = 0; [L31] unsigned char var_1_13 = 1; [L32] unsigned long int var_1_14 = 64; [L33] double var_1_15 = 10.3; [L34] double var_1_16 = 128.6; [L35] unsigned long int var_1_17 = 2600113953; [L36] float var_1_18 = 8.25; [L37] float var_1_19 = 31.5; [L38] float var_1_20 = 2.625; [L39] float var_1_21 = 999999999999999.2; [L40] float var_1_22 = 127.5; [L41] float var_1_23 = 4.8; [L42] float var_1_24 = 16.5; [L43] signed long int var_1_25 = 10; [L44] unsigned char var_1_26 = 64; [L45] unsigned short int var_1_27 = 16; [L46] unsigned char var_1_28 = 1; [L47] unsigned char var_1_29 = 0; [L48] signed long int var_1_30 = 2; [L49] signed long int var_1_31 = 10; [L50] unsigned char last_1_var_1_9 = 1; [L165] isInitial = 1 [L166] FCALL initially() [L167] COND TRUE 1 [L168] CALL updateLastVariables() [L158] last_1_var_1_9 = var_1_9 [L168] RET updateLastVariables() [L169] CALL updateVariables() [L114] var_1_4 = __VERIFIER_nondet_short() [L115] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L115] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L116] CALL assume_abort_if_not(var_1_4 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L116] RET assume_abort_if_not(var_1_4 <= 16383) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L117] var_1_5 = __VERIFIER_nondet_short() [L118] CALL assume_abort_if_not(var_1_5 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=100, var_1_9=1] [L118] RET assume_abort_if_not(var_1_5 >= -1) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=100, var_1_9=1] [L119] CALL assume_abort_if_not(var_1_5 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=100, var_1_9=1] [L119] RET assume_abort_if_not(var_1_5 <= 32766) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=100, var_1_9=1] [L120] var_1_8 = __VERIFIER_nondet_short() [L121] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L121] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L122] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L122] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L123] var_1_10 = __VERIFIER_nondet_short() [L124] CALL assume_abort_if_not(var_1_10 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L124] RET assume_abort_if_not(var_1_10 >= -32768) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L125] CALL assume_abort_if_not(var_1_10 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L125] RET assume_abort_if_not(var_1_10 <= 32767) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L126] CALL assume_abort_if_not(var_1_10 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L126] RET assume_abort_if_not(var_1_10 != 0) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L127] var_1_11 = __VERIFIER_nondet_uchar() [L128] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L128] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L129] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L129] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L130] var_1_12 = __VERIFIER_nondet_uchar() [L131] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L131] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L132] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L132] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L133] var_1_15 = __VERIFIER_nondet_double() [L134] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L134] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L135] var_1_16 = __VERIFIER_nondet_double() [L136] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L136] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L137] var_1_17 = __VERIFIER_nondet_ulong() [L138] CALL assume_abort_if_not(var_1_17 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L138] RET assume_abort_if_not(var_1_17 >= 2147483647) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L139] CALL assume_abort_if_not(var_1_17 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L139] RET assume_abort_if_not(var_1_17 <= 4294967294) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L140] var_1_19 = __VERIFIER_nondet_float() [L141] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L141] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L142] var_1_20 = __VERIFIER_nondet_float() [L143] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_1=-4, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_1=-4, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L143] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_1=-4, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L144] var_1_21 = __VERIFIER_nondet_float() [L145] CALL assume_abort_if_not((var_1_21 >= -230584.3009213691390e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 2305843.009213691390e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_1=-4, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_1=-4, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L145] RET assume_abort_if_not((var_1_21 >= -230584.3009213691390e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 2305843.009213691390e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_1=-4, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L146] var_1_22 = __VERIFIER_nondet_float() [L147] CALL assume_abort_if_not((var_1_22 >= -230584.3009213691390e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L147] RET assume_abort_if_not((var_1_22 >= -230584.3009213691390e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L148] var_1_24 = __VERIFIER_nondet_float() [L149] CALL assume_abort_if_not((var_1_24 >= -922337.2036854765600e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L149] RET assume_abort_if_not((var_1_24 >= -922337.2036854765600e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L150] var_1_29 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_29 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L151] RET assume_abort_if_not(var_1_29 >= 1) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L152] CALL assume_abort_if_not(var_1_29 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L152] RET assume_abort_if_not(var_1_29 <= 1) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L153] var_1_31 = __VERIFIER_nondet_long() [L154] CALL assume_abort_if_not(var_1_31 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=-2147483647, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=-2147483647, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L154] RET assume_abort_if_not(var_1_31 >= -2147483647) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=-2147483647, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L155] CALL assume_abort_if_not(var_1_31 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=-2147483647, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=-2147483647, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L155] RET assume_abort_if_not(var_1_31 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=-2147483647, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L169] RET updateVariables() [L170] CALL step() [L54] var_1_23 = var_1_24 [L55] var_1_25 = 256 VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_1=-4, var_1_23=2, var_1_24=2, var_1_25=256, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=-2147483647, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L56] COND TRUE var_1_24 > ((((63.125f) > (var_1_23)) ? (63.125f) : (var_1_23))) [L57] var_1_26 = ((((1) < 0 ) ? -(1) : (1))) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_1=-4, var_1_23=2, var_1_24=2, var_1_25=256, var_1_26=1, var_1_27=16, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=-2147483647, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L59] var_1_27 = var_1_26 VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_1=-4, var_1_23=2, var_1_24=2, var_1_25=256, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=-2147483647, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L60] COND FALSE !(1 > var_1_27) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_1=-4, var_1_23=2, var_1_24=2, var_1_25=256, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=-2147483647, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L65] COND FALSE !(var_1_23 < var_1_24) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_1=-4, var_1_23=2, var_1_24=2, var_1_25=256, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=-2147483647, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L70] COND TRUE \read(var_1_29) [L71] var_1_30 = var_1_27 VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_1=-4, var_1_23=2, var_1_24=2, var_1_25=256, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-2147483647, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L76] COND TRUE \read(last_1_var_1_9) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_1=-4, var_1_23=2, var_1_24=2, var_1_25=256, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-2147483647, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L77] COND TRUE var_1_5 == var_1_4 [L78] var_1_6 = ((((((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))) < ((var_1_4 - var_1_8))) ? (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))) : ((var_1_4 - var_1_8)))) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_1=-4, var_1_23=2, var_1_24=2, var_1_25=256, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-2147483647, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=1] [L85] COND FALSE !(-32 >= (var_1_5 - var_1_8)) [L92] var_1_18 = var_1_19 VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=3, var_1_19=3, var_1_1=-4, var_1_23=2, var_1_24=2, var_1_25=256, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-2147483647, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=1] [L94] COND TRUE var_1_18 < ((((var_1_18) > ((var_1_15 - var_1_16))) ? (var_1_18) : ((var_1_15 - var_1_16)))) [L95] var_1_14 = (var_1_17 - (var_1_8 + var_1_4)) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=2147483646, var_1_17=2147483648, var_1_18=3, var_1_19=3, var_1_1=-4, var_1_23=2, var_1_24=2, var_1_25=256, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-2147483647, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=1] [L97] unsigned long int stepLocal_0 = var_1_14; VAL [isInitial=1, last_1_var_1_9=1, stepLocal_0=2147483646, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=2147483646, var_1_17=2147483648, var_1_18=3, var_1_19=3, var_1_1=-4, var_1_23=2, var_1_24=2, var_1_25=256, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-2147483647, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=1] [L98] COND TRUE ((var_1_8 % var_1_10) * (8 + var_1_14)) >= stepLocal_0 [L99] var_1_9 = ((! var_1_11) || var_1_12) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=2147483646, var_1_17=2147483648, var_1_18=3, var_1_19=3, var_1_1=-4, var_1_23=2, var_1_24=2, var_1_25=256, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-2147483647, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L103] COND TRUE var_1_18 > var_1_18 [L104] var_1_1 = ((((((2 + var_1_4)) < (var_1_5)) ? ((2 + var_1_4)) : (var_1_5))) - 2) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=2147483646, var_1_17=2147483648, var_1_18=3, var_1_19=3, var_1_1=-1, var_1_23=2, var_1_24=2, var_1_25=256, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-2147483647, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L108] unsigned long int stepLocal_1 = (((var_1_14) < (var_1_5)) ? (var_1_14) : (var_1_5)); VAL [isInitial=1, last_1_var_1_9=1, stepLocal_1=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=2147483646, var_1_17=2147483648, var_1_18=3, var_1_19=3, var_1_1=-1, var_1_23=2, var_1_24=2, var_1_25=256, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-2147483647, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L109] COND FALSE !(((var_1_8 * var_1_1) + var_1_4) >= stepLocal_1) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=2147483646, var_1_17=2147483648, var_1_18=3, var_1_19=3, var_1_1=-1, var_1_23=2, var_1_24=2, var_1_25=256, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-2147483647, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L170] RET step() [L171] CALL, EXPR property() [L161-L162] return ((((((var_1_18 > var_1_18) ? (var_1_1 == ((signed short int) ((((((2 + var_1_4)) < (var_1_5)) ? ((2 + var_1_4)) : (var_1_5))) - 2))) : (var_1_1 == ((signed short int) var_1_4))) && (last_1_var_1_9 ? ((var_1_5 == var_1_4) ? (var_1_6 == ((signed short int) ((((((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))) < ((var_1_4 - var_1_8))) ? (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))) : ((var_1_4 - var_1_8)))))) : (var_1_6 == ((signed short int) var_1_8))) : (var_1_6 == ((signed short int) var_1_4)))) && ((((var_1_8 % var_1_10) * (8 + var_1_14)) >= var_1_14) ? (var_1_9 == ((unsigned char) ((! var_1_11) || var_1_12))) : (var_1_9 == ((unsigned char) (! var_1_12))))) && ((((var_1_8 * var_1_1) + var_1_4) >= ((((var_1_14) < (var_1_5)) ? (var_1_14) : (var_1_5)))) ? (var_1_13 == ((unsigned char) var_1_12)) : 1)) && ((var_1_18 < ((((var_1_18) > ((var_1_15 - var_1_16))) ? (var_1_18) : ((var_1_15 - var_1_16))))) ? (var_1_14 == ((unsigned long int) (var_1_17 - (var_1_8 + var_1_4)))) : 1)) && ((-32 >= (var_1_5 - var_1_8)) ? ((var_1_10 > var_1_6) ? (var_1_18 == ((float) ((var_1_19 - var_1_20) + (var_1_21 + var_1_22)))) : (var_1_18 == ((float) var_1_20))) : (var_1_18 == ((float) var_1_19))) ; [L171] RET, EXPR property() [L171] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=2147483646, var_1_17=2147483648, var_1_18=3, var_1_19=3, var_1_1=-1, var_1_23=2, var_1_24=2, var_1_25=256, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-2147483647, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=2147483646, var_1_17=2147483648, var_1_18=3, var_1_19=3, var_1_1=-1, var_1_23=2, var_1_24=2, var_1_25=256, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-2147483647, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 76 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 3, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 90 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 90 mSDsluCounter, 447 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 222 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15 IncrementalHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 225 mSDtfsCounter, 15 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=2, InterpolantAutomatonStates: 6, 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, 2 MinimizatonAttempts, 15 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 658 NumberOfCodeBlocks, 658 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 326 ConstructedInterpolants, 0 QuantifiedInterpolants, 712 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 2600/2600 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-14 08:35:54,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-54.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 83604eaba023e80a74c2adeaae77fd22a53b798f0a7ca2c7b67374de35192140 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 08:35:55,784 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 08:35:55,855 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 08:35:55,860 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 08:35:55,861 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 08:35:55,882 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 08:35:55,883 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 08:35:55,883 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 08:35:55,884 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 08:35:55,884 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 08:35:55,884 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 08:35:55,885 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 08:35:55,885 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 08:35:55,886 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 08:35:55,887 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 08:35:55,888 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 08:35:55,889 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 08:35:55,889 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 08:35:55,889 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 08:35:55,889 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 08:35:55,889 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 08:35:55,891 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 08:35:55,891 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 08:35:55,891 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 08:35:55,891 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 08:35:55,893 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 08:35:55,894 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 08:35:55,894 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 08:35:55,894 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 08:35:55,894 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 08:35:55,894 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 08:35:55,894 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 08:35:55,894 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 08:35:55,895 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 08:35:55,895 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 08:35:55,895 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 08:35:55,895 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 08:35:55,895 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 08:35:55,895 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 08:35:55,895 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 08:35:55,896 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 08:35:55,896 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 08:35:55,897 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 08:35:55,897 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 08:35:55,897 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 08:35:55,897 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 -> 83604eaba023e80a74c2adeaae77fd22a53b798f0a7ca2c7b67374de35192140 [2024-10-14 08:35:56,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 08:35:56,175 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 08:35:56,177 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 08:35:56,178 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 08:35:56,179 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 08:35:56,180 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-54.i [2024-10-14 08:35:57,456 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 08:35:57,629 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 08:35:57,631 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-54.i [2024-10-14 08:35:57,642 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70ce58a2f/41a4ba50cbec4126bd67e35d56e7d7cb/FLAGac4b446af [2024-10-14 08:35:57,656 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70ce58a2f/41a4ba50cbec4126bd67e35d56e7d7cb [2024-10-14 08:35:57,658 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 08:35:57,659 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 08:35:57,671 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 08:35:57,671 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 08:35:57,675 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 08:35:57,676 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:35:57" (1/1) ... [2024-10-14 08:35:57,677 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2550ae8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:35:57, skipping insertion in model container [2024-10-14 08:35:57,677 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:35:57" (1/1) ... [2024-10-14 08:35:57,700 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 08:35:57,824 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-54.i[915,928] [2024-10-14 08:35:57,891 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 08:35:57,908 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 08:35:57,917 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-54.i[915,928] [2024-10-14 08:35:57,954 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 08:35:57,977 INFO L204 MainTranslator]: Completed translation [2024-10-14 08:35:57,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:35:57 WrapperNode [2024-10-14 08:35:57,977 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 08:35:57,978 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 08:35:57,979 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 08:35:57,979 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 08:35:57,984 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:35:57" (1/1) ... [2024-10-14 08:35:57,999 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:35:57" (1/1) ... [2024-10-14 08:35:58,022 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 174 [2024-10-14 08:35:58,022 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 08:35:58,023 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 08:35:58,023 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 08:35:58,023 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 08:35:58,033 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:35:57" (1/1) ... [2024-10-14 08:35:58,033 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:35:57" (1/1) ... [2024-10-14 08:35:58,039 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:35:57" (1/1) ... [2024-10-14 08:35:58,054 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-14 08:35:58,057 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:35:57" (1/1) ... [2024-10-14 08:35:58,057 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:35:57" (1/1) ... [2024-10-14 08:35:58,080 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:35:57" (1/1) ... [2024-10-14 08:35:58,084 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:35:57" (1/1) ... [2024-10-14 08:35:58,086 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:35:57" (1/1) ... [2024-10-14 08:35:58,087 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:35:57" (1/1) ... [2024-10-14 08:35:58,098 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 08:35:58,099 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 08:35:58,103 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 08:35:58,103 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 08:35:58,104 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:35:57" (1/1) ... [2024-10-14 08:35:58,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 08:35:58,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 08:35:58,138 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-14 08:35:58,143 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-14 08:35:58,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 08:35:58,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 08:35:58,174 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 08:35:58,174 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 08:35:58,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 08:35:58,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 08:35:58,247 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 08:35:58,249 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 08:36:00,941 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-14 08:36:00,941 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 08:36:01,006 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 08:36:01,006 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 08:36:01,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:36:01 BoogieIcfgContainer [2024-10-14 08:36:01,007 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 08:36:01,016 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 08:36:01,016 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 08:36:01,019 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 08:36:01,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 08:35:57" (1/3) ... [2024-10-14 08:36:01,024 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a6a390d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:36:01, skipping insertion in model container [2024-10-14 08:36:01,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:35:57" (2/3) ... [2024-10-14 08:36:01,024 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a6a390d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:36:01, skipping insertion in model container [2024-10-14 08:36:01,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:36:01" (3/3) ... [2024-10-14 08:36:01,025 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-54.i [2024-10-14 08:36:01,041 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 08:36:01,041 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 08:36:01,101 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 08:36:01,107 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;@64eb63dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 08:36:01,107 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 08:36:01,111 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 43 states have (on average 1.441860465116279) internal successors, (62), 44 states have internal predecessors, (62), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 08:36:01,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-14 08:36:01,120 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:36:01,120 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 08:36:01,121 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:36:01,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:36:01,125 INFO L85 PathProgramCache]: Analyzing trace with hash 376376707, now seen corresponding path program 1 times [2024-10-14 08:36:01,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 08:36:01,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1203891963] [2024-10-14 08:36:01,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:36:01,135 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-14 08:36:01,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 08:36:01,138 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-14 08:36:01,139 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-14 08:36:01,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:36:01,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 08:36:01,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 08:36:01,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 986 trivial. 0 not checked. [2024-10-14 08:36:01,569 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 08:36:01,570 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 08:36:01,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1203891963] [2024-10-14 08:36:01,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1203891963] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:36:01,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:36:01,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 08:36:01,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820162729] [2024-10-14 08:36:01,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:36:01,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 08:36:01,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 08:36:01,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 08:36:01,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 08:36:01,598 INFO L87 Difference]: Start difference. First operand has 72 states, 43 states have (on average 1.441860465116279) internal successors, (62), 44 states have internal predecessors, (62), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-14 08:36:04,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.28s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 08:36:04,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:36:04,921 INFO L93 Difference]: Finished difference Result 141 states and 252 transitions. [2024-10-14 08:36:04,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 08:36:04,952 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 164 [2024-10-14 08:36:04,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:36:04,958 INFO L225 Difference]: With dead ends: 141 [2024-10-14 08:36:04,958 INFO L226 Difference]: Without dead ends: 70 [2024-10-14 08:36:04,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 163 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-14 08:36:04,963 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s 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, 3.3s IncrementalHoareTripleChecker+Time [2024-10-14 08:36:04,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-14 08:36:04,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-14 08:36:05,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-10-14 08:36:05,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 42 states have internal predecessors, (56), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 08:36:05,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 108 transitions. [2024-10-14 08:36:05,015 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 108 transitions. Word has length 164 [2024-10-14 08:36:05,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:36:05,016 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 108 transitions. [2024-10-14 08:36:05,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-14 08:36:05,016 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 108 transitions. [2024-10-14 08:36:05,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-14 08:36:05,018 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:36:05,019 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 08:36:05,038 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-14 08:36:05,222 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-14 08:36:05,223 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:36:05,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:36:05,224 INFO L85 PathProgramCache]: Analyzing trace with hash 717592637, now seen corresponding path program 1 times [2024-10-14 08:36:05,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 08:36:05,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2036501066] [2024-10-14 08:36:05,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:36:05,225 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-14 08:36:05,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 08:36:05,228 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-14 08:36:05,229 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-14 08:36:05,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:36:05,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 08:36:05,543 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 08:36:05,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 08:36:05,627 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 08:36:05,627 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 08:36:05,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2036501066] [2024-10-14 08:36:05,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2036501066] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:36:05,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:36:05,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 08:36:05,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317400627] [2024-10-14 08:36:05,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:36:05,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 08:36:05,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 08:36:05,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 08:36:05,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 08:36:05,632 INFO L87 Difference]: Start difference. First operand 70 states and 108 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 08:36:09,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 08:36:09,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:36:09,797 INFO L93 Difference]: Finished difference Result 177 states and 272 transitions. [2024-10-14 08:36:09,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 08:36:09,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 164 [2024-10-14 08:36:09,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:36:09,800 INFO L225 Difference]: With dead ends: 177 [2024-10-14 08:36:09,800 INFO L226 Difference]: Without dead ends: 108 [2024-10-14 08:36:09,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 08:36:09,801 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 87 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-14 08:36:09,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 225 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2024-10-14 08:36:09,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-14 08:36:09,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2024-10-14 08:36:09,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 57 states have (on average 1.1929824561403508) internal successors, (68), 58 states have internal predecessors, (68), 47 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2024-10-14 08:36:09,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 162 transitions. [2024-10-14 08:36:09,820 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 162 transitions. Word has length 164 [2024-10-14 08:36:09,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:36:09,821 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 162 transitions. [2024-10-14 08:36:09,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 08:36:09,821 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 162 transitions. [2024-10-14 08:36:09,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-14 08:36:09,826 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:36:09,827 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 08:36:09,844 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-14 08:36:10,027 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-14 08:36:10,028 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:36:10,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:36:10,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1618038021, now seen corresponding path program 1 times [2024-10-14 08:36:10,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 08:36:10,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1732609104] [2024-10-14 08:36:10,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:36:10,029 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-14 08:36:10,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 08:36:10,033 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-14 08:36:10,034 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-14 08:36:10,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:36:10,345 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 08:36:10,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 08:36:11,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 08:36:11,125 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 08:36:11,125 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 08:36:11,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1732609104] [2024-10-14 08:36:11,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1732609104] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:36:11,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:36:11,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 08:36:11,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451995117] [2024-10-14 08:36:11,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:36:11,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 08:36:11,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 08:36:11,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 08:36:11,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 08:36:11,127 INFO L87 Difference]: Start difference. First operand 107 states and 162 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 08:36:13,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 08:36:15,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 08:36:15,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:36:15,744 INFO L93 Difference]: Finished difference Result 214 states and 317 transitions. [2024-10-14 08:36:15,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 08:36:15,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 164 [2024-10-14 08:36:15,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:36:15,776 INFO L225 Difference]: With dead ends: 214 [2024-10-14 08:36:15,776 INFO L226 Difference]: Without dead ends: 142 [2024-10-14 08:36:15,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 08:36:15,782 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 64 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-10-14 08:36:15,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 298 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-10-14 08:36:15,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-14 08:36:15,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 127. [2024-10-14 08:36:15,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 71 states have (on average 1.1971830985915493) internal successors, (85), 71 states have internal predecessors, (85), 52 states have call successors, (52), 3 states have call predecessors, (52), 3 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-14 08:36:15,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 189 transitions. [2024-10-14 08:36:15,811 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 189 transitions. Word has length 164 [2024-10-14 08:36:15,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:36:15,811 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 189 transitions. [2024-10-14 08:36:15,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 08:36:15,812 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 189 transitions. [2024-10-14 08:36:15,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-14 08:36:15,813 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:36:15,813 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 08:36:15,829 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-14 08:36:16,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 08:36:16,018 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:36:16,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:36:16,022 INFO L85 PathProgramCache]: Analyzing trace with hash 750973431, now seen corresponding path program 1 times [2024-10-14 08:36:16,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 08:36:16,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1385152523] [2024-10-14 08:36:16,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:36:16,024 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-14 08:36:16,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 08:36:16,027 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 08:36:16,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 08:36:16,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:36:16,391 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-14 08:36:16,397 INFO L278 TraceCheckSpWp]: Computing forward predicates...