./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-55.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-55.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 ce316f509a61e336c72d9b843bd50624ceda1debc7995e28227acf1d2e0c2734 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 02:43:44,762 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 02:43:44,843 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 02:43:44,848 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 02:43:44,848 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 02:43:44,889 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 02:43:44,890 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 02:43:44,890 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 02:43:44,891 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 02:43:44,891 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 02:43:44,892 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 02:43:44,892 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 02:43:44,892 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 02:43:44,893 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 02:43:44,893 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 02:43:44,894 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 02:43:44,894 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 02:43:44,894 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 02:43:44,895 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 02:43:44,895 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 02:43:44,895 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 02:43:44,896 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 02:43:44,896 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 02:43:44,896 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 02:43:44,897 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 02:43:44,897 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 02:43:44,897 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 02:43:44,897 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 02:43:44,898 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 02:43:44,898 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 02:43:44,898 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 02:43:44,898 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 02:43:44,899 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:43:44,899 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 02:43:44,903 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 02:43:44,903 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 02:43:44,903 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 02:43:44,903 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 02:43:44,904 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 02:43:44,904 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 02:43:44,904 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 02:43:44,905 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 02:43:44,906 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 -> ce316f509a61e336c72d9b843bd50624ceda1debc7995e28227acf1d2e0c2734 [2024-10-13 02:43:45,149 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 02:43:45,175 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 02:43:45,178 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 02:43:45,179 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 02:43:45,179 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 02:43:45,180 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-55.i [2024-10-13 02:43:46,667 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 02:43:46,863 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 02:43:46,864 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-55.i [2024-10-13 02:43:46,878 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9062eaa55/6d47a8ee7c7244688bb883641f79da89/FLAG866e4f431 [2024-10-13 02:43:46,891 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9062eaa55/6d47a8ee7c7244688bb883641f79da89 [2024-10-13 02:43:46,894 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 02:43:46,896 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 02:43:46,898 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 02:43:46,898 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 02:43:46,904 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 02:43:46,905 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:43:46" (1/1) ... [2024-10-13 02:43:46,906 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2894404a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:46, skipping insertion in model container [2024-10-13 02:43:46,906 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:43:46" (1/1) ... [2024-10-13 02:43:46,939 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 02:43:47,119 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_fillercodestructure_filler-ps-ci_file-55.i[919,932] [2024-10-13 02:43:47,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:43:47,217 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 02:43:47,231 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_fillercodestructure_filler-ps-ci_file-55.i[919,932] [2024-10-13 02:43:47,273 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:43:47,302 INFO L204 MainTranslator]: Completed translation [2024-10-13 02:43:47,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:47 WrapperNode [2024-10-13 02:43:47,303 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 02:43:47,305 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 02:43:47,306 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 02:43:47,306 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 02:43:47,313 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:47" (1/1) ... [2024-10-13 02:43:47,323 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:47" (1/1) ... [2024-10-13 02:43:47,355 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 214 [2024-10-13 02:43:47,356 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 02:43:47,356 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 02:43:47,357 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 02:43:47,357 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 02:43:47,368 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:47" (1/1) ... [2024-10-13 02:43:47,368 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:47" (1/1) ... [2024-10-13 02:43:47,371 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:47" (1/1) ... [2024-10-13 02:43:47,389 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 02:43:47,390 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:47" (1/1) ... [2024-10-13 02:43:47,390 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:47" (1/1) ... [2024-10-13 02:43:47,399 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:47" (1/1) ... [2024-10-13 02:43:47,403 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:47" (1/1) ... [2024-10-13 02:43:47,405 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:47" (1/1) ... [2024-10-13 02:43:47,407 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:47" (1/1) ... [2024-10-13 02:43:47,410 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 02:43:47,411 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 02:43:47,411 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 02:43:47,412 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 02:43:47,414 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:47" (1/1) ... [2024-10-13 02:43:47,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:43:47,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:43:47,455 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 02:43:47,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 02:43:47,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 02:43:47,513 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 02:43:47,513 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 02:43:47,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 02:43:47,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 02:43:47,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 02:43:47,614 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 02:43:47,617 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 02:43:48,094 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-13 02:43:48,095 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 02:43:48,147 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 02:43:48,147 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 02:43:48,148 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:43:48 BoogieIcfgContainer [2024-10-13 02:43:48,148 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 02:43:48,151 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 02:43:48,151 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 02:43:48,154 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 02:43:48,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:43:46" (1/3) ... [2024-10-13 02:43:48,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@718550f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:43:48, skipping insertion in model container [2024-10-13 02:43:48,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:47" (2/3) ... [2024-10-13 02:43:48,156 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@718550f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:43:48, skipping insertion in model container [2024-10-13 02:43:48,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:43:48" (3/3) ... [2024-10-13 02:43:48,158 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-55.i [2024-10-13 02:43:48,174 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 02:43:48,175 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 02:43:48,249 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 02:43:48,258 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;@5fd7f2d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 02:43:48,259 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 02:43:48,264 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 49 states have (on average 1.469387755102041) internal successors, (72), 50 states have internal predecessors, (72), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-13 02:43:48,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-13 02:43:48,290 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:43:48,291 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:43:48,292 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:43:48,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:43:48,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1698564919, now seen corresponding path program 1 times [2024-10-13 02:43:48,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:43:48,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682166541] [2024-10-13 02:43:48,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:43:48,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:43:48,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:48,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:43:48,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:48,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 02:43:48,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:48,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 02:43:48,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:48,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 02:43:48,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:48,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 02:43:48,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:48,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 02:43:48,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:48,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:43:48,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:48,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 02:43:48,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:48,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:43:48,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:48,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:43:48,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:48,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:43:48,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:48,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 02:43:48,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:48,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:43:48,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:48,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 02:43:48,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:48,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:43:48,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:48,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 02:43:48,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:48,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:43:48,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:48,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 02:43:48,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:48,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:43:48,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:48,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:43:48,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:48,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:43:48,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:48,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:43:48,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:48,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:43:48,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:48,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 02:43:48,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:48,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 02:43:48,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:48,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 02:43:48,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:48,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 02:43:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:48,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 02:43:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:48,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 02:43:48,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:48,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 02:43:48,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:48,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 02:43:48,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:48,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 02:43:48,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:48,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-13 02:43:48,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:48,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-13 02:43:48,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:43:48,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682166541] [2024-10-13 02:43:48,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682166541] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:43:48,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:43:48,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 02:43:48,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754013831] [2024-10-13 02:43:48,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:43:48,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 02:43:48,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:43:48,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 02:43:48,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:43:48,983 INFO L87 Difference]: Start difference. First operand has 85 states, 49 states have (on average 1.469387755102041) internal successors, (72), 50 states have internal predecessors, (72), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-13 02:43:49,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:43:49,033 INFO L93 Difference]: Finished difference Result 167 states and 307 transitions. [2024-10-13 02:43:49,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 02:43:49,037 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 201 [2024-10-13 02:43:49,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:43:49,047 INFO L225 Difference]: With dead ends: 167 [2024-10-13 02:43:49,049 INFO L226 Difference]: Without dead ends: 83 [2024-10-13 02:43:49,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:43:49,061 INFO L432 NwaCegarLoop]: 129 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, 129 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:43:49,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:43:49,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-13 02:43:49,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-10-13 02:43:49,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 48 states have (on average 1.375) internal successors, (66), 48 states have internal predecessors, (66), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-13 02:43:49,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 132 transitions. [2024-10-13 02:43:49,109 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 132 transitions. Word has length 201 [2024-10-13 02:43:49,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:43:49,110 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 132 transitions. [2024-10-13 02:43:49,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-13 02:43:49,111 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 132 transitions. [2024-10-13 02:43:49,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-13 02:43:49,118 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:43:49,119 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:43:49,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 02:43:49,119 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:43:49,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:43:49,120 INFO L85 PathProgramCache]: Analyzing trace with hash -827116675, now seen corresponding path program 1 times [2024-10-13 02:43:49,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:43:49,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074023291] [2024-10-13 02:43:49,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:43:49,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:43:49,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:49,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:43:49,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:49,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 02:43:49,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:49,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 02:43:49,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:49,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 02:43:49,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:49,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 02:43:49,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:49,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 02:43:49,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:49,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:43:49,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:49,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 02:43:49,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:49,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:43:49,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:49,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:43:49,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:49,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:43:49,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:49,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 02:43:49,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:49,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:43:49,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:49,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 02:43:49,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:49,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:43:49,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:49,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 02:43:49,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:49,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:43:49,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:49,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 02:43:49,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:49,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:43:49,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:49,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:43:49,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:49,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:43:49,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:49,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:43:49,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:49,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:43:49,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:49,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 02:43:49,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:49,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 02:43:49,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:49,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 02:43:49,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:49,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 02:43:49,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:49,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 02:43:49,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:49,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 02:43:49,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:49,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 02:43:49,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:49,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 02:43:49,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:49,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 02:43:49,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:49,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-13 02:43:49,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:49,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-13 02:43:49,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:43:49,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074023291] [2024-10-13 02:43:49,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074023291] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:43:49,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:43:49,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:43:49,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725920494] [2024-10-13 02:43:49,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:43:49,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:43:49,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:43:49,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:43:49,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:43:49,529 INFO L87 Difference]: Start difference. First operand 83 states and 132 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 02:43:49,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:43:49,613 INFO L93 Difference]: Finished difference Result 244 states and 388 transitions. [2024-10-13 02:43:49,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:43:49,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 201 [2024-10-13 02:43:49,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:43:49,622 INFO L225 Difference]: With dead ends: 244 [2024-10-13 02:43:49,623 INFO L226 Difference]: Without dead ends: 162 [2024-10-13 02:43:49,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 68 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-13 02:43:49,625 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 122 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:43:49,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 249 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:43:49,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-10-13 02:43:49,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 84. [2024-10-13 02:43:49,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 49 states have internal predecessors, (67), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-13 02:43:49,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 133 transitions. [2024-10-13 02:43:49,649 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 133 transitions. Word has length 201 [2024-10-13 02:43:49,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:43:49,651 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 133 transitions. [2024-10-13 02:43:49,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 02:43:49,651 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 133 transitions. [2024-10-13 02:43:49,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-13 02:43:49,654 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:43:49,655 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:43:49,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 02:43:49,656 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:43:49,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:43:49,656 INFO L85 PathProgramCache]: Analyzing trace with hash -827176257, now seen corresponding path program 1 times [2024-10-13 02:43:49,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:43:49,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726087293] [2024-10-13 02:43:49,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:43:49,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:43:49,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:43:50,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 02:43:50,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 02:43:50,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 02:43:50,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 02:43:50,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 02:43:50,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:43:50,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 02:43:50,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:43:50,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:43:50,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:43:50,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 02:43:50,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:43:50,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 02:43:50,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:43:50,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 02:43:50,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:43:50,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 02:43:50,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:43:50,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:43:50,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:43:50,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:43:50,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:43:50,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 02:43:50,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 02:43:50,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 02:43:50,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 02:43:50,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 02:43:50,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 02:43:50,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 02:43:50,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 02:43:50,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 02:43:50,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-13 02:43:50,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-13 02:43:50,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:43:50,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726087293] [2024-10-13 02:43:50,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726087293] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:43:50,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:43:50,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:43:50,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145291503] [2024-10-13 02:43:50,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:43:50,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:43:50,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:43:50,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:43:50,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:43:50,213 INFO L87 Difference]: Start difference. First operand 84 states and 133 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 02:43:50,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:43:50,277 INFO L93 Difference]: Finished difference Result 237 states and 378 transitions. [2024-10-13 02:43:50,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:43:50,277 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 201 [2024-10-13 02:43:50,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:43:50,309 INFO L225 Difference]: With dead ends: 237 [2024-10-13 02:43:50,309 INFO L226 Difference]: Without dead ends: 154 [2024-10-13 02:43:50,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 67 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-13 02:43:50,311 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 55 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:43:50,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 250 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:43:50,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-10-13 02:43:50,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 150. [2024-10-13 02:43:50,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 81 states have (on average 1.308641975308642) internal successors, (106), 81 states have internal predecessors, (106), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-13 02:43:50,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 238 transitions. [2024-10-13 02:43:50,337 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 238 transitions. Word has length 201 [2024-10-13 02:43:50,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:43:50,338 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 238 transitions. [2024-10-13 02:43:50,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 02:43:50,338 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 238 transitions. [2024-10-13 02:43:50,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-13 02:43:50,341 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:43:50,342 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:43:50,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 02:43:50,342 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:43:50,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:43:50,343 INFO L85 PathProgramCache]: Analyzing trace with hash -569010819, now seen corresponding path program 1 times [2024-10-13 02:43:50,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:43:50,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185595054] [2024-10-13 02:43:50,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:43:50,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:43:50,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:43:50,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 02:43:50,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 02:43:50,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 02:43:50,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 02:43:50,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 02:43:50,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:43:50,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 02:43:50,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:43:50,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:43:50,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:43:50,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 02:43:50,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:43:50,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 02:43:50,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:43:50,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 02:43:50,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:43:50,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 02:43:50,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:43:50,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:43:50,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:43:50,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:43:50,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:43:50,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 02:43:50,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 02:43:50,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 02:43:50,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 02:43:50,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:51,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 02:43:51,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:51,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 02:43:51,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:51,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 02:43:51,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:51,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 02:43:51,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:51,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 02:43:51,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:51,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-13 02:43:51,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:51,041 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 78 proven. 18 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-10-13 02:43:51,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:43:51,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185595054] [2024-10-13 02:43:51,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185595054] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 02:43:51,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064587870] [2024-10-13 02:43:51,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:43:51,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:43:51,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:43:51,046 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 02:43:51,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 02:43:51,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:51,234 INFO L255 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 02:43:51,248 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:43:51,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 708 proven. 18 refuted. 0 times theorem prover too weak. 1386 trivial. 0 not checked. [2024-10-13 02:43:51,427 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:43:51,720 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 78 proven. 18 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-10-13 02:43:51,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064587870] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 02:43:51,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 02:43:51,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-10-13 02:43:51,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800574411] [2024-10-13 02:43:51,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 02:43:51,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 02:43:51,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:43:51,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 02:43:51,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-13 02:43:51,727 INFO L87 Difference]: Start difference. First operand 150 states and 238 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-10-13 02:43:52,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:43:52,048 INFO L93 Difference]: Finished difference Result 245 states and 380 transitions. [2024-10-13 02:43:52,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 02:43:52,048 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 201 [2024-10-13 02:43:52,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:43:52,051 INFO L225 Difference]: With dead ends: 245 [2024-10-13 02:43:52,051 INFO L226 Difference]: Without dead ends: 162 [2024-10-13 02:43:52,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 464 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-10-13 02:43:52,053 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 145 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 02:43:52,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 196 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 02:43:52,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-10-13 02:43:52,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 88. [2024-10-13 02:43:52,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 52 states have internal predecessors, (67), 33 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-13 02:43:52,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 133 transitions. [2024-10-13 02:43:52,079 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 133 transitions. Word has length 201 [2024-10-13 02:43:52,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:43:52,080 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 133 transitions. [2024-10-13 02:43:52,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-10-13 02:43:52,080 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 133 transitions. [2024-10-13 02:43:52,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-13 02:43:52,083 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:43:52,083 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:43:52,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 02:43:52,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:43:52,288 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:43:52,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:43:52,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1205996543, now seen corresponding path program 1 times [2024-10-13 02:43:52,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:43:52,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653008814] [2024-10-13 02:43:52,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:43:52,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:43:52,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:52,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:43:52,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:52,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 02:43:52,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:52,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 02:43:52,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:52,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 02:43:52,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:52,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 02:43:52,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:52,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 02:43:52,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:52,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:43:52,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:52,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 02:43:52,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:52,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:43:52,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:52,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:43:52,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:52,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:43:52,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:52,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 02:43:52,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:52,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:43:52,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:52,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 02:43:52,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:52,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:43:52,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:52,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 02:43:52,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:52,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:43:52,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:52,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 02:43:52,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:52,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:43:52,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:52,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:43:52,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:52,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:43:52,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:52,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:43:52,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:52,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:43:52,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:52,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 02:43:52,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:52,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 02:43:52,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:52,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 02:43:52,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:52,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 02:43:52,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:52,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 02:43:52,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:52,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 02:43:52,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:52,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 02:43:52,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:52,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 02:43:52,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:52,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 02:43:52,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:52,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-13 02:43:52,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:52,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-13 02:43:52,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:43:52,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653008814] [2024-10-13 02:43:52,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653008814] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:43:52,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:43:52,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 02:43:52,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133970095] [2024-10-13 02:43:52,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:43:52,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 02:43:52,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:43:52,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 02:43:52,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 02:43:52,876 INFO L87 Difference]: Start difference. First operand 88 states and 133 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 02:43:53,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:43:53,184 INFO L93 Difference]: Finished difference Result 216 states and 325 transitions. [2024-10-13 02:43:53,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 02:43:53,185 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 201 [2024-10-13 02:43:53,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:43:53,188 INFO L225 Difference]: With dead ends: 216 [2024-10-13 02:43:53,189 INFO L226 Difference]: Without dead ends: 129 [2024-10-13 02:43:53,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:43:53,190 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 104 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 02:43:53,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 277 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 02:43:53,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-10-13 02:43:53,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2024-10-13 02:43:53,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 69 states have (on average 1.1884057971014492) internal successors, (82), 70 states have internal predecessors, (82), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-13 02:43:53,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 190 transitions. [2024-10-13 02:43:53,232 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 190 transitions. Word has length 201 [2024-10-13 02:43:53,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:43:53,233 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 190 transitions. [2024-10-13 02:43:53,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 02:43:53,234 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 190 transitions. [2024-10-13 02:43:53,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-13 02:43:53,236 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:43:53,236 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:43:53,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 02:43:53,237 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:43:53,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:43:53,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1207903167, now seen corresponding path program 1 times [2024-10-13 02:43:53,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:43:53,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829534257] [2024-10-13 02:43:53,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:43:53,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:43:53,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 02:43:53,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1695665990] [2024-10-13 02:43:53,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:43:53,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:43:53,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:43:53,365 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 02:43:53,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 02:43:53,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 02:43:53,509 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 02:43:53,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 02:43:53,722 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 02:43:53,723 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 02:43:53,724 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 02:43:53,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 02:43:53,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-13 02:43:53,933 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-13 02:43:54,108 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 02:43:54,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 02:43:54 BoogieIcfgContainer [2024-10-13 02:43:54,114 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 02:43:54,115 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 02:43:54,115 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 02:43:54,115 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 02:43:54,116 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:43:48" (3/4) ... [2024-10-13 02:43:54,117 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 02:43:54,119 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 02:43:54,119 INFO L158 Benchmark]: Toolchain (without parser) took 7223.94ms. Allocated memory was 184.5MB in the beginning and 297.8MB in the end (delta: 113.2MB). Free memory was 132.8MB in the beginning and 249.8MB in the end (delta: -117.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 02:43:54,119 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 184.5MB. Free memory is still 152.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 02:43:54,120 INFO L158 Benchmark]: CACSL2BoogieTranslator took 405.84ms. Allocated memory is still 184.5MB. Free memory was 132.8MB in the beginning and 115.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 02:43:54,120 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.79ms. Allocated memory is still 184.5MB. Free memory was 115.9MB in the beginning and 113.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 02:43:54,120 INFO L158 Benchmark]: Boogie Preprocessor took 53.96ms. Allocated memory is still 184.5MB. Free memory was 113.2MB in the beginning and 109.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 02:43:54,121 INFO L158 Benchmark]: RCFGBuilder took 737.08ms. Allocated memory is still 184.5MB. Free memory was 109.0MB in the beginning and 81.8MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-13 02:43:54,121 INFO L158 Benchmark]: TraceAbstraction took 5963.09ms. Allocated memory was 184.5MB in the beginning and 297.8MB in the end (delta: 113.2MB). Free memory was 81.1MB in the beginning and 249.8MB in the end (delta: -168.7MB). Peak memory consumption was 69.0MB. Max. memory is 16.1GB. [2024-10-13 02:43:54,121 INFO L158 Benchmark]: Witness Printer took 4.06ms. Allocated memory is still 297.8MB. Free memory is still 249.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 02:43:54,122 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 184.5MB. Free memory is still 152.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 405.84ms. Allocated memory is still 184.5MB. Free memory was 132.8MB in the beginning and 115.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.79ms. Allocated memory is still 184.5MB. Free memory was 115.9MB in the beginning and 113.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.96ms. Allocated memory is still 184.5MB. Free memory was 113.2MB in the beginning and 109.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 737.08ms. Allocated memory is still 184.5MB. Free memory was 109.0MB in the beginning and 81.8MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 5963.09ms. Allocated memory was 184.5MB in the beginning and 297.8MB in the end (delta: 113.2MB). Free memory was 81.1MB in the beginning and 249.8MB in the end (delta: -168.7MB). Peak memory consumption was 69.0MB. Max. memory is 16.1GB. * Witness Printer took 4.06ms. Allocated memory is still 297.8MB. Free memory is still 249.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 184, overapproximation of someBinaryArithmeticDOUBLEoperation at line 69. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 8.8; [L23] double var_1_6 = 127.5; [L24] double var_1_7 = 2.6; [L25] double var_1_8 = 4.5; [L26] signed short int var_1_9 = -128; [L27] signed short int var_1_10 = 16; [L28] signed short int var_1_11 = 4; [L29] signed short int var_1_12 = 100; [L30] signed short int var_1_13 = 64; [L31] signed short int var_1_14 = 2; [L32] signed long int var_1_15 = 5; [L33] signed char var_1_17 = -2; [L34] signed char var_1_18 = -4; [L35] signed char var_1_19 = 8; [L36] signed char var_1_20 = 10; [L37] unsigned long int var_1_21 = 25; [L38] unsigned long int var_1_22 = 3797799060; [L39] unsigned char var_1_23 = 1; [L40] unsigned char var_1_24 = 1; [L41] unsigned char var_1_25 = 0; [L42] unsigned char var_1_26 = 0; [L43] signed short int var_1_27 = -4; [L44] signed short int var_1_28 = 24644; [L45] signed char var_1_29 = 1; [L46] signed char var_1_30 = -1; [L47] unsigned char var_1_31 = 0; [L48] signed long int var_1_32 = -2; [L49] double var_1_39 = 2.45; [L50] unsigned short int var_1_41 = 200; [L51] signed char var_1_45 = 10; [L52] signed short int var_1_47 = 4; [L53] unsigned char var_1_49 = 1; [L54] unsigned char var_1_53 = 1; [L55] unsigned char var_1_54 = 200; [L188] isInitial = 1 [L189] FCALL initially() [L190] COND TRUE 1 [L191] FCALL updateLastVariables() [L192] CALL updateVariables() [L129] var_1_6 = __VERIFIER_nondet_double() [L130] CALL assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_7=13/5, var_1_8=9/2, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_7=13/5, var_1_8=9/2, var_1_9=-128] [L130] RET assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=16, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_7=13/5, var_1_8=9/2, var_1_9=-128] [L131] var_1_7 = __VERIFIER_nondet_double() [L132] CALL assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_8=9/2, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_8=9/2, var_1_9=-128] [L132] RET assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=16, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_8=9/2, var_1_9=-128] [L133] var_1_8 = __VERIFIER_nondet_double() [L134] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L134] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=16, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L135] var_1_10 = __VERIFIER_nondet_short() [L136] CALL assume_abort_if_not(var_1_10 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L136] RET assume_abort_if_not(var_1_10 >= -1) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L137] CALL assume_abort_if_not(var_1_10 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L137] RET assume_abort_if_not(var_1_10 <= 32766) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L138] var_1_11 = __VERIFIER_nondet_short() [L139] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L139] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L140] CALL assume_abort_if_not(var_1_11 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L140] RET assume_abort_if_not(var_1_11 <= 32766) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L141] var_1_12 = __VERIFIER_nondet_short() [L142] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L142] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L143] CALL assume_abort_if_not(var_1_12 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L143] RET assume_abort_if_not(var_1_12 <= 16383) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L144] var_1_13 = __VERIFIER_nondet_short() [L145] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L145] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L146] CALL assume_abort_if_not(var_1_13 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L146] RET assume_abort_if_not(var_1_13 <= 16383) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L147] var_1_14 = __VERIFIER_nondet_short() [L148] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L148] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L149] CALL assume_abort_if_not(var_1_14 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L149] RET assume_abort_if_not(var_1_14 <= 32766) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L150] var_1_18 = __VERIFIER_nondet_char() [L151] CALL assume_abort_if_not(var_1_18 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L151] RET assume_abort_if_not(var_1_18 >= -63) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L152] CALL assume_abort_if_not(var_1_18 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L152] RET assume_abort_if_not(var_1_18 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L153] var_1_19 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L154] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L155] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L155] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L156] var_1_20 = __VERIFIER_nondet_char() [L157] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L157] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L158] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L158] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L159] var_1_22 = __VERIFIER_nondet_ulong() [L160] CALL assume_abort_if_not(var_1_22 >= 3221225470) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L160] RET assume_abort_if_not(var_1_22 >= 3221225470) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L161] CALL assume_abort_if_not(var_1_22 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L161] RET assume_abort_if_not(var_1_22 <= 4294967294) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L162] var_1_24 = __VERIFIER_nondet_uchar() [L163] CALL assume_abort_if_not(var_1_24 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L163] RET assume_abort_if_not(var_1_24 >= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L164] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L164] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L165] var_1_25 = __VERIFIER_nondet_uchar() [L166] CALL assume_abort_if_not(var_1_25 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L166] RET assume_abort_if_not(var_1_25 >= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L167] CALL assume_abort_if_not(var_1_25 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L167] RET assume_abort_if_not(var_1_25 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L168] var_1_26 = __VERIFIER_nondet_uchar() [L169] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L169] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L170] CALL assume_abort_if_not(var_1_26 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L170] RET assume_abort_if_not(var_1_26 <= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L171] var_1_28 = __VERIFIER_nondet_short() [L172] CALL assume_abort_if_not(var_1_28 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L172] RET assume_abort_if_not(var_1_28 >= 16383) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L173] CALL assume_abort_if_not(var_1_28 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L173] RET assume_abort_if_not(var_1_28 <= 32766) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L174] var_1_30 = __VERIFIER_nondet_char() [L175] CALL assume_abort_if_not(var_1_30 >= -126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L175] RET assume_abort_if_not(var_1_30 >= -126) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L176] CALL assume_abort_if_not(var_1_30 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L176] RET assume_abort_if_not(var_1_30 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=200, var_1_9=-128] [L177] var_1_54 = __VERIFIER_nondet_uchar() [L178] CALL assume_abort_if_not(var_1_54 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=127, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=127, var_1_9=-128] [L178] RET assume_abort_if_not(var_1_54 >= 127) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=127, var_1_9=-128] [L179] CALL assume_abort_if_not(var_1_54 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=127, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=127, var_1_9=-128] [L179] RET assume_abort_if_not(var_1_54 <= 254) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=-2, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=127, var_1_9=-128] [L192] RET updateVariables() [L193] CALL step() [L59] COND FALSE !(var_1_8 > var_1_7) [L66] var_1_32 = ((((32) < 0 ) ? -(32) : (32))) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=32, var_1_39=49/20, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=127, var_1_9=-128] [L68] COND TRUE var_1_13 < 4 [L69] var_1_39 = (var_1_8 + 9.625) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=32, var_1_41=200, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=127, var_1_9=-128] [L71] COND FALSE !(var_1_8 >= 127.5f) [L78] var_1_41 = var_1_11 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=32, var_1_41=0, var_1_45=10, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=127, var_1_9=-128] [L80] var_1_45 = var_1_20 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=32, var_1_41=0, var_1_45=63, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=127, var_1_9=-128] [L81] COND FALSE !(\read(var_1_31)) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=32, var_1_41=0, var_1_45=63, var_1_47=4, var_1_49=1, var_1_53=1, var_1_54=127, var_1_9=-128] [L84] COND TRUE var_1_1 < (((((var_1_8 / 15.175f)) > ((- var_1_1))) ? ((var_1_8 / 15.175f)) : ((- var_1_1)))) [L85] var_1_49 = (! var_1_24) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=32, var_1_41=0, var_1_45=63, var_1_47=4, var_1_49=0, var_1_53=1, var_1_54=127, var_1_9=-128] [L91] COND TRUE var_1_7 <= var_1_1 [L92] var_1_53 = (var_1_54 - ((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=32, var_1_41=0, var_1_45=63, var_1_47=4, var_1_49=0, var_1_53=64, var_1_54=127, var_1_9=-128] [L94] var_1_9 = (((((var_1_10 - var_1_11)) < (((var_1_12 + var_1_13) - var_1_14))) ? ((var_1_10 - var_1_11)) : (((var_1_12 + var_1_13) - var_1_14)))) [L95] var_1_17 = (var_1_18 + (var_1_19 - var_1_20)) [L96] var_1_29 = (((((var_1_30) < 0 ) ? -(var_1_30) : (var_1_30))) - var_1_20) [L97] var_1_31 = var_1_26 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-126, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=-62, var_1_30=1, var_1_31=0, var_1_32=32, var_1_41=0, var_1_45=63, var_1_47=4, var_1_49=0, var_1_53=64, var_1_54=127, var_1_9=0] [L98] COND FALSE !(var_1_17 <= (var_1_17 * (var_1_29 * var_1_29))) [L105] var_1_1 = var_1_7 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-126, var_1_18=-63, var_1_19=0, var_1_1=2, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=-62, var_1_30=1, var_1_31=0, var_1_32=32, var_1_41=0, var_1_45=63, var_1_47=4, var_1_49=0, var_1_53=64, var_1_54=127, var_1_7=2, var_1_9=0] [L107] COND FALSE !(\read(var_1_31)) [L110] var_1_23 = (var_1_24 && (var_1_25 && var_1_26)) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-126, var_1_18=-63, var_1_19=0, var_1_1=2, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=-62, var_1_30=1, var_1_31=0, var_1_32=32, var_1_41=0, var_1_45=63, var_1_47=4, var_1_49=0, var_1_53=64, var_1_54=127, var_1_7=2, var_1_9=0] [L112] COND FALSE !((- ((((var_1_1) < (var_1_8)) ? (var_1_1) : (var_1_8)))) >= -0.875) [L119] var_1_27 = ((((var_1_29) < (var_1_28)) ? (var_1_29) : (var_1_28))) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-126, var_1_18=-63, var_1_19=0, var_1_1=2, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-62, var_1_28=16383, var_1_29=-62, var_1_30=1, var_1_31=0, var_1_32=32, var_1_41=0, var_1_45=63, var_1_47=4, var_1_49=0, var_1_53=64, var_1_54=127, var_1_7=2, var_1_9=0] [L121] COND FALSE !(\read(var_1_23)) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-126, var_1_18=-63, var_1_19=0, var_1_1=2, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-62, var_1_28=16383, var_1_29=-62, var_1_30=1, var_1_31=0, var_1_32=32, var_1_41=0, var_1_45=63, var_1_47=4, var_1_49=0, var_1_53=64, var_1_54=127, var_1_7=2, var_1_9=0] [L124] COND FALSE !(\read(var_1_23)) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-126, var_1_18=-63, var_1_19=0, var_1_1=2, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-62, var_1_28=16383, var_1_29=-62, var_1_30=1, var_1_31=0, var_1_32=32, var_1_41=0, var_1_45=63, var_1_47=4, var_1_49=0, var_1_53=64, var_1_54=127, var_1_7=2, var_1_9=0] [L193] RET step() [L194] CALL, EXPR property() [L184-L185] return (((((((((var_1_17 <= (var_1_17 * (var_1_29 * var_1_29))) ? ((var_1_29 > var_1_29) ? (var_1_1 == ((double) (((((var_1_6) < (var_1_7)) ? (var_1_6) : (var_1_7))) + var_1_8))) : (var_1_1 == ((double) var_1_8))) : (var_1_1 == ((double) var_1_7))) && (var_1_9 == ((signed short int) (((((var_1_10 - var_1_11)) < (((var_1_12 + var_1_13) - var_1_14))) ? ((var_1_10 - var_1_11)) : (((var_1_12 + var_1_13) - var_1_14))))))) && (var_1_23 ? (var_1_15 == ((signed long int) (var_1_14 - var_1_13))) : 1)) && (var_1_17 == ((signed char) (var_1_18 + (var_1_19 - var_1_20))))) && (var_1_23 ? (var_1_21 == ((unsigned long int) ((var_1_22 - (1000000000u - var_1_13)) - var_1_14))) : 1)) && (var_1_31 ? (var_1_23 == ((unsigned char) (var_1_24 && var_1_25))) : (var_1_23 == ((unsigned char) (var_1_24 && (var_1_25 && var_1_26)))))) && (((- ((((var_1_1) < (var_1_8)) ? (var_1_1) : (var_1_8)))) >= -0.875) ? (var_1_31 ? (var_1_27 == ((signed short int) (var_1_19 - var_1_12))) : (var_1_27 == ((signed short int) (var_1_13 - (var_1_28 - (var_1_20 + var_1_19)))))) : (var_1_27 == ((signed short int) ((((var_1_29) < (var_1_28)) ? (var_1_29) : (var_1_28))))))) && (var_1_29 == ((signed char) (((((var_1_30) < 0 ) ? -(var_1_30) : (var_1_30))) - var_1_20)))) && (var_1_31 == ((unsigned char) var_1_26)) ; [L194] RET, EXPR property() [L194] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-126, var_1_18=-63, var_1_19=0, var_1_1=2, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-62, var_1_28=16383, var_1_29=-62, var_1_30=1, var_1_31=0, var_1_32=32, var_1_41=0, var_1_45=63, var_1_47=4, var_1_49=0, var_1_53=64, var_1_54=127, var_1_7=2, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-126, var_1_18=-63, var_1_19=0, var_1_1=2, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-62, var_1_28=16383, var_1_29=-62, var_1_30=1, var_1_31=0, var_1_32=32, var_1_41=0, var_1_45=63, var_1_47=4, var_1_49=0, var_1_53=64, var_1_54=127, var_1_7=2, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 6, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 458 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 426 mSDsluCounter, 1101 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 452 mSDsCounter, 103 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 301 IncrementalHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 103 mSolverCounterUnsat, 649 mSDtfsCounter, 301 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 789 GetRequests, 771 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=150occurred in iteration=3, InterpolantAutomatonStates: 21, 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, 5 MinimizatonAttempts, 157 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1608 NumberOfCodeBlocks, 1608 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1400 ConstructedInterpolants, 0 QuantifiedInterpolants, 1987 SizeOfPredicates, 2 NumberOfNonLiveVariables, 464 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 14730/14784 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 02:43:54,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-55.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 ce316f509a61e336c72d9b843bd50624ceda1debc7995e28227acf1d2e0c2734 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 02:43:56,475 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 02:43:56,565 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 02:43:56,574 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 02:43:56,574 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 02:43:56,608 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 02:43:56,611 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 02:43:56,612 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 02:43:56,613 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 02:43:56,613 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 02:43:56,614 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 02:43:56,614 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 02:43:56,615 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 02:43:56,617 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 02:43:56,618 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 02:43:56,618 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 02:43:56,618 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 02:43:56,619 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 02:43:56,619 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 02:43:56,619 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 02:43:56,620 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 02:43:56,624 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 02:43:56,625 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 02:43:56,625 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 02:43:56,625 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 02:43:56,625 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 02:43:56,626 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 02:43:56,626 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 02:43:56,626 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 02:43:56,627 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 02:43:56,627 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 02:43:56,627 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 02:43:56,627 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 02:43:56,628 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 02:43:56,628 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:43:56,628 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 02:43:56,628 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 02:43:56,629 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 02:43:56,629 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 02:43:56,629 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 02:43:56,629 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 02:43:56,630 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 02:43:56,632 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 02:43:56,632 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 02:43:56,632 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 02:43:56,633 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 -> ce316f509a61e336c72d9b843bd50624ceda1debc7995e28227acf1d2e0c2734 [2024-10-13 02:43:56,997 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 02:43:57,023 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 02:43:57,027 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 02:43:57,028 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 02:43:57,028 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 02:43:57,031 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-55.i [2024-10-13 02:43:58,678 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 02:43:58,891 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 02:43:58,891 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-55.i [2024-10-13 02:43:58,908 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ead13366f/1f4b3c17f06640fb9527fe6bcfb3f159/FLAGf0a115cb2 [2024-10-13 02:43:58,925 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ead13366f/1f4b3c17f06640fb9527fe6bcfb3f159 [2024-10-13 02:43:58,927 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 02:43:58,928 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 02:43:58,930 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 02:43:58,930 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 02:43:58,935 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 02:43:58,936 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:43:58" (1/1) ... [2024-10-13 02:43:58,937 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2eba1f45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:58, skipping insertion in model container [2024-10-13 02:43:58,937 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:43:58" (1/1) ... [2024-10-13 02:43:58,966 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 02:43:59,152 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_fillercodestructure_filler-ps-ci_file-55.i[919,932] [2024-10-13 02:43:59,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:43:59,264 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 02:43:59,277 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_fillercodestructure_filler-ps-ci_file-55.i[919,932] [2024-10-13 02:43:59,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:43:59,345 INFO L204 MainTranslator]: Completed translation [2024-10-13 02:43:59,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:59 WrapperNode [2024-10-13 02:43:59,346 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 02:43:59,347 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 02:43:59,347 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 02:43:59,348 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 02:43:59,354 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:59" (1/1) ... [2024-10-13 02:43:59,373 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:59" (1/1) ... [2024-10-13 02:43:59,409 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 197 [2024-10-13 02:43:59,413 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 02:43:59,414 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 02:43:59,418 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 02:43:59,418 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 02:43:59,430 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:59" (1/1) ... [2024-10-13 02:43:59,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:59" (1/1) ... [2024-10-13 02:43:59,438 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:59" (1/1) ... [2024-10-13 02:43:59,459 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 02:43:59,460 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:59" (1/1) ... [2024-10-13 02:43:59,462 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:59" (1/1) ... [2024-10-13 02:43:59,474 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:59" (1/1) ... [2024-10-13 02:43:59,481 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:59" (1/1) ... [2024-10-13 02:43:59,487 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:59" (1/1) ... [2024-10-13 02:43:59,493 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:59" (1/1) ... [2024-10-13 02:43:59,500 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 02:43:59,501 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 02:43:59,502 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 02:43:59,502 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 02:43:59,502 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:59" (1/1) ... [2024-10-13 02:43:59,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:43:59,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:43:59,536 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 02:43:59,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 02:43:59,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 02:43:59,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 02:43:59,590 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 02:43:59,590 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 02:43:59,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 02:43:59,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 02:43:59,691 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 02:43:59,693 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 02:44:07,189 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-13 02:44:07,189 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 02:44:07,259 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 02:44:07,260 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 02:44:07,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:44:07 BoogieIcfgContainer [2024-10-13 02:44:07,261 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 02:44:07,263 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 02:44:07,263 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 02:44:07,267 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 02:44:07,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:43:58" (1/3) ... [2024-10-13 02:44:07,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@433495a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:44:07, skipping insertion in model container [2024-10-13 02:44:07,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:59" (2/3) ... [2024-10-13 02:44:07,269 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@433495a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:44:07, skipping insertion in model container [2024-10-13 02:44:07,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:44:07" (3/3) ... [2024-10-13 02:44:07,271 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-55.i [2024-10-13 02:44:07,287 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 02:44:07,288 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 02:44:07,363 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 02:44:07,369 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;@409a20f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 02:44:07,369 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 02:44:07,374 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 48 states have internal predecessors, (69), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-13 02:44:07,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-13 02:44:07,393 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:44:07,394 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:44:07,395 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:44:07,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:44:07,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1540792634, now seen corresponding path program 1 times [2024-10-13 02:44:07,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:44:07,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2085638961] [2024-10-13 02:44:07,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:44:07,424 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:44:07,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:44:07,429 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:44:07,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 02:44:08,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:44:08,368 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 02:44:08,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:44:08,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 892 proven. 0 refuted. 0 times theorem prover too weak. 1220 trivial. 0 not checked. [2024-10-13 02:44:08,435 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:44:08,438 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:44:08,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2085638961] [2024-10-13 02:44:08,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2085638961] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:44:08,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:44:08,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 02:44:08,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815800866] [2024-10-13 02:44:08,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:44:08,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 02:44:08,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:44:08,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 02:44:08,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:44:08,481 INFO L87 Difference]: Start difference. First operand has 83 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 48 states have internal predecessors, (69), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-13 02:44:08,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:44:08,594 INFO L93 Difference]: Finished difference Result 163 states and 301 transitions. [2024-10-13 02:44:08,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 02:44:08,602 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 201 [2024-10-13 02:44:08,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:44:08,610 INFO L225 Difference]: With dead ends: 163 [2024-10-13 02:44:08,611 INFO L226 Difference]: Without dead ends: 81 [2024-10-13 02:44:08,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:44:08,621 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 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.1s IncrementalHoareTripleChecker+Time [2024-10-13 02:44:08,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 02:44:08,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-13 02:44:08,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-10-13 02:44:08,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 46 states have internal predecessors, (63), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-13 02:44:08,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 129 transitions. [2024-10-13 02:44:08,683 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 129 transitions. Word has length 201 [2024-10-13 02:44:08,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:44:08,685 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 129 transitions. [2024-10-13 02:44:08,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-13 02:44:08,685 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 129 transitions. [2024-10-13 02:44:08,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-13 02:44:08,689 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:44:08,690 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:44:08,721 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 (2)] Forceful destruction successful, exit code 0 [2024-10-13 02:44:08,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:44:08,891 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:44:08,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:44:08,892 INFO L85 PathProgramCache]: Analyzing trace with hash 228493068, now seen corresponding path program 1 times [2024-10-13 02:44:08,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:44:08,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1316252333] [2024-10-13 02:44:08,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:44:08,894 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:44:08,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:44:08,897 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:44:08,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 02:44:09,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:44:09,719 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 02:44:09,734 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:44:12,070 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-13 02:44:12,070 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:44:12,070 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:44:12,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1316252333] [2024-10-13 02:44:12,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1316252333] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:44:12,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:44:12,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 02:44:12,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910549307] [2024-10-13 02:44:12,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:44:12,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:44:12,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:44:12,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:44:12,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:44:12,078 INFO L87 Difference]: Start difference. First operand 81 states and 129 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 02:44:12,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:44:12,292 INFO L93 Difference]: Finished difference Result 238 states and 380 transitions. [2024-10-13 02:44:12,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:44:12,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 201 [2024-10-13 02:44:12,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:44:12,300 INFO L225 Difference]: With dead ends: 238 [2024-10-13 02:44:12,300 INFO L226 Difference]: Without dead ends: 158 [2024-10-13 02:44:12,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 199 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-13 02:44:12,304 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 28 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 02:44:12,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 243 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 02:44:12,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-10-13 02:44:12,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 152. [2024-10-13 02:44:12,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 83 states have (on average 1.3253012048192772) internal successors, (110), 83 states have internal predecessors, (110), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-13 02:44:12,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 242 transitions. [2024-10-13 02:44:12,352 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 242 transitions. Word has length 201 [2024-10-13 02:44:12,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:44:12,353 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 242 transitions. [2024-10-13 02:44:12,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 02:44:12,353 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 242 transitions. [2024-10-13 02:44:12,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-13 02:44:12,356 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:44:12,357 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:44:12,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-13 02:44:12,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:44:12,558 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:44:12,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:44:12,559 INFO L85 PathProgramCache]: Analyzing trace with hash 486658506, now seen corresponding path program 1 times [2024-10-13 02:44:12,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:44:12,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1321866606] [2024-10-13 02:44:12,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:44:12,560 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:44:12,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:44:12,563 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:44:12,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 02:44:13,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:44:13,528 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 02:44:13,534 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:44:14,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 708 proven. 18 refuted. 0 times theorem prover too weak. 1386 trivial. 0 not checked. [2024-10-13 02:44:14,464 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:44:15,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 78 proven. 18 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-10-13 02:44:15,786 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:44:15,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1321866606] [2024-10-13 02:44:15,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1321866606] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 02:44:15,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 02:44:15,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-10-13 02:44:15,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614143781] [2024-10-13 02:44:15,787 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 02:44:15,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 02:44:15,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:44:15,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 02:44:15,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-13 02:44:15,792 INFO L87 Difference]: Start difference. First operand 152 states and 242 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-10-13 02:44:19,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:44:19,104 INFO L93 Difference]: Finished difference Result 473 states and 735 transitions. [2024-10-13 02:44:19,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 02:44:19,105 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 201 [2024-10-13 02:44:19,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:44:19,109 INFO L225 Difference]: With dead ends: 473 [2024-10-13 02:44:19,109 INFO L226 Difference]: Without dead ends: 322 [2024-10-13 02:44:19,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 394 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2024-10-13 02:44:19,112 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 145 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-13 02:44:19,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 441 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-13 02:44:19,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-10-13 02:44:19,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 163. [2024-10-13 02:44:19,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 92 states have (on average 1.2934782608695652) internal successors, (119), 92 states have internal predecessors, (119), 66 states have call successors, (66), 4 states have call predecessors, (66), 4 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-13 02:44:19,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 251 transitions. [2024-10-13 02:44:19,151 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 251 transitions. Word has length 201 [2024-10-13 02:44:19,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:44:19,154 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 251 transitions. [2024-10-13 02:44:19,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-10-13 02:44:19,154 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 251 transitions. [2024-10-13 02:44:19,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-13 02:44:19,161 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:44:19,161 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:44:19,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-13 02:44:19,361 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-13 02:44:19,362 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:44:19,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:44:19,363 INFO L85 PathProgramCache]: Analyzing trace with hash 488565130, now seen corresponding path program 1 times [2024-10-13 02:44:19,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:44:19,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [41760679] [2024-10-13 02:44:19,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:44:19,364 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:44:19,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:44:19,367 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-13 02:44:19,368 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-13 02:44:20,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:44:20,322 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 02:44:20,328 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:44:57,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 191 proven. 180 refuted. 0 times theorem prover too weak. 1741 trivial. 0 not checked. [2024-10-13 02:44:57,327 INFO L311 TraceCheckSpWp]: Computing backward predicates...