./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-72.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-72.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 628ae357ecdbc8bffd368655bd28e8aec575a201b811d6a0f87cc4e59fcd6754 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 09:40:41,288 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 09:40:41,360 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 09:40:41,367 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 09:40:41,368 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 09:40:41,408 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 09:40:41,409 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 09:40:41,409 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 09:40:41,410 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 09:40:41,411 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 09:40:41,412 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 09:40:41,412 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 09:40:41,413 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 09:40:41,413 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 09:40:41,415 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 09:40:41,415 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 09:40:41,415 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 09:40:41,416 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 09:40:41,420 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 09:40:41,420 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 09:40:41,421 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 09:40:41,421 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 09:40:41,421 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 09:40:41,421 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 09:40:41,422 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 09:40:41,422 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 09:40:41,422 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 09:40:41,423 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 09:40:41,423 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 09:40:41,424 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 09:40:41,424 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 09:40:41,425 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 09:40:41,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:40:41,425 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 09:40:41,425 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 09:40:41,425 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 09:40:41,426 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 09:40:41,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 09:40:41,426 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 09:40:41,426 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 09:40:41,427 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 09:40:41,427 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 09:40:41,427 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 628ae357ecdbc8bffd368655bd28e8aec575a201b811d6a0f87cc4e59fcd6754 [2024-10-14 09:40:41,685 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 09:40:41,712 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 09:40:41,716 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 09:40:41,717 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 09:40:41,718 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 09:40:41,719 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-72.i [2024-10-14 09:40:43,240 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 09:40:43,471 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 09:40:43,472 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-72.i [2024-10-14 09:40:43,489 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3cec43d9/6c8e23c8240b4884990459293e0a3b0e/FLAGcb620129b [2024-10-14 09:40:43,507 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3cec43d9/6c8e23c8240b4884990459293e0a3b0e [2024-10-14 09:40:43,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 09:40:43,511 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 09:40:43,515 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 09:40:43,515 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 09:40:43,521 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 09:40:43,521 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:40:43" (1/1) ... [2024-10-14 09:40:43,522 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ad5b43b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:40:43, skipping insertion in model container [2024-10-14 09:40:43,522 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:40:43" (1/1) ... [2024-10-14 09:40:43,556 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 09:40:43,701 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-72.i[919,932] [2024-10-14 09:40:43,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:40:43,785 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 09:40:43,798 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-72.i[919,932] [2024-10-14 09:40:43,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:40:43,874 INFO L204 MainTranslator]: Completed translation [2024-10-14 09:40:43,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:40:43 WrapperNode [2024-10-14 09:40:43,875 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 09:40:43,876 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 09:40:43,876 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 09:40:43,876 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 09:40:43,882 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:40:43" (1/1) ... [2024-10-14 09:40:43,894 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:40:43" (1/1) ... [2024-10-14 09:40:43,929 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 229 [2024-10-14 09:40:43,933 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 09:40:43,934 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 09:40:43,934 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 09:40:43,934 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 09:40:43,946 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:40:43" (1/1) ... [2024-10-14 09:40:43,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:40:43" (1/1) ... [2024-10-14 09:40:43,950 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:40:43" (1/1) ... [2024-10-14 09:40:43,968 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 09:40:43,969 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:40:43" (1/1) ... [2024-10-14 09:40:43,969 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:40:43" (1/1) ... [2024-10-14 09:40:43,982 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:40:43" (1/1) ... [2024-10-14 09:40:43,988 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:40:43" (1/1) ... [2024-10-14 09:40:43,991 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:40:43" (1/1) ... [2024-10-14 09:40:43,996 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:40:43" (1/1) ... [2024-10-14 09:40:44,002 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 09:40:44,003 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 09:40:44,003 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 09:40:44,004 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 09:40:44,004 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:40:43" (1/1) ... [2024-10-14 09:40:44,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:40:44,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:40:44,053 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 09:40:44,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 09:40:44,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 09:40:44,109 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 09:40:44,110 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 09:40:44,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 09:40:44,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 09:40:44,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 09:40:44,214 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 09:40:44,216 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 09:40:44,629 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-14 09:40:44,629 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 09:40:44,692 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 09:40:44,693 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 09:40:44,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:40:44 BoogieIcfgContainer [2024-10-14 09:40:44,693 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 09:40:44,697 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 09:40:44,698 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 09:40:44,701 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 09:40:44,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:40:43" (1/3) ... [2024-10-14 09:40:44,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@295c266c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:40:44, skipping insertion in model container [2024-10-14 09:40:44,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:40:43" (2/3) ... [2024-10-14 09:40:44,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@295c266c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:40:44, skipping insertion in model container [2024-10-14 09:40:44,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:40:44" (3/3) ... [2024-10-14 09:40:44,705 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-72.i [2024-10-14 09:40:44,728 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 09:40:44,729 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 09:40:44,790 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 09:40:44,796 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;@583c848c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 09:40:44,796 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 09:40:44,801 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 61 states have (on average 1.5245901639344261) internal successors, (93), 62 states have internal predecessors, (93), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 09:40:44,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-14 09:40:44,813 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:40:44,814 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:40:44,814 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:40:44,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:40:44,820 INFO L85 PathProgramCache]: Analyzing trace with hash 729921479, now seen corresponding path program 1 times [2024-10-14 09:40:44,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:40:44,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784769400] [2024-10-14 09:40:44,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:40:44,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:40:45,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:45,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:40:45,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:45,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:40:45,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:45,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:40:45,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:45,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 09:40:45,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:45,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:40:45,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:45,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 09:40:45,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:45,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:40:45,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:45,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 09:40:45,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:45,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:40:45,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:45,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 09:40:45,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:45,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 09:40:45,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:45,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 09:40:45,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:45,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 09:40:45,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:45,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 09:40:45,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:45,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:40:45,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:45,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 09:40:45,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:45,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:40:45,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:45,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 09:40:45,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:45,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:40:45,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:45,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 09:40:45,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:45,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 09:40:45,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:45,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 09:40:45,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:45,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 09:40:45,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:45,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 09:40:45,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:45,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 09:40:45,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:45,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 09:40:45,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:45,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 09:40:45,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:40:45,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784769400] [2024-10-14 09:40:45,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784769400] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:40:45,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:40:45,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 09:40:45,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510765838] [2024-10-14 09:40:45,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:40:45,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 09:40:45,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:40:45,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 09:40:45,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 09:40:45,487 INFO L87 Difference]: Start difference. First operand has 90 states, 61 states have (on average 1.5245901639344261) internal successors, (93), 62 states have internal predecessors, (93), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-14 09:40:45,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:40:45,533 INFO L93 Difference]: Finished difference Result 177 states and 314 transitions. [2024-10-14 09:40:45,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 09:40:45,540 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 169 [2024-10-14 09:40:45,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:40:45,550 INFO L225 Difference]: With dead ends: 177 [2024-10-14 09:40:45,550 INFO L226 Difference]: Without dead ends: 88 [2024-10-14 09:40:45,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 09:40:45,559 INFO L432 NwaCegarLoop]: 137 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, 137 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 09:40:45,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 09:40:45,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-14 09:40:45,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-14 09:40:45,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 60 states have internal predecessors, (88), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 09:40:45,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 140 transitions. [2024-10-14 09:40:45,617 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 140 transitions. Word has length 169 [2024-10-14 09:40:45,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:40:45,617 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 140 transitions. [2024-10-14 09:40:45,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-14 09:40:45,618 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 140 transitions. [2024-10-14 09:40:45,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-14 09:40:45,621 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:40:45,622 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:40:45,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 09:40:45,622 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:40:45,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:40:45,623 INFO L85 PathProgramCache]: Analyzing trace with hash -313821169, now seen corresponding path program 1 times [2024-10-14 09:40:45,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:40:45,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884661652] [2024-10-14 09:40:45,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:40:45,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:40:45,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:46,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:40:46,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:46,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:40:46,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:46,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:40:46,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:46,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 09:40:46,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:46,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:40:46,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:46,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 09:40:46,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:46,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:40:46,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:46,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 09:40:46,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:46,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:40:46,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:46,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 09:40:46,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:46,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 09:40:46,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:46,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 09:40:46,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:46,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 09:40:46,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:46,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 09:40:46,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:46,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:40:46,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:46,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 09:40:46,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:46,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:40:46,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:46,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 09:40:46,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:46,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:40:46,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:46,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 09:40:46,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:46,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 09:40:46,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:46,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 09:40:46,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:46,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 09:40:46,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:46,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 09:40:46,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:46,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 09:40:46,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:46,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 09:40:46,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:46,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 09:40:46,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:40:46,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884661652] [2024-10-14 09:40:46,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884661652] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:40:46,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:40:46,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 09:40:46,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188642716] [2024-10-14 09:40:46,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:40:46,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 09:40:46,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:40:46,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 09:40:46,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 09:40:46,286 INFO L87 Difference]: Start difference. First operand 88 states and 140 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 09:40:46,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:40:46,374 INFO L93 Difference]: Finished difference Result 213 states and 341 transitions. [2024-10-14 09:40:46,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 09:40:46,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 169 [2024-10-14 09:40:46,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:40:46,379 INFO L225 Difference]: With dead ends: 213 [2024-10-14 09:40:46,379 INFO L226 Difference]: Without dead ends: 126 [2024-10-14 09:40:46,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 09:40:46,384 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 55 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 09:40:46,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 255 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 09:40:46,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-10-14 09:40:46,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 96. [2024-10-14 09:40:46,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 68 states have (on average 1.5) internal successors, (102), 68 states have internal predecessors, (102), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 09:40:46,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 154 transitions. [2024-10-14 09:40:46,411 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 154 transitions. Word has length 169 [2024-10-14 09:40:46,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:40:46,416 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 154 transitions. [2024-10-14 09:40:46,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 09:40:46,416 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 154 transitions. [2024-10-14 09:40:46,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-14 09:40:46,423 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:40:46,423 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:40:46,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 09:40:46,424 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:40:46,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:40:46,424 INFO L85 PathProgramCache]: Analyzing trace with hash -667646775, now seen corresponding path program 1 times [2024-10-14 09:40:46,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:40:46,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330762878] [2024-10-14 09:40:46,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:40:46,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:40:46,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:46,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:40:46,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:46,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:40:46,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:46,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:40:46,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:46,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 09:40:46,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:46,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:40:46,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:46,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 09:40:46,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:46,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:40:46,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:46,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 09:40:46,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:46,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:40:46,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:46,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 09:40:46,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:46,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 09:40:46,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:46,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 09:40:46,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:46,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 09:40:46,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:46,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 09:40:46,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:46,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:40:46,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:46,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 09:40:46,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:46,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:40:46,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:46,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 09:40:46,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:46,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:40:46,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:46,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 09:40:46,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:46,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 09:40:46,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:46,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 09:40:46,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:46,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 09:40:46,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:46,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 09:40:46,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:47,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 09:40:47,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:47,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 09:40:47,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:47,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 09:40:47,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:40:47,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330762878] [2024-10-14 09:40:47,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330762878] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:40:47,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:40:47,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 09:40:47,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86094204] [2024-10-14 09:40:47,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:40:47,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 09:40:47,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:40:47,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 09:40:47,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 09:40:47,030 INFO L87 Difference]: Start difference. First operand 96 states and 154 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 09:40:47,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:40:47,297 INFO L93 Difference]: Finished difference Result 287 states and 461 transitions. [2024-10-14 09:40:47,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 09:40:47,298 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 170 [2024-10-14 09:40:47,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:40:47,302 INFO L225 Difference]: With dead ends: 287 [2024-10-14 09:40:47,304 INFO L226 Difference]: Without dead ends: 192 [2024-10-14 09:40:47,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 09:40:47,306 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 107 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 09:40:47,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 392 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 09:40:47,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-10-14 09:40:47,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 148. [2024-10-14 09:40:47,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 93 states have (on average 1.3978494623655915) internal successors, (130), 93 states have internal predecessors, (130), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-14 09:40:47,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 234 transitions. [2024-10-14 09:40:47,354 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 234 transitions. Word has length 170 [2024-10-14 09:40:47,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:40:47,355 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 234 transitions. [2024-10-14 09:40:47,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 09:40:47,356 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 234 transitions. [2024-10-14 09:40:47,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-14 09:40:47,361 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:40:47,361 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:40:47,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 09:40:47,362 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:40:47,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:40:47,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1090348601, now seen corresponding path program 1 times [2024-10-14 09:40:47,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:40:47,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665455358] [2024-10-14 09:40:47,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:40:47,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:40:47,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:47,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:40:47,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:47,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:40:47,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:47,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:40:47,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:47,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 09:40:47,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:47,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:40:47,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:47,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 09:40:47,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:47,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:40:47,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:47,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 09:40:47,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:47,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:40:47,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:47,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 09:40:47,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:47,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 09:40:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:47,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 09:40:47,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:47,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 09:40:47,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:47,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 09:40:47,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:47,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:40:47,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:47,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 09:40:47,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:47,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:40:47,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:47,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 09:40:47,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:47,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:40:47,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:47,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 09:40:47,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:47,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 09:40:47,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:47,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 09:40:47,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:47,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 09:40:47,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:47,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 09:40:47,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:47,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 09:40:47,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:47,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 09:40:47,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:47,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 09:40:47,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:40:47,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665455358] [2024-10-14 09:40:47,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665455358] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:40:47,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:40:47,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 09:40:47,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509611627] [2024-10-14 09:40:47,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:40:47,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 09:40:47,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:40:47,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 09:40:47,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 09:40:47,621 INFO L87 Difference]: Start difference. First operand 148 states and 234 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 09:40:47,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:40:47,658 INFO L93 Difference]: Finished difference Result 244 states and 389 transitions. [2024-10-14 09:40:47,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 09:40:47,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 170 [2024-10-14 09:40:47,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:40:47,661 INFO L225 Difference]: With dead ends: 244 [2024-10-14 09:40:47,661 INFO L226 Difference]: Without dead ends: 149 [2024-10-14 09:40:47,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 09:40:47,663 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 09:40:47,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 268 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 09:40:47,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-10-14 09:40:47,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2024-10-14 09:40:47,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 94 states have (on average 1.3936170212765957) internal successors, (131), 94 states have internal predecessors, (131), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-14 09:40:47,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 235 transitions. [2024-10-14 09:40:47,720 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 235 transitions. Word has length 170 [2024-10-14 09:40:47,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:40:47,723 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 235 transitions. [2024-10-14 09:40:47,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 09:40:47,724 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 235 transitions. [2024-10-14 09:40:47,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-14 09:40:47,727 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:40:47,727 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:40:47,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 09:40:47,727 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:40:47,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:40:47,728 INFO L85 PathProgramCache]: Analyzing trace with hash 191709025, now seen corresponding path program 1 times [2024-10-14 09:40:47,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:40:47,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12950968] [2024-10-14 09:40:47,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:40:47,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:40:47,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:47,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:40:47,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:47,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:40:47,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:47,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:40:47,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:47,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 09:40:47,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:47,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:40:47,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:47,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 09:40:47,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:47,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:40:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:47,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 09:40:47,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:47,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:40:47,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:47,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 09:40:47,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:47,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 09:40:47,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:47,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 09:40:47,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:47,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 09:40:47,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:47,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 09:40:47,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:47,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:40:47,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:47,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 09:40:47,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:47,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:40:47,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:47,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 09:40:47,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:47,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:40:47,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:47,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 09:40:47,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:47,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 09:40:47,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:47,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 09:40:47,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:47,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 09:40:47,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:47,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 09:40:47,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:47,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 09:40:47,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:47,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 09:40:47,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:47,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 09:40:47,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:40:47,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12950968] [2024-10-14 09:40:47,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12950968] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:40:47,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:40:47,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 09:40:47,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914138904] [2024-10-14 09:40:47,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:40:47,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 09:40:47,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:40:47,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 09:40:47,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 09:40:47,903 INFO L87 Difference]: Start difference. First operand 149 states and 235 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 09:40:47,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:40:47,968 INFO L93 Difference]: Finished difference Result 297 states and 463 transitions. [2024-10-14 09:40:47,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 09:40:47,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2024-10-14 09:40:47,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:40:47,971 INFO L225 Difference]: With dead ends: 297 [2024-10-14 09:40:47,971 INFO L226 Difference]: Without dead ends: 201 [2024-10-14 09:40:47,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 09:40:47,973 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 58 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 09:40:47,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 254 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 09:40:47,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-10-14 09:40:47,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 198. [2024-10-14 09:40:47,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 136 states have (on average 1.375) internal successors, (187), 137 states have internal predecessors, (187), 57 states have call successors, (57), 4 states have call predecessors, (57), 4 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2024-10-14 09:40:47,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 301 transitions. [2024-10-14 09:40:47,998 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 301 transitions. Word has length 171 [2024-10-14 09:40:47,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:40:47,998 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 301 transitions. [2024-10-14 09:40:47,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 09:40:47,999 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 301 transitions. [2024-10-14 09:40:48,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-14 09:40:48,001 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:40:48,001 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:40:48,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 09:40:48,001 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:40:48,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:40:48,002 INFO L85 PathProgramCache]: Analyzing trace with hash 892773603, now seen corresponding path program 1 times [2024-10-14 09:40:48,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:40:48,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626188827] [2024-10-14 09:40:48,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:40:48,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:40:48,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:48,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:40:48,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:48,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:40:48,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:48,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:40:48,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:48,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 09:40:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:48,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:40:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:48,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 09:40:48,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:48,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:40:48,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:48,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 09:40:48,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:48,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:40:48,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:48,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 09:40:48,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:48,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 09:40:48,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:48,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 09:40:48,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:48,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 09:40:48,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:48,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 09:40:48,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:48,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:40:48,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:48,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 09:40:48,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:48,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:40:48,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:48,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 09:40:48,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:48,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:40:48,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:48,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 09:40:48,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:48,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 09:40:48,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:48,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 09:40:48,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:48,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 09:40:48,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:48,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 09:40:48,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:48,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 09:40:48,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:48,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 09:40:48,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:48,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 09:40:48,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:40:48,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626188827] [2024-10-14 09:40:48,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626188827] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:40:48,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:40:48,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 09:40:48,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629179269] [2024-10-14 09:40:48,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:40:48,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 09:40:48,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:40:48,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 09:40:48,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 09:40:48,496 INFO L87 Difference]: Start difference. First operand 198 states and 301 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 09:40:48,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:40:48,760 INFO L93 Difference]: Finished difference Result 399 states and 608 transitions. [2024-10-14 09:40:48,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 09:40:48,761 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2024-10-14 09:40:48,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:40:48,765 INFO L225 Difference]: With dead ends: 399 [2024-10-14 09:40:48,765 INFO L226 Difference]: Without dead ends: 258 [2024-10-14 09:40:48,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 09:40:48,767 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 242 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 09:40:48,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 353 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 09:40:48,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-10-14 09:40:48,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 236. [2024-10-14 09:40:48,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 152 states have (on average 1.3223684210526316) internal successors, (201), 153 states have internal predecessors, (201), 78 states have call successors, (78), 5 states have call predecessors, (78), 5 states have return successors, (78), 77 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-14 09:40:48,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 357 transitions. [2024-10-14 09:40:48,810 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 357 transitions. Word has length 171 [2024-10-14 09:40:48,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:40:48,810 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 357 transitions. [2024-10-14 09:40:48,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 09:40:48,810 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 357 transitions. [2024-10-14 09:40:48,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-14 09:40:48,812 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:40:48,812 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:40:48,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 09:40:48,813 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:40:48,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:40:48,813 INFO L85 PathProgramCache]: Analyzing trace with hash -128294751, now seen corresponding path program 1 times [2024-10-14 09:40:48,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:40:48,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281314600] [2024-10-14 09:40:48,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:40:48,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:40:48,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:49,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:40:49,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:49,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:40:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:49,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:40:49,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:49,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 09:40:49,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:49,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:40:49,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:49,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 09:40:49,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:49,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:40:49,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:49,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 09:40:49,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:49,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:40:49,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:49,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 09:40:49,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:49,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 09:40:49,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:49,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 09:40:49,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:49,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 09:40:49,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:49,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 09:40:49,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:49,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:40:49,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:49,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 09:40:49,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:49,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:40:49,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:49,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 09:40:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:49,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:40:49,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:49,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 09:40:49,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:49,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 09:40:49,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:49,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 09:40:49,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:49,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 09:40:49,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:49,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 09:40:49,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:49,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 09:40:49,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:49,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 09:40:49,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:49,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 15 proven. 60 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-10-14 09:40:49,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:40:49,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281314600] [2024-10-14 09:40:49,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281314600] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 09:40:49,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832644864] [2024-10-14 09:40:49,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:40:49,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:40:49,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:40:49,196 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 09:40:49,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 09:40:49,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:49,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 09:40:49,355 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:40:49,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 435 proven. 60 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2024-10-14 09:40:49,661 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 09:40:49,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 15 proven. 60 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-10-14 09:40:49,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832644864] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 09:40:49,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 09:40:49,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-14 09:40:49,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442365760] [2024-10-14 09:40:49,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 09:40:49,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 09:40:49,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:40:49,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 09:40:49,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 09:40:49,949 INFO L87 Difference]: Start difference. First operand 236 states and 357 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2024-10-14 09:40:50,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:40:50,207 INFO L93 Difference]: Finished difference Result 344 states and 516 transitions. [2024-10-14 09:40:50,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 09:40:50,208 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) Word has length 171 [2024-10-14 09:40:50,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:40:50,210 INFO L225 Difference]: With dead ends: 344 [2024-10-14 09:40:50,210 INFO L226 Difference]: Without dead ends: 165 [2024-10-14 09:40:50,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 389 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-14 09:40:50,211 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 63 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 09:40:50,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 264 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 09:40:50,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-14 09:40:50,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 161. [2024-10-14 09:40:50,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 102 states have (on average 1.2647058823529411) internal successors, (129), 102 states have internal predecessors, (129), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-14 09:40:50,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 233 transitions. [2024-10-14 09:40:50,235 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 233 transitions. Word has length 171 [2024-10-14 09:40:50,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:40:50,236 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 233 transitions. [2024-10-14 09:40:50,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2024-10-14 09:40:50,236 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 233 transitions. [2024-10-14 09:40:50,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 09:40:50,240 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:40:50,240 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:40:50,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 09:40:50,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:40:50,441 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:40:50,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:40:50,442 INFO L85 PathProgramCache]: Analyzing trace with hash -281059048, now seen corresponding path program 1 times [2024-10-14 09:40:50,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:40:50,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060280386] [2024-10-14 09:40:50,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:40:50,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:40:50,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:50,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:40:50,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:50,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:40:50,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:50,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:40:50,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:50,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 09:40:50,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:50,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:40:50,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:50,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 09:40:50,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:50,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:40:50,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:50,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 09:40:50,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:50,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:40:50,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:50,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 09:40:50,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:50,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 09:40:50,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:50,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 09:40:50,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:50,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 09:40:50,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:50,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 09:40:50,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:50,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:40:50,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:50,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 09:40:50,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:50,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:40:50,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:50,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 09:40:50,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:50,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:40:50,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:50,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 09:40:50,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:50,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 09:40:50,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:50,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 09:40:50,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:50,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 09:40:50,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:50,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 09:40:50,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:50,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 09:40:50,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:50,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 09:40:50,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:50,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 51 proven. 24 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-10-14 09:40:50,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:40:50,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060280386] [2024-10-14 09:40:50,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060280386] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 09:40:50,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997600797] [2024-10-14 09:40:50,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:40:50,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:40:50,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:40:50,753 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 09:40:50,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 09:40:50,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:50,896 INFO L255 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 09:40:50,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:40:51,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 603 proven. 24 refuted. 0 times theorem prover too weak. 673 trivial. 0 not checked. [2024-10-14 09:40:51,043 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 09:40:51,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 51 proven. 24 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-10-14 09:40:51,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997600797] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 09:40:51,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 09:40:51,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-10-14 09:40:51,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516441997] [2024-10-14 09:40:51,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 09:40:51,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 09:40:51,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:40:51,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 09:40:51,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 09:40:51,283 INFO L87 Difference]: Start difference. First operand 161 states and 233 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 3 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2024-10-14 09:40:51,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:40:51,554 INFO L93 Difference]: Finished difference Result 273 states and 389 transitions. [2024-10-14 09:40:51,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 09:40:51,555 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 3 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) Word has length 172 [2024-10-14 09:40:51,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:40:51,557 INFO L225 Difference]: With dead ends: 273 [2024-10-14 09:40:51,557 INFO L226 Difference]: Without dead ends: 173 [2024-10-14 09:40:51,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 391 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-10-14 09:40:51,558 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 75 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 09:40:51,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 201 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 09:40:51,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-10-14 09:40:51,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 169. [2024-10-14 09:40:51,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 108 states have (on average 1.2222222222222223) internal successors, (132), 108 states have internal predecessors, (132), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-14 09:40:51,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 236 transitions. [2024-10-14 09:40:51,586 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 236 transitions. Word has length 172 [2024-10-14 09:40:51,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:40:51,586 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 236 transitions. [2024-10-14 09:40:51,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 3 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2024-10-14 09:40:51,587 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 236 transitions. [2024-10-14 09:40:51,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-14 09:40:51,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:40:51,588 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:40:51,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 09:40:51,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-14 09:40:51,790 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:40:51,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:40:51,790 INFO L85 PathProgramCache]: Analyzing trace with hash -672709253, now seen corresponding path program 1 times [2024-10-14 09:40:51,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:40:51,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548309163] [2024-10-14 09:40:51,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:40:51,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:40:51,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:51,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:40:51,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:51,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:40:51,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:51,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:40:51,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:51,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 09:40:51,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:51,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:40:52,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:52,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 09:40:52,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:52,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:40:52,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:52,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 09:40:52,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:52,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:40:52,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:52,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 09:40:52,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:52,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 09:40:52,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:52,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 09:40:52,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:52,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 09:40:52,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:52,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 09:40:52,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:52,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:40:52,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:52,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 09:40:52,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:52,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:40:52,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:52,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 09:40:52,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:52,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:40:52,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:52,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 09:40:52,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:52,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 09:40:52,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:52,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 09:40:52,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:52,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 09:40:52,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:52,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 09:40:52,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:52,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 09:40:52,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:52,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 09:40:52,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:52,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 63 proven. 12 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-10-14 09:40:52,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:40:52,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548309163] [2024-10-14 09:40:52,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548309163] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 09:40:52,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276579462] [2024-10-14 09:40:52,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:40:52,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:40:52,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:40:52,059 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 09:40:52,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 09:40:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:52,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 09:40:52,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:40:52,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 403 proven. 12 refuted. 0 times theorem prover too weak. 885 trivial. 0 not checked. [2024-10-14 09:40:52,300 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 09:40:52,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 63 proven. 12 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-10-14 09:40:52,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276579462] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 09:40:52,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 09:40:52,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-10-14 09:40:52,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291912104] [2024-10-14 09:40:52,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 09:40:52,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 09:40:52,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:40:52,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 09:40:52,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 09:40:52,504 INFO L87 Difference]: Start difference. First operand 169 states and 236 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 3 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) [2024-10-14 09:40:52,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:40:52,724 INFO L93 Difference]: Finished difference Result 285 states and 392 transitions. [2024-10-14 09:40:52,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 09:40:52,725 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 3 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) Word has length 173 [2024-10-14 09:40:52,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:40:52,726 INFO L225 Difference]: With dead ends: 285 [2024-10-14 09:40:52,727 INFO L226 Difference]: Without dead ends: 181 [2024-10-14 09:40:52,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 393 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-10-14 09:40:52,728 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 78 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 09:40:52,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 209 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 09:40:52,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-14 09:40:52,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 177. [2024-10-14 09:40:52,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 114 states have internal predecessors, (136), 52 states have call successors, (52), 10 states have call predecessors, (52), 10 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-14 09:40:52,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 240 transitions. [2024-10-14 09:40:52,761 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 240 transitions. Word has length 173 [2024-10-14 09:40:52,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:40:52,761 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 240 transitions. [2024-10-14 09:40:52,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 3 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) [2024-10-14 09:40:52,762 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 240 transitions. [2024-10-14 09:40:52,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-10-14 09:40:52,763 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:40:52,763 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:40:52,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-14 09:40:52,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:40:52,968 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:40:52,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:40:52,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1661197637, now seen corresponding path program 1 times [2024-10-14 09:40:52,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:40:52,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086310596] [2024-10-14 09:40:52,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:40:52,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:40:53,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 09:40:53,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1300782868] [2024-10-14 09:40:53,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:40:53,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:40:53,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:40:53,038 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 09:40:53,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 09:40:53,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:53,188 INFO L255 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 09:40:53,192 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:40:53,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 09:40:53,688 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 09:40:53,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:40:53,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086310596] [2024-10-14 09:40:53,690 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 09:40:53,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300782868] [2024-10-14 09:40:53,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300782868] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:40:53,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:40:53,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 09:40:53,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096221574] [2024-10-14 09:40:53,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:40:53,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 09:40:53,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:40:53,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 09:40:53,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 09:40:53,692 INFO L87 Difference]: Start difference. First operand 177 states and 240 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 09:40:53,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:40:53,870 INFO L93 Difference]: Finished difference Result 321 states and 435 transitions. [2024-10-14 09:40:53,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 09:40:53,870 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174 [2024-10-14 09:40:53,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:40:53,872 INFO L225 Difference]: With dead ends: 321 [2024-10-14 09:40:53,873 INFO L226 Difference]: Without dead ends: 212 [2024-10-14 09:40:53,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 09:40:53,874 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 77 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 09:40:53,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 357 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 09:40:53,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-10-14 09:40:53,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 176. [2024-10-14 09:40:53,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 113 states have (on average 1.1858407079646018) internal successors, (134), 113 states have internal predecessors, (134), 52 states have call successors, (52), 10 states have call predecessors, (52), 10 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-14 09:40:53,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 238 transitions. [2024-10-14 09:40:53,926 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 238 transitions. Word has length 174 [2024-10-14 09:40:53,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:40:53,927 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 238 transitions. [2024-10-14 09:40:53,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 09:40:53,927 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 238 transitions. [2024-10-14 09:40:53,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-10-14 09:40:53,930 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:40:53,930 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:40:53,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 09:40:54,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:40:54,135 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:40:54,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:40:54,135 INFO L85 PathProgramCache]: Analyzing trace with hash 20827949, now seen corresponding path program 1 times [2024-10-14 09:40:54,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:40:54,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380692747] [2024-10-14 09:40:54,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:40:54,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:40:54,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:54,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:40:54,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:54,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:40:54,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:54,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:40:54,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:54,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 09:40:54,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:54,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:40:54,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:54,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 09:40:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:54,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:40:54,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:54,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 09:40:54,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:54,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:40:54,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:54,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 09:40:54,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:54,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 09:40:54,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:54,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 09:40:54,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:54,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 09:40:54,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:54,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 09:40:54,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:54,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:40:54,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:54,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 09:40:54,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:54,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:40:54,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:54,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 09:40:54,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:54,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:40:54,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:54,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 09:40:54,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:54,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 09:40:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:54,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 09:40:54,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:54,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 09:40:54,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:54,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 09:40:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:54,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 09:40:54,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:54,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 09:40:54,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:54,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 09:40:54,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:40:54,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380692747] [2024-10-14 09:40:54,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380692747] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:40:54,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:40:54,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 09:40:54,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551306247] [2024-10-14 09:40:54,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:40:54,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 09:40:54,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:40:54,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 09:40:54,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 09:40:54,310 INFO L87 Difference]: Start difference. First operand 176 states and 238 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-14 09:40:54,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:40:54,480 INFO L93 Difference]: Finished difference Result 387 states and 525 transitions. [2024-10-14 09:40:54,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 09:40:54,481 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 174 [2024-10-14 09:40:54,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:40:54,483 INFO L225 Difference]: With dead ends: 387 [2024-10-14 09:40:54,483 INFO L226 Difference]: Without dead ends: 279 [2024-10-14 09:40:54,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 09:40:54,486 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 170 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 09:40:54,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 259 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 09:40:54,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-10-14 09:40:54,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 177. [2024-10-14 09:40:54,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 114 states have (on average 1.1842105263157894) internal successors, (135), 114 states have internal predecessors, (135), 52 states have call successors, (52), 10 states have call predecessors, (52), 10 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-14 09:40:54,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 239 transitions. [2024-10-14 09:40:54,527 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 239 transitions. Word has length 174 [2024-10-14 09:40:54,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:40:54,529 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 239 transitions. [2024-10-14 09:40:54,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-14 09:40:54,529 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 239 transitions. [2024-10-14 09:40:54,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-14 09:40:54,531 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:40:54,531 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:40:54,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 09:40:54,532 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:40:54,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:40:54,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1259413432, now seen corresponding path program 1 times [2024-10-14 09:40:54,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:40:54,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293353640] [2024-10-14 09:40:54,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:40:54,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:40:54,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:54,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:40:54,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:54,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:40:54,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:54,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:40:54,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:54,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 09:40:54,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:54,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:40:54,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:54,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 09:40:54,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:54,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:40:54,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:54,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 09:40:54,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:54,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:40:54,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:54,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 09:40:54,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:54,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 09:40:54,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:54,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 09:40:54,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:54,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 09:40:54,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:54,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 09:40:54,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:54,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:40:54,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:54,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 09:40:54,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:54,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:40:54,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:54,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 09:40:54,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:54,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:40:54,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:54,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 09:40:54,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:54,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 09:40:54,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:54,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 09:40:54,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:54,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 09:40:54,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:54,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 09:40:54,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:54,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 09:40:54,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:54,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 09:40:54,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:54,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 09:40:54,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:40:54,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293353640] [2024-10-14 09:40:54,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293353640] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:40:54,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:40:54,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 09:40:54,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719230427] [2024-10-14 09:40:54,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:40:54,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 09:40:54,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:40:54,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 09:40:54,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 09:40:54,735 INFO L87 Difference]: Start difference. First operand 177 states and 239 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 09:40:54,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:40:54,911 INFO L93 Difference]: Finished difference Result 388 states and 525 transitions. [2024-10-14 09:40:54,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 09:40:54,911 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2024-10-14 09:40:54,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:40:54,914 INFO L225 Difference]: With dead ends: 388 [2024-10-14 09:40:54,914 INFO L226 Difference]: Without dead ends: 280 [2024-10-14 09:40:54,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 09:40:54,915 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 151 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 09:40:54,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 263 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 09:40:54,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-10-14 09:40:54,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 170. [2024-10-14 09:40:54,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 107 states have (on average 1.1682242990654206) internal successors, (125), 107 states have internal predecessors, (125), 52 states have call successors, (52), 10 states have call predecessors, (52), 10 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-14 09:40:54,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 229 transitions. [2024-10-14 09:40:54,957 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 229 transitions. Word has length 175 [2024-10-14 09:40:54,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:40:54,957 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 229 transitions. [2024-10-14 09:40:54,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 09:40:54,957 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 229 transitions. [2024-10-14 09:40:54,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-14 09:40:54,959 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:40:54,959 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:40:54,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 09:40:54,959 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:40:54,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:40:54,960 INFO L85 PathProgramCache]: Analyzing trace with hash -272934385, now seen corresponding path program 1 times [2024-10-14 09:40:54,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:40:54,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856582789] [2024-10-14 09:40:54,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:40:54,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:40:54,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:55,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:40:55,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:55,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:40:55,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:55,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:40:55,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:55,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 09:40:55,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:55,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:40:55,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:55,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 09:40:55,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:55,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:40:55,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:55,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 09:40:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:55,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:40:55,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:55,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 09:40:55,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:55,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 09:40:55,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:55,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 09:40:55,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:55,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 09:40:55,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:55,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 09:40:55,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:55,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:40:55,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:55,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 09:40:55,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:55,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:40:55,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:55,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 09:40:55,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:55,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:40:55,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:55,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 09:40:55,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:55,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 09:40:55,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:55,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 09:40:55,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:55,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 09:40:55,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:55,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 09:40:55,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:55,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 09:40:55,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:55,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 09:40:55,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:55,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 09:40:55,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:40:55,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856582789] [2024-10-14 09:40:55,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856582789] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:40:55,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:40:55,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 09:40:55,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986943796] [2024-10-14 09:40:55,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:40:55,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 09:40:55,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:40:55,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 09:40:55,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 09:40:55,185 INFO L87 Difference]: Start difference. First operand 170 states and 229 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 09:40:55,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:40:55,380 INFO L93 Difference]: Finished difference Result 309 states and 415 transitions. [2024-10-14 09:40:55,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 09:40:55,381 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2024-10-14 09:40:55,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:40:55,382 INFO L225 Difference]: With dead ends: 309 [2024-10-14 09:40:55,382 INFO L226 Difference]: Without dead ends: 206 [2024-10-14 09:40:55,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 09:40:55,384 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 80 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 09:40:55,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 359 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 09:40:55,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-10-14 09:40:55,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 170. [2024-10-14 09:40:55,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 107 states have (on average 1.158878504672897) internal successors, (124), 107 states have internal predecessors, (124), 52 states have call successors, (52), 10 states have call predecessors, (52), 10 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-14 09:40:55,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 228 transitions. [2024-10-14 09:40:55,422 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 228 transitions. Word has length 175 [2024-10-14 09:40:55,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:40:55,422 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 228 transitions. [2024-10-14 09:40:55,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 09:40:55,422 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 228 transitions. [2024-10-14 09:40:55,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-10-14 09:40:55,424 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:40:55,424 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:40:55,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 09:40:55,424 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:40:55,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:40:55,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1367751146, now seen corresponding path program 1 times [2024-10-14 09:40:55,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:40:55,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785871879] [2024-10-14 09:40:55,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:40:55,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:40:55,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 09:40:55,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [867312019] [2024-10-14 09:40:55,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:40:55,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:40:55,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:40:55,506 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 09:40:55,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-14 09:40:55,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 09:40:55,655 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 09:40:55,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 09:40:55,838 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 09:40:55,838 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 09:40:55,839 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 09:40:55,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-14 09:40:56,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-14 09:40:56,045 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:40:56,185 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 09:40:56,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 09:40:56 BoogieIcfgContainer [2024-10-14 09:40:56,189 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 09:40:56,190 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 09:40:56,190 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 09:40:56,190 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 09:40:56,191 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:40:44" (3/4) ... [2024-10-14 09:40:56,192 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 09:40:56,193 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 09:40:56,194 INFO L158 Benchmark]: Toolchain (without parser) took 12683.26ms. Allocated memory was 167.8MB in the beginning and 356.5MB in the end (delta: 188.7MB). Free memory was 114.3MB in the beginning and 215.9MB in the end (delta: -101.7MB). Peak memory consumption was 87.7MB. Max. memory is 16.1GB. [2024-10-14 09:40:56,194 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 167.8MB. Free memory is still 133.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 09:40:56,194 INFO L158 Benchmark]: CACSL2BoogieTranslator took 360.03ms. Allocated memory is still 167.8MB. Free memory was 114.3MB in the beginning and 98.3MB in the end (delta: 16.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 09:40:56,195 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.85ms. Allocated memory is still 167.8MB. Free memory was 98.3MB in the beginning and 94.8MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 09:40:56,195 INFO L158 Benchmark]: Boogie Preprocessor took 68.17ms. Allocated memory is still 167.8MB. Free memory was 94.8MB in the beginning and 90.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 09:40:56,195 INFO L158 Benchmark]: RCFGBuilder took 690.39ms. Allocated memory is still 167.8MB. Free memory was 90.6MB in the beginning and 59.1MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-14 09:40:56,196 INFO L158 Benchmark]: TraceAbstraction took 11492.64ms. Allocated memory was 167.8MB in the beginning and 356.5MB in the end (delta: 188.7MB). Free memory was 58.4MB in the beginning and 215.9MB in the end (delta: -157.5MB). Peak memory consumption was 33.2MB. Max. memory is 16.1GB. [2024-10-14 09:40:56,196 INFO L158 Benchmark]: Witness Printer took 3.56ms. Allocated memory is still 356.5MB. Free memory is still 215.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 09:40:56,198 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.18ms. Allocated memory is still 167.8MB. Free memory is still 133.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 360.03ms. Allocated memory is still 167.8MB. Free memory was 114.3MB in the beginning and 98.3MB in the end (delta: 16.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.85ms. Allocated memory is still 167.8MB. Free memory was 98.3MB in the beginning and 94.8MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.17ms. Allocated memory is still 167.8MB. Free memory was 94.8MB in the beginning and 90.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 690.39ms. Allocated memory is still 167.8MB. Free memory was 90.6MB in the beginning and 59.1MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 11492.64ms. Allocated memory was 167.8MB in the beginning and 356.5MB in the end (delta: 188.7MB). Free memory was 58.4MB in the beginning and 215.9MB in the end (delta: -157.5MB). Peak memory consumption was 33.2MB. Max. memory is 16.1GB. * Witness Printer took 3.56ms. Allocated memory is still 356.5MB. Free memory is still 215.9MB. 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 151, overapproximation of someBinaryDOUBLEComparisonOperation at line 198. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] signed char var_1_10 = 2; [L24] signed char var_1_11 = 1; [L25] float var_1_14 = 64.3; [L26] signed char var_1_16 = 32; [L27] unsigned char var_1_17 = 1; [L28] unsigned char var_1_18 = 0; [L29] unsigned char var_1_19 = 0; [L30] double var_1_20 = 9.25; [L31] double var_1_21 = 255.05; [L32] double var_1_22 = 25.5; [L33] unsigned char var_1_23 = 2; [L34] unsigned char var_1_25 = 1; [L35] unsigned short int var_1_26 = 5; [L36] unsigned char var_1_27 = 128; [L37] unsigned char var_1_28 = 1; [L38] signed long int var_1_29 = 128; [L39] unsigned long int var_1_31 = 1; [L40] unsigned long int var_1_32 = 64; [L41] unsigned long int var_1_37 = 3773873024; [L42] unsigned long int var_1_38 = 2296504360; [L43] unsigned long int var_1_39 = 16; [L44] unsigned long int var_1_40 = 2753961414; [L45] unsigned char var_1_41 = 8; [L46] signed short int var_1_43 = -50; [L47] signed char var_1_44 = -1; [L48] double var_1_47 = 255.2; [L49] double var_1_50 = 50.4; [L50] double var_1_51 = 49.25; [L51] double var_1_52 = 1000000.4; [L52] double var_1_53 = 256.2; [L53] signed char var_1_54 = -8; [L54] unsigned char last_1_var_1_17 = 1; [L55] double last_1_var_1_20 = 9.25; [L56] unsigned char last_1_var_1_23 = 2; [L57] unsigned short int last_1_var_1_26 = 5; [L58] signed long int last_1_var_1_29 = 128; [L202] isInitial = 1 [L203] FCALL initially() [L204] COND TRUE 1 [L205] CALL updateLastVariables() [L191] last_1_var_1_17 = var_1_17 [L192] last_1_var_1_20 = var_1_20 [L193] last_1_var_1_23 = var_1_23 [L194] last_1_var_1_26 = var_1_26 [L195] last_1_var_1_29 = var_1_29 [L205] RET updateLastVariables() [L206] CALL updateVariables() [L147] var_1_11 = __VERIFIER_nondet_char() [L148] CALL assume_abort_if_not(var_1_11 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L148] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L149] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L149] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L150] var_1_14 = __VERIFIER_nondet_float() [L151] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L151] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L152] var_1_16 = __VERIFIER_nondet_char() [L153] CALL assume_abort_if_not(var_1_16 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L153] RET assume_abort_if_not(var_1_16 >= -63) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L154] CALL assume_abort_if_not(var_1_16 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L154] RET assume_abort_if_not(var_1_16 <= 63) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L155] var_1_18 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_18 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L156] RET assume_abort_if_not(var_1_18 >= 1) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L157] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L157] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L158] var_1_19 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_19 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L159] RET assume_abort_if_not(var_1_19 >= 1) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L160] CALL assume_abort_if_not(var_1_19 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L160] RET assume_abort_if_not(var_1_19 <= 1) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L161] var_1_21 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L162] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L163] var_1_22 = __VERIFIER_nondet_double() [L164] CALL assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L164] RET assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L165] var_1_25 = __VERIFIER_nondet_uchar() [L166] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L166] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L167] CALL assume_abort_if_not(var_1_25 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L167] RET assume_abort_if_not(var_1_25 <= 254) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L168] var_1_27 = __VERIFIER_nondet_uchar() [L169] CALL assume_abort_if_not(var_1_27 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L169] RET assume_abort_if_not(var_1_27 >= 127) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L170] CALL assume_abort_if_not(var_1_27 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L170] RET assume_abort_if_not(var_1_27 <= 255) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L171] var_1_28 = __VERIFIER_nondet_uchar() [L172] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L172] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L173] CALL assume_abort_if_not(var_1_28 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L173] RET assume_abort_if_not(var_1_28 <= 127) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L174] var_1_37 = __VERIFIER_nondet_ulong() [L175] CALL assume_abort_if_not(var_1_37 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483648, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483648, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L175] RET assume_abort_if_not(var_1_37 >= 2147483647) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483648, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L176] CALL assume_abort_if_not(var_1_37 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483648, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483648, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L176] RET assume_abort_if_not(var_1_37 <= 4294967294) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483648, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L177] var_1_38 = __VERIFIER_nondet_ulong() [L178] CALL assume_abort_if_not(var_1_38 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483648, var_1_38=-2147483648, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483648, var_1_38=-2147483648, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L178] RET assume_abort_if_not(var_1_38 >= 2147483647) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483648, var_1_38=-2147483648, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L179] CALL assume_abort_if_not(var_1_38 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483648, var_1_38=-2147483648, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483648, var_1_38=-2147483648, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L179] RET assume_abort_if_not(var_1_38 <= 4294967294) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483648, var_1_38=-2147483648, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L180] var_1_40 = __VERIFIER_nondet_ulong() [L181] CALL assume_abort_if_not(var_1_40 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483648, var_1_38=-2147483648, var_1_39=16, var_1_40=2147483648, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483648, var_1_38=-2147483648, var_1_39=16, var_1_40=2147483648, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L181] RET assume_abort_if_not(var_1_40 >= 2147483647) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483648, var_1_38=-2147483648, var_1_39=16, var_1_40=2147483648, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L182] CALL assume_abort_if_not(var_1_40 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483648, var_1_38=-2147483648, var_1_39=16, var_1_40=2147483648, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483648, var_1_38=-2147483648, var_1_39=16, var_1_40=2147483648, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L182] RET assume_abort_if_not(var_1_40 <= 4294967294) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483648, var_1_38=-2147483648, var_1_39=16, var_1_40=2147483648, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L183] var_1_50 = __VERIFIER_nondet_double() [L184] CALL assume_abort_if_not((var_1_50 >= 0.0F && var_1_50 <= -1.0e-20F) || (var_1_50 <= 9223372.036854765600e+12F && var_1_50 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483648, var_1_38=-2147483648, var_1_39=16, var_1_40=2147483648, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483648, var_1_38=-2147483648, var_1_39=16, var_1_40=2147483648, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L184] RET assume_abort_if_not((var_1_50 >= 0.0F && var_1_50 <= -1.0e-20F) || (var_1_50 <= 9223372.036854765600e+12F && var_1_50 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483648, var_1_38=-2147483648, var_1_39=16, var_1_40=2147483648, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L185] var_1_51 = __VERIFIER_nondet_double() [L186] CALL assume_abort_if_not((var_1_51 >= 0.0F && var_1_51 <= -1.0e-20F) || (var_1_51 <= 9223372.036854765600e+12F && var_1_51 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483648, var_1_38=-2147483648, var_1_39=16, var_1_40=2147483648, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483648, var_1_38=-2147483648, var_1_39=16, var_1_40=2147483648, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L186] RET assume_abort_if_not((var_1_51 >= 0.0F && var_1_51 <= -1.0e-20F) || (var_1_51 <= 9223372.036854765600e+12F && var_1_51 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483648, var_1_38=-2147483648, var_1_39=16, var_1_40=2147483648, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L187] var_1_52 = __VERIFIER_nondet_double() [L188] CALL assume_abort_if_not((var_1_52 >= 0.0F && var_1_52 <= -1.0e-20F) || (var_1_52 <= 9223372.036854765600e+12F && var_1_52 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483648, var_1_38=-2147483648, var_1_39=16, var_1_40=2147483648, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483648, var_1_38=-2147483648, var_1_39=16, var_1_40=2147483648, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_53=1281/5, var_1_54=-8] [L188] RET assume_abort_if_not((var_1_52 >= 0.0F && var_1_52 <= -1.0e-20F) || (var_1_52 <= 9223372.036854765600e+12F && var_1_52 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483648, var_1_38=-2147483648, var_1_39=16, var_1_40=2147483648, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_53=1281/5, var_1_54=-8] [L206] RET updateVariables() [L207] CALL step() [L62] COND FALSE !((last_1_var_1_29 * last_1_var_1_23) <= last_1_var_1_29) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483648, var_1_38=-2147483648, var_1_39=16, var_1_40=2147483648, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_53=1281/5, var_1_54=-8] [L65] COND TRUE last_1_var_1_17 || last_1_var_1_17 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483648, var_1_38=-2147483648, var_1_39=16, var_1_40=2147483648, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_53=1281/5, var_1_54=-8] [L66] COND TRUE (((((last_1_var_1_20) < 0 ) ? -(last_1_var_1_20) : (last_1_var_1_20))) - var_1_14) == (last_1_var_1_20 + last_1_var_1_20) [L67] var_1_10 = (var_1_11 + var_1_16) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=126, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483648, var_1_38=-2147483648, var_1_39=16, var_1_40=2147483648, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_53=1281/5, var_1_54=-8] [L75] COND TRUE (last_1_var_1_29 + last_1_var_1_29) > last_1_var_1_26 [L76] var_1_23 = var_1_25 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=126, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483648, var_1_38=-2147483648, var_1_39=16, var_1_40=2147483648, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_53=1281/5, var_1_54=-8] [L78] COND TRUE var_1_17 || var_1_18 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=126, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483648, var_1_38=-2147483648, var_1_39=16, var_1_40=2147483648, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_53=1281/5, var_1_54=-8] [L79] COND TRUE var_1_11 >= var_1_16 [L80] var_1_47 = var_1_22 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=126, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_22=2, var_1_23=0, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483648, var_1_38=-2147483648, var_1_39=16, var_1_40=2147483648, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=2, var_1_53=1281/5, var_1_54=-8] [L93] var_1_17 = (var_1_18 && var_1_19) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=126, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_22=2, var_1_23=0, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483648, var_1_38=-2147483648, var_1_39=16, var_1_40=2147483648, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=2, var_1_53=1281/5, var_1_54=-8] [L94] COND FALSE !(! var_1_18) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=126, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_22=2, var_1_23=0, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483648, var_1_38=-2147483648, var_1_39=16, var_1_40=2147483648, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=2, var_1_53=1281/5, var_1_54=-8] [L97] COND TRUE 256 >= var_1_10 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=126, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_22=2, var_1_23=0, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483648, var_1_38=-2147483648, var_1_39=16, var_1_40=2147483648, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=2, var_1_53=1281/5, var_1_54=-8] [L98] COND TRUE var_1_17 && (var_1_25 >= (var_1_27 - var_1_28)) [L99] var_1_26 = 16 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=126, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_22=2, var_1_23=0, var_1_25=0, var_1_26=16, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483648, var_1_38=-2147483648, var_1_39=16, var_1_40=2147483648, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=2, var_1_53=1281/5, var_1_54=-8] [L106] var_1_41 = var_1_25 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=126, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_22=2, var_1_23=0, var_1_25=0, var_1_26=16, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483648, var_1_38=-2147483648, var_1_39=16, var_1_40=2147483648, var_1_41=0, var_1_43=-50, var_1_44=-1, var_1_47=2, var_1_53=1281/5, var_1_54=-8] [L107] EXPR var_1_37 ^ var_1_40 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=126, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_22=2, var_1_23=0, var_1_25=0, var_1_26=16, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483648, var_1_38=-2147483648, var_1_39=16, var_1_40=2147483648, var_1_41=0, var_1_43=-50, var_1_44=-1, var_1_47=2, var_1_53=1281/5, var_1_54=-8] [L107] EXPR ((-8) > ((var_1_37 ^ var_1_40))) ? (-8) : ((var_1_37 ^ var_1_40)) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=126, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_22=2, var_1_23=0, var_1_25=0, var_1_26=16, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483648, var_1_38=-2147483648, var_1_39=16, var_1_40=2147483648, var_1_41=0, var_1_43=-50, var_1_44=-1, var_1_47=2, var_1_53=1281/5, var_1_54=-8] [L107] COND TRUE var_1_23 <= ((((-8) > ((var_1_37 ^ var_1_40))) ? (-8) : ((var_1_37 ^ var_1_40)))) [L108] COND TRUE \read(var_1_18) [L109] var_1_44 = ((((var_1_16) > (var_1_11)) ? (var_1_16) : (var_1_11))) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=126, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_22=2, var_1_23=0, var_1_25=0, var_1_26=16, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483648, var_1_38=-2147483648, var_1_39=16, var_1_40=2147483648, var_1_41=0, var_1_43=-50, var_1_44=63, var_1_47=2, var_1_53=1281/5, var_1_54=-8] [L114] signed long int stepLocal_0 = var_1_23 * var_1_26; VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, stepLocal_0=0, var_1_10=126, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_22=2, var_1_23=0, var_1_25=0, var_1_26=16, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483648, var_1_38=-2147483648, var_1_39=16, var_1_40=2147483648, var_1_41=0, var_1_43=-50, var_1_44=63, var_1_47=2, var_1_53=1281/5, var_1_54=-8] [L115] COND FALSE !(((((var_1_20) < (63.5)) ? (var_1_20) : (63.5))) > (2.4 * var_1_20)) [L122] var_1_1 = -50 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, stepLocal_0=0, var_1_10=126, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_22=2, var_1_23=0, var_1_25=0, var_1_26=16, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483648, var_1_38=-2147483648, var_1_39=16, var_1_40=2147483648, var_1_41=0, var_1_43=-50, var_1_44=63, var_1_47=2, var_1_53=1281/5, var_1_54=-8] [L124] var_1_53 = 5.5 [L125] var_1_31 = var_1_26 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, stepLocal_0=0, var_1_10=126, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_22=2, var_1_23=0, var_1_25=0, var_1_26=16, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=16, var_1_32=64, var_1_37=-2147483648, var_1_38=-2147483648, var_1_39=16, var_1_40=2147483648, var_1_41=0, var_1_43=-50, var_1_44=63, var_1_47=2, var_1_53=11/2, var_1_54=-8] [L126] COND FALSE !(var_1_37 <= ((((var_1_26) > (var_1_26)) ? (var_1_26) : (var_1_26)))) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, stepLocal_0=0, var_1_10=126, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_22=2, var_1_23=0, var_1_25=0, var_1_26=16, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=16, var_1_32=64, var_1_37=-2147483648, var_1_38=-2147483648, var_1_39=16, var_1_40=2147483648, var_1_41=0, var_1_43=-50, var_1_44=63, var_1_47=2, var_1_53=11/2, var_1_54=-8] [L129] var_1_29 = var_1_1 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, stepLocal_0=0, var_1_10=126, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_22=2, var_1_23=0, var_1_25=0, var_1_26=16, var_1_27=127, var_1_28=127, var_1_29=-50, var_1_31=16, var_1_32=64, var_1_37=-2147483648, var_1_38=-2147483648, var_1_39=16, var_1_40=2147483648, var_1_41=0, var_1_43=-50, var_1_44=63, var_1_47=2, var_1_53=11/2, var_1_54=-8] [L130] COND TRUE var_1_18 && var_1_18 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, stepLocal_0=0, var_1_10=126, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_22=2, var_1_23=0, var_1_25=0, var_1_26=16, var_1_27=127, var_1_28=127, var_1_29=-50, var_1_31=16, var_1_32=64, var_1_37=-2147483648, var_1_38=-2147483648, var_1_39=16, var_1_40=2147483648, var_1_41=0, var_1_43=-50, var_1_44=63, var_1_47=2, var_1_53=11/2, var_1_54=-8] [L131] COND TRUE var_1_29 <= var_1_26 [L132] var_1_32 = (((((var_1_37) < (((((var_1_38) < 0 ) ? -(var_1_38) : (var_1_38))))) ? (var_1_37) : (((((var_1_38) < 0 ) ? -(var_1_38) : (var_1_38)))))) - var_1_29) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, stepLocal_0=0, var_1_10=126, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_22=2, var_1_23=0, var_1_25=0, var_1_26=16, var_1_27=127, var_1_28=127, var_1_29=-50, var_1_31=16, var_1_32=-2147483598, var_1_37=-2147483648, var_1_38=-2147483648, var_1_39=16, var_1_40=2147483648, var_1_41=0, var_1_43=-50, var_1_44=63, var_1_47=2, var_1_53=11/2, var_1_54=-8] [L135] COND TRUE (- var_1_38) <= (- var_1_37) [L136] var_1_39 = (2368197193u - var_1_23) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, stepLocal_0=0, var_1_10=126, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_22=2, var_1_23=0, var_1_25=0, var_1_26=16, var_1_27=127, var_1_28=127, var_1_29=-50, var_1_31=16, var_1_32=-2147483598, var_1_37=-2147483648, var_1_38=-2147483648, var_1_39=2368197193, var_1_40=2147483648, var_1_41=0, var_1_43=-50, var_1_44=63, var_1_47=2, var_1_53=11/2, var_1_54=-8] [L144] var_1_54 = var_1_11 [L207] RET step() [L208] CALL, EXPR property() [L198-L199] return ((((((((((((var_1_20) < (63.5)) ? (var_1_20) : (63.5))) > (2.4 * var_1_20)) ? (((var_1_23 * var_1_26) <= (~ var_1_26)) ? (var_1_1 == ((signed short int) (((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10))) + var_1_23))) : (var_1_1 == ((signed short int) var_1_10))) : (var_1_1 == ((signed short int) -50))) && (((last_1_var_1_29 * last_1_var_1_23) <= last_1_var_1_29) ? (var_1_10 == ((signed char) (var_1_11 + 10))) : ((last_1_var_1_17 || last_1_var_1_17) ? (((((((last_1_var_1_20) < 0 ) ? -(last_1_var_1_20) : (last_1_var_1_20))) - var_1_14) == (last_1_var_1_20 + last_1_var_1_20)) ? (var_1_10 == ((signed char) (var_1_11 + var_1_16))) : (var_1_10 == ((signed char) var_1_11))) : (var_1_10 == ((signed char) var_1_16))))) && (var_1_17 == ((unsigned char) (var_1_18 && var_1_19)))) && ((! var_1_18) ? (var_1_20 == ((double) ((((var_1_21) > (var_1_22)) ? (var_1_21) : (var_1_22))))) : 1)) && (((last_1_var_1_29 + last_1_var_1_29) > last_1_var_1_26) ? (var_1_23 == ((unsigned char) var_1_25)) : 1)) && ((256 >= var_1_10) ? ((var_1_17 && (var_1_25 >= (var_1_27 - var_1_28))) ? (var_1_26 == ((unsigned short int) 16)) : (var_1_26 == ((unsigned short int) var_1_28))) : (var_1_26 == ((unsigned short int) var_1_25)))) && (var_1_29 == ((signed long int) var_1_1))) && (var_1_31 == ((unsigned long int) var_1_26)) ; [L208] RET, EXPR property() [L208] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=126, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_22=2, var_1_23=0, var_1_25=0, var_1_26=16, var_1_27=127, var_1_28=127, var_1_29=-50, var_1_31=16, var_1_32=-2147483598, var_1_37=-2147483648, var_1_38=-2147483648, var_1_39=2368197193, var_1_40=2147483648, var_1_41=0, var_1_43=-50, var_1_44=63, var_1_47=2, var_1_53=11/2, var_1_54=63] [L19] reach_error() VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=126, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_22=2, var_1_23=0, var_1_25=0, var_1_26=16, var_1_27=127, var_1_28=127, var_1_29=-50, var_1_31=16, var_1_32=-2147483598, var_1_37=-2147483648, var_1_38=-2147483648, var_1_39=2368197193, var_1_40=2147483648, var_1_41=0, var_1_43=-50, var_1_44=63, var_1_47=2, var_1_53=11/2, var_1_54=63] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 90 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.3s, OverallIterations: 14, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1199 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1156 mSDsluCounter, 3571 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1868 mSDsCounter, 420 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 871 IncrementalHoareTripleChecker+Invalid, 1291 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 420 mSolverCounterUnsat, 1703 mSDtfsCounter, 871 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1912 GetRequests, 1862 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=236occurred in iteration=6, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 13 MinimizatonAttempts, 395 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 3276 NumberOfCodeBlocks, 3276 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 3247 ConstructedInterpolants, 0 QuantifiedInterpolants, 8314 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1682 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 19 InterpolantComputations, 10 PerfectInterpolantSequences, 24412/24700 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 09:40:56,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-72.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 628ae357ecdbc8bffd368655bd28e8aec575a201b811d6a0f87cc4e59fcd6754 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 09:40:58,516 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 09:40:58,608 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 09:40:58,614 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 09:40:58,615 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 09:40:58,645 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 09:40:58,648 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 09:40:58,648 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 09:40:58,649 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 09:40:58,649 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 09:40:58,650 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 09:40:58,650 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 09:40:58,651 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 09:40:58,652 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 09:40:58,654 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 09:40:58,654 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 09:40:58,654 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 09:40:58,655 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 09:40:58,655 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 09:40:58,655 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 09:40:58,655 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 09:40:58,659 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 09:40:58,659 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 09:40:58,660 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 09:40:58,660 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 09:40:58,660 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 09:40:58,661 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 09:40:58,661 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 09:40:58,661 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 09:40:58,662 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 09:40:58,663 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 09:40:58,663 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 09:40:58,663 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 09:40:58,663 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 09:40:58,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:40:58,664 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 09:40:58,664 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 09:40:58,665 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 09:40:58,665 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 09:40:58,665 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 09:40:58,665 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 09:40:58,666 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 09:40:58,666 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 09:40:58,666 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 09:40:58,666 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 09:40:58,667 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 628ae357ecdbc8bffd368655bd28e8aec575a201b811d6a0f87cc4e59fcd6754 [2024-10-14 09:40:58,978 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 09:40:59,005 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 09:40:59,008 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 09:40:59,009 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 09:40:59,010 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 09:40:59,012 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-72.i [2024-10-14 09:41:00,530 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 09:41:00,789 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 09:41:00,793 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-72.i [2024-10-14 09:41:00,808 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b59ae8d33/0729ef4a85ba421f857145d2c0ce4883/FLAGc31740a54 [2024-10-14 09:41:00,824 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b59ae8d33/0729ef4a85ba421f857145d2c0ce4883 [2024-10-14 09:41:00,827 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 09:41:00,828 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 09:41:00,830 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 09:41:00,831 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 09:41:00,836 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 09:41:00,836 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:41:00" (1/1) ... [2024-10-14 09:41:00,839 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ec001b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:41:00, skipping insertion in model container [2024-10-14 09:41:00,839 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:41:00" (1/1) ... [2024-10-14 09:41:00,871 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 09:41:01,052 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-72.i[919,932] [2024-10-14 09:41:01,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:41:01,152 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 09:41:01,164 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-72.i[919,932] [2024-10-14 09:41:01,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:41:01,232 INFO L204 MainTranslator]: Completed translation [2024-10-14 09:41:01,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:41:01 WrapperNode [2024-10-14 09:41:01,233 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 09:41:01,234 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 09:41:01,235 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 09:41:01,235 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 09:41:01,241 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:41:01" (1/1) ... [2024-10-14 09:41:01,260 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:41:01" (1/1) ... [2024-10-14 09:41:01,301 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 200 [2024-10-14 09:41:01,302 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 09:41:01,303 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 09:41:01,303 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 09:41:01,303 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 09:41:01,317 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:41:01" (1/1) ... [2024-10-14 09:41:01,317 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:41:01" (1/1) ... [2024-10-14 09:41:01,323 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:41:01" (1/1) ... [2024-10-14 09:41:01,344 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 09:41:01,344 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:41:01" (1/1) ... [2024-10-14 09:41:01,344 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:41:01" (1/1) ... [2024-10-14 09:41:01,355 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:41:01" (1/1) ... [2024-10-14 09:41:01,362 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:41:01" (1/1) ... [2024-10-14 09:41:01,369 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:41:01" (1/1) ... [2024-10-14 09:41:01,371 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:41:01" (1/1) ... [2024-10-14 09:41:01,375 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 09:41:01,376 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 09:41:01,376 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 09:41:01,376 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 09:41:01,377 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:41:01" (1/1) ... [2024-10-14 09:41:01,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:41:01,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:41:01,422 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 09:41:01,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 09:41:01,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 09:41:01,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 09:41:01,471 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 09:41:01,471 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 09:41:01,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 09:41:01,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 09:41:01,593 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 09:41:01,596 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 09:41:11,465 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-14 09:41:11,466 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 09:41:11,553 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 09:41:11,553 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 09:41:11,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:41:11 BoogieIcfgContainer [2024-10-14 09:41:11,554 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 09:41:11,557 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 09:41:11,557 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 09:41:11,560 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 09:41:11,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:41:00" (1/3) ... [2024-10-14 09:41:11,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cbe705f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:41:11, skipping insertion in model container [2024-10-14 09:41:11,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:41:01" (2/3) ... [2024-10-14 09:41:11,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cbe705f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:41:11, skipping insertion in model container [2024-10-14 09:41:11,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:41:11" (3/3) ... [2024-10-14 09:41:11,562 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-72.i [2024-10-14 09:41:11,580 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 09:41:11,581 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 09:41:11,643 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 09:41:11,652 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;@6ac5d95e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 09:41:11,652 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 09:41:11,655 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 52 states have internal predecessors, (76), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 09:41:11,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-14 09:41:11,666 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:41:11,667 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:41:11,668 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:41:11,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:41:11,673 INFO L85 PathProgramCache]: Analyzing trace with hash 271262799, now seen corresponding path program 1 times [2024-10-14 09:41:11,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:41:11,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1504333695] [2024-10-14 09:41:11,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:41:11,689 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 09:41:11,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:41:11,693 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 09:41:11,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 09:41:12,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:12,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 09:41:12,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:41:12,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 09:41:12,383 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 09:41:12,387 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 09:41:12,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1504333695] [2024-10-14 09:41:12,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1504333695] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:41:12,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:41:12,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 09:41:12,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184198283] [2024-10-14 09:41:12,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:41:12,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 09:41:12,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 09:41:12,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 09:41:12,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 09:41:12,425 INFO L87 Difference]: Start difference. First operand has 80 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 52 states have internal predecessors, (76), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 09:41:16,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 09:41:16,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:41:16,611 INFO L93 Difference]: Finished difference Result 157 states and 280 transitions. [2024-10-14 09:41:16,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 09:41:16,652 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 167 [2024-10-14 09:41:16,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:41:16,659 INFO L225 Difference]: With dead ends: 157 [2024-10-14 09:41:16,659 INFO L226 Difference]: Without dead ends: 78 [2024-10-14 09:41:16,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 09:41:16,667 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-14 09:41:16,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2024-10-14 09:41:16,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-14 09:41:16,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-14 09:41:16,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 50 states have (on average 1.38) internal successors, (69), 50 states have internal predecessors, (69), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 09:41:16,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 121 transitions. [2024-10-14 09:41:16,723 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 121 transitions. Word has length 167 [2024-10-14 09:41:16,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:41:16,726 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 121 transitions. [2024-10-14 09:41:16,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 09:41:16,727 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 121 transitions. [2024-10-14 09:41:16,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-14 09:41:16,733 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:41:16,733 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:41:16,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 09:41:16,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 09:41:16,935 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:41:16,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:41:16,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1418371686, now seen corresponding path program 1 times [2024-10-14 09:41:16,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:41:16,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1146809211] [2024-10-14 09:41:16,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:41:16,937 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 09:41:16,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:41:16,940 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 09:41:16,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 09:41:17,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:17,387 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 09:41:17,395 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:41:21,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 09:41:21,157 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 09:41:21,157 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 09:41:21,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1146809211] [2024-10-14 09:41:21,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1146809211] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:41:21,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:41:21,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 09:41:21,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093144098] [2024-10-14 09:41:21,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:41:21,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 09:41:21,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 09:41:21,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 09:41:21,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 09:41:21,164 INFO L87 Difference]: Start difference. First operand 78 states and 121 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 09:41:25,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 09:41:30,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 09:41:30,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:41:30,242 INFO L93 Difference]: Finished difference Result 250 states and 389 transitions. [2024-10-14 09:41:30,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 09:41:30,282 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 169 [2024-10-14 09:41:30,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:41:30,285 INFO L225 Difference]: With dead ends: 250 [2024-10-14 09:41:30,285 INFO L226 Difference]: Without dead ends: 173 [2024-10-14 09:41:30,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 09:41:30,288 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 126 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 53 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2024-10-14 09:41:30,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 336 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 23 Invalid, 2 Unknown, 0 Unchecked, 9.0s Time] [2024-10-14 09:41:30,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-10-14 09:41:30,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 126. [2024-10-14 09:41:30,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 71 states have (on average 1.267605633802817) internal successors, (90), 71 states have internal predecessors, (90), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-14 09:41:30,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 194 transitions. [2024-10-14 09:41:30,336 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 194 transitions. Word has length 169 [2024-10-14 09:41:30,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:41:30,337 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 194 transitions. [2024-10-14 09:41:30,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 09:41:30,337 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 194 transitions. [2024-10-14 09:41:30,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-14 09:41:30,340 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:41:30,340 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:41:30,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-14 09:41:30,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 09:41:30,541 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:41:30,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:41:30,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1207364638, now seen corresponding path program 1 times [2024-10-14 09:41:30,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:41:30,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1880782862] [2024-10-14 09:41:30,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:41:30,543 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 09:41:30,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:41:30,545 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 09:41:30,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 09:41:30,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:30,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 09:41:30,973 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:41:32,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 09:41:32,742 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 09:41:32,742 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 09:41:32,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1880782862] [2024-10-14 09:41:32,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1880782862] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:41:32,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:41:32,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 09:41:32,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236725243] [2024-10-14 09:41:32,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:41:32,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 09:41:32,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 09:41:32,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 09:41:32,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 09:41:32,746 INFO L87 Difference]: Start difference. First operand 126 states and 194 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 09:41:37,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 09:41:41,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 09:41:45,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 09:41:49,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 09:41:53,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 09:41:53,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:41:53,385 INFO L93 Difference]: Finished difference Result 231 states and 357 transitions. [2024-10-14 09:41:53,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 09:41:53,442 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 170 [2024-10-14 09:41:53,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:41:53,444 INFO L225 Difference]: With dead ends: 231 [2024-10-14 09:41:53,447 INFO L226 Difference]: Without dead ends: 154 [2024-10-14 09:41:53,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 09:41:53,451 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 69 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 54 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.6s IncrementalHoareTripleChecker+Time [2024-10-14 09:41:53,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 343 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 15 Invalid, 5 Unknown, 0 Unchecked, 20.6s Time] [2024-10-14 09:41:53,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-10-14 09:41:53,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 130. [2024-10-14 09:41:53,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 75 states have (on average 1.28) internal successors, (96), 75 states have internal predecessors, (96), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-14 09:41:53,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 200 transitions. [2024-10-14 09:41:53,489 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 200 transitions. Word has length 170 [2024-10-14 09:41:53,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:41:53,490 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 200 transitions. [2024-10-14 09:41:53,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 09:41:53,490 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 200 transitions. [2024-10-14 09:41:53,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-14 09:41:53,493 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:41:53,493 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:41:53,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-14 09:41:53,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 09:41:53,694 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:41:53,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:41:53,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1143127083, now seen corresponding path program 1 times [2024-10-14 09:41:53,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:41:53,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1279524010] [2024-10-14 09:41:53,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:41:53,696 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 09:41:53,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:41:53,699 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 09:41:53,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 09:41:54,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:54,137 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 09:41:54,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:41:57,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 09:41:57,977 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 09:41:57,977 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 09:41:57,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1279524010] [2024-10-14 09:41:57,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1279524010] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:41:57,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:41:57,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 09:41:57,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072638276] [2024-10-14 09:41:57,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:41:57,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 09:41:57,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 09:41:57,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 09:41:57,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 09:41:57,980 INFO L87 Difference]: Start difference. First operand 130 states and 200 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 09:42:02,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 09:42:06,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []