./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-97.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-97.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 f0e464b03528fd07ed2a214c41d5d0c75fd807ee4909056da113988031a11e66 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 08:12:03,206 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 08:12:03,274 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 08:12:03,278 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 08:12:03,278 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 08:12:03,298 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 08:12:03,300 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 08:12:03,300 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 08:12:03,301 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 08:12:03,303 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 08:12:03,303 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 08:12:03,304 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 08:12:03,304 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 08:12:03,305 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 08:12:03,307 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 08:12:03,307 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 08:12:03,307 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 08:12:03,308 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 08:12:03,308 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 08:12:03,308 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 08:12:03,308 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 08:12:03,313 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 08:12:03,313 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 08:12:03,313 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 08:12:03,314 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 08:12:03,314 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 08:12:03,314 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 08:12:03,314 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 08:12:03,315 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 08:12:03,315 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 08:12:03,315 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 08:12:03,315 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 08:12:03,316 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:12:03,316 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 08:12:03,316 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 08:12:03,316 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 08:12:03,316 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 08:12:03,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 08:12:03,317 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 08:12:03,317 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 08:12:03,317 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 08:12:03,319 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 08:12:03,319 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-clean/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-clean/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 -> f0e464b03528fd07ed2a214c41d5d0c75fd807ee4909056da113988031a11e66 [2024-10-11 08:12:03,640 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 08:12:03,671 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 08:12:03,675 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 08:12:03,676 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 08:12:03,677 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 08:12:03,678 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-97.i [2024-10-11 08:12:05,136 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 08:12:05,369 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 08:12:05,369 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-97.i [2024-10-11 08:12:05,380 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1652193b9/9ee6eb9417654bd885f5d7f5423bcbb6/FLAGbb28b7257 [2024-10-11 08:12:05,396 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1652193b9/9ee6eb9417654bd885f5d7f5423bcbb6 [2024-10-11 08:12:05,400 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 08:12:05,401 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 08:12:05,403 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 08:12:05,403 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 08:12:05,408 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 08:12:05,409 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:12:05" (1/1) ... [2024-10-11 08:12:05,410 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53a290e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:12:05, skipping insertion in model container [2024-10-11 08:12:05,410 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:12:05" (1/1) ... [2024-10-11 08:12:05,436 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 08:12:05,594 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-97.i[915,928] [2024-10-11 08:12:05,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:12:05,685 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 08:12:05,697 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-97.i[915,928] [2024-10-11 08:12:05,733 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:12:05,759 INFO L204 MainTranslator]: Completed translation [2024-10-11 08:12:05,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:12:05 WrapperNode [2024-10-11 08:12:05,764 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 08:12:05,765 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 08:12:05,765 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 08:12:05,765 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 08:12:05,773 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:12:05" (1/1) ... [2024-10-11 08:12:05,789 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:12:05" (1/1) ... [2024-10-11 08:12:05,850 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 257 [2024-10-11 08:12:05,850 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 08:12:05,851 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 08:12:05,851 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 08:12:05,851 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 08:12:05,866 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:12:05" (1/1) ... [2024-10-11 08:12:05,866 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:12:05" (1/1) ... [2024-10-11 08:12:05,870 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:12:05" (1/1) ... [2024-10-11 08:12:05,898 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-11 08:12:05,899 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:12:05" (1/1) ... [2024-10-11 08:12:05,899 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:12:05" (1/1) ... [2024-10-11 08:12:05,913 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:12:05" (1/1) ... [2024-10-11 08:12:05,918 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:12:05" (1/1) ... [2024-10-11 08:12:05,922 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:12:05" (1/1) ... [2024-10-11 08:12:05,926 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:12:05" (1/1) ... [2024-10-11 08:12:05,931 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 08:12:05,935 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 08:12:05,935 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 08:12:05,936 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 08:12:05,937 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:12:05" (1/1) ... [2024-10-11 08:12:05,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:12:05,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:12:05,981 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 08:12:05,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 08:12:06,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 08:12:06,051 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 08:12:06,051 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 08:12:06,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 08:12:06,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 08:12:06,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 08:12:06,155 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 08:12:06,157 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 08:12:06,728 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-10-11 08:12:06,729 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 08:12:06,762 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 08:12:06,763 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 08:12:06,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:12:06 BoogieIcfgContainer [2024-10-11 08:12:06,763 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 08:12:06,768 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 08:12:06,768 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 08:12:06,771 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 08:12:06,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:12:05" (1/3) ... [2024-10-11 08:12:06,773 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46e5e8e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:12:06, skipping insertion in model container [2024-10-11 08:12:06,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:12:05" (2/3) ... [2024-10-11 08:12:06,774 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46e5e8e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:12:06, skipping insertion in model container [2024-10-11 08:12:06,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:12:06" (3/3) ... [2024-10-11 08:12:06,776 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-97.i [2024-10-11 08:12:06,796 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 08:12:06,796 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 08:12:06,902 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 08:12:06,933 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;@41cb9cbf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 08:12:06,937 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 08:12:06,948 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 70 states have (on average 1.457142857142857) internal successors, (102), 71 states have internal predecessors, (102), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 08:12:06,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-11 08:12:06,978 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:12:06,979 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:12:06,979 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:12:06,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:12:06,984 INFO L85 PathProgramCache]: Analyzing trace with hash 576474020, now seen corresponding path program 1 times [2024-10-11 08:12:06,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:12:06,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816881434] [2024-10-11 08:12:06,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:12:06,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:12:07,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:07,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:12:07,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:07,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 08:12:07,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:07,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 08:12:07,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:07,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:12:07,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:07,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:12:07,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:07,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 08:12:07,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:07,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:12:07,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:07,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:12:07,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:07,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:12:07,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:07,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:12:07,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:07,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:12:07,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:07,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:12:07,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:07,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:12:07,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:07,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:12:07,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:07,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 08:12:07,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:07,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:12:07,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:07,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 08:12:07,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:07,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:12:07,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:07,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:12:07,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:07,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:12:07,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:07,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:12:07,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:07,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:12:07,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:07,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 08:12:07,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:07,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 08:12:07,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:07,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 08:12:07,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:07,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 08:12:07,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:07,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 08:12:07,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:07,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 08:12:07,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:07,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 08:12:07,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:07,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-11 08:12:07,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:12:07,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816881434] [2024-10-11 08:12:07,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816881434] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:12:07,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:12:07,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 08:12:07,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419330801] [2024-10-11 08:12:07,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:12:07,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 08:12:07,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:12:07,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 08:12:07,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:12:07,606 INFO L87 Difference]: Start difference. First operand has 102 states, 70 states have (on average 1.457142857142857) internal successors, (102), 71 states have internal predecessors, (102), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) 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, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-11 08:12:07,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:12:07,669 INFO L93 Difference]: Finished difference Result 201 states and 347 transitions. [2024-10-11 08:12:07,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 08:12:07,672 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, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 181 [2024-10-11 08:12:07,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:12:07,683 INFO L225 Difference]: With dead ends: 201 [2024-10-11 08:12:07,683 INFO L226 Difference]: Without dead ends: 100 [2024-10-11 08:12:07,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 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-11 08:12:07,695 INFO L432 NwaCegarLoop]: 152 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, 152 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-11 08:12:07,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 08:12:07,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-11 08:12:07,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-10-11 08:12:07,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 69 states have (on average 1.4057971014492754) internal successors, (97), 69 states have internal predecessors, (97), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 08:12:07,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 155 transitions. [2024-10-11 08:12:07,753 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 155 transitions. Word has length 181 [2024-10-11 08:12:07,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:12:07,754 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 155 transitions. [2024-10-11 08:12:07,754 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, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-11 08:12:07,755 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 155 transitions. [2024-10-11 08:12:07,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-11 08:12:07,758 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:12:07,759 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:12:07,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 08:12:07,759 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:12:07,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:12:07,760 INFO L85 PathProgramCache]: Analyzing trace with hash 628456426, now seen corresponding path program 1 times [2024-10-11 08:12:07,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:12:07,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662888894] [2024-10-11 08:12:07,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:12:07,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:12:07,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:07,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:12:07,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:08,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 08:12:08,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:08,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 08:12:08,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:08,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:12:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:08,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:12:08,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:08,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 08:12:08,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:08,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:12:08,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:08,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:12:08,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:08,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:12:08,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:08,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:12:08,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:08,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:12:08,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:08,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:12:08,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:08,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:12:08,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:08,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:12:08,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:08,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 08:12:08,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:08,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:12:08,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:08,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 08:12:08,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:08,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:12:08,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:08,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:12:08,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:08,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:12:08,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:08,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:12:08,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:08,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:12:08,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:08,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 08:12:08,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:08,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 08:12:08,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:08,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 08:12:08,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:08,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 08:12:08,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:08,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 08:12:08,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:08,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 08:12:08,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:08,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 08:12:08,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:08,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-11 08:12:08,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:12:08,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662888894] [2024-10-11 08:12:08,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662888894] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:12:08,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:12:08,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:12:08,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095188692] [2024-10-11 08:12:08,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:12:08,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 08:12:08,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:12:08,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 08:12:08,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:12:08,216 INFO L87 Difference]: Start difference. First operand 100 states and 155 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, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 08:12:08,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:12:08,337 INFO L93 Difference]: Finished difference Result 284 states and 440 transitions. [2024-10-11 08:12:08,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 08:12:08,338 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, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 181 [2024-10-11 08:12:08,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:12:08,341 INFO L225 Difference]: With dead ends: 284 [2024-10-11 08:12:08,341 INFO L226 Difference]: Without dead ends: 185 [2024-10-11 08:12:08,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 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-11 08:12:08,344 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 142 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 08:12:08,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 383 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 08:12:08,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-10-11 08:12:08,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 121. [2024-10-11 08:12:08,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 90 states have (on average 1.4) internal successors, (126), 90 states have internal predecessors, (126), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 08:12:08,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 184 transitions. [2024-10-11 08:12:08,363 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 184 transitions. Word has length 181 [2024-10-11 08:12:08,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:12:08,365 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 184 transitions. [2024-10-11 08:12:08,365 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, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 08:12:08,365 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 184 transitions. [2024-10-11 08:12:08,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-11 08:12:08,368 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:12:08,369 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:12:08,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 08:12:08,369 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:12:08,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:12:08,370 INFO L85 PathProgramCache]: Analyzing trace with hash -382660824, now seen corresponding path program 1 times [2024-10-11 08:12:08,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:12:08,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30288474] [2024-10-11 08:12:08,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:12:08,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:12:08,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:08,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:12:08,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:08,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 08:12:08,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:08,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 08:12:08,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:08,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:12:08,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:08,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:12:08,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:08,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 08:12:08,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:08,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:12:08,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:08,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:12:08,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:08,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:12:08,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:08,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:12:08,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:08,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:12:08,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:08,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:12:08,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:08,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:12:08,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:08,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:12:08,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:08,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 08:12:08,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:08,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:12:08,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:08,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 08:12:08,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:08,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:12:08,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:08,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:12:08,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:08,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:12:08,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:08,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:12:08,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:08,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:12:08,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:08,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 08:12:08,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:08,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 08:12:08,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:08,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 08:12:08,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:08,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 08:12:08,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:08,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 08:12:08,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:08,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 08:12:08,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:09,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 08:12:09,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:09,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-11 08:12:09,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:12:09,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30288474] [2024-10-11 08:12:09,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30288474] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:12:09,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:12:09,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 08:12:09,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135532734] [2024-10-11 08:12:09,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:12:09,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 08:12:09,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:12:09,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 08:12:09,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:12:09,021 INFO L87 Difference]: Start difference. First operand 121 states and 184 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 08:12:09,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:12:09,453 INFO L93 Difference]: Finished difference Result 413 states and 633 transitions. [2024-10-11 08:12:09,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 08:12:09,454 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 181 [2024-10-11 08:12:09,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:12:09,460 INFO L225 Difference]: With dead ends: 413 [2024-10-11 08:12:09,463 INFO L226 Difference]: Without dead ends: 293 [2024-10-11 08:12:09,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-11 08:12:09,466 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 230 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 08:12:09,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 493 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 08:12:09,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-10-11 08:12:09,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 233. [2024-10-11 08:12:09,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 172 states have (on average 1.3837209302325582) internal successors, (238), 172 states have internal predecessors, (238), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-11 08:12:09,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 354 transitions. [2024-10-11 08:12:09,513 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 354 transitions. Word has length 181 [2024-10-11 08:12:09,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:12:09,514 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 354 transitions. [2024-10-11 08:12:09,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 08:12:09,514 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 354 transitions. [2024-10-11 08:12:09,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-10-11 08:12:09,521 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:12:09,522 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:12:09,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 08:12:09,522 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:12:09,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:12:09,522 INFO L85 PathProgramCache]: Analyzing trace with hash -4605167, now seen corresponding path program 1 times [2024-10-11 08:12:09,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:12:09,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243890150] [2024-10-11 08:12:09,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:12:09,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:12:09,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:09,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:12:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 08:12:10,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 08:12:10,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:12:10,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:12:10,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 08:12:10,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:12:10,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:12:10,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:12:10,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:12:10,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:12:10,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:12:10,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:12:10,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:12:10,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 08:12:10,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:12:10,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 08:12:10,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:12:10,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:12:10,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:12:10,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:12:10,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:12:10,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 08:12:10,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 08:12:10,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 08:12:10,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 08:12:10,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 08:12:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 08:12:10,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 08:12:10,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-11 08:12:10,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:12:10,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243890150] [2024-10-11 08:12:10,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243890150] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:12:10,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:12:10,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 08:12:10,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000330820] [2024-10-11 08:12:10,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:12:10,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 08:12:10,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:12:10,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 08:12:10,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 08:12:10,162 INFO L87 Difference]: Start difference. First operand 233 states and 354 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 08:12:10,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:12:10,689 INFO L93 Difference]: Finished difference Result 610 states and 919 transitions. [2024-10-11 08:12:10,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 08:12:10,691 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 182 [2024-10-11 08:12:10,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:12:10,695 INFO L225 Difference]: With dead ends: 610 [2024-10-11 08:12:10,696 INFO L226 Difference]: Without dead ends: 378 [2024-10-11 08:12:10,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-11 08:12:10,698 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 199 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 08:12:10,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 640 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 08:12:10,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2024-10-11 08:12:10,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 355. [2024-10-11 08:12:10,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 264 states have (on average 1.3371212121212122) internal successors, (353), 264 states have internal predecessors, (353), 87 states have call successors, (87), 3 states have call predecessors, (87), 3 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2024-10-11 08:12:10,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 527 transitions. [2024-10-11 08:12:10,750 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 527 transitions. Word has length 182 [2024-10-11 08:12:10,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:12:10,751 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 527 transitions. [2024-10-11 08:12:10,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 08:12:10,752 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 527 transitions. [2024-10-11 08:12:10,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-11 08:12:10,755 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:12:10,755 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:12:10,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 08:12:10,755 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:12:10,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:12:10,756 INFO L85 PathProgramCache]: Analyzing trace with hash 771846706, now seen corresponding path program 1 times [2024-10-11 08:12:10,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:12:10,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946644144] [2024-10-11 08:12:10,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:12:10,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:12:10,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:12:10,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 08:12:10,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 08:12:10,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:12:10,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:12:10,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 08:12:10,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:12:10,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:12:10,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:12:10,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:12:10,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:12:10,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:12:10,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:12:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:12:10,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 08:12:10,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:12:10,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 08:12:10,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:12:10,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:12:10,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:12:10,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:12:10,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:12:10,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 08:12:10,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 08:12:10,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 08:12:10,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 08:12:10,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 08:12:10,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 08:12:10,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 08:12:10,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:10,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-11 08:12:10,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:12:10,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946644144] [2024-10-11 08:12:10,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946644144] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:12:10,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:12:10,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:12:10,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578132477] [2024-10-11 08:12:10,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:12:10,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 08:12:10,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:12:10,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 08:12:10,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:12:10,993 INFO L87 Difference]: Start difference. First operand 355 states and 527 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 08:12:11,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:12:11,029 INFO L93 Difference]: Finished difference Result 710 states and 1055 transitions. [2024-10-11 08:12:11,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 08:12:11,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 183 [2024-10-11 08:12:11,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:12:11,034 INFO L225 Difference]: With dead ends: 710 [2024-10-11 08:12:11,036 INFO L226 Difference]: Without dead ends: 356 [2024-10-11 08:12:11,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 61 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-11 08:12:11,039 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 296 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-11 08:12:11,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 296 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 08:12:11,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-10-11 08:12:11,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2024-10-11 08:12:11,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 265 states have (on average 1.3283018867924528) internal successors, (352), 265 states have internal predecessors, (352), 87 states have call successors, (87), 3 states have call predecessors, (87), 3 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2024-10-11 08:12:11,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 526 transitions. [2024-10-11 08:12:11,077 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 526 transitions. Word has length 183 [2024-10-11 08:12:11,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:12:11,079 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 526 transitions. [2024-10-11 08:12:11,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 08:12:11,080 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 526 transitions. [2024-10-11 08:12:11,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-11 08:12:11,083 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:12:11,083 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:12:11,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 08:12:11,084 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:12:11,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:12:11,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1030012144, now seen corresponding path program 1 times [2024-10-11 08:12:11,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:12:11,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278145999] [2024-10-11 08:12:11,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:12:11,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:12:11,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:11,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:12:11,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:11,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 08:12:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:11,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 08:12:11,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:11,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:12:11,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:11,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:12:11,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:11,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 08:12:11,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:11,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:12:11,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:11,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:12:11,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:11,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:12:11,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:11,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:12:11,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:11,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:12:11,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:11,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:12:11,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:11,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:12:11,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:11,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:12:11,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:11,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 08:12:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:11,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:12:11,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:11,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 08:12:11,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:11,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:12:11,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:11,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:12:11,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:11,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:12:11,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:11,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:12:11,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:11,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:12:11,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:11,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 08:12:11,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:11,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 08:12:11,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:11,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 08:12:11,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:11,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 08:12:11,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:11,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 08:12:11,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:11,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 08:12:11,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:11,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 08:12:11,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:11,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-11 08:12:11,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:12:11,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278145999] [2024-10-11 08:12:11,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278145999] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:12:11,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:12:11,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 08:12:11,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155886284] [2024-10-11 08:12:11,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:12:11,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 08:12:11,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:12:11,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 08:12:11,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:12:11,379 INFO L87 Difference]: Start difference. First operand 356 states and 526 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 08:12:11,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:12:11,832 INFO L93 Difference]: Finished difference Result 635 states and 950 transitions. [2024-10-11 08:12:11,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 08:12:11,833 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 183 [2024-10-11 08:12:11,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:12:11,838 INFO L225 Difference]: With dead ends: 635 [2024-10-11 08:12:11,838 INFO L226 Difference]: Without dead ends: 514 [2024-10-11 08:12:11,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 08:12:11,841 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 256 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 08:12:11,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 898 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 08:12:11,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2024-10-11 08:12:11,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 363. [2024-10-11 08:12:11,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 272 states have (on average 1.3308823529411764) internal successors, (362), 272 states have internal predecessors, (362), 87 states have call successors, (87), 3 states have call predecessors, (87), 3 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2024-10-11 08:12:11,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 536 transitions. [2024-10-11 08:12:11,894 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 536 transitions. Word has length 183 [2024-10-11 08:12:11,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:12:11,895 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 536 transitions. [2024-10-11 08:12:11,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 08:12:11,895 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 536 transitions. [2024-10-11 08:12:11,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-11 08:12:11,897 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:12:11,897 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:12:11,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 08:12:11,898 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:12:11,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:12:11,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1366616771, now seen corresponding path program 1 times [2024-10-11 08:12:11,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:12:11,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568511572] [2024-10-11 08:12:11,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:12:11,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:12:11,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:12:12,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 08:12:12,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 08:12:12,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:12:12,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:12:12,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 08:12:12,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:12:12,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:12:12,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:12:12,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:12:12,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:12:12,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:12:12,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:12:12,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:12:12,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 08:12:12,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:12:12,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 08:12:12,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:12:12,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:12:12,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:12:12,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:12:12,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:12:12,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 08:12:12,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 08:12:12,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 08:12:12,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 08:12:12,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 08:12:12,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 08:12:12,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 08:12:12,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-11 08:12:12,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:12:12,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568511572] [2024-10-11 08:12:12,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568511572] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:12:12,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:12:12,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 08:12:12,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2602632] [2024-10-11 08:12:12,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:12:12,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 08:12:12,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:12:12,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 08:12:12,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:12:12,330 INFO L87 Difference]: Start difference. First operand 363 states and 536 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 08:12:12,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:12:12,450 INFO L93 Difference]: Finished difference Result 783 states and 1162 transitions. [2024-10-11 08:12:12,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 08:12:12,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 183 [2024-10-11 08:12:12,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:12:12,454 INFO L225 Difference]: With dead ends: 783 [2024-10-11 08:12:12,454 INFO L226 Difference]: Without dead ends: 421 [2024-10-11 08:12:12,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 60 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-11 08:12:12,459 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 130 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 08:12:12,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 579 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 08:12:12,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-10-11 08:12:12,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 363. [2024-10-11 08:12:12,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 272 states have (on average 1.3014705882352942) internal successors, (354), 272 states have internal predecessors, (354), 87 states have call successors, (87), 3 states have call predecessors, (87), 3 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2024-10-11 08:12:12,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 528 transitions. [2024-10-11 08:12:12,544 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 528 transitions. Word has length 183 [2024-10-11 08:12:12,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:12:12,544 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 528 transitions. [2024-10-11 08:12:12,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 08:12:12,545 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 528 transitions. [2024-10-11 08:12:12,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-11 08:12:12,546 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:12:12,547 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:12:12,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 08:12:12,547 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:12:12,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:12:12,548 INFO L85 PathProgramCache]: Analyzing trace with hash -2122152352, now seen corresponding path program 1 times [2024-10-11 08:12:12,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:12:12,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182963270] [2024-10-11 08:12:12,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:12:12,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:12:12,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:12:12,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 08:12:12,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 08:12:12,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:12:12,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:12:12,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 08:12:12,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:12:12,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:12:12,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:12:12,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:12:12,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:12:12,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:12:12,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:12:12,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:12:12,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 08:12:12,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:12:12,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 08:12:12,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:12:12,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:12:12,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:12:12,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:12:12,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:12:12,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 08:12:12,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 08:12:12,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 08:12:12,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 08:12:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 08:12:12,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 08:12:12,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 08:12:12,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:12,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-11 08:12:12,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:12:12,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182963270] [2024-10-11 08:12:12,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182963270] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:12:12,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:12:12,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 08:12:12,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763462640] [2024-10-11 08:12:12,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:12:12,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 08:12:12,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:12:12,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 08:12:12,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:12:12,883 INFO L87 Difference]: Start difference. First operand 363 states and 528 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 08:12:13,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:12:13,671 INFO L93 Difference]: Finished difference Result 964 states and 1392 transitions. [2024-10-11 08:12:13,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 08:12:13,671 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 187 [2024-10-11 08:12:13,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:12:13,676 INFO L225 Difference]: With dead ends: 964 [2024-10-11 08:12:13,677 INFO L226 Difference]: Without dead ends: 836 [2024-10-11 08:12:13,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 08:12:13,679 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 325 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 249 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 249 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 08:12:13,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 637 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [249 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 08:12:13,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2024-10-11 08:12:13,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 622. [2024-10-11 08:12:13,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 471 states have (on average 1.3014861995753715) internal successors, (613), 471 states have internal predecessors, (613), 145 states have call successors, (145), 5 states have call predecessors, (145), 5 states have return successors, (145), 145 states have call predecessors, (145), 145 states have call successors, (145) [2024-10-11 08:12:13,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 903 transitions. [2024-10-11 08:12:13,831 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 903 transitions. Word has length 187 [2024-10-11 08:12:13,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:12:13,831 INFO L471 AbstractCegarLoop]: Abstraction has 622 states and 903 transitions. [2024-10-11 08:12:13,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 08:12:13,832 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 903 transitions. [2024-10-11 08:12:13,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-11 08:12:13,834 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:12:13,834 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:12:13,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 08:12:13,835 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:12:13,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:12:13,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1029143846, now seen corresponding path program 1 times [2024-10-11 08:12:13,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:12:13,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621952822] [2024-10-11 08:12:13,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:12:13,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:12:13,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:24,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:12:24,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:24,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 08:12:24,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:24,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 08:12:24,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:24,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:12:24,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:24,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:12:24,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:24,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 08:12:24,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:24,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:12:24,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:24,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:12:24,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:24,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:12:24,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:24,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:12:24,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:24,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:12:24,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:24,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:12:24,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:24,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:12:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:24,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:12:24,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:24,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 08:12:24,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:24,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:12:24,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:24,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 08:12:24,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:24,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:12:24,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:24,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:12:24,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:24,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:12:24,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:24,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:12:24,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:24,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:12:24,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:24,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 08:12:24,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:24,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 08:12:24,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:24,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 08:12:24,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:24,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 08:12:24,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:24,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 08:12:24,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:24,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 08:12:24,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:24,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 08:12:24,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:24,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-11 08:12:24,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:12:24,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621952822] [2024-10-11 08:12:24,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621952822] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:12:24,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:12:24,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 08:12:24,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682283846] [2024-10-11 08:12:24,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:12:24,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 08:12:24,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:12:24,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 08:12:24,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-11 08:12:24,215 INFO L87 Difference]: Start difference. First operand 622 states and 903 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 08:12:29,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:12:29,659 INFO L93 Difference]: Finished difference Result 1298 states and 1829 transitions. [2024-10-11 08:12:29,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 08:12:29,661 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 187 [2024-10-11 08:12:29,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:12:29,667 INFO L225 Difference]: With dead ends: 1298 [2024-10-11 08:12:29,667 INFO L226 Difference]: Without dead ends: 1058 [2024-10-11 08:12:29,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2024-10-11 08:12:29,670 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 182 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-11 08:12:29,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 561 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-11 08:12:29,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2024-10-11 08:12:29,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 987. [2024-10-11 08:12:29,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 987 states, 821 states have (on average 1.3069427527405604) internal successors, (1073), 826 states have internal predecessors, (1073), 155 states have call successors, (155), 10 states have call predecessors, (155), 10 states have return successors, (155), 150 states have call predecessors, (155), 155 states have call successors, (155) [2024-10-11 08:12:29,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 987 states and 1383 transitions. [2024-10-11 08:12:29,861 INFO L78 Accepts]: Start accepts. Automaton has 987 states and 1383 transitions. Word has length 187 [2024-10-11 08:12:29,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:12:29,861 INFO L471 AbstractCegarLoop]: Abstraction has 987 states and 1383 transitions. [2024-10-11 08:12:29,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 08:12:29,862 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 1383 transitions. [2024-10-11 08:12:29,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-11 08:12:29,864 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:12:29,865 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:12:29,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 08:12:29,865 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:12:29,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:12:29,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1247998564, now seen corresponding path program 1 times [2024-10-11 08:12:29,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:12:29,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407786189] [2024-10-11 08:12:29,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:12:29,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:12:29,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 08:12:29,956 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 08:12:30,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 08:12:30,105 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 08:12:30,106 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 08:12:30,107 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 08:12:30,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 08:12:30,112 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:12:30,246 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 08:12:30,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:12:30 BoogieIcfgContainer [2024-10-11 08:12:30,250 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 08:12:30,250 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 08:12:30,250 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 08:12:30,250 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 08:12:30,251 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:12:06" (3/4) ... [2024-10-11 08:12:30,253 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 08:12:30,254 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 08:12:30,255 INFO L158 Benchmark]: Toolchain (without parser) took 24854.09ms. Allocated memory was 167.8MB in the beginning and 362.8MB in the end (delta: 195.0MB). Free memory was 131.3MB in the beginning and 166.7MB in the end (delta: -35.4MB). Peak memory consumption was 159.5MB. Max. memory is 16.1GB. [2024-10-11 08:12:30,255 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 113.2MB. Free memory is still 85.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 08:12:30,255 INFO L158 Benchmark]: CACSL2BoogieTranslator took 361.58ms. Allocated memory is still 167.8MB. Free memory was 131.3MB in the beginning and 114.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 08:12:30,256 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.36ms. Allocated memory is still 167.8MB. Free memory was 114.5MB in the beginning and 110.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 08:12:30,256 INFO L158 Benchmark]: Boogie Preprocessor took 80.80ms. Allocated memory is still 167.8MB. Free memory was 110.3MB in the beginning and 103.9MB in the end (delta: 6.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 08:12:30,256 INFO L158 Benchmark]: RCFGBuilder took 828.10ms. Allocated memory is still 167.8MB. Free memory was 103.9MB in the beginning and 71.4MB in the end (delta: 32.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-11 08:12:30,257 INFO L158 Benchmark]: TraceAbstraction took 23482.16ms. Allocated memory was 167.8MB in the beginning and 362.8MB in the end (delta: 195.0MB). Free memory was 70.4MB in the beginning and 167.7MB in the end (delta: -97.3MB). Peak memory consumption was 98.7MB. Max. memory is 16.1GB. [2024-10-11 08:12:30,257 INFO L158 Benchmark]: Witness Printer took 4.31ms. Allocated memory is still 362.8MB. Free memory was 167.7MB in the beginning and 166.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 08:12:30,258 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 113.2MB. Free memory is still 85.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 361.58ms. Allocated memory is still 167.8MB. Free memory was 131.3MB in the beginning and 114.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.36ms. Allocated memory is still 167.8MB. Free memory was 114.5MB in the beginning and 110.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.80ms. Allocated memory is still 167.8MB. Free memory was 110.3MB in the beginning and 103.9MB in the end (delta: 6.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 828.10ms. Allocated memory is still 167.8MB. Free memory was 103.9MB in the beginning and 71.4MB in the end (delta: 32.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 23482.16ms. Allocated memory was 167.8MB in the beginning and 362.8MB in the end (delta: 195.0MB). Free memory was 70.4MB in the beginning and 167.7MB in the end (delta: -97.3MB). Peak memory consumption was 98.7MB. Max. memory is 16.1GB. * Witness Printer took 4.31ms. Allocated memory is still 362.8MB. Free memory was 167.7MB in the beginning and 166.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 165. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 2; [L23] signed long int var_1_5 = 5; [L24] unsigned char var_1_8 = 0; [L25] float var_1_9 = 128.6; [L26] float var_1_10 = 32.5; [L27] unsigned char var_1_11 = 16; [L28] unsigned char var_1_12 = 64; [L29] unsigned char var_1_13 = 4; [L30] unsigned char var_1_14 = 4; [L31] unsigned long int var_1_15 = 0; [L32] signed short int var_1_16 = 0; [L33] signed char var_1_17 = 1; [L34] signed char var_1_18 = -1; [L35] signed char var_1_19 = 0; [L36] signed long int var_1_20 = -64; [L37] unsigned char var_1_22 = 0; [L38] unsigned char var_1_23 = 0; [L39] signed short int var_1_24 = -4; [L40] unsigned char var_1_25 = 1; [L41] signed char var_1_26 = 50; [L42] signed char var_1_27 = 4; [L43] signed char var_1_28 = -10; [L44] signed char var_1_29 = -64; [L45] signed char var_1_30 = -8; [L46] signed long int var_1_31 = 1; [L47] float var_1_32 = 3.75; [L48] float var_1_33 = 8.5; [L49] unsigned char var_1_34 = 0; [L50] unsigned char var_1_35 = 8; [L51] unsigned short int var_1_36 = 5; [L52] signed long int last_1_var_1_5 = 5; [L169] isInitial = 1 [L170] FCALL initially() [L171] COND TRUE 1 [L172] CALL updateLastVariables() [L162] last_1_var_1_5 = var_1_5 [L172] RET updateLastVariables() [L173] CALL updateVariables() [L115] var_1_9 = __VERIFIER_nondet_float() [L116] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L116] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L117] var_1_10 = __VERIFIER_nondet_float() [L118] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L118] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L119] var_1_11 = __VERIFIER_nondet_uchar() [L120] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L120] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L121] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L121] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L122] var_1_12 = __VERIFIER_nondet_uchar() [L123] CALL assume_abort_if_not(var_1_12 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L123] RET assume_abort_if_not(var_1_12 >= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L124] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L124] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L125] var_1_13 = __VERIFIER_nondet_uchar() [L126] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L126] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L127] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L127] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L128] var_1_14 = __VERIFIER_nondet_uchar() [L129] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L129] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L130] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L130] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L131] var_1_18 = __VERIFIER_nondet_char() [L132] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L132] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L133] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L133] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L134] var_1_19 = __VERIFIER_nondet_char() [L135] CALL assume_abort_if_not(var_1_19 >= -15) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L135] RET assume_abort_if_not(var_1_19 >= -15) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L136] CALL assume_abort_if_not(var_1_19 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L136] RET assume_abort_if_not(var_1_19 <= 16) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L137] var_1_23 = __VERIFIER_nondet_uchar() [L138] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L138] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L139] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L139] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L140] var_1_25 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L141] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L142] CALL assume_abort_if_not(var_1_25 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L142] RET assume_abort_if_not(var_1_25 <= 1) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L143] var_1_26 = __VERIFIER_nondet_char() [L144] CALL assume_abort_if_not(var_1_26 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L144] RET assume_abort_if_not(var_1_26 >= -128) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L145] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L145] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L146] var_1_27 = __VERIFIER_nondet_char() [L147] CALL assume_abort_if_not(var_1_27 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L147] RET assume_abort_if_not(var_1_27 >= -128) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L148] CALL assume_abort_if_not(var_1_27 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L148] RET assume_abort_if_not(var_1_27 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L149] var_1_28 = __VERIFIER_nondet_char() [L150] CALL assume_abort_if_not(var_1_28 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L150] RET assume_abort_if_not(var_1_28 >= -128) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L151] CALL assume_abort_if_not(var_1_28 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L151] RET assume_abort_if_not(var_1_28 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L152] var_1_30 = __VERIFIER_nondet_char() [L153] CALL assume_abort_if_not(var_1_30 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L153] RET assume_abort_if_not(var_1_30 >= -127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L154] CALL assume_abort_if_not(var_1_30 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L154] RET assume_abort_if_not(var_1_30 <= 126) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L155] var_1_33 = __VERIFIER_nondet_float() [L156] CALL assume_abort_if_not((var_1_33 >= -922337.2036854765600e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854765600e+12F && var_1_33 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L156] RET assume_abort_if_not((var_1_33 >= -922337.2036854765600e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854765600e+12F && var_1_33 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L157] var_1_35 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_34=0, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_34=0, var_1_36=5, var_1_5=5, var_1_8=0] [L158] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_34=0, var_1_36=5, var_1_5=5, var_1_8=0] [L159] CALL assume_abort_if_not(var_1_35 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_34=0, var_1_35=254, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_34=0, var_1_35=254, var_1_36=5, var_1_5=5, var_1_8=0] [L159] RET assume_abort_if_not(var_1_35 <= 254) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_34=0, var_1_35=254, var_1_36=5, var_1_5=5, var_1_8=0] [L173] RET updateVariables() [L174] CALL step() [L56] COND FALSE !(\read(var_1_25)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_34=0, var_1_35=254, var_1_36=5, var_1_5=5, var_1_8=0] [L61] var_1_29 = var_1_30 [L62] var_1_31 = var_1_29 [L63] var_1_32 = var_1_33 [L64] var_1_34 = var_1_35 [L65] var_1_36 = var_1_35 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=5, var_1_8=0] [L66] COND FALSE !(var_1_9 > var_1_10) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=5, var_1_8=0] [L69] var_1_20 = var_1_8 [L70] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=5, var_1_8=0] [L71] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=5, var_1_8=0] [L74] var_1_16 = (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=5, var_1_8=0] [L75] COND FALSE !(\read(var_1_22)) [L82] var_1_17 = -32 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=5, var_1_8=0] [L84] unsigned long int stepLocal_1 = var_1_20 + var_1_15; [L85] signed long int stepLocal_0 = var_1_20; VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=5, var_1_8=0] [L86] COND TRUE stepLocal_1 < -200 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=5, var_1_8=0] [L87] COND FALSE !(\read(var_1_22)) [L94] var_1_1 = var_1_20 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=5, var_1_8=0] [L99] signed long int stepLocal_4 = 256; [L100] unsigned char stepLocal_3 = var_1_22; [L101] unsigned long int stepLocal_2 = var_1_15; VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, stepLocal_4=256, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=5, var_1_8=0] [L102] COND FALSE !(stepLocal_4 > (var_1_15 - (last_1_var_1_5 + var_1_8))) VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=5, var_1_8=0] [L105] COND FALSE !(stepLocal_3 || var_1_22) [L110] var_1_5 = -10000 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=-10000, var_1_8=0] [L174] RET step() [L175] CALL, EXPR property() [L165] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=-10000, var_1_8=0] [L165] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=-10000, var_1_8=0] [L165] EXPR (var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=-10000, var_1_8=0] [L165] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=-10000, var_1_8=0] [L165] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=-10000, var_1_8=0] [L165] EXPR (((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=-10000, var_1_8=0] [L165-L166] return (((((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32)))) && (var_1_20 == ((signed long int) var_1_8))) && (var_1_22 == ((unsigned char) var_1_23)) ; [L175] RET, EXPR property() [L175] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=-10000, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=-10000, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 102 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.2s, OverallIterations: 10, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1464 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1464 mSDsluCounter, 4639 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2778 mSDsCounter, 452 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1341 IncrementalHoareTripleChecker+Invalid, 1793 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 452 mSolverCounterUnsat, 1861 mSDtfsCounter, 1341 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 614 GetRequests, 575 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 6.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=987occurred in iteration=9, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 9 MinimizatonAttempts, 641 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 13.3s InterpolantComputationTime, 1835 NumberOfCodeBlocks, 1835 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1639 ConstructedInterpolants, 0 QuantifiedInterpolants, 14575 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 14616/14616 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-11 08:12:30,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-97.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 f0e464b03528fd07ed2a214c41d5d0c75fd807ee4909056da113988031a11e66 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 08:12:32,643 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 08:12:32,734 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 08:12:32,742 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 08:12:32,743 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 08:12:32,778 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 08:12:32,780 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 08:12:32,781 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 08:12:32,781 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 08:12:32,782 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 08:12:32,783 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 08:12:32,783 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 08:12:32,784 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 08:12:32,784 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 08:12:32,786 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 08:12:32,787 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 08:12:32,787 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 08:12:32,787 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 08:12:32,788 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 08:12:32,788 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 08:12:32,788 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 08:12:32,792 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 08:12:32,793 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 08:12:32,793 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 08:12:32,793 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 08:12:32,793 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 08:12:32,793 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 08:12:32,794 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 08:12:32,794 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 08:12:32,794 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 08:12:32,794 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 08:12:32,795 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 08:12:32,795 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 08:12:32,795 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 08:12:32,795 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:12:32,795 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 08:12:32,796 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 08:12:32,796 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 08:12:32,798 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 08:12:32,799 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 08:12:32,799 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 08:12:32,799 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 08:12:32,799 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 08:12:32,799 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 08:12:32,800 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 08:12:32,800 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-clean/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-clean/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 -> f0e464b03528fd07ed2a214c41d5d0c75fd807ee4909056da113988031a11e66 [2024-10-11 08:12:33,171 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 08:12:33,200 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 08:12:33,202 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 08:12:33,204 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 08:12:33,204 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 08:12:33,205 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-97.i [2024-10-11 08:12:34,916 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 08:12:35,145 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 08:12:35,145 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-97.i [2024-10-11 08:12:35,162 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ec91a9d32/34654933e7444852a9473f5ed2ade91f/FLAG46b683497 [2024-10-11 08:12:35,175 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ec91a9d32/34654933e7444852a9473f5ed2ade91f [2024-10-11 08:12:35,178 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 08:12:35,179 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 08:12:35,180 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 08:12:35,180 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 08:12:35,186 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 08:12:35,187 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:12:35" (1/1) ... [2024-10-11 08:12:35,188 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6114592 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:12:35, skipping insertion in model container [2024-10-11 08:12:35,188 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:12:35" (1/1) ... [2024-10-11 08:12:35,220 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 08:12:35,406 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-97.i[915,928] [2024-10-11 08:12:35,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:12:35,519 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 08:12:35,531 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-97.i[915,928] [2024-10-11 08:12:35,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:12:35,607 INFO L204 MainTranslator]: Completed translation [2024-10-11 08:12:35,608 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:12:35 WrapperNode [2024-10-11 08:12:35,608 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 08:12:35,609 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 08:12:35,609 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 08:12:35,609 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 08:12:35,616 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:12:35" (1/1) ... [2024-10-11 08:12:35,632 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:12:35" (1/1) ... [2024-10-11 08:12:35,680 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 181 [2024-10-11 08:12:35,680 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 08:12:35,681 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 08:12:35,685 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 08:12:35,685 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 08:12:35,696 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:12:35" (1/1) ... [2024-10-11 08:12:35,697 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:12:35" (1/1) ... [2024-10-11 08:12:35,701 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:12:35" (1/1) ... [2024-10-11 08:12:35,723 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-11 08:12:35,724 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:12:35" (1/1) ... [2024-10-11 08:12:35,724 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:12:35" (1/1) ... [2024-10-11 08:12:35,738 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:12:35" (1/1) ... [2024-10-11 08:12:35,749 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:12:35" (1/1) ... [2024-10-11 08:12:35,751 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:12:35" (1/1) ... [2024-10-11 08:12:35,753 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:12:35" (1/1) ... [2024-10-11 08:12:35,756 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 08:12:35,759 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 08:12:35,759 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 08:12:35,759 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 08:12:35,760 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:12:35" (1/1) ... [2024-10-11 08:12:35,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:12:35,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:12:35,803 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 08:12:35,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 08:12:35,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 08:12:35,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 08:12:35,856 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 08:12:35,856 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 08:12:35,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 08:12:35,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 08:12:35,959 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 08:12:35,962 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 08:12:36,419 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-11 08:12:36,420 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 08:12:36,482 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 08:12:36,483 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 08:12:36,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:12:36 BoogieIcfgContainer [2024-10-11 08:12:36,483 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 08:12:36,486 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 08:12:36,487 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 08:12:36,490 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 08:12:36,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:12:35" (1/3) ... [2024-10-11 08:12:36,491 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@421a4f7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:12:36, skipping insertion in model container [2024-10-11 08:12:36,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:12:35" (2/3) ... [2024-10-11 08:12:36,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@421a4f7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:12:36, skipping insertion in model container [2024-10-11 08:12:36,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:12:36" (3/3) ... [2024-10-11 08:12:36,496 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-97.i [2024-10-11 08:12:36,514 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 08:12:36,514 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 08:12:36,610 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 08:12:36,619 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;@2d0e634c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 08:12:36,619 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 08:12:36,624 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 44 states have internal predecessors, (60), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 08:12:36,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-11 08:12:36,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:12:36,643 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:12:36,643 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:12:36,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:12:36,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1998912747, now seen corresponding path program 1 times [2024-10-11 08:12:36,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:12:36,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [739869545] [2024-10-11 08:12:36,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:12:36,669 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-11 08:12:36,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:12:36,673 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-11 08:12:36,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 08:12:36,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:36,927 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 08:12:36,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:12:37,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 804 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2024-10-11 08:12:37,014 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:12:37,015 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:12:37,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [739869545] [2024-10-11 08:12:37,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [739869545] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:12:37,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:12:37,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 08:12:37,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984700678] [2024-10-11 08:12:37,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:12:37,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 08:12:37,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:12:37,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 08:12:37,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:12:37,051 INFO L87 Difference]: Start difference. First operand has 75 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 44 states have internal predecessors, (60), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) 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, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-11 08:12:37,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:12:37,119 INFO L93 Difference]: Finished difference Result 147 states and 263 transitions. [2024-10-11 08:12:37,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 08:12:37,124 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, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 177 [2024-10-11 08:12:37,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:12:37,133 INFO L225 Difference]: With dead ends: 147 [2024-10-11 08:12:37,133 INFO L226 Difference]: Without dead ends: 73 [2024-10-11 08:12:37,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 176 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-11 08:12:37,140 INFO L432 NwaCegarLoop]: 110 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, 110 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-11 08:12:37,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 08:12:37,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-11 08:12:37,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-11 08:12:37,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 08:12:37,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 113 transitions. [2024-10-11 08:12:37,195 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 113 transitions. Word has length 177 [2024-10-11 08:12:37,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:12:37,195 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 113 transitions. [2024-10-11 08:12:37,195 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, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-11 08:12:37,196 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 113 transitions. [2024-10-11 08:12:37,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-11 08:12:37,200 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:12:37,200 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:12:37,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 08:12:37,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-11 08:12:37,402 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:12:37,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:12:37,403 INFO L85 PathProgramCache]: Analyzing trace with hash 603145819, now seen corresponding path program 1 times [2024-10-11 08:12:37,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:12:37,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [973883824] [2024-10-11 08:12:37,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:12:37,404 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-11 08:12:37,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:12:37,407 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-11 08:12:37,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 08:12:37,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:37,631 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 08:12:37,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:12:37,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 838 proven. 39 refuted. 0 times theorem prover too weak. 747 trivial. 0 not checked. [2024-10-11 08:12:37,925 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:12:38,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 45 proven. 39 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-10-11 08:12:38,228 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:12:38,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [973883824] [2024-10-11 08:12:38,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [973883824] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 08:12:38,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 08:12:38,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-10-11 08:12:38,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110517491] [2024-10-11 08:12:38,229 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 08:12:38,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 08:12:38,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:12:38,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 08:12:38,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 08:12:38,236 INFO L87 Difference]: Start difference. First operand 73 states and 113 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) [2024-10-11 08:12:38,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:12:38,691 INFO L93 Difference]: Finished difference Result 151 states and 228 transitions. [2024-10-11 08:12:38,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 08:12:38,692 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) Word has length 177 [2024-10-11 08:12:38,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:12:38,696 INFO L225 Difference]: With dead ends: 151 [2024-10-11 08:12:38,696 INFO L226 Difference]: Without dead ends: 79 [2024-10-11 08:12:38,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 346 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2024-10-11 08:12:38,699 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 88 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 08:12:38,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 137 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 08:12:38,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-11 08:12:38,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2024-10-11 08:12:38,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 08:12:38,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 109 transitions. [2024-10-11 08:12:38,718 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 109 transitions. Word has length 177 [2024-10-11 08:12:38,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:12:38,719 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 109 transitions. [2024-10-11 08:12:38,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) [2024-10-11 08:12:38,719 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 109 transitions. [2024-10-11 08:12:38,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-11 08:12:38,723 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:12:38,723 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:12:38,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 08:12:38,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-11 08:12:38,924 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:12:38,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:12:38,925 INFO L85 PathProgramCache]: Analyzing trace with hash 210118809, now seen corresponding path program 1 times [2024-10-11 08:12:38,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:12:38,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1063895770] [2024-10-11 08:12:38,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:12:38,927 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-11 08:12:38,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:12:38,930 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-11 08:12:38,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 08:12:39,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:39,146 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 08:12:39,158 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:12:39,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-11 08:12:39,527 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:12:39,527 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:12:39,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1063895770] [2024-10-11 08:12:39,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1063895770] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:12:39,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:12:39,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 08:12:39,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007230315] [2024-10-11 08:12:39,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:12:39,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 08:12:39,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:12:39,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 08:12:39,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:12:39,530 INFO L87 Difference]: Start difference. First operand 75 states and 109 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 08:12:39,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:12:39,863 INFO L93 Difference]: Finished difference Result 208 states and 306 transitions. [2024-10-11 08:12:39,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 08:12:39,864 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 177 [2024-10-11 08:12:39,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:12:39,867 INFO L225 Difference]: With dead ends: 208 [2024-10-11 08:12:39,867 INFO L226 Difference]: Without dead ends: 134 [2024-10-11 08:12:39,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 08:12:39,869 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 104 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 08:12:39,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 384 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 08:12:39,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-11 08:12:39,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 75. [2024-10-11 08:12:39,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 43 states have internal predecessors, (50), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 08:12:39,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 108 transitions. [2024-10-11 08:12:39,896 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 108 transitions. Word has length 177 [2024-10-11 08:12:39,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:12:39,897 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 108 transitions. [2024-10-11 08:12:39,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 08:12:39,897 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 108 transitions. [2024-10-11 08:12:39,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-11 08:12:39,899 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:12:39,900 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:12:39,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 08:12:40,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/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-11 08:12:40,105 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:12:40,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:12:40,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1765421424, now seen corresponding path program 1 times [2024-10-11 08:12:40,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:12:40,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [935470262] [2024-10-11 08:12:40,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:12:40,107 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-11 08:12:40,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:12:40,111 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/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-11 08:12:40,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 08:12:40,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:40,276 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 08:12:40,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:12:41,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-11 08:12:41,113 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:12:41,114 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:12:41,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [935470262] [2024-10-11 08:12:41,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [935470262] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:12:41,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:12:41,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 08:12:41,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195185999] [2024-10-11 08:12:41,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:12:41,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 08:12:41,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:12:41,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 08:12:41,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:12:41,116 INFO L87 Difference]: Start difference. First operand 75 states and 108 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 08:12:41,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:12:41,403 INFO L93 Difference]: Finished difference Result 229 states and 328 transitions. [2024-10-11 08:12:41,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 08:12:41,404 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 178 [2024-10-11 08:12:41,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:12:41,406 INFO L225 Difference]: With dead ends: 229 [2024-10-11 08:12:41,407 INFO L226 Difference]: Without dead ends: 155 [2024-10-11 08:12:41,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 08:12:41,408 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 57 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 08:12:41,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 330 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 08:12:41,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-10-11 08:12:41,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 147. [2024-10-11 08:12:41,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 84 states have (on average 1.1547619047619047) internal successors, (97), 84 states have internal predecessors, (97), 58 states have call successors, (58), 4 states have call predecessors, (58), 4 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-11 08:12:41,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 213 transitions. [2024-10-11 08:12:41,466 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 213 transitions. Word has length 178 [2024-10-11 08:12:41,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:12:41,467 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 213 transitions. [2024-10-11 08:12:41,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 08:12:41,468 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 213 transitions. [2024-10-11 08:12:41,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-11 08:12:41,471 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:12:41,471 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:12:41,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-11 08:12:41,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/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-11 08:12:41,672 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:12:41,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:12:41,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1105641082, now seen corresponding path program 1 times [2024-10-11 08:12:41,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:12:41,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [423996587] [2024-10-11 08:12:41,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:12:41,674 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-11 08:12:41,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:12:41,677 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/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-11 08:12:41,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 08:12:42,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:12:42,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-11 08:12:42,151 INFO L278 TraceCheckSpWp]: Computing forward predicates...