./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-50.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-50.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 6bd3e010bc1161b63e7109d8f2f51cd280074799234e989c902599e5e44de78e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 08:01:30,990 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 08:01:31,069 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 08:01:31,078 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 08:01:31,078 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 08:01:31,107 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 08:01:31,108 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 08:01:31,108 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 08:01:31,109 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 08:01:31,109 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 08:01:31,110 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 08:01:31,110 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 08:01:31,111 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 08:01:31,111 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 08:01:31,111 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 08:01:31,112 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 08:01:31,112 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 08:01:31,112 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 08:01:31,113 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 08:01:31,113 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 08:01:31,113 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 08:01:31,114 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 08:01:31,114 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 08:01:31,114 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 08:01:31,114 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 08:01:31,115 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 08:01:31,115 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 08:01:31,115 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 08:01:31,115 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 08:01:31,115 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 08:01:31,116 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 08:01:31,116 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 08:01:31,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:01:31,116 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 08:01:31,117 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 08:01:31,117 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 08:01:31,121 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 08:01:31,121 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 08:01:31,121 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 08:01:31,122 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 08:01:31,122 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 08:01:31,123 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 08:01:31,123 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 -> 6bd3e010bc1161b63e7109d8f2f51cd280074799234e989c902599e5e44de78e [2024-10-24 08:01:31,390 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 08:01:31,414 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 08:01:31,418 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 08:01:31,420 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 08:01:31,420 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 08:01:31,421 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-50.i [2024-10-24 08:01:32,924 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 08:01:33,116 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 08:01:33,117 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-50.i [2024-10-24 08:01:33,133 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36d41b13a/29e65b2ba1bf4023a78f99960d67b118/FLAGb5aa5b6f7 [2024-10-24 08:01:33,150 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36d41b13a/29e65b2ba1bf4023a78f99960d67b118 [2024-10-24 08:01:33,153 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 08:01:33,154 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 08:01:33,155 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 08:01:33,155 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 08:01:33,163 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 08:01:33,164 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:01:33" (1/1) ... [2024-10-24 08:01:33,165 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@358c8505 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:01:33, skipping insertion in model container [2024-10-24 08:01:33,167 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:01:33" (1/1) ... [2024-10-24 08:01:33,198 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 08:01:33,370 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-50.i[919,932] [2024-10-24 08:01:33,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:01:33,507 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 08:01:33,520 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-50.i[919,932] [2024-10-24 08:01:33,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:01:33,583 INFO L204 MainTranslator]: Completed translation [2024-10-24 08:01:33,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:01:33 WrapperNode [2024-10-24 08:01:33,583 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 08:01:33,584 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 08:01:33,585 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 08:01:33,585 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 08:01:33,593 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:01:33" (1/1) ... [2024-10-24 08:01:33,609 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:01:33" (1/1) ... [2024-10-24 08:01:33,677 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 209 [2024-10-24 08:01:33,678 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 08:01:33,679 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 08:01:33,679 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 08:01:33,680 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 08:01:33,689 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:01:33" (1/1) ... [2024-10-24 08:01:33,689 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:01:33" (1/1) ... [2024-10-24 08:01:33,693 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:01:33" (1/1) ... [2024-10-24 08:01:33,711 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-24 08:01:33,712 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:01:33" (1/1) ... [2024-10-24 08:01:33,712 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:01:33" (1/1) ... [2024-10-24 08:01:33,733 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:01:33" (1/1) ... [2024-10-24 08:01:33,741 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:01:33" (1/1) ... [2024-10-24 08:01:33,752 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:01:33" (1/1) ... [2024-10-24 08:01:33,756 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:01:33" (1/1) ... [2024-10-24 08:01:33,767 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 08:01:33,769 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 08:01:33,769 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 08:01:33,770 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 08:01:33,770 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:01:33" (1/1) ... [2024-10-24 08:01:33,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:01:33,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:01:33,803 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-24 08:01:33,806 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-24 08:01:33,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 08:01:33,855 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 08:01:33,856 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 08:01:33,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 08:01:33,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 08:01:33,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 08:01:33,961 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 08:01:33,963 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 08:01:34,373 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-24 08:01:34,373 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 08:01:34,423 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 08:01:34,424 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 08:01:34,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:01:34 BoogieIcfgContainer [2024-10-24 08:01:34,424 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 08:01:34,427 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 08:01:34,427 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 08:01:34,430 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 08:01:34,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 08:01:33" (1/3) ... [2024-10-24 08:01:34,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d4a1153 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:01:34, skipping insertion in model container [2024-10-24 08:01:34,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:01:33" (2/3) ... [2024-10-24 08:01:34,432 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d4a1153 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:01:34, skipping insertion in model container [2024-10-24 08:01:34,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:01:34" (3/3) ... [2024-10-24 08:01:34,433 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-50.i [2024-10-24 08:01:34,451 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 08:01:34,451 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 08:01:34,522 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 08:01:34,531 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;@78c5fe3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 08:01:34,531 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 08:01:34,537 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 58 states have internal predecessors, (84), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 08:01:34,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-24 08:01:34,555 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:01:34,557 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:01:34,557 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:01:34,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:01:34,563 INFO L85 PathProgramCache]: Analyzing trace with hash -899710008, now seen corresponding path program 1 times [2024-10-24 08:01:34,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:01:34,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601698461] [2024-10-24 08:01:34,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:01:34,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:01:34,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:34,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:01:34,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:34,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:01:34,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:34,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:01:34,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:34,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:01:34,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:34,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:01:34,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:34,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 08:01:34,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:34,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 08:01:34,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:34,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 08:01:34,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:34,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 08:01:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:34,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 08:01:34,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:34,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 08:01:34,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:34,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 08:01:34,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:34,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 08:01:34,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:34,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 08:01:34,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:34,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 08:01:34,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:34,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 08:01:34,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:35,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 08:01:35,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:35,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 08:01:35,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:35,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 08:01:35,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:35,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 08:01:35,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:35,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 08:01:35,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:35,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 08:01:35,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:35,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 08:01:35,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:35,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 08:01:35,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:35,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-24 08:01:35,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:01:35,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601698461] [2024-10-24 08:01:35,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601698461] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:01:35,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:01:35,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 08:01:35,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392542623] [2024-10-24 08:01:35,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:01:35,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 08:01:35,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:01:35,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 08:01:35,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:01:35,133 INFO L87 Difference]: Start difference. First operand has 84 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 58 states have internal predecessors, (84), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-24 08:01:35,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:01:35,187 INFO L93 Difference]: Finished difference Result 165 states and 286 transitions. [2024-10-24 08:01:35,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 08:01:35,194 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 160 [2024-10-24 08:01:35,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:01:35,203 INFO L225 Difference]: With dead ends: 165 [2024-10-24 08:01:35,204 INFO L226 Difference]: Without dead ends: 82 [2024-10-24 08:01:35,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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-24 08:01:35,214 INFO L432 NwaCegarLoop]: 123 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, 123 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-24 08:01:35,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 08:01:35,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-24 08:01:35,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-10-24 08:01:35,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 08:01:35,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 126 transitions. [2024-10-24 08:01:35,275 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 126 transitions. Word has length 160 [2024-10-24 08:01:35,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:01:35,275 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 126 transitions. [2024-10-24 08:01:35,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-24 08:01:35,276 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 126 transitions. [2024-10-24 08:01:35,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-24 08:01:35,280 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:01:35,280 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:01:35,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 08:01:35,281 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:01:35,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:01:35,282 INFO L85 PathProgramCache]: Analyzing trace with hash -82626420, now seen corresponding path program 1 times [2024-10-24 08:01:35,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:01:35,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991195129] [2024-10-24 08:01:35,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:01:35,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:01:35,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:35,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:01:35,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:35,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:01:35,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:35,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:01:35,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:35,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:01:35,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:35,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:01:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:35,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 08:01:35,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:35,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 08:01:35,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:35,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 08:01:35,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:35,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 08:01:35,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:35,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 08:01:35,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:35,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 08:01:35,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:35,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 08:01:35,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:35,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 08:01:35,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:35,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 08:01:35,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:35,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 08:01:35,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:35,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 08:01:35,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:35,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 08:01:35,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:35,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 08:01:35,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:35,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 08:01:35,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:35,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 08:01:35,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:35,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 08:01:35,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:35,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 08:01:35,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:35,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 08:01:35,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:35,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 08:01:35,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:35,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-24 08:01:35,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:01:35,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991195129] [2024-10-24 08:01:35,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991195129] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:01:35,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:01:35,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 08:01:35,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748276504] [2024-10-24 08:01:35,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:01:35,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 08:01:35,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:01:35,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 08:01:35,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:01:35,625 INFO L87 Difference]: Start difference. First operand 82 states and 126 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 08:01:35,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:01:35,679 INFO L93 Difference]: Finished difference Result 164 states and 253 transitions. [2024-10-24 08:01:35,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 08:01:35,681 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 160 [2024-10-24 08:01:35,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:01:35,683 INFO L225 Difference]: With dead ends: 164 [2024-10-24 08:01:35,683 INFO L226 Difference]: Without dead ends: 83 [2024-10-24 08:01:35,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 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-24 08:01:35,685 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 08:01:35,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 238 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 08:01:35,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-24 08:01:35,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-10-24 08:01:35,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 57 states have internal predecessors, (79), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 08:01:35,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 127 transitions. [2024-10-24 08:01:35,697 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 127 transitions. Word has length 160 [2024-10-24 08:01:35,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:01:35,699 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 127 transitions. [2024-10-24 08:01:35,699 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 08:01:35,699 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 127 transitions. [2024-10-24 08:01:35,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-24 08:01:35,701 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:01:35,701 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:01:35,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 08:01:35,702 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:01:35,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:01:35,702 INFO L85 PathProgramCache]: Analyzing trace with hash -510003291, now seen corresponding path program 1 times [2024-10-24 08:01:35,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:01:35,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298855961] [2024-10-24 08:01:35,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:01:35,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:01:35,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:35,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:01:35,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:35,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:01:35,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:35,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:01:35,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:35,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:01:35,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:35,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:01:35,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:35,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 08:01:36,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:36,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 08:01:36,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:36,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 08:01:36,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:36,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 08:01:36,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:36,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 08:01:36,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:36,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 08:01:36,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:36,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 08:01:36,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:36,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 08:01:36,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:36,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 08:01:36,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:36,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 08:01:36,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:36,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 08:01:36,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:36,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 08:01:36,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:36,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 08:01:36,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:36,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 08:01:36,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:36,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 08:01:36,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:36,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 08:01:36,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:36,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 08:01:36,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:36,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 08:01:36,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:36,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 08:01:36,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:36,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-24 08:01:36,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:01:36,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298855961] [2024-10-24 08:01:36,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298855961] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:01:36,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:01:36,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 08:01:36,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886225447] [2024-10-24 08:01:36,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:01:36,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 08:01:36,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:01:36,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 08:01:36,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 08:01:36,076 INFO L87 Difference]: Start difference. First operand 83 states and 127 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 08:01:36,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:01:36,301 INFO L93 Difference]: Finished difference Result 165 states and 253 transitions. [2024-10-24 08:01:36,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 08:01:36,304 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2024-10-24 08:01:36,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:01:36,310 INFO L225 Difference]: With dead ends: 165 [2024-10-24 08:01:36,312 INFO L226 Difference]: Without dead ends: 83 [2024-10-24 08:01:36,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 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-24 08:01:36,315 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 119 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 08:01:36,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 180 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 08:01:36,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-24 08:01:36,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-10-24 08:01:36,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 57 states have (on average 1.368421052631579) internal successors, (78), 57 states have internal predecessors, (78), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 08:01:36,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 126 transitions. [2024-10-24 08:01:36,338 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 126 transitions. Word has length 161 [2024-10-24 08:01:36,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:01:36,339 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 126 transitions. [2024-10-24 08:01:36,339 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 08:01:36,339 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 126 transitions. [2024-10-24 08:01:36,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-24 08:01:36,344 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:01:36,344 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:01:36,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 08:01:36,345 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:01:36,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:01:36,348 INFO L85 PathProgramCache]: Analyzing trace with hash -452744989, now seen corresponding path program 1 times [2024-10-24 08:01:36,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:01:36,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232335404] [2024-10-24 08:01:36,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:01:36,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:01:36,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:36,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:01:36,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:36,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:01:36,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:36,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:01:36,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:36,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:01:36,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:36,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:01:36,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:36,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 08:01:36,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:36,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 08:01:36,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:36,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 08:01:36,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:36,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 08:01:36,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:36,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 08:01:36,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:36,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 08:01:36,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:36,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 08:01:36,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:36,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 08:01:36,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:36,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 08:01:36,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:36,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 08:01:36,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:36,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 08:01:36,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:36,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 08:01:36,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:36,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 08:01:36,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:36,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 08:01:36,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:36,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 08:01:36,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:36,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 08:01:36,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:36,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 08:01:36,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:36,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 08:01:36,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:36,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 08:01:36,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:36,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-24 08:01:36,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:01:36,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232335404] [2024-10-24 08:01:36,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232335404] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:01:36,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:01:36,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 08:01:36,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119809832] [2024-10-24 08:01:36,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:01:36,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 08:01:36,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:01:36,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 08:01:36,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 08:01:36,853 INFO L87 Difference]: Start difference. First operand 83 states and 126 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 08:01:36,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:01:36,909 INFO L93 Difference]: Finished difference Result 235 states and 361 transitions. [2024-10-24 08:01:36,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 08:01:36,910 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2024-10-24 08:01:36,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:01:36,912 INFO L225 Difference]: With dead ends: 235 [2024-10-24 08:01:36,914 INFO L226 Difference]: Without dead ends: 153 [2024-10-24 08:01:36,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 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-24 08:01:36,917 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 60 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 08:01:36,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 351 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 08:01:36,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-10-24 08:01:36,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 141. [2024-10-24 08:01:36,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 90 states have internal predecessors, (120), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-24 08:01:36,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 216 transitions. [2024-10-24 08:01:36,956 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 216 transitions. Word has length 161 [2024-10-24 08:01:36,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:01:36,956 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 216 transitions. [2024-10-24 08:01:36,957 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 08:01:36,957 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 216 transitions. [2024-10-24 08:01:36,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-24 08:01:36,959 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:01:36,959 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:01:36,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 08:01:36,959 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:01:36,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:01:36,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1718376790, now seen corresponding path program 1 times [2024-10-24 08:01:36,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:01:36,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547286652] [2024-10-24 08:01:36,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:01:36,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:01:36,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:37,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:01:37,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:37,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:01:37,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:37,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:01:37,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:37,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:01:37,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:37,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:01:37,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:37,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 08:01:37,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:37,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 08:01:37,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:37,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 08:01:37,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:37,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 08:01:37,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:37,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 08:01:37,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:37,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 08:01:37,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:37,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 08:01:37,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:37,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 08:01:37,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:37,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 08:01:37,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:37,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 08:01:37,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:37,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 08:01:37,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:37,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 08:01:37,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:37,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 08:01:37,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:37,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 08:01:37,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:37,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 08:01:37,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:37,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 08:01:37,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:37,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 08:01:37,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:37,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 08:01:37,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:37,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 08:01:37,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:37,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-24 08:01:37,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:01:37,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547286652] [2024-10-24 08:01:37,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547286652] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:01:37,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:01:37,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 08:01:37,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566742327] [2024-10-24 08:01:37,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:01:37,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 08:01:37,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:01:37,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 08:01:37,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 08:01:37,237 INFO L87 Difference]: Start difference. First operand 141 states and 216 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 08:01:37,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:01:37,289 INFO L93 Difference]: Finished difference Result 225 states and 344 transitions. [2024-10-24 08:01:37,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 08:01:37,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2024-10-24 08:01:37,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:01:37,293 INFO L225 Difference]: With dead ends: 225 [2024-10-24 08:01:37,295 INFO L226 Difference]: Without dead ends: 143 [2024-10-24 08:01:37,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 08:01:37,297 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 08:01:37,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 350 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 08:01:37,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-10-24 08:01:37,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2024-10-24 08:01:37,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 91 states have (on average 1.3296703296703296) internal successors, (121), 91 states have internal predecessors, (121), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-24 08:01:37,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 217 transitions. [2024-10-24 08:01:37,326 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 217 transitions. Word has length 162 [2024-10-24 08:01:37,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:01:37,327 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 217 transitions. [2024-10-24 08:01:37,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 08:01:37,327 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 217 transitions. [2024-10-24 08:01:37,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-24 08:01:37,331 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:01:37,333 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:01:37,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 08:01:37,333 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:01:37,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:01:37,334 INFO L85 PathProgramCache]: Analyzing trace with hash 2063739607, now seen corresponding path program 1 times [2024-10-24 08:01:37,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:01:37,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297101812] [2024-10-24 08:01:37,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:01:37,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:01:37,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:37,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:01:37,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:37,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:01:37,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:37,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:01:37,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:37,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:01:37,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:37,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:01:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:37,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 08:01:37,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:37,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 08:01:37,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:37,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 08:01:37,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:37,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 08:01:37,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:37,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 08:01:37,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:37,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 08:01:37,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:37,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 08:01:37,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:37,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 08:01:37,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:37,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 08:01:37,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:37,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 08:01:37,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:37,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 08:01:37,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:37,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 08:01:37,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:37,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 08:01:37,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:37,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 08:01:37,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:37,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 08:01:37,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:37,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 08:01:37,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:37,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 08:01:37,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:37,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 08:01:37,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:37,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 08:01:37,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:37,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-10-24 08:01:37,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:01:37,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297101812] [2024-10-24 08:01:37,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297101812] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 08:01:37,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245570159] [2024-10-24 08:01:37,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:01:37,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 08:01:37,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:01:37,814 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-24 08:01:37,816 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-24 08:01:37,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:37,971 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 08:01:37,983 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:01:38,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 23 proven. 69 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 08:01:38,328 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 08:01:38,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-10-24 08:01:38,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245570159] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 08:01:38,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 08:01:38,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-24 08:01:38,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571536886] [2024-10-24 08:01:38,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 08:01:38,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 08:01:38,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:01:38,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 08:01:38,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 08:01:38,621 INFO L87 Difference]: Start difference. First operand 142 states and 217 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2024-10-24 08:01:38,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:01:38,847 INFO L93 Difference]: Finished difference Result 250 states and 374 transitions. [2024-10-24 08:01:38,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 08:01:38,848 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) Word has length 163 [2024-10-24 08:01:38,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:01:38,851 INFO L225 Difference]: With dead ends: 250 [2024-10-24 08:01:38,851 INFO L226 Difference]: Without dead ends: 154 [2024-10-24 08:01:38,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 370 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-24 08:01:38,852 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 113 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 08:01:38,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 227 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 08:01:38,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-10-24 08:01:38,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 150. [2024-10-24 08:01:38,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 97 states have (on average 1.288659793814433) internal successors, (125), 97 states have internal predecessors, (125), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-24 08:01:38,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 221 transitions. [2024-10-24 08:01:38,889 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 221 transitions. Word has length 163 [2024-10-24 08:01:38,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:01:38,889 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 221 transitions. [2024-10-24 08:01:38,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2024-10-24 08:01:38,890 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 221 transitions. [2024-10-24 08:01:38,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-24 08:01:38,892 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:01:38,892 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:01:38,907 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-24 08:01:39,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-24 08:01:39,093 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:01:39,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:01:39,094 INFO L85 PathProgramCache]: Analyzing trace with hash 2125779221, now seen corresponding path program 1 times [2024-10-24 08:01:39,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:01:39,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995639198] [2024-10-24 08:01:39,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:01:39,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:01:39,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:39,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:01:39,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:39,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:01:39,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:39,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:01:39,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:39,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:01:39,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:39,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:01:39,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:39,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 08:01:39,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:39,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 08:01:39,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:39,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 08:01:39,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:39,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 08:01:39,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:39,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 08:01:39,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:39,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 08:01:39,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:39,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 08:01:39,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:39,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 08:01:39,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:39,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 08:01:39,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:39,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 08:01:39,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:39,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 08:01:39,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:39,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 08:01:39,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:39,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 08:01:39,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:39,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 08:01:39,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:39,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 08:01:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:39,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 08:01:39,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:39,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 08:01:39,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:39,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 08:01:39,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:39,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 08:01:39,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:39,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 21 proven. 48 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-10-24 08:01:39,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:01:39,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995639198] [2024-10-24 08:01:39,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995639198] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 08:01:39,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549935673] [2024-10-24 08:01:39,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:01:39,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 08:01:39,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:01:39,591 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-24 08:01:39,592 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-24 08:01:39,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:39,733 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-24 08:01:39,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:01:40,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 503 proven. 90 refuted. 0 times theorem prover too weak. 511 trivial. 0 not checked. [2024-10-24 08:01:40,140 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 08:01:40,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 42 proven. 93 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-10-24 08:01:40,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549935673] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 08:01:40,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 08:01:40,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 16 [2024-10-24 08:01:40,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961170169] [2024-10-24 08:01:40,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 08:01:40,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-24 08:01:40,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:01:40,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 08:01:40,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2024-10-24 08:01:40,501 INFO L87 Difference]: Start difference. First operand 150 states and 221 transitions. Second operand has 16 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 7 states have call successors, (57), 3 states have call predecessors, (57), 6 states have return successors, (58), 6 states have call predecessors, (58), 7 states have call successors, (58) [2024-10-24 08:01:40,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:01:40,863 INFO L93 Difference]: Finished difference Result 266 states and 380 transitions. [2024-10-24 08:01:40,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 08:01:40,864 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 7 states have call successors, (57), 3 states have call predecessors, (57), 6 states have return successors, (58), 6 states have call predecessors, (58), 7 states have call successors, (58) Word has length 163 [2024-10-24 08:01:40,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:01:40,866 INFO L225 Difference]: With dead ends: 266 [2024-10-24 08:01:40,866 INFO L226 Difference]: Without dead ends: 170 [2024-10-24 08:01:40,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=176, Invalid=330, Unknown=0, NotChecked=0, Total=506 [2024-10-24 08:01:40,868 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 240 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 08:01:40,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 250 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 08:01:40,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-10-24 08:01:40,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 166. [2024-10-24 08:01:40,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 109 states have (on average 1.2110091743119267) internal successors, (132), 109 states have internal predecessors, (132), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-24 08:01:40,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 228 transitions. [2024-10-24 08:01:40,896 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 228 transitions. Word has length 163 [2024-10-24 08:01:40,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:01:40,898 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 228 transitions. [2024-10-24 08:01:40,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 7 states have call successors, (57), 3 states have call predecessors, (57), 6 states have return successors, (58), 6 states have call predecessors, (58), 7 states have call successors, (58) [2024-10-24 08:01:40,898 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 228 transitions. [2024-10-24 08:01:40,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-24 08:01:40,899 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:01:40,900 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:01:40,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 08:01:41,100 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,SelfDestructingSolverStorable6 [2024-10-24 08:01:41,101 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:01:41,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:01:41,101 INFO L85 PathProgramCache]: Analyzing trace with hash -710781767, now seen corresponding path program 1 times [2024-10-24 08:01:41,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:01:41,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367723223] [2024-10-24 08:01:41,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:01:41,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:01:41,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:41,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:01:41,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:41,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:01:41,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:41,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:01:41,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:41,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:01:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:41,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:01:41,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:41,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 08:01:41,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:41,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 08:01:41,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:41,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 08:01:41,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:41,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 08:01:41,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:41,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 08:01:41,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:41,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 08:01:41,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:41,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 08:01:41,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:41,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 08:01:41,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:41,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 08:01:41,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:41,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 08:01:41,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:41,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 08:01:41,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:41,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 08:01:41,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:41,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 08:01:41,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:41,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 08:01:41,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:41,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 08:01:41,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:41,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 08:01:41,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:41,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 08:01:41,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:41,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 08:01:41,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:41,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 08:01:41,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:41,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-24 08:01:41,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:01:41,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367723223] [2024-10-24 08:01:41,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367723223] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:01:41,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:01:41,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 08:01:41,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225093628] [2024-10-24 08:01:41,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:01:41,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 08:01:41,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:01:41,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 08:01:41,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 08:01:41,756 INFO L87 Difference]: Start difference. First operand 166 states and 228 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-24 08:01:42,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:01:42,128 INFO L93 Difference]: Finished difference Result 282 states and 390 transitions. [2024-10-24 08:01:42,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 08:01:42,129 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 164 [2024-10-24 08:01:42,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:01:42,130 INFO L225 Difference]: With dead ends: 282 [2024-10-24 08:01:42,131 INFO L226 Difference]: Without dead ends: 181 [2024-10-24 08:01:42,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-24 08:01:42,132 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 98 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 08:01:42,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 421 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 08:01:42,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-24 08:01:42,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 168. [2024-10-24 08:01:42,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 111 states have (on average 1.2162162162162162) internal successors, (135), 111 states have internal predecessors, (135), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-24 08:01:42,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 231 transitions. [2024-10-24 08:01:42,172 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 231 transitions. Word has length 164 [2024-10-24 08:01:42,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:01:42,175 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 231 transitions. [2024-10-24 08:01:42,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-24 08:01:42,175 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 231 transitions. [2024-10-24 08:01:42,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-24 08:01:42,177 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:01:42,177 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:01:42,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 08:01:42,177 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:01:42,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:01:42,178 INFO L85 PathProgramCache]: Analyzing trace with hash -491927049, now seen corresponding path program 1 times [2024-10-24 08:01:42,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:01:42,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345343937] [2024-10-24 08:01:42,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:01:42,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:01:42,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:42,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:01:42,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:42,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:01:42,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:42,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:01:42,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:42,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:01:42,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:42,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:01:42,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:42,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 08:01:42,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:42,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 08:01:42,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:42,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 08:01:42,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:42,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 08:01:42,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:42,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 08:01:42,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:42,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 08:01:42,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:42,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 08:01:42,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:42,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 08:01:42,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:42,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 08:01:42,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:42,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 08:01:42,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:42,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 08:01:42,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:42,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 08:01:42,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:42,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 08:01:42,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:42,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 08:01:42,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:42,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 08:01:42,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:42,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 08:01:42,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:42,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 08:01:42,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:42,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 08:01:42,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:42,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 08:01:42,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:42,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-24 08:01:42,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:01:42,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345343937] [2024-10-24 08:01:42,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345343937] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:01:42,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:01:42,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 08:01:42,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57218862] [2024-10-24 08:01:42,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:01:42,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 08:01:42,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:01:42,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 08:01:42,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-24 08:01:42,764 INFO L87 Difference]: Start difference. First operand 168 states and 231 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-24 08:01:43,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:01:43,920 INFO L93 Difference]: Finished difference Result 720 states and 972 transitions. [2024-10-24 08:01:43,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 08:01:43,920 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 164 [2024-10-24 08:01:43,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:01:43,924 INFO L225 Difference]: With dead ends: 720 [2024-10-24 08:01:43,925 INFO L226 Difference]: Without dead ends: 625 [2024-10-24 08:01:43,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2024-10-24 08:01:43,927 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 846 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 287 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 846 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 287 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 08:01:43,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [846 Valid, 884 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [287 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 08:01:43,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2024-10-24 08:01:44,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 522. [2024-10-24 08:01:44,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 376 states have (on average 1.2632978723404256) internal successors, (475), 380 states have internal predecessors, (475), 118 states have call successors, (118), 27 states have call predecessors, (118), 27 states have return successors, (118), 114 states have call predecessors, (118), 118 states have call successors, (118) [2024-10-24 08:01:44,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 711 transitions. [2024-10-24 08:01:44,014 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 711 transitions. Word has length 164 [2024-10-24 08:01:44,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:01:44,015 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 711 transitions. [2024-10-24 08:01:44,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-24 08:01:44,015 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 711 transitions. [2024-10-24 08:01:44,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-24 08:01:44,018 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:01:44,018 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:01:44,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 08:01:44,019 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:01:44,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:01:44,019 INFO L85 PathProgramCache]: Analyzing trace with hash -233761611, now seen corresponding path program 1 times [2024-10-24 08:01:44,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:01:44,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676314755] [2024-10-24 08:01:44,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:01:44,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:01:44,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:44,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:01:44,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:44,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:01:44,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:44,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:01:44,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:44,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:01:44,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:44,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:01:44,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:44,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 08:01:44,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:44,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 08:01:44,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:44,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 08:01:44,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:44,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 08:01:44,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:44,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 08:01:44,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:44,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 08:01:44,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:44,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 08:01:44,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:44,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 08:01:44,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:44,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 08:01:44,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:44,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 08:01:44,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:44,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 08:01:44,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:44,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 08:01:44,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:44,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 08:01:44,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:44,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 08:01:44,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:44,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 08:01:44,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:44,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 08:01:44,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:44,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 08:01:44,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:44,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 08:01:44,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:44,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 08:01:44,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:44,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-24 08:01:44,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:01:44,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676314755] [2024-10-24 08:01:44,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676314755] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:01:44,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:01:44,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 08:01:44,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190401198] [2024-10-24 08:01:44,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:01:44,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 08:01:44,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:01:44,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 08:01:44,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:01:44,168 INFO L87 Difference]: Start difference. First operand 522 states and 711 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 08:01:44,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:01:44,257 INFO L93 Difference]: Finished difference Result 1039 states and 1403 transitions. [2024-10-24 08:01:44,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 08:01:44,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 164 [2024-10-24 08:01:44,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:01:44,265 INFO L225 Difference]: With dead ends: 1039 [2024-10-24 08:01:44,265 INFO L226 Difference]: Without dead ends: 608 [2024-10-24 08:01:44,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 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-24 08:01:44,267 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 29 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 08:01:44,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 231 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 08:01:44,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2024-10-24 08:01:44,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 600. [2024-10-24 08:01:44,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 441 states have (on average 1.2585034013605443) internal successors, (555), 448 states have internal predecessors, (555), 124 states have call successors, (124), 34 states have call predecessors, (124), 34 states have return successors, (124), 117 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-24 08:01:44,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 803 transitions. [2024-10-24 08:01:44,378 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 803 transitions. Word has length 164 [2024-10-24 08:01:44,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:01:44,379 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 803 transitions. [2024-10-24 08:01:44,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 08:01:44,379 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 803 transitions. [2024-10-24 08:01:44,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-24 08:01:44,381 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:01:44,382 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:01:44,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 08:01:44,382 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:01:44,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:01:44,383 INFO L85 PathProgramCache]: Analyzing trace with hash -820567625, now seen corresponding path program 1 times [2024-10-24 08:01:44,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:01:44,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636235956] [2024-10-24 08:01:44,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:01:44,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:01:44,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:53,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:01:53,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:53,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:01:53,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:53,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:01:53,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:53,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:01:53,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:53,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:01:53,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:53,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 08:01:53,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:53,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 08:01:53,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:53,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 08:01:53,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:53,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 08:01:53,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:53,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 08:01:53,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:53,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 08:01:53,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:53,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 08:01:53,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:53,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 08:01:53,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:53,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 08:01:53,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:53,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 08:01:53,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:53,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 08:01:53,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:53,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 08:01:53,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:53,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 08:01:53,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:53,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 08:01:53,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:53,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 08:01:53,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:53,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 08:01:53,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:53,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 08:01:53,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:53,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 08:01:53,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:53,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 08:01:53,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:53,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-24 08:01:53,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:01:53,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636235956] [2024-10-24 08:01:53,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636235956] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:01:53,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:01:53,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-24 08:01:53,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300605420] [2024-10-24 08:01:53,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:01:53,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-24 08:01:53,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:01:53,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 08:01:53,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-10-24 08:01:53,517 INFO L87 Difference]: Start difference. First operand 600 states and 803 transitions. Second operand has 16 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-24 08:01:56,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:01:56,368 INFO L93 Difference]: Finished difference Result 1201 states and 1608 transitions. [2024-10-24 08:01:56,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-24 08:01:56,369 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 164 [2024-10-24 08:01:56,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:01:56,375 INFO L225 Difference]: With dead ends: 1201 [2024-10-24 08:01:56,375 INFO L226 Difference]: Without dead ends: 696 [2024-10-24 08:01:56,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2024-10-24 08:01:56,378 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 352 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 08:01:56,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 659 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 851 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 08:01:56,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2024-10-24 08:01:56,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 632. [2024-10-24 08:01:56,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 473 states have (on average 1.2536997885835095) internal successors, (593), 480 states have internal predecessors, (593), 124 states have call successors, (124), 34 states have call predecessors, (124), 34 states have return successors, (124), 117 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-24 08:01:56,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 841 transitions. [2024-10-24 08:01:56,447 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 841 transitions. Word has length 164 [2024-10-24 08:01:56,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:01:56,448 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 841 transitions. [2024-10-24 08:01:56,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-24 08:01:56,448 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 841 transitions. [2024-10-24 08:01:56,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-24 08:01:56,450 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:01:56,450 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:01:56,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 08:01:56,452 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:01:56,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:01:56,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1629914251, now seen corresponding path program 1 times [2024-10-24 08:01:56,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:01:56,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610581675] [2024-10-24 08:01:56,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:01:56,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:01:56,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:56,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:01:56,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:56,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:01:56,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:56,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:01:56,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:56,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:01:56,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:56,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:01:56,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:56,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 08:01:56,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:56,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 08:01:56,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:56,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 08:01:56,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:56,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 08:01:56,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:56,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 08:01:56,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:56,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 08:01:56,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:56,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 08:01:56,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:56,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 08:01:56,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:56,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 08:01:56,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:56,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 08:01:56,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:56,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 08:01:56,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:56,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 08:01:56,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:56,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 08:01:56,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:56,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 08:01:56,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:56,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 08:01:56,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:56,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 08:01:56,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:56,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 08:01:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:56,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 08:01:56,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:56,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 08:01:56,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:56,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-24 08:01:56,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:01:56,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610581675] [2024-10-24 08:01:56,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610581675] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:01:56,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:01:56,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 08:01:56,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798882326] [2024-10-24 08:01:56,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:01:56,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 08:01:56,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:01:56,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 08:01:56,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 08:01:56,857 INFO L87 Difference]: Start difference. First operand 632 states and 841 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 08:01:56,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:01:56,997 INFO L93 Difference]: Finished difference Result 1278 states and 1693 transitions. [2024-10-24 08:01:56,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 08:01:56,997 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 164 [2024-10-24 08:01:56,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:01:57,002 INFO L225 Difference]: With dead ends: 1278 [2024-10-24 08:01:57,003 INFO L226 Difference]: Without dead ends: 773 [2024-10-24 08:01:57,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 08:01:57,005 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 135 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 08:01:57,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 470 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 08:01:57,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2024-10-24 08:01:57,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 685. [2024-10-24 08:01:57,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 516 states have (on average 1.2422480620155039) internal successors, (641), 524 states have internal predecessors, (641), 131 states have call successors, (131), 37 states have call predecessors, (131), 37 states have return successors, (131), 123 states have call predecessors, (131), 131 states have call successors, (131) [2024-10-24 08:01:57,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 903 transitions. [2024-10-24 08:01:57,066 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 903 transitions. Word has length 164 [2024-10-24 08:01:57,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:01:57,067 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 903 transitions. [2024-10-24 08:01:57,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 08:01:57,068 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 903 transitions. [2024-10-24 08:01:57,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-24 08:01:57,069 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:01:57,070 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:01:57,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 08:01:57,070 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:01:57,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:01:57,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1914799012, now seen corresponding path program 1 times [2024-10-24 08:01:57,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:01:57,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674599817] [2024-10-24 08:01:57,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:01:57,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:01:57,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:57,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:01:57,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:57,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:01:57,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:57,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:01:57,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:57,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:01:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:57,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:01:57,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:57,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 08:01:57,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:57,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 08:01:57,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:57,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 08:01:57,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:57,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 08:01:57,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:57,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 08:01:57,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:57,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 08:01:57,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:57,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 08:01:57,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:57,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 08:01:57,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:57,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 08:01:57,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:57,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 08:01:57,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:57,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 08:01:57,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:57,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 08:01:57,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:57,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 08:01:57,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:57,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 08:01:57,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:57,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 08:01:57,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:57,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 08:01:57,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:57,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 08:01:57,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:57,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 08:01:57,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:57,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 08:01:57,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:57,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 21 proven. 48 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-10-24 08:01:57,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:01:57,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674599817] [2024-10-24 08:01:57,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674599817] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 08:01:57,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010282648] [2024-10-24 08:01:57,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:01:57,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 08:01:57,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:01:57,542 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-24 08:01:57,543 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-24 08:01:57,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:01:57,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-24 08:01:57,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:01:58,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 509 proven. 126 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2024-10-24 08:01:58,353 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 08:01:58,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 42 proven. 93 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-10-24 08:01:58,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010282648] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 08:01:58,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 08:01:58,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 9] total 23 [2024-10-24 08:01:58,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063484509] [2024-10-24 08:01:58,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 08:01:58,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-24 08:01:58,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:01:58,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-24 08:01:58,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=350, Unknown=0, NotChecked=0, Total=506 [2024-10-24 08:01:58,939 INFO L87 Difference]: Start difference. First operand 685 states and 903 transitions. Second operand has 23 states, 21 states have (on average 5.428571428571429) internal successors, (114), 21 states have internal predecessors, (114), 9 states have call successors, (72), 4 states have call predecessors, (72), 9 states have return successors, (72), 8 states have call predecessors, (72), 9 states have call successors, (72) [2024-10-24 08:01:59,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:01:59,844 INFO L93 Difference]: Finished difference Result 880 states and 1160 transitions. [2024-10-24 08:01:59,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-24 08:01:59,845 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 5.428571428571429) internal successors, (114), 21 states have internal predecessors, (114), 9 states have call successors, (72), 4 states have call predecessors, (72), 9 states have return successors, (72), 8 states have call predecessors, (72), 9 states have call successors, (72) Word has length 165 [2024-10-24 08:01:59,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:01:59,848 INFO L225 Difference]: With dead ends: 880 [2024-10-24 08:01:59,848 INFO L226 Difference]: Without dead ends: 274 [2024-10-24 08:01:59,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=445, Invalid=1037, Unknown=0, NotChecked=0, Total=1482 [2024-10-24 08:01:59,850 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 400 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 08:01:59,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 521 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 08:01:59,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-10-24 08:01:59,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 267. [2024-10-24 08:01:59,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 191 states have (on average 1.225130890052356) internal successors, (234), 194 states have internal predecessors, (234), 59 states have call successors, (59), 16 states have call predecessors, (59), 16 states have return successors, (59), 56 states have call predecessors, (59), 59 states have call successors, (59) [2024-10-24 08:01:59,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 352 transitions. [2024-10-24 08:01:59,882 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 352 transitions. Word has length 165 [2024-10-24 08:01:59,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:01:59,882 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 352 transitions. [2024-10-24 08:01:59,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 5.428571428571429) internal successors, (114), 21 states have internal predecessors, (114), 9 states have call successors, (72), 4 states have call predecessors, (72), 9 states have return successors, (72), 8 states have call predecessors, (72), 9 states have call successors, (72) [2024-10-24 08:01:59,883 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 352 transitions. [2024-10-24 08:01:59,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-24 08:01:59,884 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:01:59,884 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:01:59,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 08:02:00,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 08:02:00,086 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:02:00,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:02:00,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1349120562, now seen corresponding path program 1 times [2024-10-24 08:02:00,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:02:00,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841073239] [2024-10-24 08:02:00,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:02:00,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:02:00,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:00,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:02:00,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:00,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:02:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:00,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:02:00,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:00,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:02:00,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:00,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:02:00,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:00,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 08:02:00,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:00,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 08:02:00,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:00,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 08:02:00,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:00,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 08:02:00,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:00,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 08:02:00,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:00,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 08:02:00,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:00,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 08:02:00,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:00,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 08:02:00,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:00,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 08:02:00,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:00,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 08:02:00,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:00,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 08:02:00,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:00,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 08:02:00,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:00,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 08:02:00,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:00,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 08:02:00,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:00,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 08:02:00,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:00,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 08:02:00,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:00,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 08:02:00,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:00,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 08:02:00,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:00,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 08:02:00,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:00,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-24 08:02:00,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:02:00,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841073239] [2024-10-24 08:02:00,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841073239] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:02:00,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:02:00,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 08:02:00,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867175152] [2024-10-24 08:02:00,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:02:00,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 08:02:00,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:02:00,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 08:02:00,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-24 08:02:00,541 INFO L87 Difference]: Start difference. First operand 267 states and 352 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 08:02:01,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:02:01,409 INFO L93 Difference]: Finished difference Result 953 states and 1248 transitions. [2024-10-24 08:02:01,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 08:02:01,410 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 165 [2024-10-24 08:02:01,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:02:01,414 INFO L225 Difference]: With dead ends: 953 [2024-10-24 08:02:01,415 INFO L226 Difference]: Without dead ends: 805 [2024-10-24 08:02:01,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2024-10-24 08:02:01,418 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 534 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 08:02:01,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 802 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 08:02:01,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2024-10-24 08:02:01,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 514. [2024-10-24 08:02:01,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 365 states have (on average 1.2136986301369863) internal successors, (443), 370 states have internal predecessors, (443), 115 states have call successors, (115), 33 states have call predecessors, (115), 33 states have return successors, (115), 110 states have call predecessors, (115), 115 states have call successors, (115) [2024-10-24 08:02:01,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 673 transitions. [2024-10-24 08:02:01,506 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 673 transitions. Word has length 165 [2024-10-24 08:02:01,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:02:01,507 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 673 transitions. [2024-10-24 08:02:01,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 08:02:01,507 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 673 transitions. [2024-10-24 08:02:01,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-24 08:02:01,509 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:02:01,509 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:02:01,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 08:02:01,509 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:02:01,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:02:01,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1020479986, now seen corresponding path program 1 times [2024-10-24 08:02:01,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:02:01,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946209483] [2024-10-24 08:02:01,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:02:01,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:02:01,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:06,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:02:06,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:06,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:02:06,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:06,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:02:06,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:06,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:02:06,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:06,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:02:06,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:06,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 08:02:06,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:06,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 08:02:06,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:06,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 08:02:06,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:06,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 08:02:06,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:06,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 08:02:06,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:06,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 08:02:06,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:06,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 08:02:06,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:06,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 08:02:06,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:06,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 08:02:06,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:06,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 08:02:06,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:06,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 08:02:06,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:06,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 08:02:06,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:06,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 08:02:06,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:06,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 08:02:06,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:06,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 08:02:06,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:06,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 08:02:06,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:06,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 08:02:06,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:06,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 08:02:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:06,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 08:02:06,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:06,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-24 08:02:06,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:02:06,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946209483] [2024-10-24 08:02:06,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946209483] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:02:06,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:02:06,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-24 08:02:06,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857267443] [2024-10-24 08:02:06,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:02:06,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 08:02:06,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:02:06,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 08:02:06,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2024-10-24 08:02:06,444 INFO L87 Difference]: Start difference. First operand 514 states and 673 transitions. Second operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 08:02:09,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:02:09,154 INFO L93 Difference]: Finished difference Result 1144 states and 1502 transitions. [2024-10-24 08:02:09,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 08:02:09,155 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 165 [2024-10-24 08:02:09,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:02:09,161 INFO L225 Difference]: With dead ends: 1144 [2024-10-24 08:02:09,161 INFO L226 Difference]: Without dead ends: 723 [2024-10-24 08:02:09,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600 [2024-10-24 08:02:09,164 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 169 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 08:02:09,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 699 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 08:02:09,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2024-10-24 08:02:09,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 701. [2024-10-24 08:02:09,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 502 states have (on average 1.2131474103585658) internal successors, (609), 508 states have internal predecessors, (609), 155 states have call successors, (155), 43 states have call predecessors, (155), 43 states have return successors, (155), 149 states have call predecessors, (155), 155 states have call successors, (155) [2024-10-24 08:02:09,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 919 transitions. [2024-10-24 08:02:09,259 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 919 transitions. Word has length 165 [2024-10-24 08:02:09,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:02:09,260 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 919 transitions. [2024-10-24 08:02:09,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 08:02:09,260 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 919 transitions. [2024-10-24 08:02:09,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-24 08:02:09,262 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:02:09,262 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:02:09,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 08:02:09,262 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:02:09,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:02:09,262 INFO L85 PathProgramCache]: Analyzing trace with hash 211133360, now seen corresponding path program 1 times [2024-10-24 08:02:09,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:02:09,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423648092] [2024-10-24 08:02:09,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:02:09,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:02:09,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:13,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:02:13,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:13,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:02:13,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:13,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:02:13,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:13,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:02:13,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:13,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:02:13,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:13,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 08:02:13,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:13,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 08:02:13,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:13,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 08:02:13,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:13,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 08:02:13,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:13,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 08:02:13,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:13,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 08:02:13,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:13,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 08:02:13,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:13,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 08:02:13,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:13,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 08:02:13,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:13,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 08:02:13,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:13,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 08:02:13,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:13,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 08:02:13,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:13,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 08:02:13,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:13,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 08:02:13,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:13,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 08:02:13,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:13,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 08:02:13,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:13,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 08:02:13,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:13,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 08:02:13,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:13,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 08:02:13,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:13,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-24 08:02:13,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:02:13,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423648092] [2024-10-24 08:02:13,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423648092] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:02:13,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:02:13,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-24 08:02:13,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800318622] [2024-10-24 08:02:13,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:02:13,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 08:02:13,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:02:13,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 08:02:13,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-10-24 08:02:13,766 INFO L87 Difference]: Start difference. First operand 701 states and 919 transitions. Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 08:02:17,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:02:17,629 INFO L93 Difference]: Finished difference Result 1398 states and 1832 transitions. [2024-10-24 08:02:17,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 08:02:17,630 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 165 [2024-10-24 08:02:17,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:02:17,636 INFO L225 Difference]: With dead ends: 1398 [2024-10-24 08:02:17,636 INFO L226 Difference]: Without dead ends: 825 [2024-10-24 08:02:17,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2024-10-24 08:02:17,639 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 232 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-24 08:02:17,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 716 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-24 08:02:17,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2024-10-24 08:02:17,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 737. [2024-10-24 08:02:17,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 538 states have (on average 1.2063197026022305) internal successors, (649), 544 states have internal predecessors, (649), 155 states have call successors, (155), 43 states have call predecessors, (155), 43 states have return successors, (155), 149 states have call predecessors, (155), 155 states have call successors, (155) [2024-10-24 08:02:17,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 959 transitions. [2024-10-24 08:02:17,735 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 959 transitions. Word has length 165 [2024-10-24 08:02:17,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:02:17,736 INFO L471 AbstractCegarLoop]: Abstraction has 737 states and 959 transitions. [2024-10-24 08:02:17,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 08:02:17,736 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 959 transitions. [2024-10-24 08:02:17,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-24 08:02:17,738 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:02:17,738 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:02:17,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 08:02:17,738 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:02:17,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:02:17,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1142267191, now seen corresponding path program 1 times [2024-10-24 08:02:17,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:02:17,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415012979] [2024-10-24 08:02:17,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:02:17,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:02:17,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 08:02:17,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [24434373] [2024-10-24 08:02:17,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:02:17,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 08:02:17,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:02:17,840 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-24 08:02:17,841 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-24 08:02:18,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 08:02:18,086 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 08:02:18,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 08:02:18,370 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 08:02:18,370 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 08:02:18,371 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 08:02:18,384 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-24 08:02:18,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-24 08:02:18,581 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:02:18,713 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 08:02:18,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 08:02:18 BoogieIcfgContainer [2024-10-24 08:02:18,716 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 08:02:18,716 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 08:02:18,717 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 08:02:18,717 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 08:02:18,718 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:01:34" (3/4) ... [2024-10-24 08:02:18,720 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 08:02:18,721 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 08:02:18,721 INFO L158 Benchmark]: Toolchain (without parser) took 45567.54ms. Allocated memory was 163.6MB in the beginning and 629.1MB in the end (delta: 465.6MB). Free memory was 97.7MB in the beginning and 461.7MB in the end (delta: -364.0MB). Peak memory consumption was 102.8MB. Max. memory is 16.1GB. [2024-10-24 08:02:18,722 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory is still 71.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 08:02:18,722 INFO L158 Benchmark]: CACSL2BoogieTranslator took 428.64ms. Allocated memory is still 163.6MB. Free memory was 97.5MB in the beginning and 131.0MB in the end (delta: -33.5MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2024-10-24 08:02:18,723 INFO L158 Benchmark]: Boogie Procedure Inliner took 93.87ms. Allocated memory is still 163.6MB. Free memory was 131.0MB in the beginning and 126.1MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 08:02:18,723 INFO L158 Benchmark]: Boogie Preprocessor took 89.01ms. Allocated memory is still 163.6MB. Free memory was 126.1MB in the beginning and 118.5MB in the end (delta: 7.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 08:02:18,723 INFO L158 Benchmark]: RCFGBuilder took 654.99ms. Allocated memory is still 163.6MB. Free memory was 118.5MB in the beginning and 86.2MB in the end (delta: 32.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-24 08:02:18,724 INFO L158 Benchmark]: TraceAbstraction took 44289.01ms. Allocated memory was 163.6MB in the beginning and 629.1MB in the end (delta: 465.6MB). Free memory was 85.6MB in the beginning and 461.7MB in the end (delta: -376.1MB). Peak memory consumption was 91.8MB. Max. memory is 16.1GB. [2024-10-24 08:02:18,724 INFO L158 Benchmark]: Witness Printer took 4.41ms. Allocated memory is still 629.1MB. Free memory is still 461.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 08:02:18,728 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.16ms. Allocated memory is still 109.1MB. Free memory is still 71.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 428.64ms. Allocated memory is still 163.6MB. Free memory was 97.5MB in the beginning and 131.0MB in the end (delta: -33.5MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 93.87ms. Allocated memory is still 163.6MB. Free memory was 131.0MB in the beginning and 126.1MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 89.01ms. Allocated memory is still 163.6MB. Free memory was 126.1MB in the beginning and 118.5MB in the end (delta: 7.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 654.99ms. Allocated memory is still 163.6MB. Free memory was 118.5MB in the beginning and 86.2MB in the end (delta: 32.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 44289.01ms. Allocated memory was 163.6MB in the beginning and 629.1MB in the end (delta: 465.6MB). Free memory was 85.6MB in the beginning and 461.7MB in the end (delta: -376.1MB). Peak memory consumption was 91.8MB. Max. memory is 16.1GB. * Witness Printer took 4.41ms. Allocated memory is still 629.1MB. Free memory is still 461.7MB. 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 169, overapproximation of bitwiseAnd at line 61, overapproximation of someUnaryDOUBLEoperation at line 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 71, overapproximation of someBinaryArithmeticFLOAToperation at line 86, overapproximation of someUnaryFLOAToperation at line 86. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_7 = 0; [L24] unsigned char var_1_8 = 1; [L25] signed short int var_1_9 = -2; [L26] float var_1_13 = 999.4; [L27] float var_1_14 = 100.425; [L28] float var_1_15 = 3.375; [L29] float var_1_16 = 15.9; [L30] signed short int var_1_17 = -10; [L31] signed short int var_1_18 = 18060; [L32] unsigned char var_1_20 = 0; [L33] unsigned long int var_1_21 = 4; [L34] unsigned char var_1_23 = 0; [L35] unsigned char var_1_24 = 0; [L36] unsigned char var_1_25 = 100; [L37] unsigned char var_1_26 = 32; [L38] unsigned char var_1_27 = 10; [L39] unsigned char var_1_28 = 1; [L40] unsigned short int var_1_29 = 256; [L41] unsigned char var_1_30 = 1; [L42] unsigned char var_1_31 = 4; [L43] double var_1_33 = 31.625; [L44] double var_1_36 = 15.75; [L45] double var_1_37 = 15.375; [L46] unsigned short int var_1_38 = 16; [L47] unsigned char var_1_39 = 0; [L48] double var_1_44 = 128.5; [L49] float var_1_45 = 1.85; [L50] double var_1_46 = 1.5; [L51] double var_1_47 = 99999999999.4; [L52] unsigned char var_1_49 = 128; [L173] isInitial = 1 [L174] FCALL initially() [L175] COND TRUE 1 [L176] FCALL updateLastVariables() [L177] CALL updateVariables() [L126] var_1_7 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L127] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L128] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L128] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L129] var_1_8 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_8 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L130] RET assume_abort_if_not(var_1_8 >= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L131] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L131] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L132] var_1_14 = __VERIFIER_nondet_float() [L133] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L133] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L134] var_1_15 = __VERIFIER_nondet_float() [L135] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L135] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L136] var_1_16 = __VERIFIER_nondet_float() [L137] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L137] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L138] var_1_18 = __VERIFIER_nondet_short() [L139] CALL assume_abort_if_not(var_1_18 >= 16382) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L139] RET assume_abort_if_not(var_1_18 >= 16382) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L140] CALL assume_abort_if_not(var_1_18 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L140] RET assume_abort_if_not(var_1_18 <= 32766) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L141] var_1_21 = __VERIFIER_nondet_ulong() [L142] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L142] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L143] CALL assume_abort_if_not(var_1_21 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L143] RET assume_abort_if_not(var_1_21 <= 4294967295) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L144] CALL assume_abort_if_not(var_1_21 != 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L144] RET assume_abort_if_not(var_1_21 != 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L145] var_1_23 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L146] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L147] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L147] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L148] var_1_24 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L149] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L150] CALL assume_abort_if_not(var_1_24 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L150] RET assume_abort_if_not(var_1_24 <= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L151] var_1_26 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L152] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L153] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L153] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L154] var_1_27 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L155] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L156] CALL assume_abort_if_not(var_1_27 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L156] RET assume_abort_if_not(var_1_27 <= 127) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L157] var_1_36 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L158] RET assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L159] var_1_37 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854765600e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L160] RET assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854765600e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L161] var_1_46 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_46 >= 0.0F && var_1_46 <= -1.0e-20F) || (var_1_46 <= 9223372.036854776000e+12F && var_1_46 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L162] RET assume_abort_if_not((var_1_46 >= 0.0F && var_1_46 <= -1.0e-20F) || (var_1_46 <= 9223372.036854776000e+12F && var_1_46 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L163] var_1_47 = __VERIFIER_nondet_double() [L164] CALL assume_abort_if_not((var_1_47 >= 0.0F && var_1_47 <= -1.0e-20F) || (var_1_47 <= 9223372.036854776000e+12F && var_1_47 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L164] RET assume_abort_if_not((var_1_47 >= 0.0F && var_1_47 <= -1.0e-20F) || (var_1_47 <= 9223372.036854776000e+12F && var_1_47 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L177] RET updateVariables() [L178] CALL step() [L56] var_1_31 = var_1_26 VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=-512, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L57] COND FALSE !(! var_1_7) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=-512, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L60] var_1_38 = ((((var_1_27) > (var_1_27)) ? (var_1_27) : (var_1_27))) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=-512, var_1_33=253/8, var_1_38=0, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L61] EXPR var_1_18 & (var_1_29 + 2u) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=-512, var_1_33=253/8, var_1_38=0, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L61] EXPR 16u >> var_1_26 VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=-512, var_1_33=253/8, var_1_38=0, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L61] COND TRUE (var_1_18 & (var_1_29 + 2u)) < (16u >> var_1_26) [L62] var_1_39 = ((var_1_7 && (var_1_7 && var_1_8)) && (! var_1_23)) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=-512, var_1_33=253/8, var_1_38=0, var_1_39=1, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L64] COND FALSE !(var_1_36 <= var_1_16) [L69] var_1_44 = var_1_36 VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=-512, var_1_33=253/8, var_1_36=2, var_1_38=0, var_1_39=1, var_1_44=2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L71] COND FALSE !((var_1_14 * (var_1_46 - var_1_47)) < var_1_14) [L76] var_1_45 = (((((((((((var_1_14) > (var_1_36)) ? (var_1_14) : (var_1_36)))) < (var_1_37)) ? (((((var_1_14) > (var_1_36)) ? (var_1_14) : (var_1_36)))) : (var_1_37))) < 0 ) ? -((((((((var_1_14) > (var_1_36)) ? (var_1_14) : (var_1_36)))) < (var_1_37)) ? (((((var_1_14) > (var_1_36)) ? (var_1_14) : (var_1_36)))) : (var_1_37))) : ((((((((var_1_14) > (var_1_36)) ? (var_1_14) : (var_1_36)))) < (var_1_37)) ? (((((var_1_14) > (var_1_36)) ? (var_1_14) : (var_1_36)))) : (var_1_37))))) VAL [isInitial=1, var_1_13=4997/5, var_1_14=0, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=-512, var_1_33=253/8, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=2, var_1_45=3, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L78] var_1_20 || (var_1_26 >= (var_1_18 & var_1_27)) VAL [isInitial=1, var_1_13=4997/5, var_1_14=0, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=-512, var_1_33=253/8, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=2, var_1_45=3, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L78] EXPR var_1_18 & var_1_27 VAL [isInitial=1, var_1_13=4997/5, var_1_14=0, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=-512, var_1_33=253/8, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=2, var_1_45=3, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L78] var_1_20 || (var_1_26 >= (var_1_18 & var_1_27)) VAL [isInitial=1, var_1_13=4997/5, var_1_14=0, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=-512, var_1_33=253/8, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=2, var_1_45=3, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L78] COND TRUE var_1_20 || (var_1_26 >= (var_1_18 & var_1_27)) [L79] COND FALSE !(-2 > var_1_27) [L82] var_1_49 = var_1_26 VAL [isInitial=1, var_1_13=4997/5, var_1_14=0, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=-512, var_1_33=253/8, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=2, var_1_45=3, var_1_49=-512, var_1_7=1, var_1_8=1, var_1_9=-2] [L85] COND TRUE \read(var_1_8) [L86] var_1_13 = (((((var_1_14 + var_1_15)) < (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16))))) ? ((var_1_14 + var_1_15)) : (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16)))))) VAL [isInitial=1, var_1_13=4, var_1_14=0, var_1_16=0, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=-512, var_1_33=253/8, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=2, var_1_45=3, var_1_49=-512, var_1_7=1, var_1_8=1, var_1_9=-2] [L88] COND TRUE \read(var_1_8) [L89] var_1_25 = (var_1_26 + var_1_27) VAL [isInitial=1, var_1_13=4, var_1_14=0, var_1_16=0, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=-512, var_1_33=253/8, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=2, var_1_45=3, var_1_49=-512, var_1_7=1, var_1_8=1, var_1_9=-2] [L91] var_1_29 = var_1_27 [L92] var_1_30 = var_1_8 VAL [isInitial=1, var_1_13=4, var_1_14=0, var_1_16=0, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=-512, var_1_33=253/8, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=2, var_1_45=3, var_1_49=-512, var_1_7=1, var_1_8=1, var_1_9=-2] [L93] COND FALSE !((var_1_29 > var_1_25) && var_1_30) [L96] var_1_9 = ((((var_1_25) > ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25))))) ? (var_1_25) : ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25)))))) VAL [isInitial=1, var_1_13=4, var_1_14=0, var_1_16=0, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=-512, var_1_33=253/8, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=2, var_1_45=3, var_1_49=-512, var_1_7=1, var_1_8=1, var_1_9=0] [L98] var_1_17 = ((var_1_18 - 25) - var_1_25) [L99] signed long int stepLocal_2 = var_1_25 + var_1_17; VAL [isInitial=1, stepLocal_2=16396, var_1_13=4, var_1_14=0, var_1_16=0, var_1_17=16396, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=-512, var_1_33=253/8, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=2, var_1_45=3, var_1_49=-512, var_1_7=1, var_1_8=1, var_1_9=0] [L100] COND TRUE ((var_1_18 % var_1_21) & ((((1u) < 0 ) ? -(1u) : (1u)))) < stepLocal_2 [L101] var_1_20 = (var_1_23 || var_1_24) VAL [isInitial=1, var_1_13=4, var_1_14=0, var_1_16=0, var_1_17=16396, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=-512, var_1_33=253/8, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=2, var_1_45=3, var_1_49=-512, var_1_7=1, var_1_8=1, var_1_9=0] [L105] signed short int stepLocal_3 = var_1_9; VAL [isInitial=1, stepLocal_3=0, var_1_13=4, var_1_14=0, var_1_16=0, var_1_17=16396, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=-512, var_1_33=253/8, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=2, var_1_45=3, var_1_49=-512, var_1_7=1, var_1_8=1, var_1_9=0] [L106] COND FALSE !((~ var_1_29) > stepLocal_3) [L109] var_1_28 = (var_1_20 || ((! var_1_23) && (var_1_24 || var_1_7))) VAL [isInitial=1, var_1_13=4, var_1_14=0, var_1_16=0, var_1_17=16396, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=-512, var_1_33=253/8, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=2, var_1_45=3, var_1_49=-512, var_1_7=1, var_1_8=1, var_1_9=0] [L111] signed long int stepLocal_1 = (((var_1_9) > (var_1_25)) ? (var_1_9) : (var_1_25)); [L112] unsigned char stepLocal_0 = var_1_25; VAL [isInitial=1, stepLocal_0=0, stepLocal_1=0, var_1_13=4, var_1_14=0, var_1_16=0, var_1_17=16396, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=-512, var_1_33=253/8, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=2, var_1_45=3, var_1_49=-512, var_1_7=1, var_1_8=1, var_1_9=0] [L113] COND TRUE stepLocal_1 <= (var_1_25 - var_1_25) VAL [isInitial=1, stepLocal_0=0, var_1_13=4, var_1_14=0, var_1_16=0, var_1_17=16396, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=-512, var_1_33=253/8, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=2, var_1_45=3, var_1_49=-512, var_1_7=1, var_1_8=1, var_1_9=0] [L114] COND FALSE !(stepLocal_0 < var_1_25) VAL [isInitial=1, var_1_13=4, var_1_14=0, var_1_16=0, var_1_17=16396, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=-512, var_1_33=253/8, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=2, var_1_45=3, var_1_49=-512, var_1_7=1, var_1_8=1, var_1_9=0] [L178] RET step() [L179] CALL, EXPR property() [L169-L170] return (((((((((((((var_1_9) > (var_1_25)) ? (var_1_9) : (var_1_25))) <= (var_1_25 - var_1_25)) ? ((var_1_25 < var_1_25) ? (var_1_20 ? (var_1_1 == ((unsigned char) var_1_7)) : (var_1_1 == ((unsigned char) var_1_8))) : 1) : (var_1_1 == ((unsigned char) 0))) && (((var_1_29 > var_1_25) && var_1_30) ? (var_1_9 == ((signed short int) var_1_25)) : (var_1_9 == ((signed short int) ((((var_1_25) > ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25))))) ? (var_1_25) : ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25)))))))))) && (var_1_8 ? (var_1_13 == ((float) (((((var_1_14 + var_1_15)) < (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16))))) ? ((var_1_14 + var_1_15)) : (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16)))))))) : 1)) && (var_1_17 == ((signed short int) ((var_1_18 - 25) - var_1_25)))) && ((((var_1_18 % var_1_21) & ((((1u) < 0 ) ? -(1u) : (1u)))) < (var_1_25 + var_1_17)) ? (var_1_20 == ((unsigned char) (var_1_23 || var_1_24))) : (var_1_20 == ((unsigned char) var_1_7)))) && (var_1_8 ? (var_1_25 == ((unsigned char) (var_1_26 + var_1_27))) : 1)) && (((~ var_1_29) > var_1_9) ? (var_1_28 == ((unsigned char) (! var_1_7))) : (var_1_28 == ((unsigned char) (var_1_20 || ((! var_1_23) && (var_1_24 || var_1_7))))))) && (var_1_29 == ((unsigned short int) var_1_27))) && (var_1_30 == ((unsigned char) var_1_8)) ; [L179] RET, EXPR property() [L179] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_13=4, var_1_14=0, var_1_16=0, var_1_17=16396, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=-512, var_1_33=253/8, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=2, var_1_45=3, var_1_49=-512, var_1_7=1, var_1_8=1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_13=4, var_1_14=0, var_1_16=0, var_1_17=16396, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=-512, var_1_33=253/8, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=2, var_1_45=3, var_1_49=-512, var_1_7=1, var_1_8=1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 84 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 44.1s, OverallIterations: 17, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 14.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3342 SdHoareTripleChecker+Valid, 6.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3327 mSDsluCounter, 7122 SdHoareTripleChecker+Invalid, 5.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5169 mSDsCounter, 903 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4374 IncrementalHoareTripleChecker+Invalid, 5277 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 903 mSolverCounterUnsat, 1953 mSDtfsCounter, 4374 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1991 GetRequests, 1797 SyntacticMatches, 1 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 803 ImplicationChecksByTransitivity, 10.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=737occurred in iteration=16, InterpolantAutomatonStates: 150, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 16 MinimizatonAttempts, 705 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 25.8s InterpolantComputationTime, 3433 NumberOfCodeBlocks, 3433 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 3570 ConstructedInterpolants, 0 QuantifiedInterpolants, 15536 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1162 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 22 InterpolantComputations, 13 PerfectInterpolantSequences, 23583/24288 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-24 08:02:18,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-50.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 6bd3e010bc1161b63e7109d8f2f51cd280074799234e989c902599e5e44de78e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 08:02:21,100 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 08:02:21,188 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 08:02:21,194 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 08:02:21,195 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 08:02:21,234 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 08:02:21,235 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 08:02:21,237 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 08:02:21,238 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 08:02:21,238 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 08:02:21,238 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 08:02:21,239 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 08:02:21,239 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 08:02:21,240 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 08:02:21,242 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 08:02:21,242 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 08:02:21,243 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 08:02:21,243 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 08:02:21,243 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 08:02:21,243 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 08:02:21,244 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 08:02:21,248 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 08:02:21,249 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 08:02:21,249 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 08:02:21,249 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 08:02:21,249 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 08:02:21,250 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 08:02:21,250 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 08:02:21,250 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 08:02:21,250 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 08:02:21,251 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 08:02:21,251 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 08:02:21,251 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 08:02:21,251 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 08:02:21,252 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:02:21,252 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 08:02:21,252 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 08:02:21,253 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 08:02:21,253 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 08:02:21,253 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 08:02:21,253 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 08:02:21,255 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 08:02:21,255 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 08:02:21,255 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 08:02:21,255 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 08:02:21,255 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 -> 6bd3e010bc1161b63e7109d8f2f51cd280074799234e989c902599e5e44de78e [2024-10-24 08:02:21,590 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 08:02:21,608 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 08:02:21,611 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 08:02:21,612 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 08:02:21,614 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 08:02:21,616 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-50.i [2024-10-24 08:02:23,211 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 08:02:23,456 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 08:02:23,457 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-50.i [2024-10-24 08:02:23,468 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4a40c7e5/731e0a056d5748c781407a1148464de2/FLAGf13736aa6 [2024-10-24 08:02:23,482 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4a40c7e5/731e0a056d5748c781407a1148464de2 [2024-10-24 08:02:23,485 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 08:02:23,486 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 08:02:23,487 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 08:02:23,487 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 08:02:23,494 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 08:02:23,495 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:02:23" (1/1) ... [2024-10-24 08:02:23,496 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bb9f694 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:02:23, skipping insertion in model container [2024-10-24 08:02:23,496 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:02:23" (1/1) ... [2024-10-24 08:02:23,530 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 08:02:23,731 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-50.i[919,932] [2024-10-24 08:02:23,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:02:23,853 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 08:02:23,864 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-50.i[919,932] [2024-10-24 08:02:23,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:02:23,940 INFO L204 MainTranslator]: Completed translation [2024-10-24 08:02:23,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:02:23 WrapperNode [2024-10-24 08:02:23,940 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 08:02:23,941 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 08:02:23,942 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 08:02:23,942 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 08:02:23,948 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:02:23" (1/1) ... [2024-10-24 08:02:23,969 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:02:23" (1/1) ... [2024-10-24 08:02:24,023 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 178 [2024-10-24 08:02:24,027 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 08:02:24,028 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 08:02:24,028 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 08:02:24,029 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 08:02:24,041 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:02:23" (1/1) ... [2024-10-24 08:02:24,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:02:23" (1/1) ... [2024-10-24 08:02:24,048 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:02:23" (1/1) ... [2024-10-24 08:02:24,072 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-24 08:02:24,075 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:02:23" (1/1) ... [2024-10-24 08:02:24,076 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:02:23" (1/1) ... [2024-10-24 08:02:24,093 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:02:23" (1/1) ... [2024-10-24 08:02:24,100 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:02:23" (1/1) ... [2024-10-24 08:02:24,107 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:02:23" (1/1) ... [2024-10-24 08:02:24,113 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:02:23" (1/1) ... [2024-10-24 08:02:24,120 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 08:02:24,121 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 08:02:24,121 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 08:02:24,121 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 08:02:24,122 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:02:23" (1/1) ... [2024-10-24 08:02:24,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:02:24,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:02:24,156 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-24 08:02:24,163 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-24 08:02:24,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 08:02:24,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 08:02:24,211 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 08:02:24,211 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 08:02:24,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 08:02:24,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 08:02:24,324 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 08:02:24,326 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 08:02:34,236 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-24 08:02:34,236 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 08:02:34,294 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 08:02:34,295 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 08:02:34,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:02:34 BoogieIcfgContainer [2024-10-24 08:02:34,295 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 08:02:34,297 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 08:02:34,297 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 08:02:34,302 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 08:02:34,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 08:02:23" (1/3) ... [2024-10-24 08:02:34,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1673aaa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:02:34, skipping insertion in model container [2024-10-24 08:02:34,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:02:23" (2/3) ... [2024-10-24 08:02:34,303 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1673aaa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:02:34, skipping insertion in model container [2024-10-24 08:02:34,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:02:34" (3/3) ... [2024-10-24 08:02:34,305 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-50.i [2024-10-24 08:02:34,321 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 08:02:34,321 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 08:02:34,393 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 08:02:34,400 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;@3e62d438, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 08:02:34,400 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 08:02:34,406 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 47 states have internal predecessors, (67), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 08:02:34,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-24 08:02:34,421 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:02:34,422 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:02:34,422 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:02:34,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:02:34,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1633757492, now seen corresponding path program 1 times [2024-10-24 08:02:34,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:02:34,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1938017143] [2024-10-24 08:02:34,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:02:34,447 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-24 08:02:34,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:02:34,449 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-24 08:02:34,450 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-24 08:02:35,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:35,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 08:02:35,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:02:35,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 574 proven. 0 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2024-10-24 08:02:35,187 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 08:02:35,188 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 08:02:35,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1938017143] [2024-10-24 08:02:35,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1938017143] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:02:35,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:02:35,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 08:02:35,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137870487] [2024-10-24 08:02:35,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:02:35,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 08:02:35,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 08:02:35,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 08:02:35,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:02:35,226 INFO L87 Difference]: Start difference. First operand has 73 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 47 states have internal predecessors, (67), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-24 08:02:35,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:02:35,434 INFO L93 Difference]: Finished difference Result 143 states and 252 transitions. [2024-10-24 08:02:35,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 08:02:35,445 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 156 [2024-10-24 08:02:35,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:02:35,452 INFO L225 Difference]: With dead ends: 143 [2024-10-24 08:02:35,452 INFO L226 Difference]: Without dead ends: 71 [2024-10-24 08:02:35,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 155 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-24 08:02:35,460 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 106 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.2s IncrementalHoareTripleChecker+Time [2024-10-24 08:02:35,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 08:02:35,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-24 08:02:35,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-10-24 08:02:35,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 45 states have internal predecessors, (61), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 08:02:35,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 109 transitions. [2024-10-24 08:02:35,510 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 109 transitions. Word has length 156 [2024-10-24 08:02:35,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:02:35,511 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 109 transitions. [2024-10-24 08:02:35,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-24 08:02:35,512 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 109 transitions. [2024-10-24 08:02:35,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-24 08:02:35,517 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:02:35,518 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:02:35,539 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-24 08:02:35,718 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-24 08:02:35,719 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:02:35,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:02:35,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1016455160, now seen corresponding path program 1 times [2024-10-24 08:02:35,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:02:35,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [760925854] [2024-10-24 08:02:35,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:02:35,721 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-24 08:02:35,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:02:35,723 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-24 08:02:35,724 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-24 08:02:36,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:02:36,310 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 08:02:36,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:02:38,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 23 proven. 69 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 08:02:38,223 INFO L311 TraceCheckSpWp]: Computing backward predicates...