./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/kundu.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/kundu.cil.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 941010afb19994aa6e2e07f5c4b80f87a4c5e60b4e0ef3217e91339d9dc3aacb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 19:53:22,466 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 19:53:22,541 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 19:53:22,547 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 19:53:22,548 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 19:53:22,587 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 19:53:22,587 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 19:53:22,587 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 19:53:22,588 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 19:53:22,591 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 19:53:22,591 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 19:53:22,591 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 19:53:22,592 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 19:53:22,592 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 19:53:22,592 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 19:53:22,593 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 19:53:22,593 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 19:53:22,593 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 19:53:22,593 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 19:53:22,594 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 19:53:22,594 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 19:53:22,597 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 19:53:22,597 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 19:53:22,598 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 19:53:22,598 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 19:53:22,598 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 19:53:22,598 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 19:53:22,599 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 19:53:22,599 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 19:53:22,599 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 19:53:22,599 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 19:53:22,599 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 19:53:22,600 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:53:22,600 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 19:53:22,600 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 19:53:22,600 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 19:53:22,600 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 19:53:22,601 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 19:53:22,601 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 19:53:22,601 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 19:53:22,602 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 19:53:22,603 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 19:53:22,604 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 -> 941010afb19994aa6e2e07f5c4b80f87a4c5e60b4e0ef3217e91339d9dc3aacb [2024-10-12 19:53:22,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 19:53:22,884 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 19:53:22,887 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 19:53:22,888 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 19:53:22,888 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 19:53:22,890 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/kundu.cil.c [2024-10-12 19:53:24,334 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 19:53:24,569 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 19:53:24,570 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/kundu.cil.c [2024-10-12 19:53:24,585 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5de971fe/066c959c4d5749d6ac0141f3a1e27690/FLAGe79b74302 [2024-10-12 19:53:24,601 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5de971fe/066c959c4d5749d6ac0141f3a1e27690 [2024-10-12 19:53:24,605 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 19:53:24,606 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 19:53:24,608 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 19:53:24,608 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 19:53:24,615 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 19:53:24,616 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:53:24" (1/1) ... [2024-10-12 19:53:24,617 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d006661 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:53:24, skipping insertion in model container [2024-10-12 19:53:24,617 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:53:24" (1/1) ... [2024-10-12 19:53:24,657 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 19:53:24,812 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/kundu.cil.c[635,648] [2024-10-12 19:53:24,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:53:24,874 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 19:53:24,885 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/kundu.cil.c[635,648] [2024-10-12 19:53:24,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:53:24,932 INFO L204 MainTranslator]: Completed translation [2024-10-12 19:53:24,933 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:53:24 WrapperNode [2024-10-12 19:53:24,933 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 19:53:24,934 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 19:53:24,934 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 19:53:24,935 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 19:53:24,942 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:53:24" (1/1) ... [2024-10-12 19:53:24,949 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:53:24" (1/1) ... [2024-10-12 19:53:24,977 INFO L138 Inliner]: procedures = 34, calls = 40, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 317 [2024-10-12 19:53:24,978 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 19:53:24,979 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 19:53:24,979 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 19:53:24,979 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 19:53:24,986 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:53:24" (1/1) ... [2024-10-12 19:53:24,986 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:53:24" (1/1) ... [2024-10-12 19:53:24,989 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:53:24" (1/1) ... [2024-10-12 19:53:25,003 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-12 19:53:25,003 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:53:24" (1/1) ... [2024-10-12 19:53:25,003 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:53:24" (1/1) ... [2024-10-12 19:53:25,009 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:53:24" (1/1) ... [2024-10-12 19:53:25,017 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:53:24" (1/1) ... [2024-10-12 19:53:25,023 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:53:24" (1/1) ... [2024-10-12 19:53:25,025 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:53:24" (1/1) ... [2024-10-12 19:53:25,031 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 19:53:25,036 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 19:53:25,036 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 19:53:25,036 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 19:53:25,037 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:53:24" (1/1) ... [2024-10-12 19:53:25,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:53:25,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:53:25,083 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-12 19:53:25,086 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-12 19:53:25,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 19:53:25,135 INFO L130 BoogieDeclarations]: Found specification of procedure write_data [2024-10-12 19:53:25,135 INFO L138 BoogieDeclarations]: Found implementation of procedure write_data [2024-10-12 19:53:25,135 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-10-12 19:53:25,136 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-10-12 19:53:25,136 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-12 19:53:25,136 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-12 19:53:25,136 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-12 19:53:25,136 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-12 19:53:25,136 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-12 19:53:25,136 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-12 19:53:25,137 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-12 19:53:25,137 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-12 19:53:25,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 19:53:25,137 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-12 19:53:25,137 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-12 19:53:25,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 19:53:25,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 19:53:25,212 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 19:53:25,215 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 19:53:25,611 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2024-10-12 19:53:25,611 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 19:53:25,654 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 19:53:25,655 INFO L314 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-12 19:53:25,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:53:25 BoogieIcfgContainer [2024-10-12 19:53:25,655 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 19:53:25,657 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 19:53:25,658 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 19:53:25,661 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 19:53:25,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 07:53:24" (1/3) ... [2024-10-12 19:53:25,662 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@538425aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:53:25, skipping insertion in model container [2024-10-12 19:53:25,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:53:24" (2/3) ... [2024-10-12 19:53:25,663 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@538425aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:53:25, skipping insertion in model container [2024-10-12 19:53:25,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:53:25" (3/3) ... [2024-10-12 19:53:25,665 INFO L112 eAbstractionObserver]: Analyzing ICFG kundu.cil.c [2024-10-12 19:53:25,681 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 19:53:25,682 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 19:53:25,757 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 19:53:25,765 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;@ba19471, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 19:53:25,765 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 19:53:25,770 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 96 states have (on average 1.5833333333333333) internal successors, (152), 100 states have internal predecessors, (152), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-12 19:53:25,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-12 19:53:25,780 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:53:25,781 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] [2024-10-12 19:53:25,782 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:53:25,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:53:25,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1531733126, now seen corresponding path program 1 times [2024-10-12 19:53:25,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:53:25,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878809311] [2024-10-12 19:53:25,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:53:25,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:53:25,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:26,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:53:26,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:26,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:53:26,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:26,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:53:26,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:26,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 19:53:26,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:26,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 19:53:26,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:26,141 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-12 19:53:26,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:53:26,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878809311] [2024-10-12 19:53:26,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878809311] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:53:26,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:53:26,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 19:53:26,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053953618] [2024-10-12 19:53:26,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:53:26,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:53:26,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:53:26,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:53:26,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:53:26,174 INFO L87 Difference]: Start difference. First operand has 123 states, 96 states have (on average 1.5833333333333333) internal successors, (152), 100 states have internal predecessors, (152), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:53:26,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:53:26,421 INFO L93 Difference]: Finished difference Result 256 states and 398 transitions. [2024-10-12 19:53:26,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 19:53:26,424 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2024-10-12 19:53:26,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:53:26,433 INFO L225 Difference]: With dead ends: 256 [2024-10-12 19:53:26,433 INFO L226 Difference]: Without dead ends: 135 [2024-10-12 19:53:26,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:53:26,440 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 208 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:53:26,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 262 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 19:53:26,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-12 19:53:26,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 119. [2024-10-12 19:53:26,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 94 states have (on average 1.4893617021276595) internal successors, (140), 97 states have internal predecessors, (140), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-12 19:53:26,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 173 transitions. [2024-10-12 19:53:26,511 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 173 transitions. Word has length 52 [2024-10-12 19:53:26,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:53:26,512 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 173 transitions. [2024-10-12 19:53:26,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:53:26,513 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 173 transitions. [2024-10-12 19:53:26,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-12 19:53:26,516 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:53:26,517 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] [2024-10-12 19:53:26,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 19:53:26,517 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:53:26,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:53:26,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1884821508, now seen corresponding path program 1 times [2024-10-12 19:53:26,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:53:26,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804248113] [2024-10-12 19:53:26,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:53:26,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:53:26,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:26,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:53:26,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:26,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:53:26,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:26,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:53:26,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:26,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 19:53:26,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:26,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 19:53:26,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:26,759 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-12 19:53:26,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:53:26,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804248113] [2024-10-12 19:53:26,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804248113] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:53:26,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:53:26,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 19:53:26,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885756673] [2024-10-12 19:53:26,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:53:26,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:53:26,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:53:26,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:53:26,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:53:26,767 INFO L87 Difference]: Start difference. First operand 119 states and 173 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:53:27,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:53:27,155 INFO L93 Difference]: Finished difference Result 368 states and 542 transitions. [2024-10-12 19:53:27,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:53:27,156 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2024-10-12 19:53:27,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:53:27,159 INFO L225 Difference]: With dead ends: 368 [2024-10-12 19:53:27,159 INFO L226 Difference]: Without dead ends: 258 [2024-10-12 19:53:27,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:53:27,161 INFO L432 NwaCegarLoop]: 314 mSDtfsCounter, 370 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:53:27,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 730 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 19:53:27,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-10-12 19:53:27,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 220. [2024-10-12 19:53:27,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 178 states have (on average 1.4775280898876404) internal successors, (263), 182 states have internal predecessors, (263), 29 states have call successors, (29), 13 states have call predecessors, (29), 12 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-12 19:53:27,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 318 transitions. [2024-10-12 19:53:27,208 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 318 transitions. Word has length 52 [2024-10-12 19:53:27,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:53:27,208 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 318 transitions. [2024-10-12 19:53:27,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:53:27,208 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 318 transitions. [2024-10-12 19:53:27,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-12 19:53:27,213 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:53:27,213 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] [2024-10-12 19:53:27,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 19:53:27,214 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:53:27,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:53:27,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1886825117, now seen corresponding path program 1 times [2024-10-12 19:53:27,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:53:27,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216626235] [2024-10-12 19:53:27,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:53:27,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:53:27,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:27,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:53:27,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:27,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:53:27,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:27,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:53:27,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:27,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 19:53:27,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:27,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 19:53:27,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:27,392 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-12 19:53:27,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:53:27,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216626235] [2024-10-12 19:53:27,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216626235] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:53:27,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:53:27,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 19:53:27,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710505705] [2024-10-12 19:53:27,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:53:27,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:53:27,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:53:27,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:53:27,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:53:27,400 INFO L87 Difference]: Start difference. First operand 220 states and 318 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:53:27,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:53:27,655 INFO L93 Difference]: Finished difference Result 459 states and 676 transitions. [2024-10-12 19:53:27,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 19:53:27,656 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2024-10-12 19:53:27,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:53:27,658 INFO L225 Difference]: With dead ends: 459 [2024-10-12 19:53:27,660 INFO L226 Difference]: Without dead ends: 248 [2024-10-12 19:53:27,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:53:27,665 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 50 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:53:27,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 551 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 19:53:27,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-10-12 19:53:27,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 222. [2024-10-12 19:53:27,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 180 states have (on average 1.4666666666666666) internal successors, (264), 184 states have internal predecessors, (264), 29 states have call successors, (29), 13 states have call predecessors, (29), 12 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-12 19:53:27,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 319 transitions. [2024-10-12 19:53:27,700 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 319 transitions. Word has length 52 [2024-10-12 19:53:27,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:53:27,700 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 319 transitions. [2024-10-12 19:53:27,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:53:27,702 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 319 transitions. [2024-10-12 19:53:27,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-12 19:53:27,706 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:53:27,706 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] [2024-10-12 19:53:27,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 19:53:27,706 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:53:27,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:53:27,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1564136677, now seen corresponding path program 1 times [2024-10-12 19:53:27,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:53:27,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140118540] [2024-10-12 19:53:27,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:53:27,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:53:27,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:27,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:53:27,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:27,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:53:27,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:27,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:53:27,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:27,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 19:53:27,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:27,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 19:53:27,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:27,791 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-12 19:53:27,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:53:27,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140118540] [2024-10-12 19:53:27,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140118540] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:53:27,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:53:27,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 19:53:27,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611185813] [2024-10-12 19:53:27,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:53:27,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:53:27,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:53:27,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:53:27,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:53:27,794 INFO L87 Difference]: Start difference. First operand 222 states and 319 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:53:27,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:53:27,983 INFO L93 Difference]: Finished difference Result 467 states and 684 transitions. [2024-10-12 19:53:27,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:53:27,984 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2024-10-12 19:53:27,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:53:27,986 INFO L225 Difference]: With dead ends: 467 [2024-10-12 19:53:27,988 INFO L226 Difference]: Without dead ends: 254 [2024-10-12 19:53:27,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:53:27,990 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 50 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:53:27,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 514 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:53:27,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-10-12 19:53:28,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 226. [2024-10-12 19:53:28,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 184 states have (on average 1.4565217391304348) internal successors, (268), 188 states have internal predecessors, (268), 29 states have call successors, (29), 13 states have call predecessors, (29), 12 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-12 19:53:28,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 323 transitions. [2024-10-12 19:53:28,017 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 323 transitions. Word has length 52 [2024-10-12 19:53:28,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:53:28,017 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 323 transitions. [2024-10-12 19:53:28,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:53:28,018 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 323 transitions. [2024-10-12 19:53:28,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-12 19:53:28,019 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:53:28,019 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] [2024-10-12 19:53:28,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 19:53:28,019 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:53:28,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:53:28,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1586768931, now seen corresponding path program 1 times [2024-10-12 19:53:28,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:53:28,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066515417] [2024-10-12 19:53:28,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:53:28,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:53:28,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:28,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:53:28,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:28,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:53:28,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:28,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:53:28,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:28,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 19:53:28,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:28,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 19:53:28,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:28,130 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-12 19:53:28,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:53:28,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066515417] [2024-10-12 19:53:28,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066515417] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:53:28,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:53:28,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:53:28,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212185318] [2024-10-12 19:53:28,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:53:28,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:53:28,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:53:28,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:53:28,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:53:28,133 INFO L87 Difference]: Start difference. First operand 226 states and 323 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:53:28,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:53:28,725 INFO L93 Difference]: Finished difference Result 937 states and 1377 transitions. [2024-10-12 19:53:28,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:53:28,726 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2024-10-12 19:53:28,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:53:28,733 INFO L225 Difference]: With dead ends: 937 [2024-10-12 19:53:28,734 INFO L226 Difference]: Without dead ends: 720 [2024-10-12 19:53:28,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:53:28,737 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 723 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 19:53:28,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 863 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 19:53:28,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2024-10-12 19:53:28,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 425. [2024-10-12 19:53:28,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 349 states have (on average 1.4441260744985673) internal successors, (504), 355 states have internal predecessors, (504), 51 states have call successors, (51), 25 states have call predecessors, (51), 24 states have return successors, (51), 45 states have call predecessors, (51), 48 states have call successors, (51) [2024-10-12 19:53:28,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 606 transitions. [2024-10-12 19:53:28,783 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 606 transitions. Word has length 52 [2024-10-12 19:53:28,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:53:28,784 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 606 transitions. [2024-10-12 19:53:28,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:53:28,784 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 606 transitions. [2024-10-12 19:53:28,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-12 19:53:28,785 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:53:28,785 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] [2024-10-12 19:53:28,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 19:53:28,785 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:53:28,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:53:28,786 INFO L85 PathProgramCache]: Analyzing trace with hash 971286814, now seen corresponding path program 1 times [2024-10-12 19:53:28,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:53:28,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391510678] [2024-10-12 19:53:28,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:53:28,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:53:28,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:28,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:53:28,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:28,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:53:28,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:28,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:53:28,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:28,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 19:53:28,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:28,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:53:28,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:28,868 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-12 19:53:28,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:53:28,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391510678] [2024-10-12 19:53:28,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391510678] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:53:28,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:53:28,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 19:53:28,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093914582] [2024-10-12 19:53:28,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:53:28,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:53:28,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:53:28,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:53:28,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:53:28,871 INFO L87 Difference]: Start difference. First operand 425 states and 606 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:53:29,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:53:29,065 INFO L93 Difference]: Finished difference Result 904 states and 1318 transitions. [2024-10-12 19:53:29,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:53:29,065 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 53 [2024-10-12 19:53:29,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:53:29,069 INFO L225 Difference]: With dead ends: 904 [2024-10-12 19:53:29,069 INFO L226 Difference]: Without dead ends: 488 [2024-10-12 19:53:29,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:53:29,071 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 50 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:53:29,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 514 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:53:29,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2024-10-12 19:53:29,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 433. [2024-10-12 19:53:29,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 357 states have (on average 1.4341736694677871) internal successors, (512), 363 states have internal predecessors, (512), 51 states have call successors, (51), 25 states have call predecessors, (51), 24 states have return successors, (51), 45 states have call predecessors, (51), 48 states have call successors, (51) [2024-10-12 19:53:29,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 614 transitions. [2024-10-12 19:53:29,105 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 614 transitions. Word has length 53 [2024-10-12 19:53:29,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:53:29,105 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 614 transitions. [2024-10-12 19:53:29,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:53:29,106 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 614 transitions. [2024-10-12 19:53:29,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-12 19:53:29,107 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:53:29,107 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] [2024-10-12 19:53:29,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 19:53:29,107 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:53:29,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:53:29,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1111835424, now seen corresponding path program 1 times [2024-10-12 19:53:29,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:53:29,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433970318] [2024-10-12 19:53:29,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:53:29,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:53:29,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:29,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:53:29,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:29,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:53:29,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:29,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:53:29,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:29,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 19:53:29,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:29,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:53:29,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:29,191 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-12 19:53:29,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:53:29,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433970318] [2024-10-12 19:53:29,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433970318] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:53:29,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:53:29,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:53:29,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599728408] [2024-10-12 19:53:29,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:53:29,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:53:29,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:53:29,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:53:29,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:53:29,193 INFO L87 Difference]: Start difference. First operand 433 states and 614 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-12 19:53:29,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:53:29,489 INFO L93 Difference]: Finished difference Result 1349 states and 1927 transitions. [2024-10-12 19:53:29,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:53:29,490 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 53 [2024-10-12 19:53:29,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:53:29,495 INFO L225 Difference]: With dead ends: 1349 [2024-10-12 19:53:29,495 INFO L226 Difference]: Without dead ends: 926 [2024-10-12 19:53:29,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:53:29,497 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 233 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:53:29,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 738 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 19:53:29,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2024-10-12 19:53:29,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 808. [2024-10-12 19:53:29,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 668 states have (on average 1.4251497005988023) internal successors, (952), 682 states have internal predecessors, (952), 91 states have call successors, (91), 49 states have call predecessors, (91), 48 states have return successors, (93), 77 states have call predecessors, (93), 88 states have call successors, (93) [2024-10-12 19:53:29,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1136 transitions. [2024-10-12 19:53:29,557 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1136 transitions. Word has length 53 [2024-10-12 19:53:29,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:53:29,558 INFO L471 AbstractCegarLoop]: Abstraction has 808 states and 1136 transitions. [2024-10-12 19:53:29,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-12 19:53:29,558 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1136 transitions. [2024-10-12 19:53:29,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-12 19:53:29,559 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:53:29,559 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 19:53:29,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 19:53:29,560 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:53:29,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:53:29,562 INFO L85 PathProgramCache]: Analyzing trace with hash -2095343432, now seen corresponding path program 1 times [2024-10-12 19:53:29,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:53:29,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929753612] [2024-10-12 19:53:29,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:53:29,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:53:29,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:29,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:53:29,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:29,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:53:29,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:29,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:53:29,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:29,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 19:53:29,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:29,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:53:29,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:29,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-12 19:53:29,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:29,714 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:53:29,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:53:29,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929753612] [2024-10-12 19:53:29,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929753612] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:53:29,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575338017] [2024-10-12 19:53:29,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:53:29,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:53:29,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:53:29,717 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-12 19:53:29,719 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-12 19:53:29,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:29,800 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 19:53:29,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:53:29,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:53:29,915 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:53:29,992 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:53:29,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575338017] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-12 19:53:29,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-12 19:53:29,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 5] total 8 [2024-10-12 19:53:29,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561775029] [2024-10-12 19:53:29,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:53:29,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:53:29,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:53:29,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:53:29,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:53:29,994 INFO L87 Difference]: Start difference. First operand 808 states and 1136 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-12 19:53:30,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:53:30,257 INFO L93 Difference]: Finished difference Result 2232 states and 3155 transitions. [2024-10-12 19:53:30,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:53:30,258 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 64 [2024-10-12 19:53:30,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:53:30,266 INFO L225 Difference]: With dead ends: 2232 [2024-10-12 19:53:30,266 INFO L226 Difference]: Without dead ends: 1525 [2024-10-12 19:53:30,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:53:30,270 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 277 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:53:30,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 1151 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 19:53:30,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525 states. [2024-10-12 19:53:30,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525 to 1510. [2024-10-12 19:53:30,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1510 states, 1254 states have (on average 1.4218500797448166) internal successors, (1783), 1277 states have internal predecessors, (1783), 165 states have call successors, (165), 91 states have call predecessors, (165), 90 states have return successors, (172), 142 states have call predecessors, (172), 162 states have call successors, (172) [2024-10-12 19:53:30,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 2120 transitions. [2024-10-12 19:53:30,368 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 2120 transitions. Word has length 64 [2024-10-12 19:53:30,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:53:30,369 INFO L471 AbstractCegarLoop]: Abstraction has 1510 states and 2120 transitions. [2024-10-12 19:53:30,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-12 19:53:30,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 2120 transitions. [2024-10-12 19:53:30,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-12 19:53:30,370 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:53:30,370 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] [2024-10-12 19:53:30,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-12 19:53:30,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:53:30,571 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:53:30,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:53:30,572 INFO L85 PathProgramCache]: Analyzing trace with hash -850655386, now seen corresponding path program 1 times [2024-10-12 19:53:30,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:53:30,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380772190] [2024-10-12 19:53:30,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:53:30,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:53:30,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:30,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:53:30,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:30,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:53:30,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:30,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:53:30,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:30,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 19:53:30,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:30,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:53:30,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:30,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-12 19:53:30,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:30,684 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-12 19:53:30,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:53:30,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380772190] [2024-10-12 19:53:30,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380772190] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:53:30,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:53:30,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:53:30,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329362183] [2024-10-12 19:53:30,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:53:30,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:53:30,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:53:30,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:53:30,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:53:30,687 INFO L87 Difference]: Start difference. First operand 1510 states and 2120 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 19:53:31,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:53:31,334 INFO L93 Difference]: Finished difference Result 4752 states and 6781 transitions. [2024-10-12 19:53:31,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 19:53:31,335 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 66 [2024-10-12 19:53:31,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:53:31,354 INFO L225 Difference]: With dead ends: 4752 [2024-10-12 19:53:31,354 INFO L226 Difference]: Without dead ends: 3252 [2024-10-12 19:53:31,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-12 19:53:31,361 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 396 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 19:53:31,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 522 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 19:53:31,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3252 states. [2024-10-12 19:53:31,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3252 to 2964. [2024-10-12 19:53:31,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2964 states, 2487 states have (on average 1.403297145154805) internal successors, (3490), 2528 states have internal predecessors, (3490), 292 states have call successors, (292), 170 states have call predecessors, (292), 184 states have return successors, (401), 267 states have call predecessors, (401), 289 states have call successors, (401) [2024-10-12 19:53:31,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2964 states to 2964 states and 4183 transitions. [2024-10-12 19:53:31,555 INFO L78 Accepts]: Start accepts. Automaton has 2964 states and 4183 transitions. Word has length 66 [2024-10-12 19:53:31,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:53:31,556 INFO L471 AbstractCegarLoop]: Abstraction has 2964 states and 4183 transitions. [2024-10-12 19:53:31,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 19:53:31,556 INFO L276 IsEmpty]: Start isEmpty. Operand 2964 states and 4183 transitions. [2024-10-12 19:53:31,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-12 19:53:31,558 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:53:31,558 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] [2024-10-12 19:53:31,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 19:53:31,558 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:53:31,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:53:31,558 INFO L85 PathProgramCache]: Analyzing trace with hash -648831452, now seen corresponding path program 1 times [2024-10-12 19:53:31,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:53:31,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370857930] [2024-10-12 19:53:31,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:53:31,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:53:31,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:31,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:53:31,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:31,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:53:31,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:31,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:53:31,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:31,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 19:53:31,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:31,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:53:31,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:31,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-12 19:53:31,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:31,623 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-12 19:53:31,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:53:31,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370857930] [2024-10-12 19:53:31,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370857930] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:53:31,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:53:31,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 19:53:31,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351427924] [2024-10-12 19:53:31,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:53:31,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:53:31,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:53:31,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:53:31,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:53:31,627 INFO L87 Difference]: Start difference. First operand 2964 states and 4183 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 19:53:32,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:53:32,044 INFO L93 Difference]: Finished difference Result 6225 states and 8823 transitions. [2024-10-12 19:53:32,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:53:32,045 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 66 [2024-10-12 19:53:32,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:53:32,063 INFO L225 Difference]: With dead ends: 6225 [2024-10-12 19:53:32,064 INFO L226 Difference]: Without dead ends: 3270 [2024-10-12 19:53:32,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:53:32,073 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 287 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:53:32,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 266 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 19:53:32,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3270 states. [2024-10-12 19:53:32,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3270 to 2959. [2024-10-12 19:53:32,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2959 states, 2485 states have (on average 1.4028169014084506) internal successors, (3486), 2525 states have internal predecessors, (3486), 289 states have call successors, (289), 170 states have call predecessors, (289), 184 states have return successors, (397), 264 states have call predecessors, (397), 286 states have call successors, (397) [2024-10-12 19:53:32,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2959 states to 2959 states and 4172 transitions. [2024-10-12 19:53:32,288 INFO L78 Accepts]: Start accepts. Automaton has 2959 states and 4172 transitions. Word has length 66 [2024-10-12 19:53:32,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:53:32,289 INFO L471 AbstractCegarLoop]: Abstraction has 2959 states and 4172 transitions. [2024-10-12 19:53:32,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 19:53:32,289 INFO L276 IsEmpty]: Start isEmpty. Operand 2959 states and 4172 transitions. [2024-10-12 19:53:32,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-12 19:53:32,290 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:53:32,290 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] [2024-10-12 19:53:32,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 19:53:32,291 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:53:32,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:53:32,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1187424253, now seen corresponding path program 1 times [2024-10-12 19:53:32,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:53:32,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373544191] [2024-10-12 19:53:32,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:53:32,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:53:32,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:32,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:53:32,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:32,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:53:32,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:32,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:53:32,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:32,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 19:53:32,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:32,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:53:32,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:32,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-12 19:53:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:32,349 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-12 19:53:32,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:53:32,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373544191] [2024-10-12 19:53:32,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373544191] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:53:32,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:53:32,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 19:53:32,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791133603] [2024-10-12 19:53:32,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:53:32,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:53:32,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:53:32,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:53:32,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:53:32,351 INFO L87 Difference]: Start difference. First operand 2959 states and 4172 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-12 19:53:33,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:53:33,037 INFO L93 Difference]: Finished difference Result 8563 states and 12186 transitions. [2024-10-12 19:53:33,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:53:33,038 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 67 [2024-10-12 19:53:33,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:53:33,064 INFO L225 Difference]: With dead ends: 8563 [2024-10-12 19:53:33,064 INFO L226 Difference]: Without dead ends: 5613 [2024-10-12 19:53:33,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:53:33,075 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 349 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:53:33,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 420 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 19:53:33,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5613 states. [2024-10-12 19:53:33,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5613 to 4678. [2024-10-12 19:53:33,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4678 states, 3895 states have (on average 1.3650834403080874) internal successors, (5317), 3959 states have internal predecessors, (5317), 475 states have call successors, (475), 283 states have call predecessors, (475), 307 states have return successors, (665), 436 states have call predecessors, (665), 472 states have call successors, (665) [2024-10-12 19:53:33,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4678 states to 4678 states and 6457 transitions. [2024-10-12 19:53:33,411 INFO L78 Accepts]: Start accepts. Automaton has 4678 states and 6457 transitions. Word has length 67 [2024-10-12 19:53:33,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:53:33,413 INFO L471 AbstractCegarLoop]: Abstraction has 4678 states and 6457 transitions. [2024-10-12 19:53:33,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-12 19:53:33,413 INFO L276 IsEmpty]: Start isEmpty. Operand 4678 states and 6457 transitions. [2024-10-12 19:53:33,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-12 19:53:33,416 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:53:33,416 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] [2024-10-12 19:53:33,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 19:53:33,416 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:53:33,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:53:33,417 INFO L85 PathProgramCache]: Analyzing trace with hash -588871477, now seen corresponding path program 1 times [2024-10-12 19:53:33,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:53:33,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863805106] [2024-10-12 19:53:33,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:53:33,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:53:33,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:33,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:53:33,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:33,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:53:33,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:33,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:53:33,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:33,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 19:53:33,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:33,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:53:33,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:33,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-12 19:53:33,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:33,533 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-12 19:53:33,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:53:33,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863805106] [2024-10-12 19:53:33,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863805106] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:53:33,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:53:33,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 19:53:33,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396467775] [2024-10-12 19:53:33,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:53:33,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 19:53:33,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:53:33,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 19:53:33,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:53:33,535 INFO L87 Difference]: Start difference. First operand 4678 states and 6457 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-12 19:53:34,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:53:34,696 INFO L93 Difference]: Finished difference Result 12159 states and 16841 transitions. [2024-10-12 19:53:34,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 19:53:34,697 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 68 [2024-10-12 19:53:34,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:53:34,739 INFO L225 Difference]: With dead ends: 12159 [2024-10-12 19:53:34,739 INFO L226 Difference]: Without dead ends: 7652 [2024-10-12 19:53:34,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-10-12 19:53:34,757 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 720 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 19:53:34,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 495 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 19:53:34,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7652 states. [2024-10-12 19:53:35,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7652 to 6864. [2024-10-12 19:53:35,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6864 states, 5729 states have (on average 1.3655088148018852) internal successors, (7823), 5809 states have internal predecessors, (7823), 687 states have call successors, (687), 411 states have call predecessors, (687), 447 states have return successors, (971), 644 states have call predecessors, (971), 684 states have call successors, (971) [2024-10-12 19:53:35,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6864 states to 6864 states and 9481 transitions. [2024-10-12 19:53:35,293 INFO L78 Accepts]: Start accepts. Automaton has 6864 states and 9481 transitions. Word has length 68 [2024-10-12 19:53:35,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:53:35,294 INFO L471 AbstractCegarLoop]: Abstraction has 6864 states and 9481 transitions. [2024-10-12 19:53:35,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-12 19:53:35,294 INFO L276 IsEmpty]: Start isEmpty. Operand 6864 states and 9481 transitions. [2024-10-12 19:53:35,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-12 19:53:35,296 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:53:35,296 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 19:53:35,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 19:53:35,296 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:53:35,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:53:35,297 INFO L85 PathProgramCache]: Analyzing trace with hash -421261476, now seen corresponding path program 1 times [2024-10-12 19:53:35,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:53:35,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888113336] [2024-10-12 19:53:35,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:53:35,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:53:35,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:35,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:53:35,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:35,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:53:35,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:35,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:53:35,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:35,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 19:53:35,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:35,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:53:35,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:35,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 19:53:35,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:35,367 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-12 19:53:35,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:53:35,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888113336] [2024-10-12 19:53:35,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888113336] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:53:35,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200366929] [2024-10-12 19:53:35,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:53:35,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:53:35,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:53:35,370 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-12 19:53:35,372 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-12 19:53:35,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:35,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 19:53:35,442 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:53:35,469 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:53:35,470 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:53:35,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200366929] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:53:35,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:53:35,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-12 19:53:35,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147041424] [2024-10-12 19:53:35,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:53:35,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:53:35,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:53:35,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:53:35,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:53:35,472 INFO L87 Difference]: Start difference. First operand 6864 states and 9481 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 19:53:36,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:53:36,150 INFO L93 Difference]: Finished difference Result 18019 states and 25163 transitions. [2024-10-12 19:53:36,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:53:36,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 71 [2024-10-12 19:53:36,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:53:36,210 INFO L225 Difference]: With dead ends: 18019 [2024-10-12 19:53:36,210 INFO L226 Difference]: Without dead ends: 11165 [2024-10-12 19:53:36,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:53:36,237 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 125 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:53:36,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 437 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:53:36,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11165 states. [2024-10-12 19:53:37,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11165 to 10643. [2024-10-12 19:53:37,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10643 states, 8830 states have (on average 1.3558323895809739) internal successors, (11972), 8960 states have internal predecessors, (11972), 1097 states have call successors, (1097), 657 states have call predecessors, (1097), 715 states have return successors, (1717), 1027 states have call predecessors, (1717), 1094 states have call successors, (1717) [2024-10-12 19:53:37,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10643 states to 10643 states and 14786 transitions. [2024-10-12 19:53:37,238 INFO L78 Accepts]: Start accepts. Automaton has 10643 states and 14786 transitions. Word has length 71 [2024-10-12 19:53:37,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:53:37,239 INFO L471 AbstractCegarLoop]: Abstraction has 10643 states and 14786 transitions. [2024-10-12 19:53:37,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 19:53:37,239 INFO L276 IsEmpty]: Start isEmpty. Operand 10643 states and 14786 transitions. [2024-10-12 19:53:37,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-12 19:53:37,242 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:53:37,243 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2024-10-12 19:53:37,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-12 19:53:37,446 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-12 19:53:37,447 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:53:37,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:53:37,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1122212262, now seen corresponding path program 1 times [2024-10-12 19:53:37,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:53:37,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743670575] [2024-10-12 19:53:37,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:53:37,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:53:37,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:37,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:53:37,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:37,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:53:37,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:37,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:53:37,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:37,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 19:53:37,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:37,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:53:37,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:37,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-12 19:53:37,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:37,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 19:53:37,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:37,560 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 19:53:37,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:53:37,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743670575] [2024-10-12 19:53:37,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743670575] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:53:37,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:53:37,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:53:37,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347583330] [2024-10-12 19:53:37,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:53:37,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:53:37,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:53:37,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:53:37,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:53:37,565 INFO L87 Difference]: Start difference. First operand 10643 states and 14786 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:53:39,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:53:39,228 INFO L93 Difference]: Finished difference Result 26618 states and 37192 transitions. [2024-10-12 19:53:39,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-12 19:53:39,229 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 77 [2024-10-12 19:53:39,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:53:39,300 INFO L225 Difference]: With dead ends: 26618 [2024-10-12 19:53:39,300 INFO L226 Difference]: Without dead ends: 17340 [2024-10-12 19:53:39,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-12 19:53:39,328 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 740 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 19:53:39,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 1052 Invalid, 987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 907 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 19:53:39,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17340 states. [2024-10-12 19:53:40,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17340 to 14611. [2024-10-12 19:53:40,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14611 states, 12202 states have (on average 1.3667431568595312) internal successors, (16677), 12412 states have internal predecessors, (16677), 1425 states have call successors, (1425), 853 states have call predecessors, (1425), 983 states have return successors, (2443), 1347 states have call predecessors, (2443), 1422 states have call successors, (2443) [2024-10-12 19:53:40,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14611 states to 14611 states and 20545 transitions. [2024-10-12 19:53:40,679 INFO L78 Accepts]: Start accepts. Automaton has 14611 states and 20545 transitions. Word has length 77 [2024-10-12 19:53:40,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:53:40,680 INFO L471 AbstractCegarLoop]: Abstraction has 14611 states and 20545 transitions. [2024-10-12 19:53:40,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:53:40,681 INFO L276 IsEmpty]: Start isEmpty. Operand 14611 states and 20545 transitions. [2024-10-12 19:53:40,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-12 19:53:40,685 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:53:40,686 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:53:40,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 19:53:40,686 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:53:40,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:53:40,687 INFO L85 PathProgramCache]: Analyzing trace with hash 167760280, now seen corresponding path program 1 times [2024-10-12 19:53:40,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:53:40,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508773515] [2024-10-12 19:53:40,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:53:40,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:53:40,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:40,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:53:40,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:40,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:53:40,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:40,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:53:40,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:40,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 19:53:40,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:40,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:53:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:40,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-12 19:53:40,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:40,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 19:53:40,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:40,850 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 19:53:40,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:53:40,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508773515] [2024-10-12 19:53:40,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508773515] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:53:40,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:53:40,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 19:53:40,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470225779] [2024-10-12 19:53:40,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:53:40,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 19:53:40,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:53:40,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 19:53:40,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:53:40,854 INFO L87 Difference]: Start difference. First operand 14611 states and 20545 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:53:43,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:53:43,247 INFO L93 Difference]: Finished difference Result 38017 states and 53573 transitions. [2024-10-12 19:53:43,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-12 19:53:43,247 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 80 [2024-10-12 19:53:43,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:53:43,358 INFO L225 Difference]: With dead ends: 38017 [2024-10-12 19:53:43,358 INFO L226 Difference]: Without dead ends: 24771 [2024-10-12 19:53:43,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2024-10-12 19:53:43,403 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 847 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 1294 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 1320 SdHoareTripleChecker+Invalid, 1404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 19:53:43,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 1320 Invalid, 1404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1294 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 19:53:43,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24771 states. [2024-10-12 19:53:44,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24771 to 21057. [2024-10-12 19:53:44,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21057 states, 17640 states have (on average 1.373015873015873) internal successors, (24220), 17920 states have internal predecessors, (24220), 2016 states have call successors, (2016), 1207 states have call predecessors, (2016), 1400 states have return successors, (3536), 1931 states have call predecessors, (3536), 2013 states have call successors, (3536) [2024-10-12 19:53:44,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21057 states to 21057 states and 29772 transitions. [2024-10-12 19:53:44,685 INFO L78 Accepts]: Start accepts. Automaton has 21057 states and 29772 transitions. Word has length 80 [2024-10-12 19:53:44,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:53:44,686 INFO L471 AbstractCegarLoop]: Abstraction has 21057 states and 29772 transitions. [2024-10-12 19:53:44,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:53:44,686 INFO L276 IsEmpty]: Start isEmpty. Operand 21057 states and 29772 transitions. [2024-10-12 19:53:44,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-12 19:53:44,690 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:53:44,691 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 19:53:44,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 19:53:44,691 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:53:44,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:53:44,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1527405945, now seen corresponding path program 1 times [2024-10-12 19:53:44,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:53:44,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910958108] [2024-10-12 19:53:44,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:53:44,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:53:44,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:44,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:53:44,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:44,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:53:44,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:44,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:53:44,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:44,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 19:53:44,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:44,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:53:44,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:44,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-12 19:53:44,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:44,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 19:53:44,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:44,763 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:53:44,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:53:44,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910958108] [2024-10-12 19:53:44,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910958108] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:53:44,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:53:44,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:53:44,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652814671] [2024-10-12 19:53:44,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:53:44,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:53:44,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:53:44,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:53:44,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:53:44,766 INFO L87 Difference]: Start difference. First operand 21057 states and 29772 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 19:53:48,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:53:48,059 INFO L93 Difference]: Finished difference Result 64092 states and 92160 transitions. [2024-10-12 19:53:48,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-12 19:53:48,059 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 86 [2024-10-12 19:53:48,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:53:48,234 INFO L225 Difference]: With dead ends: 64092 [2024-10-12 19:53:48,234 INFO L226 Difference]: Without dead ends: 43049 [2024-10-12 19:53:48,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2024-10-12 19:53:48,284 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 1085 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1100 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 19:53:48,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1100 Valid, 890 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 19:53:48,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43049 states. [2024-10-12 19:53:50,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43049 to 40539. [2024-10-12 19:53:50,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40539 states, 33832 states have (on average 1.3446145660912745) internal successors, (45491), 34367 states have internal predecessors, (45491), 3900 states have call successors, (3900), 2376 states have call predecessors, (3900), 2806 states have return successors, (7008), 3797 states have call predecessors, (7008), 3897 states have call successors, (7008) [2024-10-12 19:53:51,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40539 states to 40539 states and 56399 transitions. [2024-10-12 19:53:51,149 INFO L78 Accepts]: Start accepts. Automaton has 40539 states and 56399 transitions. Word has length 86 [2024-10-12 19:53:51,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:53:51,150 INFO L471 AbstractCegarLoop]: Abstraction has 40539 states and 56399 transitions. [2024-10-12 19:53:51,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 19:53:51,150 INFO L276 IsEmpty]: Start isEmpty. Operand 40539 states and 56399 transitions. [2024-10-12 19:53:51,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-12 19:53:51,155 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:53:51,155 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1] [2024-10-12 19:53:51,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 19:53:51,155 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:53:51,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:53:51,156 INFO L85 PathProgramCache]: Analyzing trace with hash 253434099, now seen corresponding path program 1 times [2024-10-12 19:53:51,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:53:51,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009827594] [2024-10-12 19:53:51,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:53:51,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:53:51,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:51,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:53:51,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:51,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:53:51,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:51,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:53:51,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:51,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 19:53:51,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:51,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:53:51,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:51,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-12 19:53:51,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:51,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 19:53:51,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:51,242 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 19:53:51,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:53:51,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009827594] [2024-10-12 19:53:51,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009827594] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:53:51,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201482697] [2024-10-12 19:53:51,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:53:51,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:53:51,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:53:51,245 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-12 19:53:51,246 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-12 19:53:51,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:51,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 19:53:51,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:53:51,436 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:53:51,436 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:53:51,622 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 19:53:51,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201482697] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-12 19:53:51,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-12 19:53:51,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 6] total 15 [2024-10-12 19:53:51,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785594188] [2024-10-12 19:53:51,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:53:51,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 19:53:51,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:53:51,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 19:53:51,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-10-12 19:53:51,624 INFO L87 Difference]: Start difference. First operand 40539 states and 56399 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:53:53,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:53:53,927 INFO L93 Difference]: Finished difference Result 42729 states and 59198 transitions. [2024-10-12 19:53:53,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 19:53:53,928 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 87 [2024-10-12 19:53:53,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:53:54,085 INFO L225 Difference]: With dead ends: 42729 [2024-10-12 19:53:54,085 INFO L226 Difference]: Without dead ends: 42726 [2024-10-12 19:53:54,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 178 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2024-10-12 19:53:54,104 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 379 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:53:54,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 977 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:53:54,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42726 states. [2024-10-12 19:53:56,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42726 to 41535. [2024-10-12 19:53:56,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41535 states, 34647 states have (on average 1.3413859785840043) internal successors, (46475), 35200 states have internal predecessors, (46475), 4006 states have call successors, (4006), 2443 states have call predecessors, (4006), 2881 states have return successors, (7155), 3893 states have call predecessors, (7155), 4003 states have call successors, (7155) [2024-10-12 19:53:56,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41535 states to 41535 states and 57636 transitions. [2024-10-12 19:53:56,940 INFO L78 Accepts]: Start accepts. Automaton has 41535 states and 57636 transitions. Word has length 87 [2024-10-12 19:53:56,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:53:56,940 INFO L471 AbstractCegarLoop]: Abstraction has 41535 states and 57636 transitions. [2024-10-12 19:53:56,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:53:56,940 INFO L276 IsEmpty]: Start isEmpty. Operand 41535 states and 57636 transitions. [2024-10-12 19:53:56,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-12 19:53:56,946 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:53:56,946 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-10-12 19:53:56,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 19:53:57,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:53:57,147 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:53:57,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:53:57,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1399470103, now seen corresponding path program 1 times [2024-10-12 19:53:57,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:53:57,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551624692] [2024-10-12 19:53:57,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:53:57,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:53:57,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:57,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:53:57,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:57,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:53:57,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:57,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:53:57,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:57,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 19:53:57,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:57,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:53:57,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:57,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-12 19:53:57,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:57,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 19:53:57,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:57,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 19:53:57,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:53:57,247 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-12 19:53:57,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:53:57,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551624692] [2024-10-12 19:53:57,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551624692] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:53:57,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:53:57,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:53:57,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418822149] [2024-10-12 19:53:57,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:53:57,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:53:57,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:53:57,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:53:57,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:53:57,250 INFO L87 Difference]: Start difference. First operand 41535 states and 57636 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 3 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-12 19:54:00,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:54:00,470 INFO L93 Difference]: Finished difference Result 86391 states and 119808 transitions. [2024-10-12 19:54:00,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 19:54:00,470 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 3 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 89 [2024-10-12 19:54:00,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:54:00,662 INFO L225 Difference]: With dead ends: 86391 [2024-10-12 19:54:00,662 INFO L226 Difference]: Without dead ends: 44870 [2024-10-12 19:54:00,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-12 19:54:00,750 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 349 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:54:00,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 462 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 19:54:00,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44870 states. [2024-10-12 19:54:03,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44870 to 41479. [2024-10-12 19:54:03,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41479 states, 34479 states have (on average 1.3318541721047594) internal successors, (45921), 35144 states have internal predecessors, (45921), 4006 states have call successors, (4006), 2443 states have call predecessors, (4006), 2993 states have return successors, (6707), 3893 states have call predecessors, (6707), 4003 states have call successors, (6707) [2024-10-12 19:54:03,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41479 states to 41479 states and 56634 transitions. [2024-10-12 19:54:03,776 INFO L78 Accepts]: Start accepts. Automaton has 41479 states and 56634 transitions. Word has length 89 [2024-10-12 19:54:03,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:54:03,776 INFO L471 AbstractCegarLoop]: Abstraction has 41479 states and 56634 transitions. [2024-10-12 19:54:03,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 3 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-12 19:54:03,777 INFO L276 IsEmpty]: Start isEmpty. Operand 41479 states and 56634 transitions. [2024-10-12 19:54:03,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-12 19:54:03,782 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:54:03,783 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-10-12 19:54:03,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 19:54:03,783 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:54:03,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:54:03,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1328739243, now seen corresponding path program 1 times [2024-10-12 19:54:03,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:54:03,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976356695] [2024-10-12 19:54:03,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:54:03,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:54:03,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:03,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:03,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:03,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:54:03,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:03,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:54:03,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:03,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 19:54:03,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:03,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:54:03,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:03,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-12 19:54:03,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:03,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 19:54:03,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:03,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 19:54:03,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:03,829 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-12 19:54:03,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:54:03,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976356695] [2024-10-12 19:54:03,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976356695] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:54:03,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:54:03,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 19:54:03,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304680244] [2024-10-12 19:54:03,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:54:03,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:54:03,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:54:03,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:54:03,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:54:03,832 INFO L87 Difference]: Start difference. First operand 41479 states and 56634 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:54:06,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:54:06,670 INFO L93 Difference]: Finished difference Result 46943 states and 64319 transitions. [2024-10-12 19:54:06,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:54:06,671 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 89 [2024-10-12 19:54:06,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:54:06,874 INFO L225 Difference]: With dead ends: 46943 [2024-10-12 19:54:06,875 INFO L226 Difference]: Without dead ends: 44667 [2024-10-12 19:54:06,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:54:06,908 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 291 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:54:06,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 264 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 19:54:06,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44667 states.