./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_loopvsstraightlinecode_25-1loop_file-32.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-32.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 d4efba5d8035d5b89a6fee2af18255a7435db1834e066c2b81c99247161e78c7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:07:13,320 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:07:13,399 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 04:07:13,403 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:07:13,404 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:07:13,426 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:07:13,428 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:07:13,429 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:07:13,429 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:07:13,430 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:07:13,431 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:07:13,431 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:07:13,432 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:07:13,433 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:07:13,433 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:07:13,434 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:07:13,434 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:07:13,434 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:07:13,435 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 04:07:13,435 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:07:13,435 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:07:13,439 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:07:13,439 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:07:13,440 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:07:13,440 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:07:13,440 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:07:13,440 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:07:13,441 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:07:13,441 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:07:13,441 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:07:13,441 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:07:13,442 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:07:13,442 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:07:13,442 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:07:13,442 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:07:13,442 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:07:13,443 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 04:07:13,443 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 04:07:13,443 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:07:13,443 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:07:13,443 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:07:13,444 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:07:13,444 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 -> d4efba5d8035d5b89a6fee2af18255a7435db1834e066c2b81c99247161e78c7 [2024-10-13 04:07:13,712 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:07:13,735 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:07:13,739 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:07:13,740 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:07:13,741 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:07:13,742 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-32.i [2024-10-13 04:07:15,237 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:07:15,428 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:07:15,429 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-32.i [2024-10-13 04:07:15,445 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbec1f41a/72a90ba455244adb8f1100becfc44077/FLAGbd2874b55 [2024-10-13 04:07:15,465 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbec1f41a/72a90ba455244adb8f1100becfc44077 [2024-10-13 04:07:15,468 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:07:15,470 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:07:15,473 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:07:15,474 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:07:15,480 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:07:15,481 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:07:15" (1/1) ... [2024-10-13 04:07:15,482 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71c0a28b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:07:15, skipping insertion in model container [2024-10-13 04:07:15,482 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:07:15" (1/1) ... [2024-10-13 04:07:15,514 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:07:15,686 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_loopvsstraightlinecode_25-1loop_file-32.i[915,928] [2024-10-13 04:07:15,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:07:15,760 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:07:15,778 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_loopvsstraightlinecode_25-1loop_file-32.i[915,928] [2024-10-13 04:07:15,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:07:15,861 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:07:15,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:07:15 WrapperNode [2024-10-13 04:07:15,862 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:07:15,863 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:07:15,863 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:07:15,863 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:07:15,871 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:07:15" (1/1) ... [2024-10-13 04:07:15,882 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:07:15" (1/1) ... [2024-10-13 04:07:15,929 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 191 [2024-10-13 04:07:15,930 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:07:15,933 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:07:15,934 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:07:15,934 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:07:15,943 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:07:15" (1/1) ... [2024-10-13 04:07:15,943 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:07:15" (1/1) ... [2024-10-13 04:07:15,947 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:07:15" (1/1) ... [2024-10-13 04:07:15,982 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 04:07:15,982 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:07:15" (1/1) ... [2024-10-13 04:07:15,983 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:07:15" (1/1) ... [2024-10-13 04:07:15,998 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:07:15" (1/1) ... [2024-10-13 04:07:16,005 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:07:15" (1/1) ... [2024-10-13 04:07:16,010 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:07:15" (1/1) ... [2024-10-13 04:07:16,016 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:07:15" (1/1) ... [2024-10-13 04:07:16,023 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:07:16,025 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:07:16,025 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:07:16,025 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:07:16,028 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:07:15" (1/1) ... [2024-10-13 04:07:16,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:07:16,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:07:16,064 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 04:07:16,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 04:07:16,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:07:16,104 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:07:16,105 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:07:16,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 04:07:16,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:07:16,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:07:16,168 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:07:16,170 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:07:16,565 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2024-10-13 04:07:16,566 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:07:16,598 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:07:16,598 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:07:16,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:07:16 BoogieIcfgContainer [2024-10-13 04:07:16,599 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:07:16,602 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:07:16,602 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:07:16,606 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:07:16,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:07:15" (1/3) ... [2024-10-13 04:07:16,607 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16ae1d1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:07:16, skipping insertion in model container [2024-10-13 04:07:16,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:07:15" (2/3) ... [2024-10-13 04:07:16,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16ae1d1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:07:16, skipping insertion in model container [2024-10-13 04:07:16,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:07:16" (3/3) ... [2024-10-13 04:07:16,610 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-32.i [2024-10-13 04:07:16,629 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:07:16,630 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:07:16,696 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:07:16,703 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;@844afe7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:07:16,703 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:07:16,707 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 54 states have (on average 1.5) internal successors, (81), 55 states have internal predecessors, (81), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 04:07:16,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-13 04:07:16,719 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:07:16,721 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:07:16,722 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:07:16,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:07:16,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1304209682, now seen corresponding path program 1 times [2024-10-13 04:07:16,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:07:16,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766204636] [2024-10-13 04:07:16,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:07:16,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:07:16,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:16,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:07:16,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:16,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:07:16,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:17,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:07:17,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:17,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:07:17,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:17,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:07:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:17,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:07:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:17,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:07:17,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:17,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:07:17,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:17,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:07:17,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:17,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:07:17,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:17,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:07:17,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:17,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:07:17,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:17,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:07:17,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:17,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:07:17,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:17,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:07:17,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:17,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:07:17,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:17,108 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 04:07:17,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:07:17,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766204636] [2024-10-13 04:07:17,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766204636] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:07:17,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:07:17,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 04:07:17,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793082298] [2024-10-13 04:07:17,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:07:17,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 04:07:17,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:07:17,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 04:07:17,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:07:17,141 INFO L87 Difference]: Start difference. First operand has 73 states, 54 states have (on average 1.5) internal successors, (81), 55 states have internal predecessors, (81), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-13 04:07:17,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:07:17,182 INFO L93 Difference]: Finished difference Result 145 states and 241 transitions. [2024-10-13 04:07:17,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 04:07:17,185 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 106 [2024-10-13 04:07:17,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:07:17,191 INFO L225 Difference]: With dead ends: 145 [2024-10-13 04:07:17,191 INFO L226 Difference]: Without dead ends: 71 [2024-10-13 04:07:17,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:07:17,197 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:07:17,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:07:17,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-13 04:07:17,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-10-13 04:07:17,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 53 states have internal predecessors, (76), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 04:07:17,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 108 transitions. [2024-10-13 04:07:17,252 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 108 transitions. Word has length 106 [2024-10-13 04:07:17,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:07:17,252 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 108 transitions. [2024-10-13 04:07:17,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-13 04:07:17,253 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 108 transitions. [2024-10-13 04:07:17,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-13 04:07:17,257 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:07:17,257 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:07:17,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 04:07:17,257 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:07:17,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:07:17,258 INFO L85 PathProgramCache]: Analyzing trace with hash -726632722, now seen corresponding path program 1 times [2024-10-13 04:07:17,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:07:17,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922867287] [2024-10-13 04:07:17,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:07:17,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:07:17,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:17,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:07:17,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:17,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:07:17,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:17,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:07:17,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:17,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:07:17,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:17,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:07:17,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:17,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:07:17,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:17,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:07:17,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:17,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:07:17,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:17,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:07:17,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:17,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:07:17,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:17,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:07:17,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:17,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:07:17,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:17,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:07:17,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:17,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:07:17,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:17,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:07:17,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:17,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:07:17,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:17,772 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 04:07:17,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:07:17,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922867287] [2024-10-13 04:07:17,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922867287] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:07:17,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:07:17,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 04:07:17,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834916634] [2024-10-13 04:07:17,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:07:17,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 04:07:17,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:07:17,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 04:07:17,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 04:07:17,780 INFO L87 Difference]: Start difference. First operand 71 states and 108 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 04:07:17,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:07:17,952 INFO L93 Difference]: Finished difference Result 246 states and 374 transitions. [2024-10-13 04:07:17,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 04:07:17,952 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 106 [2024-10-13 04:07:17,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:07:17,955 INFO L225 Difference]: With dead ends: 246 [2024-10-13 04:07:17,957 INFO L226 Difference]: Without dead ends: 176 [2024-10-13 04:07:17,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 04:07:17,959 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 137 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 04:07:17,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 348 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 04:07:17,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-10-13 04:07:17,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 139. [2024-10-13 04:07:17,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 104 states have (on average 1.4326923076923077) internal successors, (149), 104 states have internal predecessors, (149), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 04:07:17,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 213 transitions. [2024-10-13 04:07:17,996 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 213 transitions. Word has length 106 [2024-10-13 04:07:17,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:07:17,997 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 213 transitions. [2024-10-13 04:07:17,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 04:07:17,997 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 213 transitions. [2024-10-13 04:07:17,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-13 04:07:17,999 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:07:17,999 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:07:17,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 04:07:17,999 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:07:18,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:07:18,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1747701076, now seen corresponding path program 1 times [2024-10-13 04:07:18,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:07:18,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876883904] [2024-10-13 04:07:18,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:07:18,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:07:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:18,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:07:18,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:18,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:07:18,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:18,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:07:18,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:18,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:07:18,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:18,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:07:18,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:18,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:07:18,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:18,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:07:18,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:18,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:07:18,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:18,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:07:18,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:18,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:07:18,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:18,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:07:18,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:18,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:07:18,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:18,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:07:18,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:18,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:07:18,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:18,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:07:18,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:18,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:07:18,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:18,302 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 04:07:18,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:07:18,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876883904] [2024-10-13 04:07:18,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876883904] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:07:18,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:07:18,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 04:07:18,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045766779] [2024-10-13 04:07:18,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:07:18,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 04:07:18,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:07:18,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 04:07:18,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 04:07:18,305 INFO L87 Difference]: Start difference. First operand 139 states and 213 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 04:07:18,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:07:18,482 INFO L93 Difference]: Finished difference Result 393 states and 603 transitions. [2024-10-13 04:07:18,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 04:07:18,483 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 106 [2024-10-13 04:07:18,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:07:18,485 INFO L225 Difference]: With dead ends: 393 [2024-10-13 04:07:18,486 INFO L226 Difference]: Without dead ends: 255 [2024-10-13 04:07:18,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 04:07:18,494 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 121 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 04:07:18,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 383 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 04:07:18,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-10-13 04:07:18,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 185. [2024-10-13 04:07:18,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 133 states have (on average 1.413533834586466) internal successors, (188), 133 states have internal predecessors, (188), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-13 04:07:18,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 284 transitions. [2024-10-13 04:07:18,535 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 284 transitions. Word has length 106 [2024-10-13 04:07:18,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:07:18,536 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 284 transitions. [2024-10-13 04:07:18,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 04:07:18,536 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 284 transitions. [2024-10-13 04:07:18,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-13 04:07:18,538 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:07:18,538 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:07:18,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 04:07:18,539 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:07:18,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:07:18,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1312855375, now seen corresponding path program 1 times [2024-10-13 04:07:18,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:07:18,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664462599] [2024-10-13 04:07:18,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:07:18,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:07:18,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:18,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:07:18,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:18,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:07:18,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:18,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:07:18,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:18,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:07:18,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:18,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:07:18,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:18,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:07:18,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:18,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:07:18,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:18,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:07:18,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:18,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:07:18,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:18,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:07:18,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:18,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:07:18,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:18,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:07:18,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:18,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:07:18,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:18,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:07:18,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:18,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:07:18,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:18,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:07:18,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:18,814 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 04:07:18,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:07:18,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664462599] [2024-10-13 04:07:18,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664462599] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:07:18,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:07:18,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 04:07:18,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150518831] [2024-10-13 04:07:18,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:07:18,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 04:07:18,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:07:18,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 04:07:18,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 04:07:18,819 INFO L87 Difference]: Start difference. First operand 185 states and 284 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 04:07:18,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:07:18,884 INFO L93 Difference]: Finished difference Result 389 states and 599 transitions. [2024-10-13 04:07:18,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 04:07:18,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 107 [2024-10-13 04:07:18,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:07:18,890 INFO L225 Difference]: With dead ends: 389 [2024-10-13 04:07:18,891 INFO L226 Difference]: Without dead ends: 251 [2024-10-13 04:07:18,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 04:07:18,897 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 72 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:07:18,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 190 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:07:18,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-10-13 04:07:18,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 249. [2024-10-13 04:07:18,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 180 states have (on average 1.4) internal successors, (252), 180 states have internal predecessors, (252), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-13 04:07:18,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 380 transitions. [2024-10-13 04:07:18,931 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 380 transitions. Word has length 107 [2024-10-13 04:07:18,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:07:18,932 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 380 transitions. [2024-10-13 04:07:18,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 04:07:18,933 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 380 transitions. [2024-10-13 04:07:18,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-13 04:07:18,936 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:07:18,936 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:07:18,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 04:07:18,937 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:07:18,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:07:18,937 INFO L85 PathProgramCache]: Analyzing trace with hash 240859825, now seen corresponding path program 1 times [2024-10-13 04:07:18,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:07:18,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540331658] [2024-10-13 04:07:18,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:07:18,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:07:18,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:19,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:07:19,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:19,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:07:19,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:19,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:07:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:19,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:07:19,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:19,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:07:19,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:19,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:07:19,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:19,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:07:19,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:19,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:07:19,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:19,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:07:19,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:19,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:07:19,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:19,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:07:19,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:19,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:07:19,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:19,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:07:19,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:19,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:07:19,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:19,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:07:19,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:19,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:07:19,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:19,431 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 04:07:19,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:07:19,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540331658] [2024-10-13 04:07:19,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540331658] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:07:19,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:07:19,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 04:07:19,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944215619] [2024-10-13 04:07:19,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:07:19,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 04:07:19,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:07:19,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 04:07:19,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 04:07:19,435 INFO L87 Difference]: Start difference. First operand 249 states and 380 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 04:07:19,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:07:19,706 INFO L93 Difference]: Finished difference Result 589 states and 895 transitions. [2024-10-13 04:07:19,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 04:07:19,706 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 107 [2024-10-13 04:07:19,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:07:19,710 INFO L225 Difference]: With dead ends: 589 [2024-10-13 04:07:19,711 INFO L226 Difference]: Without dead ends: 383 [2024-10-13 04:07:19,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-10-13 04:07:19,713 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 128 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 04:07:19,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 453 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 04:07:19,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-10-13 04:07:19,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 343. [2024-10-13 04:07:19,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 274 states have (on average 1.4197080291970803) internal successors, (389), 274 states have internal predecessors, (389), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-13 04:07:19,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 517 transitions. [2024-10-13 04:07:19,748 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 517 transitions. Word has length 107 [2024-10-13 04:07:19,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:07:19,749 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 517 transitions. [2024-10-13 04:07:19,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 04:07:19,749 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 517 transitions. [2024-10-13 04:07:19,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-13 04:07:19,750 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:07:19,751 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:07:19,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 04:07:19,751 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:07:19,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:07:19,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1628909693, now seen corresponding path program 1 times [2024-10-13 04:07:19,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:07:19,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822712549] [2024-10-13 04:07:19,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:07:19,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:07:19,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:19,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:07:19,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:19,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:07:19,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:19,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:07:19,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:19,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:07:19,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:19,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:07:19,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:19,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:07:19,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:19,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:07:19,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:19,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:07:19,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:19,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:07:19,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:19,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:07:19,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:19,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:07:19,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:19,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:07:19,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:19,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:07:19,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:19,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:07:19,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:19,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:07:19,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:19,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:07:19,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:19,985 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 04:07:19,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:07:19,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822712549] [2024-10-13 04:07:19,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822712549] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:07:19,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:07:19,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 04:07:19,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705186389] [2024-10-13 04:07:19,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:07:19,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 04:07:19,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:07:19,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 04:07:19,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 04:07:19,988 INFO L87 Difference]: Start difference. First operand 343 states and 517 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 04:07:20,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:07:20,131 INFO L93 Difference]: Finished difference Result 718 states and 1080 transitions. [2024-10-13 04:07:20,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 04:07:20,132 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 111 [2024-10-13 04:07:20,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:07:20,135 INFO L225 Difference]: With dead ends: 718 [2024-10-13 04:07:20,135 INFO L226 Difference]: Without dead ends: 431 [2024-10-13 04:07:20,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 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-13 04:07:20,137 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 86 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 04:07:20,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 386 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 04:07:20,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2024-10-13 04:07:20,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 383. [2024-10-13 04:07:20,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 314 states have (on average 1.4171974522292994) internal successors, (445), 314 states have internal predecessors, (445), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-13 04:07:20,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 573 transitions. [2024-10-13 04:07:20,161 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 573 transitions. Word has length 111 [2024-10-13 04:07:20,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:07:20,161 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 573 transitions. [2024-10-13 04:07:20,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 04:07:20,162 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 573 transitions. [2024-10-13 04:07:20,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-13 04:07:20,163 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:07:20,163 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:07:20,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 04:07:20,164 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:07:20,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:07:20,164 INFO L85 PathProgramCache]: Analyzing trace with hash 2017453221, now seen corresponding path program 1 times [2024-10-13 04:07:20,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:07:20,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741008378] [2024-10-13 04:07:20,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:07:20,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:07:20,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:21,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:07:21,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:21,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:07:21,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:21,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:07:21,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:21,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:07:21,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:21,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:07:21,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:21,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:07:21,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:21,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:07:21,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:21,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:07:21,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:21,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:07:21,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:21,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:07:21,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:21,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:07:21,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:21,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:07:21,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:21,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:07:21,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:21,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:07:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:21,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:07:21,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:21,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:07:21,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:21,613 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 04:07:21,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:07:21,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741008378] [2024-10-13 04:07:21,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741008378] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:07:21,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:07:21,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 04:07:21,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460521475] [2024-10-13 04:07:21,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:07:21,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 04:07:21,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:07:21,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 04:07:21,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-13 04:07:21,615 INFO L87 Difference]: Start difference. First operand 383 states and 573 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 04:07:23,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:07:23,715 INFO L93 Difference]: Finished difference Result 864 states and 1288 transitions. [2024-10-13 04:07:23,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 04:07:23,717 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 112 [2024-10-13 04:07:23,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:07:23,721 INFO L225 Difference]: With dead ends: 864 [2024-10-13 04:07:23,721 INFO L226 Difference]: Without dead ends: 577 [2024-10-13 04:07:23,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-13 04:07:23,725 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 53 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-13 04:07:23,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 598 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-13 04:07:23,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2024-10-13 04:07:23,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 492. [2024-10-13 04:07:23,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 423 states have (on average 1.4160756501182032) internal successors, (599), 423 states have internal predecessors, (599), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-13 04:07:23,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 727 transitions. [2024-10-13 04:07:23,757 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 727 transitions. Word has length 112 [2024-10-13 04:07:23,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:07:23,757 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 727 transitions. [2024-10-13 04:07:23,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 04:07:23,758 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 727 transitions. [2024-10-13 04:07:23,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-13 04:07:23,759 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:07:23,759 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:07:23,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 04:07:23,759 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:07:23,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:07:23,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1430647207, now seen corresponding path program 1 times [2024-10-13 04:07:23,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:07:23,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61315808] [2024-10-13 04:07:23,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:07:23,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:07:23,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:25,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:07:25,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:25,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:07:25,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:25,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:07:25,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:25,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:07:25,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:25,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:07:25,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:25,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:07:25,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:25,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:07:25,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:25,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:07:25,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:25,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:07:25,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:25,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:07:25,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:25,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:07:25,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:25,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:07:25,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:25,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:07:25,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:25,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:07:25,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:25,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:07:25,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:25,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:07:25,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:25,660 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 04:07:25,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:07:25,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61315808] [2024-10-13 04:07:25,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61315808] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:07:25,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:07:25,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 04:07:25,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352764205] [2024-10-13 04:07:25,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:07:25,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 04:07:25,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:07:25,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 04:07:25,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-13 04:07:25,663 INFO L87 Difference]: Start difference. First operand 492 states and 727 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 04:07:27,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:07:27,187 INFO L93 Difference]: Finished difference Result 1008 states and 1479 transitions. [2024-10-13 04:07:27,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 04:07:27,188 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 112 [2024-10-13 04:07:27,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:07:27,191 INFO L225 Difference]: With dead ends: 1008 [2024-10-13 04:07:27,191 INFO L226 Difference]: Without dead ends: 640 [2024-10-13 04:07:27,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2024-10-13 04:07:27,193 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 124 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 04:07:27,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 771 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 04:07:27,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2024-10-13 04:07:27,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 492. [2024-10-13 04:07:27,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 423 states have (on average 1.4160756501182032) internal successors, (599), 423 states have internal predecessors, (599), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-13 04:07:27,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 727 transitions. [2024-10-13 04:07:27,225 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 727 transitions. Word has length 112 [2024-10-13 04:07:27,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:07:27,226 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 727 transitions. [2024-10-13 04:07:27,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 04:07:27,226 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 727 transitions. [2024-10-13 04:07:27,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-13 04:07:27,229 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:07:27,229 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:07:27,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 04:07:27,229 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:07:27,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:07:27,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1319951810, now seen corresponding path program 1 times [2024-10-13 04:07:27,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:07:27,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291086027] [2024-10-13 04:07:27,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:07:27,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:07:27,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:27,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:07:27,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:27,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:07:27,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:27,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:07:27,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:27,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:07:27,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:27,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:07:27,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:27,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:07:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:27,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:07:27,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:27,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:07:27,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:27,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:07:27,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:27,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:07:27,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:27,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:07:27,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:27,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:07:27,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:27,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:07:27,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:27,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:07:27,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:27,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:07:27,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:27,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:07:27,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:27,553 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 04:07:27,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:07:27,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291086027] [2024-10-13 04:07:27,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291086027] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:07:27,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:07:27,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 04:07:27,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904827619] [2024-10-13 04:07:27,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:07:27,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 04:07:27,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:07:27,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 04:07:27,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 04:07:27,555 INFO L87 Difference]: Start difference. First operand 492 states and 727 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-13 04:07:27,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:07:27,799 INFO L93 Difference]: Finished difference Result 1149 states and 1703 transitions. [2024-10-13 04:07:27,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 04:07:27,800 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 113 [2024-10-13 04:07:27,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:07:27,805 INFO L225 Difference]: With dead ends: 1149 [2024-10-13 04:07:27,805 INFO L226 Difference]: Without dead ends: 773 [2024-10-13 04:07:27,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-13 04:07:27,807 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 161 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 04:07:27,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 351 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 04:07:27,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2024-10-13 04:07:27,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 746. [2024-10-13 04:07:27,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 650 states have (on average 1.3846153846153846) internal successors, (900), 653 states have internal predecessors, (900), 88 states have call successors, (88), 7 states have call predecessors, (88), 7 states have return successors, (88), 85 states have call predecessors, (88), 88 states have call successors, (88) [2024-10-13 04:07:27,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1076 transitions. [2024-10-13 04:07:27,850 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1076 transitions. Word has length 113 [2024-10-13 04:07:27,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:07:27,851 INFO L471 AbstractCegarLoop]: Abstraction has 746 states and 1076 transitions. [2024-10-13 04:07:27,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-13 04:07:27,851 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1076 transitions. [2024-10-13 04:07:27,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-13 04:07:27,853 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:07:27,853 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:07:27,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 04:07:27,854 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:07:27,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:07:27,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1362429189, now seen corresponding path program 1 times [2024-10-13 04:07:27,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:07:27,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400222635] [2024-10-13 04:07:27,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:07:27,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:07:27,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:28,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:07:28,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:28,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:07:28,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:28,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:07:28,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:28,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:07:28,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:28,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:07:28,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:28,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:07:28,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:28,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:07:28,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:28,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:07:28,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:28,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:07:28,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:28,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:07:28,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:28,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:07:28,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:28,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:07:28,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:28,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:07:28,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:28,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:07:28,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:28,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:07:28,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:28,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:07:28,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:28,208 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 04:07:28,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:07:28,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400222635] [2024-10-13 04:07:28,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400222635] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:07:28,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:07:28,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 04:07:28,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373174157] [2024-10-13 04:07:28,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:07:28,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 04:07:28,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:07:28,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 04:07:28,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 04:07:28,210 INFO L87 Difference]: Start difference. First operand 746 states and 1076 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-13 04:07:28,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:07:28,639 INFO L93 Difference]: Finished difference Result 1566 states and 2281 transitions. [2024-10-13 04:07:28,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 04:07:28,639 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 113 [2024-10-13 04:07:28,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:07:28,646 INFO L225 Difference]: With dead ends: 1566 [2024-10-13 04:07:28,647 INFO L226 Difference]: Without dead ends: 976 [2024-10-13 04:07:28,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-13 04:07:28,649 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 185 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 04:07:28,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 414 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 04:07:28,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-10-13 04:07:28,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 807. [2024-10-13 04:07:28,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 710 states have (on average 1.408450704225352) internal successors, (1000), 713 states have internal predecessors, (1000), 88 states have call successors, (88), 8 states have call predecessors, (88), 8 states have return successors, (88), 85 states have call predecessors, (88), 88 states have call successors, (88) [2024-10-13 04:07:28,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1176 transitions. [2024-10-13 04:07:28,696 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1176 transitions. Word has length 113 [2024-10-13 04:07:28,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:07:28,697 INFO L471 AbstractCegarLoop]: Abstraction has 807 states and 1176 transitions. [2024-10-13 04:07:28,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-13 04:07:28,700 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1176 transitions. [2024-10-13 04:07:28,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-13 04:07:28,701 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:07:28,701 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:07:28,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 04:07:28,702 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:07:28,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:07:28,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1029134026, now seen corresponding path program 1 times [2024-10-13 04:07:28,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:07:28,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964457288] [2024-10-13 04:07:28,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:07:28,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:07:28,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:29,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:07:29,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:29,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:07:29,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:29,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:07:29,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:29,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:07:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:29,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:07:29,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:29,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:07:29,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:29,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:07:29,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:29,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:07:29,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:29,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:07:29,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:29,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:07:29,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:29,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:07:29,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:29,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:07:29,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:29,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:07:29,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:29,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:07:29,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:29,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:07:29,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:29,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:07:29,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:29,100 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 04:07:29,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:07:29,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964457288] [2024-10-13 04:07:29,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964457288] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:07:29,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:07:29,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 04:07:29,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440292215] [2024-10-13 04:07:29,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:07:29,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 04:07:29,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:07:29,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 04:07:29,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 04:07:29,103 INFO L87 Difference]: Start difference. First operand 807 states and 1176 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 04:07:29,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:07:29,325 INFO L93 Difference]: Finished difference Result 1162 states and 1696 transitions. [2024-10-13 04:07:29,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 04:07:29,326 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 114 [2024-10-13 04:07:29,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:07:29,332 INFO L225 Difference]: With dead ends: 1162 [2024-10-13 04:07:29,332 INFO L226 Difference]: Without dead ends: 1160 [2024-10-13 04:07:29,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-13 04:07:29,333 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 72 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 04:07:29,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 584 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 04:07:29,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2024-10-13 04:07:29,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1156. [2024-10-13 04:07:29,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1015 states have (on average 1.4108374384236453) internal successors, (1432), 1022 states have internal predecessors, (1432), 128 states have call successors, (128), 12 states have call predecessors, (128), 12 states have return successors, (128), 121 states have call predecessors, (128), 128 states have call successors, (128) [2024-10-13 04:07:29,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1688 transitions. [2024-10-13 04:07:29,410 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1688 transitions. Word has length 114 [2024-10-13 04:07:29,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:07:29,410 INFO L471 AbstractCegarLoop]: Abstraction has 1156 states and 1688 transitions. [2024-10-13 04:07:29,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 04:07:29,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1688 transitions. [2024-10-13 04:07:29,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-13 04:07:29,412 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:07:29,412 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:07:29,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 04:07:29,413 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:07:29,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:07:29,413 INFO L85 PathProgramCache]: Analyzing trace with hash -210827014, now seen corresponding path program 1 times [2024-10-13 04:07:29,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:07:29,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135813872] [2024-10-13 04:07:29,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:07:29,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:07:29,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:29,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:07:29,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:29,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:07:29,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:29,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:07:29,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:29,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:07:29,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:29,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:07:29,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:29,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:07:29,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:29,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:07:29,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:29,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:07:29,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:29,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:07:29,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:29,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:07:29,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:29,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:07:29,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:29,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:07:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:29,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:07:29,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:29,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:07:29,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:29,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:07:29,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:29,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:07:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:29,518 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 04:07:29,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:07:29,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135813872] [2024-10-13 04:07:29,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135813872] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:07:29,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:07:29,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 04:07:29,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76087891] [2024-10-13 04:07:29,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:07:29,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 04:07:29,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:07:29,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 04:07:29,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 04:07:29,520 INFO L87 Difference]: Start difference. First operand 1156 states and 1688 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 04:07:29,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:07:29,627 INFO L93 Difference]: Finished difference Result 2438 states and 3530 transitions. [2024-10-13 04:07:29,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 04:07:29,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 114 [2024-10-13 04:07:29,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:07:29,639 INFO L225 Difference]: With dead ends: 2438 [2024-10-13 04:07:29,639 INFO L226 Difference]: Without dead ends: 1466 [2024-10-13 04:07:29,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 04:07:29,643 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 47 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:07:29,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 192 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:07:29,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2024-10-13 04:07:29,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1459. [2024-10-13 04:07:29,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1459 states, 1287 states have (on average 1.3721833721833723) internal successors, (1766), 1299 states have internal predecessors, (1766), 148 states have call successors, (148), 23 states have call predecessors, (148), 23 states have return successors, (148), 136 states have call predecessors, (148), 148 states have call successors, (148) [2024-10-13 04:07:29,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1459 states to 1459 states and 2062 transitions. [2024-10-13 04:07:29,742 INFO L78 Accepts]: Start accepts. Automaton has 1459 states and 2062 transitions. Word has length 114 [2024-10-13 04:07:29,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:07:29,742 INFO L471 AbstractCegarLoop]: Abstraction has 1459 states and 2062 transitions. [2024-10-13 04:07:29,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 04:07:29,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 2062 transitions. [2024-10-13 04:07:29,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-13 04:07:29,745 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:07:29,745 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:07:29,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 04:07:29,745 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:07:29,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:07:29,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1805923998, now seen corresponding path program 1 times [2024-10-13 04:07:29,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:07:29,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617596906] [2024-10-13 04:07:29,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:07:29,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:07:29,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:30,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:07:30,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:30,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:07:30,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:30,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:07:30,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:30,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:07:30,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:30,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:07:30,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:30,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:07:30,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:30,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:07:30,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:30,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:07:30,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:30,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:07:30,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:30,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:07:30,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:30,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:07:30,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:30,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:07:30,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:30,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:07:30,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:30,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:07:30,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:30,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:07:30,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:30,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:07:30,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:30,487 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 04:07:30,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:07:30,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617596906] [2024-10-13 04:07:30,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617596906] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:07:30,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:07:30,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 04:07:30,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371552227] [2024-10-13 04:07:30,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:07:30,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 04:07:30,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:07:30,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 04:07:30,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 04:07:30,490 INFO L87 Difference]: Start difference. First operand 1459 states and 2062 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 04:07:32,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:07:32,340 INFO L93 Difference]: Finished difference Result 3225 states and 4537 transitions. [2024-10-13 04:07:32,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 04:07:32,341 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 114 [2024-10-13 04:07:32,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:07:32,349 INFO L225 Difference]: With dead ends: 3225 [2024-10-13 04:07:32,349 INFO L226 Difference]: Without dead ends: 1999 [2024-10-13 04:07:32,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-13 04:07:32,353 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 38 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 04:07:32,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 660 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 04:07:32,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1999 states. [2024-10-13 04:07:32,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1999 to 1987. [2024-10-13 04:07:32,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1987 states, 1785 states have (on average 1.35406162464986) internal successors, (2417), 1807 states have internal predecessors, (2417), 168 states have call successors, (168), 33 states have call predecessors, (168), 33 states have return successors, (168), 146 states have call predecessors, (168), 168 states have call successors, (168) [2024-10-13 04:07:32,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1987 states to 1987 states and 2753 transitions. [2024-10-13 04:07:32,522 INFO L78 Accepts]: Start accepts. Automaton has 1987 states and 2753 transitions. Word has length 114 [2024-10-13 04:07:32,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:07:32,522 INFO L471 AbstractCegarLoop]: Abstraction has 1987 states and 2753 transitions. [2024-10-13 04:07:32,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 04:07:32,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1987 states and 2753 transitions. [2024-10-13 04:07:32,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-13 04:07:32,524 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:07:32,524 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:07:32,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 04:07:32,525 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:07:32,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:07:32,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1477926048, now seen corresponding path program 1 times [2024-10-13 04:07:32,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:07:32,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754754445] [2024-10-13 04:07:32,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:07:32,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:07:32,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:33,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:07:33,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:33,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:07:33,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:33,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:07:33,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:33,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:07:33,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:33,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:07:33,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:33,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:07:33,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:33,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:07:33,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:33,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:07:33,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:33,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:07:33,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:33,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:07:33,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:33,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:07:33,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:33,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:07:33,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:33,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:07:33,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:33,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:07:33,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:33,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:07:33,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:33,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:07:33,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:33,307 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 04:07:33,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:07:33,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754754445] [2024-10-13 04:07:33,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754754445] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:07:33,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:07:33,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 04:07:33,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111025926] [2024-10-13 04:07:33,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:07:33,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 04:07:33,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:07:33,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 04:07:33,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 04:07:33,309 INFO L87 Difference]: Start difference. First operand 1987 states and 2753 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 04:07:34,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:07:34,231 INFO L93 Difference]: Finished difference Result 4289 states and 5937 transitions. [2024-10-13 04:07:34,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 04:07:34,232 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 114 [2024-10-13 04:07:34,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:07:34,245 INFO L225 Difference]: With dead ends: 4289 [2024-10-13 04:07:34,245 INFO L226 Difference]: Without dead ends: 2600 [2024-10-13 04:07:34,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-13 04:07:34,249 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 63 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 04:07:34,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 789 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 04:07:34,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2600 states. [2024-10-13 04:07:34,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2600 to 2501. [2024-10-13 04:07:34,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2501 states, 2242 states have (on average 1.3331846565566459) internal successors, (2989), 2270 states have internal predecessors, (2989), 216 states have call successors, (216), 42 states have call predecessors, (216), 42 states have return successors, (216), 188 states have call predecessors, (216), 216 states have call successors, (216) [2024-10-13 04:07:34,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2501 states to 2501 states and 3421 transitions. [2024-10-13 04:07:34,468 INFO L78 Accepts]: Start accepts. Automaton has 2501 states and 3421 transitions. Word has length 114 [2024-10-13 04:07:34,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:07:34,468 INFO L471 AbstractCegarLoop]: Abstraction has 2501 states and 3421 transitions. [2024-10-13 04:07:34,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 04:07:34,469 INFO L276 IsEmpty]: Start isEmpty. Operand 2501 states and 3421 transitions. [2024-10-13 04:07:34,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-13 04:07:34,471 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:07:34,471 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:07:34,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 04:07:34,471 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:07:34,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:07:34,472 INFO L85 PathProgramCache]: Analyzing trace with hash 274854138, now seen corresponding path program 1 times [2024-10-13 04:07:34,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:07:34,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508590365] [2024-10-13 04:07:34,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:07:34,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:07:34,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:34,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:07:34,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:34,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:07:34,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:34,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:07:34,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:34,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:07:34,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:34,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:07:34,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:34,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:07:34,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:34,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:07:34,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:34,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:07:34,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:34,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:07:34,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:34,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:07:34,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:34,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:07:34,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:34,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:07:34,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:34,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:07:34,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:34,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:07:34,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:34,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:07:34,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:34,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:07:34,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:34,557 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 04:07:34,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:07:34,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508590365] [2024-10-13 04:07:34,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508590365] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:07:34,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:07:34,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 04:07:34,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505325723] [2024-10-13 04:07:34,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:07:34,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 04:07:34,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:07:34,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 04:07:34,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 04:07:34,560 INFO L87 Difference]: Start difference. First operand 2501 states and 3421 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 04:07:34,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:07:34,777 INFO L93 Difference]: Finished difference Result 4706 states and 6443 transitions. [2024-10-13 04:07:34,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 04:07:34,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 114 [2024-10-13 04:07:34,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:07:34,790 INFO L225 Difference]: With dead ends: 4706 [2024-10-13 04:07:34,790 INFO L226 Difference]: Without dead ends: 2543 [2024-10-13 04:07:34,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 04:07:34,797 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 49 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:07:34,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 241 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:07:34,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2543 states. [2024-10-13 04:07:34,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2543 to 2063. [2024-10-13 04:07:34,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2063 states, 1851 states have (on average 1.3187466234467855) internal successors, (2441), 1866 states have internal predecessors, (2441), 174 states have call successors, (174), 37 states have call predecessors, (174), 37 states have return successors, (174), 159 states have call predecessors, (174), 174 states have call successors, (174) [2024-10-13 04:07:34,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2063 states to 2063 states and 2789 transitions. [2024-10-13 04:07:34,950 INFO L78 Accepts]: Start accepts. Automaton has 2063 states and 2789 transitions. Word has length 114 [2024-10-13 04:07:34,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:07:34,951 INFO L471 AbstractCegarLoop]: Abstraction has 2063 states and 2789 transitions. [2024-10-13 04:07:34,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 04:07:34,951 INFO L276 IsEmpty]: Start isEmpty. Operand 2063 states and 2789 transitions. [2024-10-13 04:07:34,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-13 04:07:34,954 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:07:34,954 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:07:34,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 04:07:34,954 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:07:34,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:07:34,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1421886056, now seen corresponding path program 1 times [2024-10-13 04:07:34,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:07:34,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606593289] [2024-10-13 04:07:34,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:07:34,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:07:34,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:35,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:07:35,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:35,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:07:35,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:35,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:07:35,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:35,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:07:35,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:35,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:07:35,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:35,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:07:35,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:35,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:07:35,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:35,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:07:35,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:35,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:07:35,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:35,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:07:35,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:35,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:07:35,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:35,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:07:35,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:35,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:07:35,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:35,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:07:35,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:35,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:07:35,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:35,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:07:35,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:35,380 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 04:07:35,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:07:35,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606593289] [2024-10-13 04:07:35,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606593289] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:07:35,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:07:35,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 04:07:35,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687858321] [2024-10-13 04:07:35,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:07:35,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 04:07:35,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:07:35,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 04:07:35,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-13 04:07:35,384 INFO L87 Difference]: Start difference. First operand 2063 states and 2789 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 04:07:35,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:07:35,849 INFO L93 Difference]: Finished difference Result 4117 states and 5595 transitions. [2024-10-13 04:07:35,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 04:07:35,850 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 115 [2024-10-13 04:07:35,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:07:35,860 INFO L225 Difference]: With dead ends: 4117 [2024-10-13 04:07:35,860 INFO L226 Difference]: Without dead ends: 2407 [2024-10-13 04:07:35,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2024-10-13 04:07:35,865 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 125 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 04:07:35,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 710 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 04:07:35,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2407 states. [2024-10-13 04:07:36,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2407 to 2083. [2024-10-13 04:07:36,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2083 states, 1871 states have (on average 1.3153393907001603) internal successors, (2461), 1886 states have internal predecessors, (2461), 174 states have call successors, (174), 37 states have call predecessors, (174), 37 states have return successors, (174), 159 states have call predecessors, (174), 174 states have call successors, (174) [2024-10-13 04:07:36,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2083 states to 2083 states and 2809 transitions. [2024-10-13 04:07:36,019 INFO L78 Accepts]: Start accepts. Automaton has 2083 states and 2809 transitions. Word has length 115 [2024-10-13 04:07:36,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:07:36,019 INFO L471 AbstractCegarLoop]: Abstraction has 2083 states and 2809 transitions. [2024-10-13 04:07:36,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 04:07:36,019 INFO L276 IsEmpty]: Start isEmpty. Operand 2083 states and 2809 transitions. [2024-10-13 04:07:36,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-13 04:07:36,021 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:07:36,021 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:07:36,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 04:07:36,022 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:07:36,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:07:36,023 INFO L85 PathProgramCache]: Analyzing trace with hash 303861893, now seen corresponding path program 1 times [2024-10-13 04:07:36,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:07:36,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161414568] [2024-10-13 04:07:36,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:07:36,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:07:36,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:36,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:07:36,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:36,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:07:36,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:36,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:07:36,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:36,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:07:36,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:36,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:07:36,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:36,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:07:36,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:36,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:07:36,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:36,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:07:36,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:36,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:07:36,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:36,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:07:36,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:36,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:07:36,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:36,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:07:36,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:36,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:07:36,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:36,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:07:36,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:36,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:07:36,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:36,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:07:36,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:36,852 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 04:07:36,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:07:36,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161414568] [2024-10-13 04:07:36,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161414568] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:07:36,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:07:36,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-13 04:07:36,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115151288] [2024-10-13 04:07:36,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:07:36,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 04:07:36,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:07:36,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 04:07:36,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-10-13 04:07:36,855 INFO L87 Difference]: Start difference. First operand 2083 states and 2809 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-13 04:07:37,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:07:37,733 INFO L93 Difference]: Finished difference Result 4103 states and 5574 transitions. [2024-10-13 04:07:37,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 04:07:37,735 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 115 [2024-10-13 04:07:37,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:07:37,744 INFO L225 Difference]: With dead ends: 4103 [2024-10-13 04:07:37,745 INFO L226 Difference]: Without dead ends: 2393 [2024-10-13 04:07:37,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2024-10-13 04:07:37,750 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 270 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 04:07:37,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 666 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 04:07:37,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2393 states. [2024-10-13 04:07:37,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2393 to 2093. [2024-10-13 04:07:37,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2093 states, 1881 states have (on average 1.3136629452418926) internal successors, (2471), 1896 states have internal predecessors, (2471), 174 states have call successors, (174), 37 states have call predecessors, (174), 37 states have return successors, (174), 159 states have call predecessors, (174), 174 states have call successors, (174) [2024-10-13 04:07:37,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2093 states to 2093 states and 2819 transitions. [2024-10-13 04:07:37,901 INFO L78 Accepts]: Start accepts. Automaton has 2093 states and 2819 transitions. Word has length 115 [2024-10-13 04:07:37,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:07:37,902 INFO L471 AbstractCegarLoop]: Abstraction has 2093 states and 2819 transitions. [2024-10-13 04:07:37,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-13 04:07:37,903 INFO L276 IsEmpty]: Start isEmpty. Operand 2093 states and 2819 transitions. [2024-10-13 04:07:37,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-13 04:07:37,905 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:07:37,905 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:07:37,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 04:07:37,906 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:07:37,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:07:37,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1042354037, now seen corresponding path program 1 times [2024-10-13 04:07:37,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:07:37,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5587771] [2024-10-13 04:07:37,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:07:37,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:07:37,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:38,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:07:38,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:38,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:07:38,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:38,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:07:38,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:38,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:07:38,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:38,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:07:38,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:38,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:07:38,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:38,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:07:38,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:38,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:07:38,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:38,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:07:38,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:38,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:07:38,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:38,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:07:38,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:38,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:07:38,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:38,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:07:38,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:38,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:07:38,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:38,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:07:38,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:38,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:07:38,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:38,118 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 75 proven. 9 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2024-10-13 04:07:38,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:07:38,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5587771] [2024-10-13 04:07:38,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5587771] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 04:07:38,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185969917] [2024-10-13 04:07:38,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:07:38,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:07:38,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:07:38,121 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 04:07:38,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 04:07:38,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:38,231 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 04:07:38,240 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:07:38,386 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 194 proven. 9 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2024-10-13 04:07:38,386 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 04:07:38,653 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 75 proven. 12 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2024-10-13 04:07:38,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185969917] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 04:07:38,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 04:07:38,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 12 [2024-10-13 04:07:38,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283355423] [2024-10-13 04:07:38,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 04:07:38,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 04:07:38,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:07:38,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 04:07:38,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-13 04:07:38,656 INFO L87 Difference]: Start difference. First operand 2093 states and 2819 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 3 states have call successors, (19), 3 states have call predecessors, (19), 7 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-10-13 04:07:39,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:07:39,037 INFO L93 Difference]: Finished difference Result 4242 states and 5671 transitions. [2024-10-13 04:07:39,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 04:07:39,038 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 3 states have call successors, (19), 3 states have call predecessors, (19), 7 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 115 [2024-10-13 04:07:39,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:07:39,049 INFO L225 Difference]: With dead ends: 4242 [2024-10-13 04:07:39,049 INFO L226 Difference]: Without dead ends: 2191 [2024-10-13 04:07:39,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 254 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2024-10-13 04:07:39,053 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 80 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 04:07:39,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 226 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 04:07:39,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2191 states. [2024-10-13 04:07:39,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2191 to 2125. [2024-10-13 04:07:39,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2125 states, 1905 states have (on average 1.2992125984251968) internal successors, (2475), 1920 states have internal predecessors, (2475), 174 states have call successors, (174), 45 states have call predecessors, (174), 45 states have return successors, (174), 159 states have call predecessors, (174), 174 states have call successors, (174) [2024-10-13 04:07:39,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2125 states to 2125 states and 2823 transitions. [2024-10-13 04:07:39,217 INFO L78 Accepts]: Start accepts. Automaton has 2125 states and 2823 transitions. Word has length 115 [2024-10-13 04:07:39,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:07:39,218 INFO L471 AbstractCegarLoop]: Abstraction has 2125 states and 2823 transitions. [2024-10-13 04:07:39,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 3 states have call successors, (19), 3 states have call predecessors, (19), 7 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-10-13 04:07:39,218 INFO L276 IsEmpty]: Start isEmpty. Operand 2125 states and 2823 transitions. [2024-10-13 04:07:39,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-13 04:07:39,220 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:07:39,220 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:07:39,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 04:07:39,421 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,SelfDestructingSolverStorable17 [2024-10-13 04:07:39,422 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:07:39,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:07:39,422 INFO L85 PathProgramCache]: Analyzing trace with hash 60671004, now seen corresponding path program 1 times [2024-10-13 04:07:39,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:07:39,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325907359] [2024-10-13 04:07:39,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:07:39,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:07:39,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 04:07:39,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [375648226] [2024-10-13 04:07:39,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:07:39,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:07:39,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:07:39,471 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 04:07:39,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 04:07:39,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 04:07:39,608 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 04:07:39,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 04:07:39,731 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 04:07:39,732 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 04:07:39,733 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 04:07:39,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 04:07:39,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:07:39,941 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:07:40,046 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 04:07:40,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 04:07:40 BoogieIcfgContainer [2024-10-13 04:07:40,050 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 04:07:40,051 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 04:07:40,052 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 04:07:40,052 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 04:07:40,052 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:07:16" (3/4) ... [2024-10-13 04:07:40,054 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 04:07:40,055 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 04:07:40,055 INFO L158 Benchmark]: Toolchain (without parser) took 24585.32ms. Allocated memory was 167.8MB in the beginning and 539.0MB in the end (delta: 371.2MB). Free memory was 108.5MB in the beginning and 278.1MB in the end (delta: -169.6MB). Peak memory consumption was 201.1MB. Max. memory is 16.1GB. [2024-10-13 04:07:40,055 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 96.5MB. Free memory was 50.6MB in the beginning and 50.6MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:07:40,056 INFO L158 Benchmark]: CACSL2BoogieTranslator took 389.78ms. Allocated memory is still 167.8MB. Free memory was 108.5MB in the beginning and 138.2MB in the end (delta: -29.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 04:07:40,056 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.48ms. Allocated memory is still 167.8MB. Free memory was 138.2MB in the beginning and 134.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 04:07:40,056 INFO L158 Benchmark]: Boogie Preprocessor took 90.23ms. Allocated memory is still 167.8MB. Free memory was 134.0MB in the beginning and 129.1MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 04:07:40,057 INFO L158 Benchmark]: RCFGBuilder took 574.09ms. Allocated memory is still 167.8MB. Free memory was 129.1MB in the beginning and 102.5MB in the end (delta: 26.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-13 04:07:40,057 INFO L158 Benchmark]: TraceAbstraction took 23448.05ms. Allocated memory was 167.8MB in the beginning and 539.0MB in the end (delta: 371.2MB). Free memory was 101.8MB in the beginning and 279.2MB in the end (delta: -177.4MB). Peak memory consumption was 196.3MB. Max. memory is 16.1GB. [2024-10-13 04:07:40,057 INFO L158 Benchmark]: Witness Printer took 3.37ms. Allocated memory is still 539.0MB. Free memory was 279.2MB in the beginning and 278.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:07:40,058 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.10ms. Allocated memory is still 96.5MB. Free memory was 50.6MB in the beginning and 50.6MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 389.78ms. Allocated memory is still 167.8MB. Free memory was 108.5MB in the beginning and 138.2MB in the end (delta: -29.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.48ms. Allocated memory is still 167.8MB. Free memory was 138.2MB in the beginning and 134.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 90.23ms. Allocated memory is still 167.8MB. Free memory was 134.0MB in the beginning and 129.1MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 574.09ms. Allocated memory is still 167.8MB. Free memory was 129.1MB in the beginning and 102.5MB in the end (delta: 26.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 23448.05ms. Allocated memory was 167.8MB in the beginning and 539.0MB in the end (delta: 371.2MB). Free memory was 101.8MB in the beginning and 279.2MB in the end (delta: -177.4MB). Peak memory consumption was 196.3MB. Max. memory is 16.1GB. * Witness Printer took 3.37ms. Allocated memory is still 539.0MB. Free memory was 279.2MB in the beginning and 278.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftLeft at line 90. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 0; [L23] unsigned short int var_1_3 = 128; [L24] unsigned short int var_1_4 = 4; [L25] unsigned short int var_1_5 = 0; [L26] signed short int var_1_6 = 0; [L27] unsigned char var_1_7 = 1; [L28] signed short int var_1_8 = -2; [L29] signed short int var_1_9 = 500; [L30] unsigned long int var_1_10 = 10; [L31] unsigned char var_1_11 = 2; [L32] unsigned char var_1_12 = 64; [L33] unsigned long int var_1_13 = 1; [L34] unsigned long int last_1_var_1_10 = 10; [L35] unsigned long int last_1_var_1_13 = 1; [L94] isInitial = 1 [L95] FCALL initially() [L96] int k_loop; [L97] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=128, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L97] COND TRUE k_loop < 1 [L98] CALL updateLastVariables() [L86] last_1_var_1_10 = var_1_10 [L87] last_1_var_1_13 = var_1_13 [L98] RET updateLastVariables() [L99] CALL updateVariables() [L60] var_1_3 = __VERIFIER_nondet_ushort() [L61] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L61] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L62] CALL assume_abort_if_not(var_1_3 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L62] RET assume_abort_if_not(var_1_3 <= 32767) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L63] var_1_4 = __VERIFIER_nondet_ushort() [L64] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L64] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L65] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L65] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L66] var_1_5 = __VERIFIER_nondet_ushort() [L67] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L67] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L68] CALL assume_abort_if_not(var_1_5 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L68] RET assume_abort_if_not(var_1_5 <= 65534) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L69] var_1_7 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_8=-2, var_1_9=500] [L70] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_8=-2, var_1_9=500] [L71] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L71] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L72] var_1_8 = __VERIFIER_nondet_short() [L73] CALL assume_abort_if_not(var_1_8 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=500] [L73] RET assume_abort_if_not(var_1_8 >= -16383) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=500] [L74] CALL assume_abort_if_not(var_1_8 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=500] [L74] RET assume_abort_if_not(var_1_8 <= 16383) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=500] [L75] var_1_9 = __VERIFIER_nondet_short() [L76] CALL assume_abort_if_not(var_1_9 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L76] RET assume_abort_if_not(var_1_9 >= -16383) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L77] CALL assume_abort_if_not(var_1_9 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L77] RET assume_abort_if_not(var_1_9 <= 16383) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L78] var_1_11 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=127, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=127, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L79] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=127, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L80] CALL assume_abort_if_not(var_1_11 <= 128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=127, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=127, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L80] RET assume_abort_if_not(var_1_11 <= 128) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=127, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L81] var_1_12 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_12 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=127, var_1_12=127, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=127, var_1_12=127, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L82] RET assume_abort_if_not(var_1_12 >= 1) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=127, var_1_12=127, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L83] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=127, var_1_12=127, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=127, var_1_12=127, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L83] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=127, var_1_12=127, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L99] RET updateVariables() [L100] CALL step() [L39] COND FALSE !(last_1_var_1_13 >= -50) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=127, var_1_12=127, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L42] EXPR var_1_11 & var_1_12 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=127, var_1_12=127, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L42] signed long int stepLocal_0 = var_1_11 & var_1_12; [L43] COND TRUE \read(var_1_7) [L44] var_1_13 = ((((var_1_11) > (var_1_1)) ? (var_1_11) : (var_1_1))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=127, var_1_10=10, var_1_11=127, var_1_12=127, var_1_13=127, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L50] COND TRUE \read(var_1_7) [L51] var_1_6 = (var_1_8 + var_1_9) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=127, var_1_10=10, var_1_11=127, var_1_12=127, var_1_13=127, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L53] EXPR last_1_var_1_10 >> var_1_1 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=127, var_1_10=10, var_1_11=127, var_1_12=127, var_1_13=127, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L53] EXPR var_1_8 << var_1_5 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=127, var_1_10=10, var_1_11=127, var_1_12=127, var_1_13=127, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L53] EXPR (last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=127, var_1_10=10, var_1_11=127, var_1_12=127, var_1_13=127, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L53] COND TRUE (var_1_6 / (var_1_11 + var_1_12)) != ((last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5)) [L54] var_1_10 = ((((var_1_12) < (var_1_4)) ? (var_1_12) : (var_1_4))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=127, var_1_10=0, var_1_11=127, var_1_12=127, var_1_13=127, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L100] RET step() [L101] CALL, EXPR property() [L90] EXPR (((last_1_var_1_13 >= -50) ? (var_1_1 == ((unsigned short int) (((((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) > (var_1_5)) ? ((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : (var_1_5))))) : 1) && (var_1_7 ? (var_1_6 == ((signed short int) (var_1_8 + var_1_9))) : 1)) && (((var_1_6 / (var_1_11 + var_1_12)) != ((last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5))) ? (var_1_10 == ((unsigned long int) ((((var_1_12) < (var_1_4)) ? (var_1_12) : (var_1_4))))) : (var_1_10 == ((unsigned long int) var_1_11))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=0, var_1_11=127, var_1_12=127, var_1_13=127, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L90] EXPR last_1_var_1_10 >> var_1_1 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=0, var_1_11=127, var_1_12=127, var_1_13=127, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L90] EXPR var_1_8 << var_1_5 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=0, var_1_11=127, var_1_12=127, var_1_13=127, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L90] EXPR (last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=0, var_1_11=127, var_1_12=127, var_1_13=127, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L90] EXPR (((last_1_var_1_13 >= -50) ? (var_1_1 == ((unsigned short int) (((((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) > (var_1_5)) ? ((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : (var_1_5))))) : 1) && (var_1_7 ? (var_1_6 == ((signed short int) (var_1_8 + var_1_9))) : 1)) && (((var_1_6 / (var_1_11 + var_1_12)) != ((last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5))) ? (var_1_10 == ((unsigned long int) ((((var_1_12) < (var_1_4)) ? (var_1_12) : (var_1_4))))) : (var_1_10 == ((unsigned long int) var_1_11))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=0, var_1_11=127, var_1_12=127, var_1_13=127, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L90] EXPR ((((last_1_var_1_13 >= -50) ? (var_1_1 == ((unsigned short int) (((((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) > (var_1_5)) ? ((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : (var_1_5))))) : 1) && (var_1_7 ? (var_1_6 == ((signed short int) (var_1_8 + var_1_9))) : 1)) && (((var_1_6 / (var_1_11 + var_1_12)) != ((last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5))) ? (var_1_10 == ((unsigned long int) ((((var_1_12) < (var_1_4)) ? (var_1_12) : (var_1_4))))) : (var_1_10 == ((unsigned long int) var_1_11)))) && (var_1_7 ? (var_1_13 == ((unsigned long int) ((((var_1_11) > (var_1_1)) ? (var_1_11) : (var_1_1))))) : (((var_1_11 & var_1_12) != var_1_1) ? (var_1_13 == ((unsigned long int) var_1_12)) : 1)) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=0, var_1_11=127, var_1_12=127, var_1_13=127, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L90-L91] return ((((last_1_var_1_13 >= -50) ? (var_1_1 == ((unsigned short int) (((((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) > (var_1_5)) ? ((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : (var_1_5))))) : 1) && (var_1_7 ? (var_1_6 == ((signed short int) (var_1_8 + var_1_9))) : 1)) && (((var_1_6 / (var_1_11 + var_1_12)) != ((last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5))) ? (var_1_10 == ((unsigned long int) ((((var_1_12) < (var_1_4)) ? (var_1_12) : (var_1_4))))) : (var_1_10 == ((unsigned long int) var_1_11)))) && (var_1_7 ? (var_1_13 == ((unsigned long int) ((((var_1_11) > (var_1_1)) ? (var_1_11) : (var_1_1))))) : (((var_1_11 & var_1_12) != var_1_1) ? (var_1_13 == ((unsigned long int) var_1_12)) : 1)) ; [L101] RET, EXPR property() [L101] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=0, var_1_11=127, var_1_12=127, var_1_13=127, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=0, var_1_11=127, var_1_12=127, var_1_13=127, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 73 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.3s, OverallIterations: 19, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 10.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1824 SdHoareTripleChecker+Valid, 6.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1811 mSDsluCounter, 8067 SdHoareTripleChecker+Invalid, 6.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6077 mSDsCounter, 383 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3066 IncrementalHoareTripleChecker+Invalid, 3449 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 383 mSolverCounterUnsat, 1990 mSDtfsCounter, 3066 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 994 GetRequests, 858 SyntacticMatches, 2 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2501occurred in iteration=14, InterpolantAutomatonStates: 123, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 18 MinimizatonAttempts, 1918 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 2355 NumberOfCodeBlocks, 2355 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 2218 ConstructedInterpolants, 0 QuantifiedInterpolants, 9054 SizeOfPredicates, 1 NumberOfNonLiveVariables, 262 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 20 InterpolantComputations, 17 PerfectInterpolantSequences, 9570/9600 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 04:07:40,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-32.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 d4efba5d8035d5b89a6fee2af18255a7435db1834e066c2b81c99247161e78c7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:07:42,276 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:07:42,353 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 04:07:42,358 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:07:42,358 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:07:42,387 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:07:42,387 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:07:42,388 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:07:42,388 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:07:42,388 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:07:42,389 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:07:42,389 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:07:42,390 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:07:42,390 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:07:42,390 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:07:42,391 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:07:42,391 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:07:42,391 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:07:42,391 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:07:42,392 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:07:42,392 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:07:42,395 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:07:42,396 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:07:42,396 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 04:07:42,396 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 04:07:42,396 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:07:42,397 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 04:07:42,397 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:07:42,397 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:07:42,397 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:07:42,398 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:07:42,398 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:07:42,398 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:07:42,398 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:07:42,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:07:42,411 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:07:42,411 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:07:42,411 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:07:42,411 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 04:07:42,412 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 04:07:42,412 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:07:42,414 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:07:42,415 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:07:42,415 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:07:42,415 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 04:07:42,416 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 -> d4efba5d8035d5b89a6fee2af18255a7435db1834e066c2b81c99247161e78c7 [2024-10-13 04:07:42,732 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:07:42,751 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:07:42,755 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:07:42,756 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:07:42,757 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:07:42,759 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-32.i [2024-10-13 04:07:44,274 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:07:44,473 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:07:44,474 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-32.i [2024-10-13 04:07:44,483 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da64b04ef/7fed985bdf09440bb336290a0517ab6a/FLAG94ec50740 [2024-10-13 04:07:44,500 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da64b04ef/7fed985bdf09440bb336290a0517ab6a [2024-10-13 04:07:44,502 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:07:44,504 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:07:44,505 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:07:44,505 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:07:44,511 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:07:44,512 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:07:44" (1/1) ... [2024-10-13 04:07:44,513 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d928d74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:07:44, skipping insertion in model container [2024-10-13 04:07:44,513 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:07:44" (1/1) ... [2024-10-13 04:07:44,540 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:07:44,738 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_loopvsstraightlinecode_25-1loop_file-32.i[915,928] [2024-10-13 04:07:44,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:07:44,817 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:07:44,833 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_loopvsstraightlinecode_25-1loop_file-32.i[915,928] [2024-10-13 04:07:44,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:07:44,885 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:07:44,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:07:44 WrapperNode [2024-10-13 04:07:44,886 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:07:44,887 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:07:44,887 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:07:44,887 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:07:44,893 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:07:44" (1/1) ... [2024-10-13 04:07:44,909 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:07:44" (1/1) ... [2024-10-13 04:07:44,943 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2024-10-13 04:07:44,943 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:07:44,944 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:07:44,944 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:07:44,944 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:07:44,956 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:07:44" (1/1) ... [2024-10-13 04:07:44,956 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:07:44" (1/1) ... [2024-10-13 04:07:44,961 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:07:44" (1/1) ... [2024-10-13 04:07:44,980 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 04:07:44,981 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:07:44" (1/1) ... [2024-10-13 04:07:44,981 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:07:44" (1/1) ... [2024-10-13 04:07:44,993 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:07:44" (1/1) ... [2024-10-13 04:07:44,996 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:07:44" (1/1) ... [2024-10-13 04:07:45,000 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:07:44" (1/1) ... [2024-10-13 04:07:45,004 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:07:44" (1/1) ... [2024-10-13 04:07:45,007 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:07:45,012 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:07:45,012 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:07:45,012 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:07:45,013 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:07:44" (1/1) ... [2024-10-13 04:07:45,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:07:45,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:07:45,049 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 04:07:45,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 04:07:45,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:07:45,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 04:07:45,096 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:07:45,096 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:07:45,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:07:45,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:07:45,171 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:07:45,173 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:07:45,493 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-10-13 04:07:45,494 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:07:45,552 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:07:45,553 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:07:45,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:07:45 BoogieIcfgContainer [2024-10-13 04:07:45,554 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:07:45,556 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:07:45,556 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:07:45,560 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:07:45,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:07:44" (1/3) ... [2024-10-13 04:07:45,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69786bae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:07:45, skipping insertion in model container [2024-10-13 04:07:45,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:07:44" (2/3) ... [2024-10-13 04:07:45,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69786bae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:07:45, skipping insertion in model container [2024-10-13 04:07:45,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:07:45" (3/3) ... [2024-10-13 04:07:45,562 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-32.i [2024-10-13 04:07:45,594 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:07:45,595 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:07:45,660 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:07:45,667 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;@690e21cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:07:45,667 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:07:45,671 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 25 states have internal predecessors, (34), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 04:07:45,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 04:07:45,681 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:07:45,682 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:07:45,683 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:07:45,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:07:45,688 INFO L85 PathProgramCache]: Analyzing trace with hash 658397701, now seen corresponding path program 1 times [2024-10-13 04:07:45,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:07:45,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1350476036] [2024-10-13 04:07:45,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:07:45,706 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:07:45,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:07:45,709 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 04:07:45,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 04:07:45,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:45,871 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 04:07:45,880 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:07:45,931 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-10-13 04:07:45,932 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 04:07:45,933 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:07:45,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1350476036] [2024-10-13 04:07:45,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1350476036] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:07:45,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:07:45,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 04:07:45,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121937043] [2024-10-13 04:07:45,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:07:45,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 04:07:45,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 04:07:45,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 04:07:45,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:07:45,969 INFO L87 Difference]: Start difference. First operand has 43 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 25 states have internal predecessors, (34), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 04:07:46,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:07:46,029 INFO L93 Difference]: Finished difference Result 85 states and 147 transitions. [2024-10-13 04:07:46,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 04:07:46,032 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) Word has length 98 [2024-10-13 04:07:46,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:07:46,039 INFO L225 Difference]: With dead ends: 85 [2024-10-13 04:07:46,039 INFO L226 Difference]: Without dead ends: 41 [2024-10-13 04:07:46,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:07:46,047 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:07:46,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:07:46,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-13 04:07:46,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-13 04:07:46,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 04:07:46,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 61 transitions. [2024-10-13 04:07:46,093 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 61 transitions. Word has length 98 [2024-10-13 04:07:46,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:07:46,094 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 61 transitions. [2024-10-13 04:07:46,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 04:07:46,095 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 61 transitions. [2024-10-13 04:07:46,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 04:07:46,102 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:07:46,102 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:07:46,110 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-13 04:07:46,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:07:46,307 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:07:46,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:07:46,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1731495419, now seen corresponding path program 1 times [2024-10-13 04:07:46,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:07:46,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1297181693] [2024-10-13 04:07:46,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:07:46,309 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:07:46,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:07:46,313 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 04:07:46,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 04:07:46,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:46,467 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 04:07:46,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:07:46,759 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 04:07:46,759 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 04:07:46,760 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:07:46,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1297181693] [2024-10-13 04:07:46,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1297181693] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:07:46,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:07:46,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 04:07:46,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020267275] [2024-10-13 04:07:46,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:07:46,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 04:07:46,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 04:07:46,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 04:07:46,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 04:07:46,766 INFO L87 Difference]: Start difference. First operand 41 states and 61 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 04:07:46,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:07:46,933 INFO L93 Difference]: Finished difference Result 129 states and 191 transitions. [2024-10-13 04:07:46,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 04:07:46,934 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 98 [2024-10-13 04:07:46,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:07:46,938 INFO L225 Difference]: With dead ends: 129 [2024-10-13 04:07:46,940 INFO L226 Difference]: Without dead ends: 89 [2024-10-13 04:07:46,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 04:07:46,956 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 40 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 04:07:46,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 173 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 04:07:46,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-13 04:07:46,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 79. [2024-10-13 04:07:46,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 04:07:46,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 119 transitions. [2024-10-13 04:07:46,991 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 119 transitions. Word has length 98 [2024-10-13 04:07:46,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:07:46,991 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 119 transitions. [2024-10-13 04:07:46,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 04:07:46,992 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 119 transitions. [2024-10-13 04:07:46,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 04:07:46,994 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:07:46,994 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:07:47,003 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 (3)] Ended with exit code 0 [2024-10-13 04:07:47,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:07:47,202 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:07:47,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:07:47,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1754125251, now seen corresponding path program 1 times [2024-10-13 04:07:47,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:07:47,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1644374309] [2024-10-13 04:07:47,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:07:47,204 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:07:47,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:07:47,209 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 04:07:47,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 04:07:47,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:47,324 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 04:07:47,330 INFO L278 TraceCheckSpWp]: Computing forward predicates...