./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.04.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.04.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 05d3b7d21cc48825b4a0189c75f03d768acc6241312029d3e223c1b9b2a509ea --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 01:14:58,206 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 01:14:58,273 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 01:14:58,279 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 01:14:58,279 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 01:14:58,304 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 01:14:58,321 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 01:14:58,322 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 01:14:58,322 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 01:14:58,323 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 01:14:58,323 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 01:14:58,323 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 01:14:58,324 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 01:14:58,329 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 01:14:58,329 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 01:14:58,329 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 01:14:58,329 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 01:14:58,330 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 01:14:58,330 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 01:14:58,330 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 01:14:58,330 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 01:14:58,332 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 01:14:58,332 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 01:14:58,332 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 01:14:58,332 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 01:14:58,333 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 01:14:58,333 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 01:14:58,333 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 01:14:58,333 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 01:14:58,334 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 01:14:58,334 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 01:14:58,334 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 01:14:58,335 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:14:58,336 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 01:14:58,336 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 01:14:58,336 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 01:14:58,336 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 01:14:58,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 01:14:58,337 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 01:14:58,337 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 01:14:58,338 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 01:14:58,338 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 01:14:58,338 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 05d3b7d21cc48825b4a0189c75f03d768acc6241312029d3e223c1b9b2a509ea [2024-10-24 01:14:58,600 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 01:14:58,627 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 01:14:58,630 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 01:14:58,631 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 01:14:58,632 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 01:14:58,633 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.04.cil-2.c [2024-10-24 01:15:00,006 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 01:15:00,223 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 01:15:00,224 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.04.cil-2.c [2024-10-24 01:15:00,238 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40867d028/67d76f8ed8384a508038214646381206/FLAG4289d9ada [2024-10-24 01:15:00,255 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40867d028/67d76f8ed8384a508038214646381206 [2024-10-24 01:15:00,258 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 01:15:00,260 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 01:15:00,262 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 01:15:00,263 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 01:15:00,269 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 01:15:00,270 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:15:00" (1/1) ... [2024-10-24 01:15:00,271 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28aabdda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:15:00, skipping insertion in model container [2024-10-24 01:15:00,273 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:15:00" (1/1) ... [2024-10-24 01:15:00,321 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 01:15:00,490 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.04.cil-2.c[671,684] [2024-10-24 01:15:00,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:15:00,589 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 01:15:00,600 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.04.cil-2.c[671,684] [2024-10-24 01:15:00,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:15:00,652 INFO L204 MainTranslator]: Completed translation [2024-10-24 01:15:00,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:15:00 WrapperNode [2024-10-24 01:15:00,653 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 01:15:00,654 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 01:15:00,654 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 01:15:00,654 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 01:15:00,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:15:00" (1/1) ... [2024-10-24 01:15:00,667 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:15:00" (1/1) ... [2024-10-24 01:15:00,694 INFO L138 Inliner]: procedures = 36, calls = 44, calls flagged for inlining = 19, calls inlined = 19, statements flattened = 405 [2024-10-24 01:15:00,695 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 01:15:00,695 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 01:15:00,695 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 01:15:00,696 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 01:15:00,705 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:15:00" (1/1) ... [2024-10-24 01:15:00,705 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:15:00" (1/1) ... [2024-10-24 01:15:00,708 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:15:00" (1/1) ... [2024-10-24 01:15:00,721 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 01:15:00,722 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:15:00" (1/1) ... [2024-10-24 01:15:00,722 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:15:00" (1/1) ... [2024-10-24 01:15:00,731 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:15:00" (1/1) ... [2024-10-24 01:15:00,739 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:15:00" (1/1) ... [2024-10-24 01:15:00,741 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:15:00" (1/1) ... [2024-10-24 01:15:00,747 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:15:00" (1/1) ... [2024-10-24 01:15:00,755 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 01:15:00,756 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 01:15:00,757 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 01:15:00,757 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 01:15:00,757 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:15:00" (1/1) ... [2024-10-24 01:15:00,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:15:00,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:15:00,794 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 01:15:00,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 01:15:00,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 01:15:00,841 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-10-24 01:15:00,841 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-10-24 01:15:00,841 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-24 01:15:00,841 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-24 01:15:00,841 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-24 01:15:00,842 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-24 01:15:00,842 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-24 01:15:00,842 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-24 01:15:00,842 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-24 01:15:00,842 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-24 01:15:00,842 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-24 01:15:00,843 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-24 01:15:00,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 01:15:00,843 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-24 01:15:00,843 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-24 01:15:00,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 01:15:00,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 01:15:00,926 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 01:15:00,929 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 01:15:01,466 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2024-10-24 01:15:01,467 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 01:15:01,523 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 01:15:01,523 INFO L314 CfgBuilder]: Removed 7 assume(true) statements. [2024-10-24 01:15:01,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:15:01 BoogieIcfgContainer [2024-10-24 01:15:01,524 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 01:15:01,527 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 01:15:01,528 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 01:15:01,531 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 01:15:01,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 01:15:00" (1/3) ... [2024-10-24 01:15:01,533 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44d04d2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:15:01, skipping insertion in model container [2024-10-24 01:15:01,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:15:00" (2/3) ... [2024-10-24 01:15:01,533 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44d04d2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:15:01, skipping insertion in model container [2024-10-24 01:15:01,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:15:01" (3/3) ... [2024-10-24 01:15:01,535 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.04.cil-2.c [2024-10-24 01:15:01,553 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 01:15:01,553 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 01:15:01,622 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 01:15:01,627 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;@e28f035, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 01:15:01,627 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 01:15:01,632 INFO L276 IsEmpty]: Start isEmpty. Operand has 172 states, 143 states have (on average 1.6993006993006994) internal successors, (243), 147 states have internal predecessors, (243), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 01:15:01,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-24 01:15:01,645 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:15:01,646 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] [2024-10-24 01:15:01,647 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:15:01,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:15:01,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1753003295, now seen corresponding path program 1 times [2024-10-24 01:15:01,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:15:01,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138853895] [2024-10-24 01:15:01,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:15:01,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:15:01,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:01,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:15:01,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:02,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 01:15:02,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:02,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 01:15:02,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:02,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 01:15:02,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:02,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 01:15:02,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:02,162 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-24 01:15:02,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:15:02,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138853895] [2024-10-24 01:15:02,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138853895] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:15:02,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:15:02,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:15:02,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118030634] [2024-10-24 01:15:02,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:15:02,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:15:02,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:15:02,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:15:02,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:15:02,212 INFO L87 Difference]: Start difference. First operand has 172 states, 143 states have (on average 1.6993006993006994) internal successors, (243), 147 states have internal predecessors, (243), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 3 states have internal predecessors, (70), 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-24 01:15:03,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:15:03,111 INFO L93 Difference]: Finished difference Result 385 states and 641 transitions. [2024-10-24 01:15:03,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 01:15:03,114 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 3 states have internal predecessors, (70), 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 81 [2024-10-24 01:15:03,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:15:03,129 INFO L225 Difference]: With dead ends: 385 [2024-10-24 01:15:03,129 INFO L226 Difference]: Without dead ends: 219 [2024-10-24 01:15:03,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:15:03,138 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 421 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 01:15:03,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 326 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 01:15:03,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-24 01:15:03,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 169. [2024-10-24 01:15:03,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 142 states have (on average 1.5845070422535212) internal successors, (225), 144 states have internal predecessors, (225), 20 states have call successors, (20), 7 states have call predecessors, (20), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 01:15:03,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 263 transitions. [2024-10-24 01:15:03,206 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 263 transitions. Word has length 81 [2024-10-24 01:15:03,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:15:03,206 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 263 transitions. [2024-10-24 01:15:03,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 3 states have internal predecessors, (70), 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-24 01:15:03,207 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 263 transitions. [2024-10-24 01:15:03,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-24 01:15:03,210 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:15:03,210 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] [2024-10-24 01:15:03,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 01:15:03,210 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:15:03,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:15:03,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1676102497, now seen corresponding path program 1 times [2024-10-24 01:15:03,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:15:03,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454640709] [2024-10-24 01:15:03,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:15:03,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:15:03,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:03,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:15:03,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:03,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 01:15:03,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:03,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 01:15:03,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:03,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 01:15:03,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:03,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 01:15:03,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:03,469 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-24 01:15:03,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:15:03,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454640709] [2024-10-24 01:15:03,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454640709] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:15:03,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:15:03,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 01:15:03,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090559704] [2024-10-24 01:15:03,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:15:03,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 01:15:03,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:15:03,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 01:15:03,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 01:15:03,474 INFO L87 Difference]: Start difference. First operand 169 states and 263 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 4 states have internal predecessors, (70), 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-24 01:15:04,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:15:04,705 INFO L93 Difference]: Finished difference Result 590 states and 941 transitions. [2024-10-24 01:15:04,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 01:15:04,706 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 4 states have internal predecessors, (70), 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 81 [2024-10-24 01:15:04,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:15:04,710 INFO L225 Difference]: With dead ends: 590 [2024-10-24 01:15:04,710 INFO L226 Difference]: Without dead ends: 431 [2024-10-24 01:15:04,712 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-24 01:15:04,713 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 621 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 01:15:04,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 540 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 947 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 01:15:04,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2024-10-24 01:15:04,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 330. [2024-10-24 01:15:04,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 283 states have (on average 1.5936395759717314) internal successors, (451), 286 states have internal predecessors, (451), 33 states have call successors, (33), 13 states have call predecessors, (33), 13 states have return successors, (34), 31 states have call predecessors, (34), 31 states have call successors, (34) [2024-10-24 01:15:04,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 518 transitions. [2024-10-24 01:15:04,779 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 518 transitions. Word has length 81 [2024-10-24 01:15:04,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:15:04,779 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 518 transitions. [2024-10-24 01:15:04,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 4 states have internal predecessors, (70), 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-24 01:15:04,780 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 518 transitions. [2024-10-24 01:15:04,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-24 01:15:04,785 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:15:04,786 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] [2024-10-24 01:15:04,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 01:15:04,786 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:15:04,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:15:04,787 INFO L85 PathProgramCache]: Analyzing trace with hash 674003233, now seen corresponding path program 1 times [2024-10-24 01:15:04,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:15:04,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79235964] [2024-10-24 01:15:04,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:15:04,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:15:04,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:04,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:15:04,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:04,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 01:15:04,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:04,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 01:15:04,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:04,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 01:15:04,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:04,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 01:15:04,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:04,988 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-24 01:15:04,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:15:04,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79235964] [2024-10-24 01:15:04,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79235964] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:15:04,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:15:04,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:15:04,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098953008] [2024-10-24 01:15:04,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:15:04,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:15:04,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:15:04,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:15:04,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:15:04,991 INFO L87 Difference]: Start difference. First operand 330 states and 518 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 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-24 01:15:06,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:15:06,493 INFO L93 Difference]: Finished difference Result 965 states and 1535 transitions. [2024-10-24 01:15:06,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 01:15:06,494 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 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 81 [2024-10-24 01:15:06,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:15:06,502 INFO L225 Difference]: With dead ends: 965 [2024-10-24 01:15:06,502 INFO L226 Difference]: Without dead ends: 645 [2024-10-24 01:15:06,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-24 01:15:06,505 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 624 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 1560 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 1609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:15:06,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 1021 Invalid, 1609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1560 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 01:15:06,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2024-10-24 01:15:06,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 480. [2024-10-24 01:15:06,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 413 states have (on average 1.585956416464891) internal successors, (655), 417 states have internal predecessors, (655), 46 states have call successors, (46), 19 states have call predecessors, (46), 20 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) [2024-10-24 01:15:06,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 750 transitions. [2024-10-24 01:15:06,569 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 750 transitions. Word has length 81 [2024-10-24 01:15:06,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:15:06,569 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 750 transitions. [2024-10-24 01:15:06,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 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-24 01:15:06,570 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 750 transitions. [2024-10-24 01:15:06,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-24 01:15:06,571 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:15:06,573 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] [2024-10-24 01:15:06,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 01:15:06,577 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:15:06,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:15:06,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1627943391, now seen corresponding path program 1 times [2024-10-24 01:15:06,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:15:06,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775957974] [2024-10-24 01:15:06,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:15:06,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:15:06,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:06,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:15:06,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:06,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 01:15:06,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:06,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 01:15:06,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:06,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 01:15:06,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:06,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 01:15:06,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:06,820 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-24 01:15:06,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:15:06,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775957974] [2024-10-24 01:15:06,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775957974] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:15:06,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:15:06,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:15:06,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652696315] [2024-10-24 01:15:06,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:15:06,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:15:06,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:15:06,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:15:06,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:15:06,823 INFO L87 Difference]: Start difference. First operand 480 states and 750 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 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-24 01:15:08,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:15:08,145 INFO L93 Difference]: Finished difference Result 1514 states and 2403 transitions. [2024-10-24 01:15:08,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 01:15:08,146 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 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 81 [2024-10-24 01:15:08,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:15:08,153 INFO L225 Difference]: With dead ends: 1514 [2024-10-24 01:15:08,153 INFO L226 Difference]: Without dead ends: 1044 [2024-10-24 01:15:08,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-24 01:15:08,156 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 672 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 1287 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 1362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:15:08,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [683 Valid, 670 Invalid, 1362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1287 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 01:15:08,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2024-10-24 01:15:08,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 781. [2024-10-24 01:15:08,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 674 states have (on average 1.5786350148367954) internal successors, (1064), 680 states have internal predecessors, (1064), 72 states have call successors, (72), 31 states have call predecessors, (72), 34 states have return successors, (83), 73 states have call predecessors, (83), 70 states have call successors, (83) [2024-10-24 01:15:08,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1219 transitions. [2024-10-24 01:15:08,237 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1219 transitions. Word has length 81 [2024-10-24 01:15:08,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:15:08,237 INFO L471 AbstractCegarLoop]: Abstraction has 781 states and 1219 transitions. [2024-10-24 01:15:08,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 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-24 01:15:08,238 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1219 transitions. [2024-10-24 01:15:08,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-24 01:15:08,240 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:15:08,240 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] [2024-10-24 01:15:08,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 01:15:08,240 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:15:08,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:15:08,241 INFO L85 PathProgramCache]: Analyzing trace with hash 411789665, now seen corresponding path program 1 times [2024-10-24 01:15:08,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:15:08,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642049236] [2024-10-24 01:15:08,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:15:08,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:15:08,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:08,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:15:08,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:08,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 01:15:08,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:08,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 01:15:08,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:08,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 01:15:08,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:08,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 01:15:08,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:08,410 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-24 01:15:08,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:15:08,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642049236] [2024-10-24 01:15:08,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642049236] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:15:08,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:15:08,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:15:08,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198364953] [2024-10-24 01:15:08,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:15:08,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:15:08,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:15:08,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:15:08,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:15:08,413 INFO L87 Difference]: Start difference. First operand 781 states and 1219 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 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-24 01:15:09,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:15:09,094 INFO L93 Difference]: Finished difference Result 1803 states and 2863 transitions. [2024-10-24 01:15:09,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 01:15:09,095 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 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 81 [2024-10-24 01:15:09,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:15:09,101 INFO L225 Difference]: With dead ends: 1803 [2024-10-24 01:15:09,102 INFO L226 Difference]: Without dead ends: 1032 [2024-10-24 01:15:09,104 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-24 01:15:09,105 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 533 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 01:15:09,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 423 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 699 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 01:15:09,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2024-10-24 01:15:09,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 781. [2024-10-24 01:15:09,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 674 states have (on average 1.5712166172106825) internal successors, (1059), 680 states have internal predecessors, (1059), 72 states have call successors, (72), 31 states have call predecessors, (72), 34 states have return successors, (83), 73 states have call predecessors, (83), 70 states have call successors, (83) [2024-10-24 01:15:09,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1214 transitions. [2024-10-24 01:15:09,183 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1214 transitions. Word has length 81 [2024-10-24 01:15:09,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:15:09,184 INFO L471 AbstractCegarLoop]: Abstraction has 781 states and 1214 transitions. [2024-10-24 01:15:09,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 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-24 01:15:09,184 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1214 transitions. [2024-10-24 01:15:09,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-24 01:15:09,189 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:15:09,189 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] [2024-10-24 01:15:09,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 01:15:09,190 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:15:09,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:15:09,190 INFO L85 PathProgramCache]: Analyzing trace with hash -320177761, now seen corresponding path program 1 times [2024-10-24 01:15:09,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:15:09,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515380226] [2024-10-24 01:15:09,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:15:09,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:15:09,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:09,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:15:09,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:09,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 01:15:09,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:09,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 01:15:09,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:09,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 01:15:09,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:09,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 01:15:09,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:09,314 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-24 01:15:09,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:15:09,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515380226] [2024-10-24 01:15:09,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515380226] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:15:09,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:15:09,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:15:09,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576794495] [2024-10-24 01:15:09,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:15:09,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:15:09,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:15:09,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:15:09,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:15:09,317 INFO L87 Difference]: Start difference. First operand 781 states and 1214 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 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-24 01:15:10,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:15:10,020 INFO L93 Difference]: Finished difference Result 1797 states and 2837 transitions. [2024-10-24 01:15:10,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 01:15:10,021 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 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 81 [2024-10-24 01:15:10,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:15:10,027 INFO L225 Difference]: With dead ends: 1797 [2024-10-24 01:15:10,028 INFO L226 Difference]: Without dead ends: 1026 [2024-10-24 01:15:10,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-24 01:15:10,034 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 531 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 01:15:10,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 423 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 01:15:10,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2024-10-24 01:15:10,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 781. [2024-10-24 01:15:10,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 674 states have (on average 1.5637982195845697) internal successors, (1054), 680 states have internal predecessors, (1054), 72 states have call successors, (72), 31 states have call predecessors, (72), 34 states have return successors, (83), 73 states have call predecessors, (83), 70 states have call successors, (83) [2024-10-24 01:15:10,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1209 transitions. [2024-10-24 01:15:10,106 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1209 transitions. Word has length 81 [2024-10-24 01:15:10,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:15:10,107 INFO L471 AbstractCegarLoop]: Abstraction has 781 states and 1209 transitions. [2024-10-24 01:15:10,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 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-24 01:15:10,107 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1209 transitions. [2024-10-24 01:15:10,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-24 01:15:10,108 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:15:10,109 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] [2024-10-24 01:15:10,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 01:15:10,109 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:15:10,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:15:10,109 INFO L85 PathProgramCache]: Analyzing trace with hash -2006357599, now seen corresponding path program 1 times [2024-10-24 01:15:10,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:15:10,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945241479] [2024-10-24 01:15:10,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:15:10,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:15:10,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:10,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:15:10,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:10,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 01:15:10,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:10,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 01:15:10,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:10,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 01:15:10,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:10,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 01:15:10,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:10,240 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-24 01:15:10,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:15:10,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945241479] [2024-10-24 01:15:10,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945241479] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:15:10,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:15:10,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:15:10,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768686983] [2024-10-24 01:15:10,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:15:10,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:15:10,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:15:10,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:15:10,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:15:10,243 INFO L87 Difference]: Start difference. First operand 781 states and 1209 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 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-24 01:15:11,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:15:11,831 INFO L93 Difference]: Finished difference Result 2780 states and 4348 transitions. [2024-10-24 01:15:11,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 01:15:11,832 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 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 81 [2024-10-24 01:15:11,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:15:11,844 INFO L225 Difference]: With dead ends: 2780 [2024-10-24 01:15:11,845 INFO L226 Difference]: Without dead ends: 2009 [2024-10-24 01:15:11,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-24 01:15:11,849 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 754 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 1496 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 1550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:15:11,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [770 Valid, 1012 Invalid, 1550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1496 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 01:15:11,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2009 states. [2024-10-24 01:15:11,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2009 to 1384. [2024-10-24 01:15:11,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1201 states have (on average 1.5570358034970857) internal successors, (1870), 1211 states have internal predecessors, (1870), 120 states have call successors, (120), 55 states have call predecessors, (120), 62 states have return successors, (153), 125 states have call predecessors, (153), 118 states have call successors, (153) [2024-10-24 01:15:11,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 2143 transitions. [2024-10-24 01:15:11,958 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 2143 transitions. Word has length 81 [2024-10-24 01:15:11,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:15:11,959 INFO L471 AbstractCegarLoop]: Abstraction has 1384 states and 2143 transitions. [2024-10-24 01:15:11,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 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-24 01:15:11,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 2143 transitions. [2024-10-24 01:15:11,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-24 01:15:11,963 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:15:11,963 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] [2024-10-24 01:15:11,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 01:15:11,964 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:15:11,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:15:11,964 INFO L85 PathProgramCache]: Analyzing trace with hash -2060750497, now seen corresponding path program 1 times [2024-10-24 01:15:11,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:15:11,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805521269] [2024-10-24 01:15:11,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:15:11,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:15:11,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:12,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:15:12,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:12,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 01:15:12,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:12,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 01:15:12,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:12,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 01:15:12,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:12,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 01:15:12,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:12,113 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-24 01:15:12,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:15:12,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805521269] [2024-10-24 01:15:12,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805521269] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:15:12,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:15:12,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:15:12,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381695150] [2024-10-24 01:15:12,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:15:12,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:15:12,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:15:12,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:15:12,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:15:12,116 INFO L87 Difference]: Start difference. First operand 1384 states and 2143 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 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-24 01:15:13,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:15:13,883 INFO L93 Difference]: Finished difference Result 5003 states and 7824 transitions. [2024-10-24 01:15:13,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 01:15:13,883 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 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 81 [2024-10-24 01:15:13,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:15:13,906 INFO L225 Difference]: With dead ends: 5003 [2024-10-24 01:15:13,907 INFO L226 Difference]: Without dead ends: 3629 [2024-10-24 01:15:13,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-24 01:15:13,914 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 630 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 1710 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 640 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 1763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 01:15:13,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [640 Valid, 1008 Invalid, 1763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1710 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 01:15:13,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3629 states. [2024-10-24 01:15:14,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3629 to 2504. [2024-10-24 01:15:14,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2504 states, 2173 states have (on average 1.54348826507133) internal successors, (3354), 2191 states have internal predecessors, (3354), 212 states have call successors, (212), 103 states have call predecessors, (212), 118 states have return successors, (307), 225 states have call predecessors, (307), 210 states have call successors, (307) [2024-10-24 01:15:14,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2504 states to 2504 states and 3873 transitions. [2024-10-24 01:15:14,121 INFO L78 Accepts]: Start accepts. Automaton has 2504 states and 3873 transitions. Word has length 81 [2024-10-24 01:15:14,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:15:14,122 INFO L471 AbstractCegarLoop]: Abstraction has 2504 states and 3873 transitions. [2024-10-24 01:15:14,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 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-24 01:15:14,123 INFO L276 IsEmpty]: Start isEmpty. Operand 2504 states and 3873 transitions. [2024-10-24 01:15:14,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-24 01:15:14,126 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:15:14,126 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:15:14,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 01:15:14,126 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:15:14,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:15:14,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1816820193, now seen corresponding path program 1 times [2024-10-24 01:15:14,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:15:14,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588311635] [2024-10-24 01:15:14,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:15:14,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:15:14,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:14,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:15:14,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:14,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 01:15:14,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:14,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 01:15:14,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:14,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 01:15:14,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:14,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 01:15:14,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:14,259 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-24 01:15:14,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:15:14,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588311635] [2024-10-24 01:15:14,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588311635] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:15:14,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:15:14,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:15:14,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877551419] [2024-10-24 01:15:14,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:15:14,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:15:14,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:15:14,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:15:14,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:15:14,262 INFO L87 Difference]: Start difference. First operand 2504 states and 3873 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 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-24 01:15:15,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:15:15,898 INFO L93 Difference]: Finished difference Result 8885 states and 13882 transitions. [2024-10-24 01:15:15,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 01:15:15,898 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 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 81 [2024-10-24 01:15:15,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:15:15,934 INFO L225 Difference]: With dead ends: 8885 [2024-10-24 01:15:15,934 INFO L226 Difference]: Without dead ends: 6391 [2024-10-24 01:15:15,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-24 01:15:15,944 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 647 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 1454 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 1508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:15:15,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 1012 Invalid, 1508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1454 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 01:15:15,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6391 states. [2024-10-24 01:15:16,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6391 to 4839. [2024-10-24 01:15:16,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4839 states, 4220 states have (on average 1.543127962085308) internal successors, (6512), 4254 states have internal predecessors, (6512), 388 states have call successors, (388), 199 states have call predecessors, (388), 230 states have return successors, (661), 417 states have call predecessors, (661), 386 states have call successors, (661) [2024-10-24 01:15:16,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4839 states to 4839 states and 7561 transitions. [2024-10-24 01:15:16,366 INFO L78 Accepts]: Start accepts. Automaton has 4839 states and 7561 transitions. Word has length 81 [2024-10-24 01:15:16,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:15:16,367 INFO L471 AbstractCegarLoop]: Abstraction has 4839 states and 7561 transitions. [2024-10-24 01:15:16,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 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-24 01:15:16,367 INFO L276 IsEmpty]: Start isEmpty. Operand 4839 states and 7561 transitions. [2024-10-24 01:15:16,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-24 01:15:16,372 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:15:16,372 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] [2024-10-24 01:15:16,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 01:15:16,372 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:15:16,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:15:16,373 INFO L85 PathProgramCache]: Analyzing trace with hash -516572445, now seen corresponding path program 1 times [2024-10-24 01:15:16,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:15:16,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878229930] [2024-10-24 01:15:16,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:15:16,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:15:16,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:16,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:15:16,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:16,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 01:15:16,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:16,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 01:15:16,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:16,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 01:15:16,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:16,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 01:15:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:16,525 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-24 01:15:16,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:15:16,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878229930] [2024-10-24 01:15:16,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878229930] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:15:16,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:15:16,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:15:16,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584086363] [2024-10-24 01:15:16,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:15:16,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:15:16,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:15:16,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:15:16,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:15:16,527 INFO L87 Difference]: Start difference. First operand 4839 states and 7561 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 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-24 01:15:18,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:15:18,470 INFO L93 Difference]: Finished difference Result 16860 states and 26568 transitions. [2024-10-24 01:15:18,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 01:15:18,471 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 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 81 [2024-10-24 01:15:18,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:15:18,536 INFO L225 Difference]: With dead ends: 16860 [2024-10-24 01:15:18,537 INFO L226 Difference]: Without dead ends: 12031 [2024-10-24 01:15:18,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-24 01:15:18,558 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 596 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 1530 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 1584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:15:18,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 1012 Invalid, 1584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1530 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 01:15:18,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12031 states. [2024-10-24 01:15:19,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12031 to 9506. [2024-10-24 01:15:19,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9506 states, 8327 states have (on average 1.5436531764140746) internal successors, (12854), 8393 states have internal predecessors, (12854), 724 states have call successors, (724), 391 states have call predecessors, (724), 454 states have return successors, (1515), 785 states have call predecessors, (1515), 722 states have call successors, (1515) [2024-10-24 01:15:19,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9506 states to 9506 states and 15093 transitions. [2024-10-24 01:15:19,416 INFO L78 Accepts]: Start accepts. Automaton has 9506 states and 15093 transitions. Word has length 81 [2024-10-24 01:15:19,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:15:19,416 INFO L471 AbstractCegarLoop]: Abstraction has 9506 states and 15093 transitions. [2024-10-24 01:15:19,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 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-24 01:15:19,416 INFO L276 IsEmpty]: Start isEmpty. Operand 9506 states and 15093 transitions. [2024-10-24 01:15:19,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-24 01:15:19,426 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:15:19,426 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] [2024-10-24 01:15:19,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 01:15:19,427 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:15:19,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:15:19,427 INFO L85 PathProgramCache]: Analyzing trace with hash -314748511, now seen corresponding path program 1 times [2024-10-24 01:15:19,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:15:19,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107363999] [2024-10-24 01:15:19,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:15:19,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:15:19,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:19,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:15:19,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:19,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 01:15:19,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:19,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 01:15:19,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:19,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 01:15:19,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:19,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 01:15:19,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:19,606 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-24 01:15:19,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:15:19,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107363999] [2024-10-24 01:15:19,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107363999] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:15:19,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:15:19,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 01:15:19,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735728478] [2024-10-24 01:15:19,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:15:19,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 01:15:19,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:15:19,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 01:15:19,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 01:15:19,609 INFO L87 Difference]: Start difference. First operand 9506 states and 15093 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 4 states have internal predecessors, (70), 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-24 01:15:21,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:15:21,551 INFO L93 Difference]: Finished difference Result 26812 states and 42512 transitions. [2024-10-24 01:15:21,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 01:15:21,552 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 4 states have internal predecessors, (70), 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 81 [2024-10-24 01:15:21,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:15:21,636 INFO L225 Difference]: With dead ends: 26812 [2024-10-24 01:15:21,636 INFO L226 Difference]: Without dead ends: 17317 [2024-10-24 01:15:21,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-24 01:15:21,671 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 796 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 1247 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 1326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 01:15:21,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 732 Invalid, 1326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1247 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 01:15:21,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17317 states. [2024-10-24 01:15:22,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17317 to 14161. [2024-10-24 01:15:22,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14161 states, 12370 states have (on average 1.5295068714632174) internal successors, (18920), 12501 states have internal predecessors, (18920), 1106 states have call successors, (1106), 589 states have call predecessors, (1106), 684 states have return successors, (2141), 1134 states have call predecessors, (2141), 1104 states have call successors, (2141) [2024-10-24 01:15:22,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14161 states to 14161 states and 22167 transitions. [2024-10-24 01:15:22,933 INFO L78 Accepts]: Start accepts. Automaton has 14161 states and 22167 transitions. Word has length 81 [2024-10-24 01:15:22,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:15:22,936 INFO L471 AbstractCegarLoop]: Abstraction has 14161 states and 22167 transitions. [2024-10-24 01:15:22,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 4 states have internal predecessors, (70), 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-24 01:15:22,936 INFO L276 IsEmpty]: Start isEmpty. Operand 14161 states and 22167 transitions. [2024-10-24 01:15:22,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-24 01:15:22,973 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:15:22,973 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:15:22,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 01:15:22,974 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:15:22,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:15:22,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1718177814, now seen corresponding path program 1 times [2024-10-24 01:15:22,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:15:22,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073227899] [2024-10-24 01:15:22,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:15:22,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:15:22,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:23,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:15:23,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:23,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 01:15:23,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:23,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 01:15:23,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:23,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 01:15:23,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:23,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 01:15:23,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:23,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 01:15:23,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:23,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 01:15:23,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:23,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 01:15:23,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:23,147 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-24 01:15:23,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:15:23,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073227899] [2024-10-24 01:15:23,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073227899] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:15:23,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112715032] [2024-10-24 01:15:23,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:15:23,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:15:23,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:15:23,151 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 01:15:23,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 01:15:23,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:23,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 01:15:23,293 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:15:23,398 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-24 01:15:23,399 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 01:15:23,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112715032] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:15:23,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 01:15:23,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-24 01:15:23,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959317054] [2024-10-24 01:15:23,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:15:23,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:15:23,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:15:23,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:15:23,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:15:23,402 INFO L87 Difference]: Start difference. First operand 14161 states and 22167 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 01:15:25,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:15:25,134 INFO L93 Difference]: Finished difference Result 42164 states and 66419 transitions. [2024-10-24 01:15:25,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:15:25,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 131 [2024-10-24 01:15:25,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:15:25,252 INFO L225 Difference]: With dead ends: 42164 [2024-10-24 01:15:25,252 INFO L226 Difference]: Without dead ends: 28014 [2024-10-24 01:15:25,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:15:25,296 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 216 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:15:25,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 456 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:15:25,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28014 states. [2024-10-24 01:15:27,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28014 to 27912. [2024-10-24 01:15:27,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27912 states, 24387 states have (on average 1.5249518185918727) internal successors, (37189), 24647 states have internal predecessors, (37189), 2156 states have call successors, (2156), 1177 states have call predecessors, (2156), 1368 states have return successors, (4165), 2151 states have call predecessors, (4165), 2154 states have call successors, (4165) [2024-10-24 01:15:27,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27912 states to 27912 states and 43510 transitions. [2024-10-24 01:15:27,756 INFO L78 Accepts]: Start accepts. Automaton has 27912 states and 43510 transitions. Word has length 131 [2024-10-24 01:15:27,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:15:27,757 INFO L471 AbstractCegarLoop]: Abstraction has 27912 states and 43510 transitions. [2024-10-24 01:15:27,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 01:15:27,758 INFO L276 IsEmpty]: Start isEmpty. Operand 27912 states and 43510 transitions. [2024-10-24 01:15:27,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-24 01:15:27,831 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:15:27,832 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:15:27,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 01:15:28,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-24 01:15:28,034 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:15:28,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:15:28,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1991092534, now seen corresponding path program 1 times [2024-10-24 01:15:28,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:15:28,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263201821] [2024-10-24 01:15:28,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:15:28,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:15:28,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:28,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:15:28,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:28,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 01:15:28,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:28,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 01:15:28,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:28,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 01:15:28,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:28,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 01:15:28,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:28,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 01:15:28,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:28,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 01:15:28,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:28,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 01:15:28,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:28,194 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-24 01:15:28,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:15:28,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263201821] [2024-10-24 01:15:28,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263201821] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:15:28,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661367155] [2024-10-24 01:15:28,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:15:28,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:15:28,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:15:28,197 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 01:15:28,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 01:15:28,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:28,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 01:15:28,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:15:28,398 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-24 01:15:28,398 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 01:15:28,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661367155] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:15:28,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 01:15:28,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-24 01:15:28,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020171917] [2024-10-24 01:15:28,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:15:28,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:15:28,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:15:28,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:15:28,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:15:28,401 INFO L87 Difference]: Start difference. First operand 27912 states and 43510 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 01:15:31,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:15:31,822 INFO L93 Difference]: Finished difference Result 83121 states and 130416 transitions. [2024-10-24 01:15:31,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:15:31,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 131 [2024-10-24 01:15:31,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:15:32,097 INFO L225 Difference]: With dead ends: 83121 [2024-10-24 01:15:32,098 INFO L226 Difference]: Without dead ends: 55220 [2024-10-24 01:15:32,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:15:32,179 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 211 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:15:32,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 456 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:15:32,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55220 states. [2024-10-24 01:15:35,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55220 to 55020. [2024-10-24 01:15:35,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55020 states, 48077 states have (on average 1.5202487676019718) internal successors, (73089), 48595 states have internal predecessors, (73089), 4206 states have call successors, (4206), 2353 states have call predecessors, (4206), 2736 states have return successors, (8163), 4135 states have call predecessors, (8163), 4204 states have call successors, (8163) [2024-10-24 01:15:36,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55020 states to 55020 states and 85458 transitions. [2024-10-24 01:15:36,035 INFO L78 Accepts]: Start accepts. Automaton has 55020 states and 85458 transitions. Word has length 131 [2024-10-24 01:15:36,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:15:36,035 INFO L471 AbstractCegarLoop]: Abstraction has 55020 states and 85458 transitions. [2024-10-24 01:15:36,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 01:15:36,036 INFO L276 IsEmpty]: Start isEmpty. Operand 55020 states and 85458 transitions. [2024-10-24 01:15:36,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-24 01:15:36,505 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:15:36,506 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:15:36,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 01:15:36,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-24 01:15:36,707 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:15:36,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:15:36,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1289872362, now seen corresponding path program 1 times [2024-10-24 01:15:36,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:15:36,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351741411] [2024-10-24 01:15:36,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:15:36,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:15:36,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:36,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:15:36,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:36,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 01:15:36,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:36,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 01:15:36,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:36,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 01:15:36,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:36,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 01:15:36,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:36,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 01:15:36,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:36,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 01:15:36,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:36,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 01:15:36,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:36,839 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-24 01:15:36,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:15:36,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351741411] [2024-10-24 01:15:36,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351741411] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:15:36,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631574191] [2024-10-24 01:15:36,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:15:36,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:15:36,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:15:36,842 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 01:15:36,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 01:15:36,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:36,949 INFO L255 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 01:15:36,951 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:15:36,983 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-24 01:15:36,983 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 01:15:36,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631574191] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:15:36,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 01:15:36,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-24 01:15:36,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020361415] [2024-10-24 01:15:36,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:15:36,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:15:36,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:15:36,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:15:36,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:15:36,985 INFO L87 Difference]: Start difference. First operand 55020 states and 85458 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 01:15:42,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:15:42,863 INFO L93 Difference]: Finished difference Result 162408 states and 254831 transitions. [2024-10-24 01:15:42,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:15:42,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 131 [2024-10-24 01:15:42,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:15:43,560 INFO L225 Difference]: With dead ends: 162408 [2024-10-24 01:15:43,561 INFO L226 Difference]: Without dead ends: 107400 [2024-10-24 01:15:43,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:15:43,713 INFO L432 NwaCegarLoop]: 449 mSDtfsCounter, 218 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:15:43,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 689 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:15:43,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107400 states. [2024-10-24 01:15:51,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107400 to 107400. [2024-10-24 01:15:51,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107400 states, 93782 states have (on average 1.511004243884754) internal successors, (141705), 94685 states have internal predecessors, (141705), 8145 states have call successors, (8145), 4705 states have call predecessors, (8145), 5472 states have return successors, (17646), 8137 states have call predecessors, (17646), 8143 states have call successors, (17646) [2024-10-24 01:15:51,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107400 states to 107400 states and 167496 transitions. [2024-10-24 01:15:51,606 INFO L78 Accepts]: Start accepts. Automaton has 107400 states and 167496 transitions. Word has length 131 [2024-10-24 01:15:51,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:15:51,607 INFO L471 AbstractCegarLoop]: Abstraction has 107400 states and 167496 transitions. [2024-10-24 01:15:51,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 01:15:51,607 INFO L276 IsEmpty]: Start isEmpty. Operand 107400 states and 167496 transitions. [2024-10-24 01:15:51,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-24 01:15:51,877 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:15:51,877 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:15:51,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-24 01:15:52,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:15:52,078 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:15:52,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:15:52,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1396618167, now seen corresponding path program 1 times [2024-10-24 01:15:52,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:15:52,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682075079] [2024-10-24 01:15:52,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:15:52,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:15:52,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:52,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:15:52,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:52,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 01:15:52,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:52,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 01:15:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:52,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 01:15:52,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:52,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 01:15:52,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:52,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 01:15:52,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:52,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 01:15:52,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:52,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 01:15:52,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:52,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 01:15:52,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:52,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-24 01:15:52,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:52,242 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-24 01:15:52,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:15:52,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682075079] [2024-10-24 01:15:52,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682075079] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:15:52,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348443610] [2024-10-24 01:15:52,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:15:52,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:15:52,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:15:52,246 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 01:15:52,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 01:15:52,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:52,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 01:15:52,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:15:52,547 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-24 01:15:52,551 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 01:15:52,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348443610] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:15:52,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 01:15:52,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-24 01:15:52,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132955914] [2024-10-24 01:15:52,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:15:52,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:15:52,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:15:52,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:15:52,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:15:52,553 INFO L87 Difference]: Start difference. First operand 107400 states and 167496 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10)