./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.07.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.07.cil.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 022987cd4c8c671e376c5c3e5a08e2f1b98444b4d5d48bc73787bff74aa0de0f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:15:33,591 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:15:33,643 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:15:33,648 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:15:33,649 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:15:33,671 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:15:33,671 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:15:33,672 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:15:33,672 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:15:33,674 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:15:33,674 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:15:33,674 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:15:33,675 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:15:33,677 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:15:33,678 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:15:33,678 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:15:33,678 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:15:33,678 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:15:33,678 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:15:33,679 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:15:33,679 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:15:33,679 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:15:33,679 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:15:33,680 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:15:33,680 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:15:33,681 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:15:33,681 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:15:33,681 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:15:33,681 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:15:33,682 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:15:33,682 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:15:33,682 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:15:33,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:15:33,683 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:15:33,683 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:15:33,683 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:15:33,684 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:15:33,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:15:33,684 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:15:33,684 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:15:33,685 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:15:33,685 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:15:33,685 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 022987cd4c8c671e376c5c3e5a08e2f1b98444b4d5d48bc73787bff74aa0de0f [2024-10-11 03:15:33,905 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:15:33,926 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:15:33,928 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:15:33,929 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:15:33,930 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:15:33,931 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.07.cil.c [2024-10-11 03:15:35,220 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:15:35,392 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:15:35,394 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.07.cil.c [2024-10-11 03:15:35,404 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0ce3494eb/d76d88443da04716aeec21cc32740c83/FLAGa36dbae00 [2024-10-11 03:15:35,420 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0ce3494eb/d76d88443da04716aeec21cc32740c83 [2024-10-11 03:15:35,422 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:15:35,425 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:15:35,429 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:15:35,430 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:15:35,438 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:15:35,439 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:15:35" (1/1) ... [2024-10-11 03:15:35,440 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@622b1003 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:15:35, skipping insertion in model container [2024-10-11 03:15:35,440 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:15:35" (1/1) ... [2024-10-11 03:15:35,478 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:15:35,621 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/systemc/transmitter.07.cil.c[706,719] [2024-10-11 03:15:35,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:15:35,780 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:15:35,791 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/systemc/transmitter.07.cil.c[706,719] [2024-10-11 03:15:35,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:15:35,846 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:15:35,846 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:15:35 WrapperNode [2024-10-11 03:15:35,846 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:15:35,847 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:15:35,850 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:15:35,850 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:15:35,855 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:15:35" (1/1) ... [2024-10-11 03:15:35,867 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:15:35" (1/1) ... [2024-10-11 03:15:35,899 INFO L138 Inliner]: procedures = 42, calls = 51, calls flagged for inlining = 26, calls inlined = 26, statements flattened = 564 [2024-10-11 03:15:35,899 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:15:35,900 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:15:35,900 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:15:35,900 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:15:35,909 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:15:35" (1/1) ... [2024-10-11 03:15:35,909 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:15:35" (1/1) ... [2024-10-11 03:15:35,912 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:15:35" (1/1) ... [2024-10-11 03:15:35,931 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 03:15:35,931 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:15:35" (1/1) ... [2024-10-11 03:15:35,931 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:15:35" (1/1) ... [2024-10-11 03:15:35,937 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:15:35" (1/1) ... [2024-10-11 03:15:35,954 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:15:35" (1/1) ... [2024-10-11 03:15:35,956 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:15:35" (1/1) ... [2024-10-11 03:15:35,961 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:15:35" (1/1) ... [2024-10-11 03:15:35,964 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:15:35,964 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:15:35,965 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:15:35,965 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:15:35,975 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:15:35" (1/1) ... [2024-10-11 03:15:35,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:15:35,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:15:36,014 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 03:15:36,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 03:15:36,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:15:36,059 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-11 03:15:36,060 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-11 03:15:36,060 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-11 03:15:36,060 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-11 03:15:36,060 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 03:15:36,061 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 03:15:36,061 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-11 03:15:36,062 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-11 03:15:36,062 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-11 03:15:36,063 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-11 03:15:36,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:15:36,063 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-11 03:15:36,063 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-11 03:15:36,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:15:36,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:15:36,142 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:15:36,144 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:15:36,629 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2024-10-11 03:15:36,629 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:15:36,680 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:15:36,681 INFO L314 CfgBuilder]: Removed 11 assume(true) statements. [2024-10-11 03:15:36,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:15:36 BoogieIcfgContainer [2024-10-11 03:15:36,681 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:15:36,684 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:15:36,684 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:15:36,687 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:15:36,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:15:35" (1/3) ... [2024-10-11 03:15:36,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c33a219 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:15:36, skipping insertion in model container [2024-10-11 03:15:36,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:15:35" (2/3) ... [2024-10-11 03:15:36,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c33a219 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:15:36, skipping insertion in model container [2024-10-11 03:15:36,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:15:36" (3/3) ... [2024-10-11 03:15:36,689 INFO L112 eAbstractionObserver]: Analyzing ICFG transmitter.07.cil.c [2024-10-11 03:15:36,701 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:15:36,701 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:15:36,759 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:15:36,764 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;@2c4ced95, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:15:36,765 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:15:36,769 INFO L276 IsEmpty]: Start isEmpty. Operand has 228 states, 200 states have (on average 1.72) internal successors, (344), 202 states have internal predecessors, (344), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 03:15:36,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 03:15:36,779 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:36,779 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:15:36,780 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:36,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:36,784 INFO L85 PathProgramCache]: Analyzing trace with hash -934557041, now seen corresponding path program 1 times [2024-10-11 03:15:36,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:36,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830741801] [2024-10-11 03:15:36,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:36,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:36,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:37,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:15:37,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:37,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:15:37,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:37,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 03:15:37,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:37,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 03:15:37,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:37,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 03:15:37,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:37,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:15:37,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:37,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830741801] [2024-10-11 03:15:37,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830741801] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:37,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:37,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:15:37,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554218032] [2024-10-11 03:15:37,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:37,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:15:37,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:37,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:15:37,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:15:37,322 INFO L87 Difference]: Start difference. First operand has 228 states, 200 states have (on average 1.72) internal successors, (344), 202 states have internal predecessors, (344), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:15:38,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:38,361 INFO L93 Difference]: Finished difference Result 526 states and 892 transitions. [2024-10-11 03:15:38,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:15:38,363 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 114 [2024-10-11 03:15:38,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:38,374 INFO L225 Difference]: With dead ends: 526 [2024-10-11 03:15:38,374 INFO L226 Difference]: Without dead ends: 304 [2024-10-11 03:15:38,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:15:38,382 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 605 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:38,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 406 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 03:15:38,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-10-11 03:15:38,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 226. [2024-10-11 03:15:38,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 199 states have (on average 1.5979899497487438) internal successors, (318), 200 states have internal predecessors, (318), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 03:15:38,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 358 transitions. [2024-10-11 03:15:38,450 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 358 transitions. Word has length 114 [2024-10-11 03:15:38,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:38,451 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 358 transitions. [2024-10-11 03:15:38,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:15:38,451 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 358 transitions. [2024-10-11 03:15:38,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 03:15:38,455 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:38,455 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:15:38,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:15:38,456 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:38,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:38,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1052998515, now seen corresponding path program 1 times [2024-10-11 03:15:38,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:38,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719219825] [2024-10-11 03:15:38,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:38,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:38,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:38,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:15:38,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:38,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:15:38,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:38,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 03:15:38,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:38,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 03:15:38,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:38,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 03:15:38,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:38,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:15:38,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:38,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719219825] [2024-10-11 03:15:38,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719219825] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:38,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:38,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:15:38,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237326683] [2024-10-11 03:15:38,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:38,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:15:38,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:38,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:15:38,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:15:38,747 INFO L87 Difference]: Start difference. First operand 226 states and 358 transitions. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:15:40,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:40,200 INFO L93 Difference]: Finished difference Result 816 states and 1332 transitions. [2024-10-11 03:15:40,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 03:15:40,200 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 114 [2024-10-11 03:15:40,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:40,204 INFO L225 Difference]: With dead ends: 816 [2024-10-11 03:15:40,204 INFO L226 Difference]: Without dead ends: 603 [2024-10-11 03:15:40,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:15:40,206 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 911 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 1485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:40,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 678 Invalid, 1485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1400 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 03:15:40,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2024-10-11 03:15:40,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 448. [2024-10-11 03:15:40,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 399 states have (on average 1.6040100250626566) internal successors, (640), 401 states have internal predecessors, (640), 35 states have call successors, (35), 12 states have call predecessors, (35), 13 states have return successors, (38), 35 states have call predecessors, (38), 35 states have call successors, (38) [2024-10-11 03:15:40,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 713 transitions. [2024-10-11 03:15:40,261 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 713 transitions. Word has length 114 [2024-10-11 03:15:40,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:40,262 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 713 transitions. [2024-10-11 03:15:40,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:15:40,262 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 713 transitions. [2024-10-11 03:15:40,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 03:15:40,264 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:40,264 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:15:40,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:15:40,264 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:40,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:40,265 INFO L85 PathProgramCache]: Analyzing trace with hash -34389012, now seen corresponding path program 1 times [2024-10-11 03:15:40,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:40,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907857805] [2024-10-11 03:15:40,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:40,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:40,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:40,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:15:40,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:40,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:15:40,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:40,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 03:15:40,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:40,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 03:15:40,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:40,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 03:15:40,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:40,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:15:40,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:40,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907857805] [2024-10-11 03:15:40,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907857805] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:40,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:40,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:15:40,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943366329] [2024-10-11 03:15:40,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:40,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:15:40,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:40,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:15:40,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:15:40,494 INFO L87 Difference]: Start difference. First operand 448 states and 713 transitions. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:15:42,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:42,722 INFO L93 Difference]: Finished difference Result 1442 states and 2333 transitions. [2024-10-11 03:15:42,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 03:15:42,724 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 114 [2024-10-11 03:15:42,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:42,729 INFO L225 Difference]: With dead ends: 1442 [2024-10-11 03:15:42,730 INFO L226 Difference]: Without dead ends: 1007 [2024-10-11 03:15:42,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:15:42,732 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 998 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 2841 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1011 SdHoareTripleChecker+Valid, 1293 SdHoareTripleChecker+Invalid, 2893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 2841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:42,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1011 Valid, 1293 Invalid, 2893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 2841 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 03:15:42,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2024-10-11 03:15:42,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 655. [2024-10-11 03:15:42,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 584 states have (on average 1.595890410958904) internal successors, (932), 587 states have internal predecessors, (932), 50 states have call successors, (50), 18 states have call predecessors, (50), 20 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2024-10-11 03:15:42,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1037 transitions. [2024-10-11 03:15:42,801 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1037 transitions. Word has length 114 [2024-10-11 03:15:42,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:42,802 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 1037 transitions. [2024-10-11 03:15:42,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:15:42,802 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1037 transitions. [2024-10-11 03:15:42,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 03:15:42,806 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:42,806 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:15:42,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:15:42,807 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:42,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:42,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1566682094, now seen corresponding path program 1 times [2024-10-11 03:15:42,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:42,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590578012] [2024-10-11 03:15:42,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:42,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:42,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:42,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:15:42,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:42,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:15:42,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:42,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 03:15:42,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:42,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 03:15:42,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:42,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 03:15:42,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:42,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:15:42,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:42,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590578012] [2024-10-11 03:15:42,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590578012] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:42,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:42,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:15:42,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649301015] [2024-10-11 03:15:42,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:42,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:15:42,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:42,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:15:42,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:15:42,987 INFO L87 Difference]: Start difference. First operand 655 states and 1037 transitions. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:15:43,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:43,793 INFO L93 Difference]: Finished difference Result 1562 states and 2522 transitions. [2024-10-11 03:15:43,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:15:43,793 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 114 [2024-10-11 03:15:43,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:43,799 INFO L225 Difference]: With dead ends: 1562 [2024-10-11 03:15:43,799 INFO L226 Difference]: Without dead ends: 920 [2024-10-11 03:15:43,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:15:43,803 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 766 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 1115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:43,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 545 Invalid, 1115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 03:15:43,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2024-10-11 03:15:43,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 655. [2024-10-11 03:15:43,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 584 states have (on average 1.5907534246575343) internal successors, (929), 587 states have internal predecessors, (929), 50 states have call successors, (50), 18 states have call predecessors, (50), 20 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2024-10-11 03:15:43,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1034 transitions. [2024-10-11 03:15:43,844 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1034 transitions. Word has length 114 [2024-10-11 03:15:43,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:43,844 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 1034 transitions. [2024-10-11 03:15:43,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:15:43,844 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1034 transitions. [2024-10-11 03:15:43,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 03:15:43,845 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:43,846 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:15:43,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:15:43,846 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:43,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:43,847 INFO L85 PathProgramCache]: Analyzing trace with hash 509950892, now seen corresponding path program 1 times [2024-10-11 03:15:43,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:43,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378866560] [2024-10-11 03:15:43,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:43,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:43,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:43,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:15:43,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:43,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:15:43,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:43,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 03:15:43,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:43,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 03:15:43,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:43,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 03:15:43,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:43,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:15:43,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:43,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378866560] [2024-10-11 03:15:43,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378866560] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:43,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:43,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:15:43,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250449223] [2024-10-11 03:15:43,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:43,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:15:43,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:43,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:15:43,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:15:43,988 INFO L87 Difference]: Start difference. First operand 655 states and 1034 transitions. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:15:44,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:44,769 INFO L93 Difference]: Finished difference Result 1558 states and 2505 transitions. [2024-10-11 03:15:44,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:15:44,773 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 114 [2024-10-11 03:15:44,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:44,779 INFO L225 Difference]: With dead ends: 1558 [2024-10-11 03:15:44,779 INFO L226 Difference]: Without dead ends: 916 [2024-10-11 03:15:44,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:15:44,781 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 764 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 778 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 1101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:44,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [778 Valid, 545 Invalid, 1101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1027 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 03:15:44,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2024-10-11 03:15:44,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 655. [2024-10-11 03:15:44,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 584 states have (on average 1.5856164383561644) internal successors, (926), 587 states have internal predecessors, (926), 50 states have call successors, (50), 18 states have call predecessors, (50), 20 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2024-10-11 03:15:44,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1031 transitions. [2024-10-11 03:15:44,818 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1031 transitions. Word has length 114 [2024-10-11 03:15:44,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:44,818 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 1031 transitions. [2024-10-11 03:15:44,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:15:44,819 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1031 transitions. [2024-10-11 03:15:44,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 03:15:44,820 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:44,820 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:15:44,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:15:44,820 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:44,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:44,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1861336110, now seen corresponding path program 1 times [2024-10-11 03:15:44,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:44,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823261448] [2024-10-11 03:15:44,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:44,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:44,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:44,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:15:44,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:44,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:15:44,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:44,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 03:15:44,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:44,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 03:15:44,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:44,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 03:15:44,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:44,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:15:44,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:44,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823261448] [2024-10-11 03:15:44,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823261448] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:44,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:44,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:15:44,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480798996] [2024-10-11 03:15:44,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:44,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:15:44,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:44,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:15:44,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:15:44,981 INFO L87 Difference]: Start difference. First operand 655 states and 1031 transitions. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:15:45,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:45,697 INFO L93 Difference]: Finished difference Result 1554 states and 2488 transitions. [2024-10-11 03:15:45,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:15:45,697 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 114 [2024-10-11 03:15:45,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:45,702 INFO L225 Difference]: With dead ends: 1554 [2024-10-11 03:15:45,702 INFO L226 Difference]: Without dead ends: 912 [2024-10-11 03:15:45,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:15:45,707 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 762 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 1087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:45,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [776 Valid, 545 Invalid, 1087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1013 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 03:15:45,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2024-10-11 03:15:45,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 655. [2024-10-11 03:15:45,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 584 states have (on average 1.5804794520547945) internal successors, (923), 587 states have internal predecessors, (923), 50 states have call successors, (50), 18 states have call predecessors, (50), 20 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2024-10-11 03:15:45,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1028 transitions. [2024-10-11 03:15:45,750 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1028 transitions. Word has length 114 [2024-10-11 03:15:45,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:45,750 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 1028 transitions. [2024-10-11 03:15:45,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:15:45,751 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1028 transitions. [2024-10-11 03:15:45,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 03:15:45,752 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:45,752 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:15:45,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:15:45,752 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:45,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:45,752 INFO L85 PathProgramCache]: Analyzing trace with hash 242361196, now seen corresponding path program 1 times [2024-10-11 03:15:45,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:45,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100507623] [2024-10-11 03:15:45,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:45,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:45,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:45,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:15:45,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:45,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:15:45,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:45,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 03:15:45,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:45,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 03:15:45,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:45,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 03:15:45,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:45,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:15:45,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:45,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100507623] [2024-10-11 03:15:45,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100507623] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:45,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:45,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:15:45,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956338632] [2024-10-11 03:15:45,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:45,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:15:45,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:45,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:15:45,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:15:45,940 INFO L87 Difference]: Start difference. First operand 655 states and 1028 transitions. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:15:47,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:47,699 INFO L93 Difference]: Finished difference Result 2209 states and 3515 transitions. [2024-10-11 03:15:47,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 03:15:47,700 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 114 [2024-10-11 03:15:47,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:47,706 INFO L225 Difference]: With dead ends: 2209 [2024-10-11 03:15:47,706 INFO L226 Difference]: Without dead ends: 1567 [2024-10-11 03:15:47,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:15:47,710 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 972 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 2741 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 985 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 2795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:47,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [985 Valid, 1291 Invalid, 2795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2741 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 03:15:47,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2024-10-11 03:15:47,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1081. [2024-10-11 03:15:47,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1081 states, 966 states have (on average 1.5714285714285714) internal successors, (1518), 971 states have internal predecessors, (1518), 80 states have call successors, (80), 30 states have call predecessors, (80), 34 states have return successors, (93), 83 states have call predecessors, (93), 80 states have call successors, (93) [2024-10-11 03:15:47,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1691 transitions. [2024-10-11 03:15:47,776 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1691 transitions. Word has length 114 [2024-10-11 03:15:47,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:47,779 INFO L471 AbstractCegarLoop]: Abstraction has 1081 states and 1691 transitions. [2024-10-11 03:15:47,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:15:47,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1691 transitions. [2024-10-11 03:15:47,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 03:15:47,782 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:47,783 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:15:47,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:15:47,783 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:47,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:47,783 INFO L85 PathProgramCache]: Analyzing trace with hash -641147794, now seen corresponding path program 1 times [2024-10-11 03:15:47,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:47,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048111858] [2024-10-11 03:15:47,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:47,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:47,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:47,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:15:47,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:47,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:15:47,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:47,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 03:15:47,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:47,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 03:15:47,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:47,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 03:15:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:47,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:15:47,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:47,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048111858] [2024-10-11 03:15:47,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048111858] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:47,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:47,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:15:47,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845397843] [2024-10-11 03:15:47,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:47,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:15:47,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:47,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:15:47,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:15:47,946 INFO L87 Difference]: Start difference. First operand 1081 states and 1691 transitions. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:15:48,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:48,852 INFO L93 Difference]: Finished difference Result 2528 states and 4013 transitions. [2024-10-11 03:15:48,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:15:48,852 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 114 [2024-10-11 03:15:48,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:48,859 INFO L225 Difference]: With dead ends: 2528 [2024-10-11 03:15:48,860 INFO L226 Difference]: Without dead ends: 1460 [2024-10-11 03:15:48,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:15:48,864 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 694 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 708 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 1103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:48,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [708 Valid, 650 Invalid, 1103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1048 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 03:15:48,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2024-10-11 03:15:48,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 1081. [2024-10-11 03:15:48,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1081 states, 966 states have (on average 1.5662525879917184) internal successors, (1513), 971 states have internal predecessors, (1513), 80 states have call successors, (80), 30 states have call predecessors, (80), 34 states have return successors, (93), 83 states have call predecessors, (93), 80 states have call successors, (93) [2024-10-11 03:15:48,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1686 transitions. [2024-10-11 03:15:48,925 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1686 transitions. Word has length 114 [2024-10-11 03:15:48,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:48,925 INFO L471 AbstractCegarLoop]: Abstraction has 1081 states and 1686 transitions. [2024-10-11 03:15:48,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:15:48,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1686 transitions. [2024-10-11 03:15:48,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 03:15:48,927 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:48,928 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:15:48,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:15:48,928 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:48,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:48,928 INFO L85 PathProgramCache]: Analyzing trace with hash -669648084, now seen corresponding path program 1 times [2024-10-11 03:15:48,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:48,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518479117] [2024-10-11 03:15:48,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:48,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:48,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:48,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:15:48,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:49,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:15:49,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:49,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 03:15:49,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:49,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 03:15:49,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:49,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 03:15:49,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:49,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:15:49,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:49,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518479117] [2024-10-11 03:15:49,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518479117] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:49,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:49,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:15:49,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327042991] [2024-10-11 03:15:49,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:49,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:15:49,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:49,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:15:49,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:15:49,066 INFO L87 Difference]: Start difference. First operand 1081 states and 1686 transitions. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:15:51,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:51,087 INFO L93 Difference]: Finished difference Result 4039 states and 6376 transitions. [2024-10-11 03:15:51,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 03:15:51,088 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 114 [2024-10-11 03:15:51,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:51,103 INFO L225 Difference]: With dead ends: 4039 [2024-10-11 03:15:51,103 INFO L226 Difference]: Without dead ends: 2971 [2024-10-11 03:15:51,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:15:51,109 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 1026 mSDsluCounter, 971 mSDsCounter, 0 mSdLazyCounter, 2712 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 2768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:51,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1038 Valid, 1270 Invalid, 2768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2712 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 03:15:51,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2971 states. [2024-10-11 03:15:51,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2971 to 1923. [2024-10-11 03:15:51,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1923 states, 1724 states have (on average 1.5597447795823667) internal successors, (2689), 1733 states have internal predecessors, (2689), 136 states have call successors, (136), 54 states have call predecessors, (136), 62 states have return successors, (171), 143 states have call predecessors, (171), 136 states have call successors, (171) [2024-10-11 03:15:51,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1923 states to 1923 states and 2996 transitions. [2024-10-11 03:15:51,229 INFO L78 Accepts]: Start accepts. Automaton has 1923 states and 2996 transitions. Word has length 114 [2024-10-11 03:15:51,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:51,229 INFO L471 AbstractCegarLoop]: Abstraction has 1923 states and 2996 transitions. [2024-10-11 03:15:51,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:15:51,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1923 states and 2996 transitions. [2024-10-11 03:15:51,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 03:15:51,231 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:51,232 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:15:51,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:15:51,232 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:51,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:51,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1684737198, now seen corresponding path program 1 times [2024-10-11 03:15:51,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:51,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306528024] [2024-10-11 03:15:51,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:51,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:51,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:51,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:15:51,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:51,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:15:51,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:51,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 03:15:51,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:51,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 03:15:51,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:51,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 03:15:51,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:51,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:15:51,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:51,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306528024] [2024-10-11 03:15:51,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306528024] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:51,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:51,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:15:51,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571239063] [2024-10-11 03:15:51,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:51,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:15:51,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:51,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:15:51,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:15:51,373 INFO L87 Difference]: Start difference. First operand 1923 states and 2996 transitions. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:15:53,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:53,292 INFO L93 Difference]: Finished difference Result 7141 states and 11260 transitions. [2024-10-11 03:15:53,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 03:15:53,293 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 114 [2024-10-11 03:15:53,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:53,314 INFO L225 Difference]: With dead ends: 7141 [2024-10-11 03:15:53,315 INFO L226 Difference]: Without dead ends: 5231 [2024-10-11 03:15:53,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:15:53,322 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 1119 mSDsluCounter, 971 mSDsCounter, 0 mSdLazyCounter, 2390 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1139 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 2447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:53,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1139 Valid, 1270 Invalid, 2447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2390 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 03:15:53,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5231 states. [2024-10-11 03:15:53,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5231 to 3617. [2024-10-11 03:15:53,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3617 states, 3254 states have (on average 1.5565457897971726) internal successors, (5065), 3271 states have internal predecessors, (5065), 244 states have call successors, (244), 102 states have call predecessors, (244), 118 states have return successors, (341), 259 states have call predecessors, (341), 244 states have call successors, (341) [2024-10-11 03:15:53,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3617 states to 3617 states and 5650 transitions. [2024-10-11 03:15:53,535 INFO L78 Accepts]: Start accepts. Automaton has 3617 states and 5650 transitions. Word has length 114 [2024-10-11 03:15:53,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:53,535 INFO L471 AbstractCegarLoop]: Abstraction has 3617 states and 5650 transitions. [2024-10-11 03:15:53,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:15:53,535 INFO L276 IsEmpty]: Start isEmpty. Operand 3617 states and 5650 transitions. [2024-10-11 03:15:53,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 03:15:53,539 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:53,540 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:15:53,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 03:15:53,540 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:53,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:53,541 INFO L85 PathProgramCache]: Analyzing trace with hash 914003632, now seen corresponding path program 1 times [2024-10-11 03:15:53,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:53,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225912409] [2024-10-11 03:15:53,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:53,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:53,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:53,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:15:53,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:53,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:15:53,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:53,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 03:15:53,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:53,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 03:15:53,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:53,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 03:15:53,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:53,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:15:53,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:53,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225912409] [2024-10-11 03:15:53,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225912409] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:53,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:53,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:15:53,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600476162] [2024-10-11 03:15:53,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:53,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:15:53,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:53,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:15:53,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:15:53,690 INFO L87 Difference]: Start difference. First operand 3617 states and 5650 transitions. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:15:55,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:55,998 INFO L93 Difference]: Finished difference Result 13353 states and 21088 transitions. [2024-10-11 03:15:55,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 03:15:55,998 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 114 [2024-10-11 03:15:55,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:56,037 INFO L225 Difference]: With dead ends: 13353 [2024-10-11 03:15:56,038 INFO L226 Difference]: Without dead ends: 9749 [2024-10-11 03:15:56,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:15:56,058 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 993 mSDsluCounter, 971 mSDsCounter, 0 mSdLazyCounter, 2672 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1005 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 2728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:56,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1005 Valid, 1270 Invalid, 2728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2672 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 03:15:56,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9749 states. [2024-10-11 03:15:56,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9749 to 7002. [2024-10-11 03:15:56,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7002 states, 6319 states have (on average 1.55515113150815) internal successors, (9827), 6352 states have internal predecessors, (9827), 452 states have call successors, (452), 198 states have call predecessors, (452), 230 states have return successors, (727), 483 states have call predecessors, (727), 452 states have call successors, (727) [2024-10-11 03:15:56,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7002 states to 7002 states and 11006 transitions. [2024-10-11 03:15:56,496 INFO L78 Accepts]: Start accepts. Automaton has 7002 states and 11006 transitions. Word has length 114 [2024-10-11 03:15:56,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:56,496 INFO L471 AbstractCegarLoop]: Abstraction has 7002 states and 11006 transitions. [2024-10-11 03:15:56,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:15:56,497 INFO L276 IsEmpty]: Start isEmpty. Operand 7002 states and 11006 transitions. [2024-10-11 03:15:56,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 03:15:56,504 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:56,504 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:15:56,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 03:15:56,505 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:56,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:56,505 INFO L85 PathProgramCache]: Analyzing trace with hash -80690066, now seen corresponding path program 1 times [2024-10-11 03:15:56,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:56,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089638107] [2024-10-11 03:15:56,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:56,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:56,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:56,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:15:56,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:56,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:15:56,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:56,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 03:15:56,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:56,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 03:15:56,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:56,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 03:15:56,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:56,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:15:56,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:56,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089638107] [2024-10-11 03:15:56,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089638107] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:56,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:56,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:15:56,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890070317] [2024-10-11 03:15:56,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:56,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:15:56,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:56,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:15:56,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:15:56,632 INFO L87 Difference]: Start difference. First operand 7002 states and 11006 transitions. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:15:57,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:57,781 INFO L93 Difference]: Finished difference Result 15900 states and 25296 transitions. [2024-10-11 03:15:57,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:15:57,782 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 114 [2024-10-11 03:15:57,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:57,822 INFO L225 Difference]: With dead ends: 15900 [2024-10-11 03:15:57,822 INFO L226 Difference]: Without dead ends: 8911 [2024-10-11 03:15:57,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:15:57,841 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 667 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 1095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:57,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [681 Valid, 650 Invalid, 1095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 03:15:57,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8911 states. [2024-10-11 03:15:58,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8911 to 7002. [2024-10-11 03:15:58,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7002 states, 6319 states have (on average 1.5499287862003481) internal successors, (9794), 6352 states have internal predecessors, (9794), 452 states have call successors, (452), 198 states have call predecessors, (452), 230 states have return successors, (727), 483 states have call predecessors, (727), 452 states have call successors, (727) [2024-10-11 03:15:58,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7002 states to 7002 states and 10973 transitions. [2024-10-11 03:15:58,420 INFO L78 Accepts]: Start accepts. Automaton has 7002 states and 10973 transitions. Word has length 114 [2024-10-11 03:15:58,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:58,421 INFO L471 AbstractCegarLoop]: Abstraction has 7002 states and 10973 transitions. [2024-10-11 03:15:58,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:15:58,421 INFO L276 IsEmpty]: Start isEmpty. Operand 7002 states and 10973 transitions. [2024-10-11 03:15:58,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 03:15:58,429 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:58,429 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:15:58,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 03:15:58,429 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:58,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:58,430 INFO L85 PathProgramCache]: Analyzing trace with hash -666966288, now seen corresponding path program 1 times [2024-10-11 03:15:58,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:58,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626594822] [2024-10-11 03:15:58,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:58,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:58,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:58,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:15:58,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:58,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:15:58,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:58,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 03:15:58,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:58,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 03:15:58,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:58,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 03:15:58,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:58,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:15:58,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:58,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626594822] [2024-10-11 03:15:58,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626594822] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:58,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:58,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:15:58,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43174518] [2024-10-11 03:15:58,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:58,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:15:58,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:58,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:15:58,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:15:58,555 INFO L87 Difference]: Start difference. First operand 7002 states and 10973 transitions. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:16:01,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:16:01,160 INFO L93 Difference]: Finished difference Result 25118 states and 39734 transitions. [2024-10-11 03:16:01,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 03:16:01,161 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 114 [2024-10-11 03:16:01,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:16:01,223 INFO L225 Difference]: With dead ends: 25118 [2024-10-11 03:16:01,224 INFO L226 Difference]: Without dead ends: 18129 [2024-10-11 03:16:01,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:16:01,247 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 967 mSDsluCounter, 971 mSDsCounter, 0 mSdLazyCounter, 2634 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 979 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 2690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:16:01,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [979 Valid, 1270 Invalid, 2690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2634 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 03:16:01,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18129 states. [2024-10-11 03:16:02,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18129 to 13804. [2024-10-11 03:16:02,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13804 states, 12497 states have (on average 1.5483716091862048) internal successors, (19350), 12562 states have internal predecessors, (19350), 852 states have call successors, (852), 390 states have call predecessors, (852), 454 states have return successors, (1645), 915 states have call predecessors, (1645), 852 states have call successors, (1645) [2024-10-11 03:16:02,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13804 states to 13804 states and 21847 transitions. [2024-10-11 03:16:02,321 INFO L78 Accepts]: Start accepts. Automaton has 13804 states and 21847 transitions. Word has length 114 [2024-10-11 03:16:02,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:16:02,322 INFO L471 AbstractCegarLoop]: Abstraction has 13804 states and 21847 transitions. [2024-10-11 03:16:02,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:16:02,322 INFO L276 IsEmpty]: Start isEmpty. Operand 13804 states and 21847 transitions. [2024-10-11 03:16:02,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 03:16:02,337 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:16:02,337 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:16:02,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 03:16:02,337 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:16:02,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:16:02,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1669426222, now seen corresponding path program 1 times [2024-10-11 03:16:02,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:16:02,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587004457] [2024-10-11 03:16:02,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:16:02,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:16:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:02,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:16:02,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:02,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:16:02,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:02,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 03:16:02,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:02,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 03:16:02,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:02,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 03:16:02,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:02,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:16:02,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:16:02,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587004457] [2024-10-11 03:16:02,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587004457] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:16:02,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:16:02,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:16:02,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632988032] [2024-10-11 03:16:02,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:16:02,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:16:02,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:16:02,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:16:02,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:16:02,463 INFO L87 Difference]: Start difference. First operand 13804 states and 21847 transitions. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:16:06,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:16:06,304 INFO L93 Difference]: Finished difference Result 48622 states and 77694 transitions. [2024-10-11 03:16:06,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 03:16:06,304 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 114 [2024-10-11 03:16:06,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:16:06,495 INFO L225 Difference]: With dead ends: 48622 [2024-10-11 03:16:06,495 INFO L226 Difference]: Without dead ends: 34831 [2024-10-11 03:16:06,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:16:06,527 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 966 mSDsluCounter, 971 mSDsCounter, 0 mSdLazyCounter, 2508 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 986 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 2566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:16:06,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [986 Valid, 1270 Invalid, 2566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2508 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 03:16:06,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34831 states. [2024-10-11 03:16:07,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34831 to 27405. [2024-10-11 03:16:08,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27405 states, 24882 states have (on average 1.5481070653484446) internal successors, (38520), 25011 states have internal predecessors, (38520), 1620 states have call successors, (1620), 774 states have call predecessors, (1620), 902 states have return successors, (3935), 1747 states have call predecessors, (3935), 1620 states have call successors, (3935) [2024-10-11 03:16:08,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27405 states to 27405 states and 44075 transitions. [2024-10-11 03:16:08,093 INFO L78 Accepts]: Start accepts. Automaton has 27405 states and 44075 transitions. Word has length 114 [2024-10-11 03:16:08,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:16:08,095 INFO L471 AbstractCegarLoop]: Abstraction has 27405 states and 44075 transitions. [2024-10-11 03:16:08,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:16:08,095 INFO L276 IsEmpty]: Start isEmpty. Operand 27405 states and 44075 transitions. [2024-10-11 03:16:08,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 03:16:08,126 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:16:08,126 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:16:08,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 03:16:08,126 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:16:08,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:16:08,127 INFO L85 PathProgramCache]: Analyzing trace with hash -749058256, now seen corresponding path program 1 times [2024-10-11 03:16:08,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:16:08,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515394204] [2024-10-11 03:16:08,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:16:08,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:16:08,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:08,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:16:08,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:08,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:16:08,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:08,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 03:16:08,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:08,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 03:16:08,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:08,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 03:16:08,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:08,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:16:08,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:16:08,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515394204] [2024-10-11 03:16:08,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515394204] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:16:08,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:16:08,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:16:08,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737043023] [2024-10-11 03:16:08,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:16:08,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:16:08,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:16:08,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:16:08,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:16:08,248 INFO L87 Difference]: Start difference. First operand 27405 states and 44075 transitions. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:16:11,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:16:11,607 INFO L93 Difference]: Finished difference Result 60443 states and 97699 transitions. [2024-10-11 03:16:11,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:16:11,608 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 114 [2024-10-11 03:16:11,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:16:11,863 INFO L225 Difference]: With dead ends: 60443 [2024-10-11 03:16:11,863 INFO L226 Difference]: Without dead ends: 33052 [2024-10-11 03:16:11,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:16:11,913 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 299 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 1212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:16:11,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 726 Invalid, 1212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1172 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 03:16:11,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33052 states. [2024-10-11 03:16:13,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33052 to 27407. [2024-10-11 03:16:13,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27407 states, 24884 states have (on average 1.5429191448320205) internal successors, (38394), 25013 states have internal predecessors, (38394), 1620 states have call successors, (1620), 774 states have call predecessors, (1620), 902 states have return successors, (3935), 1747 states have call predecessors, (3935), 1620 states have call successors, (3935) [2024-10-11 03:16:13,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27407 states to 27407 states and 43949 transitions. [2024-10-11 03:16:13,555 INFO L78 Accepts]: Start accepts. Automaton has 27407 states and 43949 transitions. Word has length 114 [2024-10-11 03:16:13,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:16:13,556 INFO L471 AbstractCegarLoop]: Abstraction has 27407 states and 43949 transitions. [2024-10-11 03:16:13,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:16:13,556 INFO L276 IsEmpty]: Start isEmpty. Operand 27407 states and 43949 transitions. [2024-10-11 03:16:13,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 03:16:13,585 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:16:13,585 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:16:13,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 03:16:13,585 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:16:13,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:16:13,586 INFO L85 PathProgramCache]: Analyzing trace with hash -721992654, now seen corresponding path program 1 times [2024-10-11 03:16:13,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:16:13,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315783439] [2024-10-11 03:16:13,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:16:13,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:16:13,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:13,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:16:13,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:13,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:16:13,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:13,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 03:16:13,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:13,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 03:16:13,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:13,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 03:16:13,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:13,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:16:13,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:16:13,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315783439] [2024-10-11 03:16:13,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315783439] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:16:13,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:16:13,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:16:13,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788490030] [2024-10-11 03:16:13,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:16:13,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:16:13,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:16:13,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:16:13,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:16:13,698 INFO L87 Difference]: Start difference. First operand 27407 states and 43949 transitions. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:16:17,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:16:17,004 INFO L93 Difference]: Finished difference Result 60705 states and 97834 transitions. [2024-10-11 03:16:17,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:16:17,005 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 114 [2024-10-11 03:16:17,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:16:17,135 INFO L225 Difference]: With dead ends: 60705 [2024-10-11 03:16:17,136 INFO L226 Difference]: Without dead ends: 33312 [2024-10-11 03:16:17,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:16:17,205 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 310 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 1144 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 03:16:17,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 726 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1144 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 03:16:17,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33312 states. [2024-10-11 03:16:19,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33312 to 27665. [2024-10-11 03:16:19,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27665 states, 25142 states have (on average 1.5373478641317317) internal successors, (38652), 25271 states have internal predecessors, (38652), 1620 states have call successors, (1620), 774 states have call predecessors, (1620), 902 states have return successors, (3935), 1747 states have call predecessors, (3935), 1620 states have call successors, (3935) [2024-10-11 03:16:19,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27665 states to 27665 states and 44207 transitions. [2024-10-11 03:16:19,140 INFO L78 Accepts]: Start accepts. Automaton has 27665 states and 44207 transitions. Word has length 114 [2024-10-11 03:16:19,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:16:19,140 INFO L471 AbstractCegarLoop]: Abstraction has 27665 states and 44207 transitions. [2024-10-11 03:16:19,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:16:19,140 INFO L276 IsEmpty]: Start isEmpty. Operand 27665 states and 44207 transitions. [2024-10-11 03:16:19,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 03:16:19,169 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:16:19,170 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:16:19,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 03:16:19,170 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:16:19,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:16:19,170 INFO L85 PathProgramCache]: Analyzing trace with hash -645091856, now seen corresponding path program 1 times [2024-10-11 03:16:19,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:16:19,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569282185] [2024-10-11 03:16:19,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:16:19,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:16:19,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:19,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:16:19,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:19,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:16:19,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:19,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 03:16:19,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:19,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 03:16:19,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:19,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 03:16:19,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:19,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:16:19,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:16:19,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569282185] [2024-10-11 03:16:19,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569282185] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:16:19,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:16:19,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:16:19,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338946041] [2024-10-11 03:16:19,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:16:19,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:16:19,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:16:19,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:16:19,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:16:19,330 INFO L87 Difference]: Start difference. First operand 27665 states and 44207 transitions. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:16:29,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:16:29,418 INFO L93 Difference]: Finished difference Result 155764 states and 253817 transitions. [2024-10-11 03:16:29,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 03:16:29,419 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 114 [2024-10-11 03:16:29,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:16:30,137 INFO L225 Difference]: With dead ends: 155764 [2024-10-11 03:16:30,137 INFO L226 Difference]: Without dead ends: 128113 [2024-10-11 03:16:30,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:16:30,231 INFO L432 NwaCegarLoop]: 352 mSDtfsCounter, 2370 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 2222 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2384 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 2459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 2222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 03:16:30,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2384 Valid, 1198 Invalid, 2459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 2222 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 03:16:30,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128113 states. [2024-10-11 03:16:37,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128113 to 106092. [2024-10-11 03:16:38,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106092 states, 96532 states have (on average 1.5328699291426677) internal successors, (147971), 97045 states have internal predecessors, (147971), 5951 states have call successors, (5951), 3096 states have call predecessors, (5951), 3608 states have return successors, (17162), 6078 states have call predecessors, (17162), 5951 states have call successors, (17162) [2024-10-11 03:16:38,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106092 states to 106092 states and 171084 transitions. [2024-10-11 03:16:38,633 INFO L78 Accepts]: Start accepts. Automaton has 106092 states and 171084 transitions. Word has length 114 [2024-10-11 03:16:38,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:16:38,633 INFO L471 AbstractCegarLoop]: Abstraction has 106092 states and 171084 transitions. [2024-10-11 03:16:38,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:16:38,633 INFO L276 IsEmpty]: Start isEmpty. Operand 106092 states and 171084 transitions. [2024-10-11 03:16:38,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 03:16:38,661 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:16:38,661 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:16:38,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 03:16:38,661 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:16:38,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:16:38,662 INFO L85 PathProgramCache]: Analyzing trace with hash 261664591, now seen corresponding path program 1 times [2024-10-11 03:16:38,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:16:38,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719693723] [2024-10-11 03:16:38,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:16:38,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:16:38,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:38,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:16:38,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:38,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:16:38,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:38,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 03:16:38,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:38,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 03:16:38,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:38,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 03:16:38,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:38,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:16:38,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:16:38,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719693723] [2024-10-11 03:16:38,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719693723] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:16:38,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:16:38,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:16:38,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116521116] [2024-10-11 03:16:38,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:16:38,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:16:38,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:16:38,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:16:38,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:16:38,779 INFO L87 Difference]: Start difference. First operand 106092 states and 171084 transitions. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)