./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/token_ring.09.cil-2.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/token_ring.09.cil-2.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 ae06fa96255229a08f1e8c01eaa7f353b1ba462dacd64e058a3c6957598773d9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:14:01,876 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:14:01,933 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:14:01,939 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:14:01,939 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:14:01,963 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:14:01,964 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:14:01,964 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:14:01,965 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:14:01,966 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:14:01,967 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:14:01,967 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:14:01,967 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:14:01,969 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:14:01,969 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:14:01,969 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:14:01,969 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:14:01,970 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:14:01,970 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:14:01,970 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:14:01,970 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:14:01,973 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:14:01,973 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:14:01,973 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:14:01,973 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:14:01,974 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:14:01,974 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:14:01,974 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:14:01,974 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:14:01,974 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:14:01,975 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:14:01,975 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:14:01,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:14:01,975 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:14:01,975 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:14:01,975 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:14:01,975 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:14:01,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:14:01,976 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:14:01,976 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:14:01,976 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:14:01,977 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:14:01,977 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 -> ae06fa96255229a08f1e8c01eaa7f353b1ba462dacd64e058a3c6957598773d9 [2024-10-11 03:14:02,176 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:14:02,196 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:14:02,199 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:14:02,200 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:14:02,200 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:14:02,202 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.09.cil-2.c [2024-10-11 03:14:03,494 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:14:03,666 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:14:03,667 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.09.cil-2.c [2024-10-11 03:14:03,678 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5a33beb31/de926753dc3b47de8c560df288a1a321/FLAGef85a2402 [2024-10-11 03:14:03,689 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5a33beb31/de926753dc3b47de8c560df288a1a321 [2024-10-11 03:14:03,693 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:14:03,694 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:14:03,695 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:14:03,695 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:14:03,701 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:14:03,702 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:14:03" (1/1) ... [2024-10-11 03:14:03,702 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bb414b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:14:03, skipping insertion in model container [2024-10-11 03:14:03,702 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:14:03" (1/1) ... [2024-10-11 03:14:03,741 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:14:03,882 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/token_ring.09.cil-2.c[671,684] [2024-10-11 03:14:03,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:14:03,997 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:14:04,009 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/token_ring.09.cil-2.c[671,684] [2024-10-11 03:14:04,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:14:04,078 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:14:04,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:14:04 WrapperNode [2024-10-11 03:14:04,079 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:14:04,080 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:14:04,080 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:14:04,080 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:14:04,085 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:14:04" (1/1) ... [2024-10-11 03:14:04,094 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:14:04" (1/1) ... [2024-10-11 03:14:04,122 INFO L138 Inliner]: procedures = 46, calls = 59, calls flagged for inlining = 29, calls inlined = 29, statements flattened = 705 [2024-10-11 03:14:04,123 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:14:04,123 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:14:04,123 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:14:04,123 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:14:04,137 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:14:04" (1/1) ... [2024-10-11 03:14:04,137 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:14:04" (1/1) ... [2024-10-11 03:14:04,141 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:14:04" (1/1) ... [2024-10-11 03:14:04,165 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:14:04,165 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:14:04" (1/1) ... [2024-10-11 03:14:04,165 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:14:04" (1/1) ... [2024-10-11 03:14:04,173 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:14:04" (1/1) ... [2024-10-11 03:14:04,184 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:14:04" (1/1) ... [2024-10-11 03:14:04,186 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:14:04" (1/1) ... [2024-10-11 03:14:04,195 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:14:04" (1/1) ... [2024-10-11 03:14:04,202 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:14:04,203 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:14:04,203 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:14:04,204 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:14:04,205 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:14:04" (1/1) ... [2024-10-11 03:14:04,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:14:04,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:14:04,240 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:14:04,243 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:14:04,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:14:04,286 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-10-11 03:14:04,287 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-10-11 03:14:04,287 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-11 03:14:04,287 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-11 03:14:04,287 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-11 03:14:04,287 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-11 03:14:04,287 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 03:14:04,288 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 03:14:04,288 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-11 03:14:04,289 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-11 03:14:04,289 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-11 03:14:04,289 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-11 03:14:04,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:14:04,289 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-11 03:14:04,289 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-11 03:14:04,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:14:04,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:14:04,383 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:14:04,385 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:14:05,006 INFO L? ?]: Removed 83 outVars from TransFormulas that were not future-live. [2024-10-11 03:14:05,006 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:14:05,064 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:14:05,064 INFO L314 CfgBuilder]: Removed 12 assume(true) statements. [2024-10-11 03:14:05,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:14:05 BoogieIcfgContainer [2024-10-11 03:14:05,065 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:14:05,066 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:14:05,067 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:14:05,069 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:14:05,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:14:03" (1/3) ... [2024-10-11 03:14:05,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25c5fe8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:14:05, skipping insertion in model container [2024-10-11 03:14:05,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:14:04" (2/3) ... [2024-10-11 03:14:05,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25c5fe8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:14:05, skipping insertion in model container [2024-10-11 03:14:05,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:14:05" (3/3) ... [2024-10-11 03:14:05,072 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.09.cil-2.c [2024-10-11 03:14:05,085 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:14:05,086 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:14:05,153 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:14:05,160 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;@7a101b4c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:14:05,162 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:14:05,167 INFO L276 IsEmpty]: Start isEmpty. Operand has 287 states, 253 states have (on average 1.7312252964426877) internal successors, (438), 257 states have internal predecessors, (438), 25 states have call successors, (25), 7 states have call predecessors, (25), 7 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 03:14:05,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 03:14:05,181 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:14:05,181 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:14:05,182 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:14:05,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:14:05,188 INFO L85 PathProgramCache]: Analyzing trace with hash -2115979141, now seen corresponding path program 1 times [2024-10-11 03:14:05,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:14:05,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773897539] [2024-10-11 03:14:05,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:14:05,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:14:05,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:05,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:14:05,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:05,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 03:14:05,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:05,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:14:05,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:05,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 03:14:05,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:05,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 03:14:05,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:05,772 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:14:05,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:14:05,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773897539] [2024-10-11 03:14:05,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773897539] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:14:05,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:14:05,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:14:05,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189580297] [2024-10-11 03:14:05,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:14:05,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:14:05,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:14:05,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:14:05,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:14:05,800 INFO L87 Difference]: Start difference. First operand has 287 states, 253 states have (on average 1.7312252964426877) internal successors, (438), 257 states have internal predecessors, (438), 25 states have call successors, (25), 7 states have call predecessors, (25), 7 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 3 states have internal predecessors, (120), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:14:07,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:14:07,058 INFO L93 Difference]: Finished difference Result 663 states and 1137 transitions. [2024-10-11 03:14:07,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:14:07,061 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 3 states have internal predecessors, (120), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2024-10-11 03:14:07,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:14:07,077 INFO L225 Difference]: With dead ends: 663 [2024-10-11 03:14:07,077 INFO L226 Difference]: Without dead ends: 384 [2024-10-11 03:14:07,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:14:07,088 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 774 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:14:07,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 531 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 03:14:07,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2024-10-11 03:14:07,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 284. [2024-10-11 03:14:07,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 252 states have (on average 1.626984126984127) internal successors, (410), 254 states have internal predecessors, (410), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 03:14:07,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 458 transitions. [2024-10-11 03:14:07,163 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 458 transitions. Word has length 131 [2024-10-11 03:14:07,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:14:07,165 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 458 transitions. [2024-10-11 03:14:07,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 3 states have internal predecessors, (120), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:14:07,166 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 458 transitions. [2024-10-11 03:14:07,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 03:14:07,169 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:14:07,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:14:07,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:14:07,171 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:14:07,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:14:07,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1023343939, now seen corresponding path program 1 times [2024-10-11 03:14:07,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:14:07,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721428742] [2024-10-11 03:14:07,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:14:07,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:14:07,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:07,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:14:07,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:07,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 03:14:07,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:07,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:14:07,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:07,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 03:14:07,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:07,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 03:14:07,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:07,448 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:14:07,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:14:07,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721428742] [2024-10-11 03:14:07,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721428742] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:14:07,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:14:07,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:14:07,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65788307] [2024-10-11 03:14:07,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:14:07,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:14:07,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:14:07,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:14:07,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:14:07,454 INFO L87 Difference]: Start difference. First operand 284 states and 458 transitions. Second operand has 6 states, 6 states have (on average 20.0) internal successors, (120), 4 states have internal predecessors, (120), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:14:09,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:14:09,482 INFO L93 Difference]: Finished difference Result 1035 states and 1706 transitions. [2024-10-11 03:14:09,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 03:14:09,483 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 4 states have internal predecessors, (120), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2024-10-11 03:14:09,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:14:09,488 INFO L225 Difference]: With dead ends: 1035 [2024-10-11 03:14:09,488 INFO L226 Difference]: Without dead ends: 766 [2024-10-11 03:14:09,489 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:14:09,490 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 1166 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 1830 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1182 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 1934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 03:14:09,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1182 Valid, 1008 Invalid, 1934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1830 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 03:14:09,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2024-10-11 03:14:09,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 565. [2024-10-11 03:14:09,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 508 states have (on average 1.6358267716535433) internal successors, (831), 511 states have internal predecessors, (831), 43 states have call successors, (43), 13 states have call predecessors, (43), 13 states have return successors, (44), 41 states have call predecessors, (44), 41 states have call successors, (44) [2024-10-11 03:14:09,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 918 transitions. [2024-10-11 03:14:09,538 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 918 transitions. Word has length 131 [2024-10-11 03:14:09,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:14:09,539 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 918 transitions. [2024-10-11 03:14:09,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 4 states have internal predecessors, (120), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:14:09,539 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 918 transitions. [2024-10-11 03:14:09,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 03:14:09,541 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:14:09,541 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:14:09,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:14:09,541 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:14:09,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:14:09,541 INFO L85 PathProgramCache]: Analyzing trace with hash -50816967, now seen corresponding path program 1 times [2024-10-11 03:14:09,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:14:09,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081268039] [2024-10-11 03:14:09,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:14:09,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:14:09,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:09,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:14:09,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:09,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 03:14:09,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:09,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:14:09,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:09,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 03:14:09,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:09,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 03:14:09,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:09,815 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:14:09,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:14:09,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081268039] [2024-10-11 03:14:09,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081268039] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:14:09,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:14:09,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:14:09,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572639125] [2024-10-11 03:14:09,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:14:09,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:14:09,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:14:09,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:14:09,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:14:09,819 INFO L87 Difference]: Start difference. First operand 565 states and 918 transitions. Second operand has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 5 states have internal predecessors, (120), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:14:12,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:14:12,104 INFO L93 Difference]: Finished difference Result 1710 states and 2820 transitions. [2024-10-11 03:14:12,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 03:14:12,105 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 5 states have internal predecessors, (120), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2024-10-11 03:14:12,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:14:12,114 INFO L225 Difference]: With dead ends: 1710 [2024-10-11 03:14:12,114 INFO L226 Difference]: Without dead ends: 1160 [2024-10-11 03:14:12,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 03:14:12,118 INFO L432 NwaCegarLoop]: 395 mSDtfsCounter, 1187 mSDsluCounter, 1301 mSDsCounter, 0 mSdLazyCounter, 2927 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1203 SdHoareTripleChecker+Valid, 1696 SdHoareTripleChecker+Invalid, 2986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 03:14:12,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1203 Valid, 1696 Invalid, 2986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2927 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 03:14:12,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2024-10-11 03:14:12,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 825. [2024-10-11 03:14:12,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 825 states, 743 states have (on average 1.6285329744279946) internal successors, (1210), 747 states have internal predecessors, (1210), 61 states have call successors, (61), 19 states have call predecessors, (61), 20 states have return successors, (64), 60 states have call predecessors, (64), 59 states have call successors, (64) [2024-10-11 03:14:12,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1335 transitions. [2024-10-11 03:14:12,175 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1335 transitions. Word has length 131 [2024-10-11 03:14:12,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:14:12,176 INFO L471 AbstractCegarLoop]: Abstraction has 825 states and 1335 transitions. [2024-10-11 03:14:12,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 5 states have internal predecessors, (120), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:14:12,177 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1335 transitions. [2024-10-11 03:14:12,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 03:14:12,178 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:14:12,178 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:14:12,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:14:12,179 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:14:12,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:14:12,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1676327995, now seen corresponding path program 1 times [2024-10-11 03:14:12,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:14:12,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952115374] [2024-10-11 03:14:12,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:14:12,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:14:12,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:12,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:14:12,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:12,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 03:14:12,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:12,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:14:12,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:12,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 03:14:12,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:12,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 03:14:12,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:12,387 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:14:12,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:14:12,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952115374] [2024-10-11 03:14:12,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952115374] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:14:12,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:14:12,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:14:12,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747208340] [2024-10-11 03:14:12,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:14:12,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:14:12,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:14:12,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:14:12,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:14:12,389 INFO L87 Difference]: Start difference. First operand 825 states and 1335 transitions. Second operand has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 5 states have internal predecessors, (120), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:14:14,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:14:14,778 INFO L93 Difference]: Finished difference Result 2699 states and 4443 transitions. [2024-10-11 03:14:14,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 03:14:14,779 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 5 states have internal predecessors, (120), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2024-10-11 03:14:14,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:14:14,788 INFO L225 Difference]: With dead ends: 2699 [2024-10-11 03:14:14,788 INFO L226 Difference]: Without dead ends: 1889 [2024-10-11 03:14:14,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 03:14:14,792 INFO L432 NwaCegarLoop]: 393 mSDtfsCounter, 1185 mSDsluCounter, 1301 mSDsCounter, 0 mSdLazyCounter, 2923 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1201 SdHoareTripleChecker+Valid, 1694 SdHoareTripleChecker+Invalid, 2984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 03:14:14,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1201 Valid, 1694 Invalid, 2984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2923 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 03:14:14,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1889 states. [2024-10-11 03:14:14,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1889 to 1346. [2024-10-11 03:14:14,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1346 states, 1214 states have (on average 1.6219110378912684) internal successors, (1969), 1220 states have internal predecessors, (1969), 97 states have call successors, (97), 31 states have call predecessors, (97), 34 states have return successors, (108), 98 states have call predecessors, (108), 95 states have call successors, (108) [2024-10-11 03:14:14,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 2174 transitions. [2024-10-11 03:14:14,875 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 2174 transitions. Word has length 131 [2024-10-11 03:14:14,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:14:14,876 INFO L471 AbstractCegarLoop]: Abstraction has 1346 states and 2174 transitions. [2024-10-11 03:14:14,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 5 states have internal predecessors, (120), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:14:14,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 2174 transitions. [2024-10-11 03:14:14,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 03:14:14,878 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:14:14,879 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:14:14,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:14:14,879 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:14:14,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:14:14,879 INFO L85 PathProgramCache]: Analyzing trace with hash -2147282951, now seen corresponding path program 1 times [2024-10-11 03:14:14,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:14:14,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524265859] [2024-10-11 03:14:14,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:14:14,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:14:14,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:14,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:14:14,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:15,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 03:14:15,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:15,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:14:15,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:15,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 03:14:15,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:15,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 03:14:15,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:15,087 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:14:15,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:14:15,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524265859] [2024-10-11 03:14:15,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524265859] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:14:15,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:14:15,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:14:15,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022012324] [2024-10-11 03:14:15,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:14:15,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:14:15,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:14:15,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:14:15,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:14:15,090 INFO L87 Difference]: Start difference. First operand 1346 states and 2174 transitions. Second operand has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 5 states have internal predecessors, (120), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:14:16,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:14:16,271 INFO L93 Difference]: Finished difference Result 3208 states and 5273 transitions. [2024-10-11 03:14:16,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:14:16,271 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 5 states have internal predecessors, (120), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2024-10-11 03:14:16,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:14:16,279 INFO L225 Difference]: With dead ends: 3208 [2024-10-11 03:14:16,279 INFO L226 Difference]: Without dead ends: 1877 [2024-10-11 03:14:16,282 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:14:16,283 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 858 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 1486 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 875 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 1549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 03:14:16,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [875 Valid, 862 Invalid, 1549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1486 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 03:14:16,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877 states. [2024-10-11 03:14:16,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877 to 1346. [2024-10-11 03:14:16,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1346 states, 1214 states have (on average 1.6177924217462933) internal successors, (1964), 1220 states have internal predecessors, (1964), 97 states have call successors, (97), 31 states have call predecessors, (97), 34 states have return successors, (108), 98 states have call predecessors, (108), 95 states have call successors, (108) [2024-10-11 03:14:16,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 2169 transitions. [2024-10-11 03:14:16,359 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 2169 transitions. Word has length 131 [2024-10-11 03:14:16,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:14:16,360 INFO L471 AbstractCegarLoop]: Abstraction has 1346 states and 2169 transitions. [2024-10-11 03:14:16,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 5 states have internal predecessors, (120), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:14:16,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 2169 transitions. [2024-10-11 03:14:16,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 03:14:16,361 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:14:16,361 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:14:16,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:14:16,362 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:14:16,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:14:16,362 INFO L85 PathProgramCache]: Analyzing trace with hash 500321403, now seen corresponding path program 1 times [2024-10-11 03:14:16,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:14:16,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944388074] [2024-10-11 03:14:16,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:14:16,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:14:16,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:16,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:14:16,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:16,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 03:14:16,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:16,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:14:16,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:16,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 03:14:16,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:16,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 03:14:16,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:16,522 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:14:16,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:14:16,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944388074] [2024-10-11 03:14:16,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944388074] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:14:16,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:14:16,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:14:16,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388940212] [2024-10-11 03:14:16,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:14:16,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:14:16,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:14:16,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:14:16,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:14:16,524 INFO L87 Difference]: Start difference. First operand 1346 states and 2169 transitions. Second operand has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 5 states have internal predecessors, (120), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:14:17,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:14:17,551 INFO L93 Difference]: Finished difference Result 3202 states and 5247 transitions. [2024-10-11 03:14:17,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:14:17,552 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 5 states have internal predecessors, (120), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2024-10-11 03:14:17,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:14:17,559 INFO L225 Difference]: With dead ends: 3202 [2024-10-11 03:14:17,559 INFO L226 Difference]: Without dead ends: 1871 [2024-10-11 03:14:17,563 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:14:17,563 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 982 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 1320 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 999 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 1408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 03:14:17,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [999 Valid, 723 Invalid, 1408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1320 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 03:14:17,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1871 states. [2024-10-11 03:14:17,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1871 to 1346. [2024-10-11 03:14:17,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1346 states, 1214 states have (on average 1.613673805601318) internal successors, (1959), 1220 states have internal predecessors, (1959), 97 states have call successors, (97), 31 states have call predecessors, (97), 34 states have return successors, (108), 98 states have call predecessors, (108), 95 states have call successors, (108) [2024-10-11 03:14:17,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 2164 transitions. [2024-10-11 03:14:17,641 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 2164 transitions. Word has length 131 [2024-10-11 03:14:17,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:14:17,642 INFO L471 AbstractCegarLoop]: Abstraction has 1346 states and 2164 transitions. [2024-10-11 03:14:17,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 5 states have internal predecessors, (120), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:14:17,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 2164 transitions. [2024-10-11 03:14:17,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 03:14:17,644 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:14:17,644 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:14:17,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:14:17,644 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:14:17,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:14:17,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1631029319, now seen corresponding path program 1 times [2024-10-11 03:14:17,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:14:17,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909637570] [2024-10-11 03:14:17,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:14:17,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:14:17,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:17,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:14:17,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:17,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 03:14:17,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:17,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:14:17,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:17,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 03:14:17,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:17,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 03:14:17,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:17,824 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:14:17,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:14:17,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909637570] [2024-10-11 03:14:17,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909637570] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:14:17,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:14:17,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:14:17,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648837849] [2024-10-11 03:14:17,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:14:17,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:14:17,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:14:17,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:14:17,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:14:17,826 INFO L87 Difference]: Start difference. First operand 1346 states and 2164 transitions. Second operand has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 5 states have internal predecessors, (120), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:14:19,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:14:19,829 INFO L93 Difference]: Finished difference Result 4577 states and 7462 transitions. [2024-10-11 03:14:19,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 03:14:19,830 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 5 states have internal predecessors, (120), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2024-10-11 03:14:19,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:14:19,845 INFO L225 Difference]: With dead ends: 4577 [2024-10-11 03:14:19,845 INFO L226 Difference]: Without dead ends: 3246 [2024-10-11 03:14:19,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 03:14:19,852 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 1256 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 2364 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1272 SdHoareTripleChecker+Valid, 1100 SdHoareTripleChecker+Invalid, 2459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 2364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:14:19,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1272 Valid, 1100 Invalid, 2459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 2364 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 03:14:19,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3246 states. [2024-10-11 03:14:19,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3246 to 2402. [2024-10-11 03:14:19,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2402 states, 2170 states have (on average 1.6078341013824884) internal successors, (3489), 2180 states have internal predecessors, (3489), 169 states have call successors, (169), 55 states have call predecessors, (169), 62 states have return successors, (202), 174 states have call predecessors, (202), 167 states have call successors, (202) [2024-10-11 03:14:19,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2402 states to 2402 states and 3860 transitions. [2024-10-11 03:14:19,989 INFO L78 Accepts]: Start accepts. Automaton has 2402 states and 3860 transitions. Word has length 131 [2024-10-11 03:14:19,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:14:19,989 INFO L471 AbstractCegarLoop]: Abstraction has 2402 states and 3860 transitions. [2024-10-11 03:14:19,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 5 states have internal predecessors, (120), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:14:19,990 INFO L276 IsEmpty]: Start isEmpty. Operand 2402 states and 3860 transitions. [2024-10-11 03:14:19,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 03:14:19,994 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:14:19,994 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:14:19,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:14:19,995 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:14:19,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:14:19,995 INFO L85 PathProgramCache]: Analyzing trace with hash 690772599, now seen corresponding path program 1 times [2024-10-11 03:14:19,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:14:19,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184020353] [2024-10-11 03:14:19,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:14:19,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:14:20,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:20,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:14:20,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:20,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 03:14:20,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:20,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:14:20,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:20,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 03:14:20,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:20,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 03:14:20,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:20,172 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:14:20,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:14:20,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184020353] [2024-10-11 03:14:20,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184020353] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:14:20,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:14:20,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:14:20,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840075440] [2024-10-11 03:14:20,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:14:20,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:14:20,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:14:20,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:14:20,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:14:20,174 INFO L87 Difference]: Start difference. First operand 2402 states and 3860 transitions. Second operand has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 5 states have internal predecessors, (120), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:14:21,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:14:21,453 INFO L93 Difference]: Finished difference Result 5644 states and 9207 transitions. [2024-10-11 03:14:21,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:14:21,453 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 5 states have internal predecessors, (120), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2024-10-11 03:14:21,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:14:21,465 INFO L225 Difference]: With dead ends: 5644 [2024-10-11 03:14:21,465 INFO L226 Difference]: Without dead ends: 3257 [2024-10-11 03:14:21,470 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:14:21,471 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 859 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 1431 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 876 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 1494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:14:21,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [876 Valid, 862 Invalid, 1494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1431 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 03:14:21,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3257 states. [2024-10-11 03:14:21,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3257 to 2402. [2024-10-11 03:14:21,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2402 states, 2170 states have (on average 1.6036866359447004) internal successors, (3480), 2180 states have internal predecessors, (3480), 169 states have call successors, (169), 55 states have call predecessors, (169), 62 states have return successors, (202), 174 states have call predecessors, (202), 167 states have call successors, (202) [2024-10-11 03:14:21,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2402 states to 2402 states and 3851 transitions. [2024-10-11 03:14:21,598 INFO L78 Accepts]: Start accepts. Automaton has 2402 states and 3851 transitions. Word has length 131 [2024-10-11 03:14:21,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:14:21,599 INFO L471 AbstractCegarLoop]: Abstraction has 2402 states and 3851 transitions. [2024-10-11 03:14:21,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 5 states have internal predecessors, (120), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:14:21,599 INFO L276 IsEmpty]: Start isEmpty. Operand 2402 states and 3851 transitions. [2024-10-11 03:14:21,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 03:14:21,601 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:14:21,601 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:14:21,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:14:21,601 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:14:21,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:14:21,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1451087879, now seen corresponding path program 1 times [2024-10-11 03:14:21,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:14:21,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574931907] [2024-10-11 03:14:21,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:14:21,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:14:21,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:21,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:14:21,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:21,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 03:14:21,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:21,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:14:21,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:21,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 03:14:21,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:21,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 03:14:21,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:21,772 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:14:21,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:14:21,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574931907] [2024-10-11 03:14:21,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574931907] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:14:21,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:14:21,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:14:21,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900623833] [2024-10-11 03:14:21,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:14:21,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:14:21,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:14:21,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:14:21,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:14:21,775 INFO L87 Difference]: Start difference. First operand 2402 states and 3851 transitions. Second operand has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 5 states have internal predecessors, (120), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:14:24,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:14:24,099 INFO L93 Difference]: Finished difference Result 8361 states and 13572 transitions. [2024-10-11 03:14:24,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 03:14:24,099 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 5 states have internal predecessors, (120), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2024-10-11 03:14:24,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:14:24,120 INFO L225 Difference]: With dead ends: 8361 [2024-10-11 03:14:24,120 INFO L226 Difference]: Without dead ends: 5974 [2024-10-11 03:14:24,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 03:14:24,126 INFO L432 NwaCegarLoop]: 393 mSDtfsCounter, 1163 mSDsluCounter, 1301 mSDsCounter, 0 mSdLazyCounter, 2804 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1179 SdHoareTripleChecker+Valid, 1694 SdHoareTripleChecker+Invalid, 2865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:14:24,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1179 Valid, 1694 Invalid, 2865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2804 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 03:14:24,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5974 states. [2024-10-11 03:14:24,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5974 to 4524. [2024-10-11 03:14:24,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4524 states, 4092 states have (on average 1.598240469208211) internal successors, (6540), 4110 states have internal predecessors, (6540), 313 states have call successors, (313), 103 states have call predecessors, (313), 118 states have return successors, (408), 326 states have call predecessors, (408), 311 states have call successors, (408) [2024-10-11 03:14:24,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4524 states to 4524 states and 7261 transitions. [2024-10-11 03:14:24,432 INFO L78 Accepts]: Start accepts. Automaton has 4524 states and 7261 transitions. Word has length 131 [2024-10-11 03:14:24,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:14:24,433 INFO L471 AbstractCegarLoop]: Abstraction has 4524 states and 7261 transitions. [2024-10-11 03:14:24,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 5 states have internal predecessors, (120), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:14:24,433 INFO L276 IsEmpty]: Start isEmpty. Operand 4524 states and 7261 transitions. [2024-10-11 03:14:24,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 03:14:24,437 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:14:24,438 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:14:24,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:14:24,438 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:14:24,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:14:24,439 INFO L85 PathProgramCache]: Analyzing trace with hash -2074369481, now seen corresponding path program 1 times [2024-10-11 03:14:24,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:14:24,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708989532] [2024-10-11 03:14:24,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:14:24,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:14:24,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:24,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:14:24,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:24,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 03:14:24,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:24,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:14:24,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:24,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 03:14:24,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:24,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 03:14:24,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:24,600 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:14:24,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:14:24,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708989532] [2024-10-11 03:14:24,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708989532] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:14:24,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:14:24,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:14:24,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861836166] [2024-10-11 03:14:24,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:14:24,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:14:24,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:14:24,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:14:24,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:14:24,602 INFO L87 Difference]: Start difference. First operand 4524 states and 7261 transitions. Second operand has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 5 states have internal predecessors, (120), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:14:27,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:14:27,014 INFO L93 Difference]: Finished difference Result 15945 states and 25924 transitions. [2024-10-11 03:14:27,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 03:14:27,014 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 5 states have internal predecessors, (120), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2024-10-11 03:14:27,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:14:27,051 INFO L225 Difference]: With dead ends: 15945 [2024-10-11 03:14:27,051 INFO L226 Difference]: Without dead ends: 11436 [2024-10-11 03:14:27,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 03:14:27,062 INFO L432 NwaCegarLoop]: 393 mSDtfsCounter, 1162 mSDsluCounter, 1301 mSDsCounter, 0 mSdLazyCounter, 2791 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1178 SdHoareTripleChecker+Valid, 1694 SdHoareTripleChecker+Invalid, 2852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 03:14:27,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1178 Valid, 1694 Invalid, 2852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2791 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 03:14:27,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11436 states. [2024-10-11 03:14:27,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11436 to 8781. [2024-10-11 03:14:27,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8781 states, 7949 states have (on average 1.5949175996980753) internal successors, (12678), 7983 states have internal predecessors, (12678), 601 states have call successors, (601), 199 states have call predecessors, (601), 230 states have return successors, (874), 630 states have call predecessors, (874), 599 states have call successors, (874) [2024-10-11 03:14:27,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8781 states to 8781 states and 14153 transitions. [2024-10-11 03:14:27,642 INFO L78 Accepts]: Start accepts. Automaton has 8781 states and 14153 transitions. Word has length 131 [2024-10-11 03:14:27,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:14:27,642 INFO L471 AbstractCegarLoop]: Abstraction has 8781 states and 14153 transitions. [2024-10-11 03:14:27,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 5 states have internal predecessors, (120), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:14:27,643 INFO L276 IsEmpty]: Start isEmpty. Operand 8781 states and 14153 transitions. [2024-10-11 03:14:27,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 03:14:27,648 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:14:27,648 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:14:27,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 03:14:27,648 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:14:27,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:14:27,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1955928007, now seen corresponding path program 1 times [2024-10-11 03:14:27,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:14:27,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280546257] [2024-10-11 03:14:27,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:14:27,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:14:27,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:27,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:14:27,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:27,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 03:14:27,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:27,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:14:27,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:27,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 03:14:27,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:27,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 03:14:27,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:27,847 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:14:27,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:14:27,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280546257] [2024-10-11 03:14:27,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280546257] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:14:27,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:14:27,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:14:27,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861312087] [2024-10-11 03:14:27,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:14:27,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:14:27,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:14:27,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:14:27,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:14:27,849 INFO L87 Difference]: Start difference. First operand 8781 states and 14153 transitions. Second operand has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 5 states have internal predecessors, (120), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:14:31,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:14:31,114 INFO L93 Difference]: Finished difference Result 34824 states and 56804 transitions. [2024-10-11 03:14:31,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 03:14:31,114 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 5 states have internal predecessors, (120), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2024-10-11 03:14:31,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:14:31,236 INFO L225 Difference]: With dead ends: 34824 [2024-10-11 03:14:31,237 INFO L226 Difference]: Without dead ends: 26058 [2024-10-11 03:14:31,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:14:31,260 INFO L432 NwaCegarLoop]: 391 mSDtfsCounter, 1490 mSDsluCounter, 1296 mSDsCounter, 0 mSdLazyCounter, 2768 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1516 SdHoareTripleChecker+Valid, 1687 SdHoareTripleChecker+Invalid, 2832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 2768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 03:14:31,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1516 Valid, 1687 Invalid, 2832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 2768 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 03:14:31,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26058 states. [2024-10-11 03:14:32,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26058 to 17262. [2024-10-11 03:14:32,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17262 states, 15662 states have (on average 1.5941769888903077) internal successors, (24968), 15728 states have internal predecessors, (24968), 1145 states have call successors, (1145), 391 states have call predecessors, (1145), 454 states have return successors, (1936), 1206 states have call predecessors, (1936), 1143 states have call successors, (1936) [2024-10-11 03:14:32,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17262 states to 17262 states and 28049 transitions. [2024-10-11 03:14:32,145 INFO L78 Accepts]: Start accepts. Automaton has 17262 states and 28049 transitions. Word has length 131 [2024-10-11 03:14:32,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:14:32,145 INFO L471 AbstractCegarLoop]: Abstraction has 17262 states and 28049 transitions. [2024-10-11 03:14:32,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 5 states have internal predecessors, (120), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:14:32,147 INFO L276 IsEmpty]: Start isEmpty. Operand 17262 states and 28049 transitions. [2024-10-11 03:14:32,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 03:14:32,156 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:14:32,156 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:14:32,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 03:14:32,157 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:14:32,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:14:32,157 INFO L85 PathProgramCache]: Analyzing trace with hash -566633993, now seen corresponding path program 1 times [2024-10-11 03:14:32,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:14:32,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882799329] [2024-10-11 03:14:32,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:14:32,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:14:32,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:32,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:14:32,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:32,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 03:14:32,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:32,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:14:32,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:32,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 03:14:32,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:32,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 03:14:32,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:32,300 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:14:32,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:14:32,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882799329] [2024-10-11 03:14:32,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882799329] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:14:32,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:14:32,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:14:32,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410956601] [2024-10-11 03:14:32,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:14:32,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:14:32,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:14:32,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:14:32,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:14:32,301 INFO L87 Difference]: Start difference. First operand 17262 states and 28049 transitions. Second operand has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 5 states have internal predecessors, (120), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:14:37,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:14:37,046 INFO L93 Difference]: Finished difference Result 67975 states and 111738 transitions. [2024-10-11 03:14:37,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 03:14:37,046 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 5 states have internal predecessors, (120), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2024-10-11 03:14:37,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:14:37,219 INFO L225 Difference]: With dead ends: 67975 [2024-10-11 03:14:37,219 INFO L226 Difference]: Without dead ends: 50728 [2024-10-11 03:14:37,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:14:37,274 INFO L432 NwaCegarLoop]: 390 mSDtfsCounter, 1233 mSDsluCounter, 1293 mSDsCounter, 0 mSdLazyCounter, 3263 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1248 SdHoareTripleChecker+Valid, 1683 SdHoareTripleChecker+Invalid, 3326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 03:14:37,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1248 Valid, 1683 Invalid, 3326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 3263 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 03:14:37,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50728 states. [2024-10-11 03:14:39,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50728 to 33583. [2024-10-11 03:14:39,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33583 states, 30479 states have (on average 1.589881557793891) internal successors, (48458), 30609 states have internal predecessors, (48458), 2201 states have call successors, (2201), 775 states have call predecessors, (2201), 902 states have return successors, (4514), 2326 states have call predecessors, (4514), 2199 states have call successors, (4514) [2024-10-11 03:14:39,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33583 states to 33583 states and 55173 transitions. [2024-10-11 03:14:39,500 INFO L78 Accepts]: Start accepts. Automaton has 33583 states and 55173 transitions. Word has length 131 [2024-10-11 03:14:39,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:14:39,500 INFO L471 AbstractCegarLoop]: Abstraction has 33583 states and 55173 transitions. [2024-10-11 03:14:39,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 5 states have internal predecessors, (120), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:14:39,501 INFO L276 IsEmpty]: Start isEmpty. Operand 33583 states and 55173 transitions. [2024-10-11 03:14:39,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 03:14:39,521 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:14:39,521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:14:39,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 03:14:39,522 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:14:39,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:14:39,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1694939257, now seen corresponding path program 1 times [2024-10-11 03:14:39,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:14:39,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964897008] [2024-10-11 03:14:39,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:14:39,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:14:39,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:39,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:14:39,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:39,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 03:14:39,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:39,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:14:39,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:39,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 03:14:39,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:39,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 03:14:39,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:39,788 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:14:39,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:14:39,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964897008] [2024-10-11 03:14:39,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964897008] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:14:39,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:14:39,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:14:39,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118315646] [2024-10-11 03:14:39,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:14:39,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:14:39,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:14:39,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:14:39,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:14:39,791 INFO L87 Difference]: Start difference. First operand 33583 states and 55173 transitions. Second operand has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 5 states have internal predecessors, (120), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:14:42,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:14:42,997 INFO L93 Difference]: Finished difference Result 77284 states and 129532 transitions. [2024-10-11 03:14:42,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:14:42,998 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 5 states have internal predecessors, (120), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2024-10-11 03:14:42,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:14:43,263 INFO L225 Difference]: With dead ends: 77284 [2024-10-11 03:14:43,263 INFO L226 Difference]: Without dead ends: 43716 [2024-10-11 03:14:43,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:14:43,323 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 864 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 1371 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 881 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 1436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 03:14:43,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [881 Valid, 861 Invalid, 1436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1371 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 03:14:43,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43716 states. [2024-10-11 03:14:45,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43716 to 33583. [2024-10-11 03:14:45,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33583 states, 30479 states have (on average 1.585649135470324) internal successors, (48329), 30609 states have internal predecessors, (48329), 2201 states have call successors, (2201), 775 states have call predecessors, (2201), 902 states have return successors, (4514), 2326 states have call predecessors, (4514), 2199 states have call successors, (4514) [2024-10-11 03:14:45,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33583 states to 33583 states and 55044 transitions. [2024-10-11 03:14:45,796 INFO L78 Accepts]: Start accepts. Automaton has 33583 states and 55044 transitions. Word has length 131 [2024-10-11 03:14:45,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:14:45,797 INFO L471 AbstractCegarLoop]: Abstraction has 33583 states and 55044 transitions. [2024-10-11 03:14:45,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 5 states have internal predecessors, (120), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:14:45,798 INFO L276 IsEmpty]: Start isEmpty. Operand 33583 states and 55044 transitions. [2024-10-11 03:14:45,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 03:14:45,817 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:14:45,817 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:14:45,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 03:14:45,818 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:14:45,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:14:45,818 INFO L85 PathProgramCache]: Analyzing trace with hash -171769417, now seen corresponding path program 1 times [2024-10-11 03:14:45,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:14:45,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874892403] [2024-10-11 03:14:45,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:14:45,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:14:45,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:45,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:14:45,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:45,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 03:14:45,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:45,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:14:45,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:45,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 03:14:45,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:45,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 03:14:45,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:45,995 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:14:45,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:14:45,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874892403] [2024-10-11 03:14:45,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874892403] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:14:45,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:14:45,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:14:45,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421112525] [2024-10-11 03:14:45,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:14:45,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:14:45,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:14:45,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:14:45,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:14:45,997 INFO L87 Difference]: Start difference. First operand 33583 states and 55044 transitions. Second operand has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 5 states have internal predecessors, (120), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:14:53,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:14:53,161 INFO L93 Difference]: Finished difference Result 128130 states and 212660 transitions. [2024-10-11 03:14:53,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 03:14:53,161 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 5 states have internal predecessors, (120), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2024-10-11 03:14:53,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:14:53,494 INFO L225 Difference]: With dead ends: 128130 [2024-10-11 03:14:53,494 INFO L226 Difference]: Without dead ends: 94562 [2024-10-11 03:14:53,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:14:53,587 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 1270 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 2650 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1285 SdHoareTripleChecker+Valid, 1100 SdHoareTripleChecker+Invalid, 2745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 2650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 03:14:53,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1285 Valid, 1100 Invalid, 2745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 2650 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 03:14:53,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94562 states. [2024-10-11 03:14:57,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94562 to 67122. [2024-10-11 03:14:57,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67122 states, 61074 states have (on average 1.585732062743557) internal successors, (96847), 61332 states have internal predecessors, (96847), 4249 states have call successors, (4249), 1543 states have call predecessors, (4249), 1798 states have return successors, (11064), 4502 states have call predecessors, (11064), 4247 states have call successors, (11064) [2024-10-11 03:14:58,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67122 states to 67122 states and 112160 transitions. [2024-10-11 03:14:58,259 INFO L78 Accepts]: Start accepts. Automaton has 67122 states and 112160 transitions. Word has length 131 [2024-10-11 03:14:58,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:14:58,260 INFO L471 AbstractCegarLoop]: Abstraction has 67122 states and 112160 transitions. [2024-10-11 03:14:58,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 5 states have internal predecessors, (120), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:14:58,261 INFO L276 IsEmpty]: Start isEmpty. Operand 67122 states and 112160 transitions. [2024-10-11 03:14:58,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 03:14:58,304 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:14:58,304 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:14:58,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 03:14:58,305 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:14:58,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:14:58,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1725727349, now seen corresponding path program 1 times [2024-10-11 03:14:58,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:14:58,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151816413] [2024-10-11 03:14:58,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:14:58,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:14:58,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:58,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:14:58,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:58,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 03:14:58,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:58,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:14:58,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:58,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 03:14:58,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:58,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 03:14:58,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:58,476 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:14:58,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:14:58,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151816413] [2024-10-11 03:14:58,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151816413] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:14:58,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:14:58,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:14:58,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806657618] [2024-10-11 03:14:58,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:14:58,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:14:58,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:14:58,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:14:58,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:14:58,479 INFO L87 Difference]: Start difference. First operand 67122 states and 112160 transitions. Second operand has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 5 states have internal predecessors, (120), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:15:04,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:04,380 INFO L93 Difference]: Finished difference Result 153060 states and 261819 transitions. [2024-10-11 03:15:04,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:15:04,380 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 5 states have internal predecessors, (120), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2024-10-11 03:15:04,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:04,734 INFO L225 Difference]: With dead ends: 153060 [2024-10-11 03:15:04,734 INFO L226 Difference]: Without dead ends: 85953 [2024-10-11 03:15:04,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:15:04,893 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 982 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 1214 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 999 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 1304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:04,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [999 Valid, 722 Invalid, 1304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1214 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 03:15:04,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85953 states. [2024-10-11 03:15:09,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85953 to 67122. [2024-10-11 03:15:09,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67122 states, 61074 states have (on average 1.5815240527884207) internal successors, (96590), 61332 states have internal predecessors, (96590), 4249 states have call successors, (4249), 1543 states have call predecessors, (4249), 1798 states have return successors, (11064), 4502 states have call predecessors, (11064), 4247 states have call successors, (11064) [2024-10-11 03:15:09,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67122 states to 67122 states and 111903 transitions. [2024-10-11 03:15:09,553 INFO L78 Accepts]: Start accepts. Automaton has 67122 states and 111903 transitions. Word has length 131 [2024-10-11 03:15:09,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:09,554 INFO L471 AbstractCegarLoop]: Abstraction has 67122 states and 111903 transitions. [2024-10-11 03:15:09,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 5 states have internal predecessors, (120), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:15:09,554 INFO L276 IsEmpty]: Start isEmpty. Operand 67122 states and 111903 transitions. [2024-10-11 03:15:09,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 03:15:09,584 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:09,584 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:15:09,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 03:15:09,585 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:09,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:09,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1538199049, now seen corresponding path program 1 times [2024-10-11 03:15:09,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:09,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847354536] [2024-10-11 03:15:09,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:09,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:09,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:09,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:15:09,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:09,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 03:15:09,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:09,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:15:09,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:09,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 03:15:09,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:09,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 03:15:09,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:09,765 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:09,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:09,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847354536] [2024-10-11 03:15:09,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847354536] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:09,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:09,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:15:09,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076166560] [2024-10-11 03:15:09,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:09,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:15:09,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:09,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:15:09,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:15:09,767 INFO L87 Difference]: Start difference. First operand 67122 states and 111903 transitions. Second operand has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 5 states have internal predecessors, (120), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)