./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/kundu2.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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/kundu2.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 87760fc84dfa44e1b5109b35af0fae7e5f68f814afbb1ba90e7b46e4e9e3b4bf --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 03:21:24,788 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:21:24,881 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 03:21:24,887 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:21:24,887 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:21:24,910 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:21:24,910 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:21:24,911 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:21:24,912 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:21:24,913 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:21:24,913 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:21:24,914 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:21:24,914 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:21:24,915 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:21:24,915 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:21:24,917 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:21:24,918 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:21:24,918 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:21:24,919 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 03:21:24,920 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:21:24,920 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:21:24,922 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:21:24,923 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:21:24,923 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:21:24,923 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:21:24,924 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:21:24,924 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:21:24,924 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:21:24,925 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:21:24,925 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:21:24,925 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:21:24,925 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:21:24,926 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:21:24,926 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:21:24,927 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:21:24,927 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:21:24,928 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 03:21:24,928 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 03:21:24,929 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:21:24,929 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:21:24,929 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:21:24,929 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:21:24,930 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 -> 87760fc84dfa44e1b5109b35af0fae7e5f68f814afbb1ba90e7b46e4e9e3b4bf [2024-10-14 03:21:25,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:21:25,202 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:21:25,206 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:21:25,207 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:21:25,208 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:21:25,209 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/kundu2.cil.c [2024-10-14 03:21:26,673 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:21:26,875 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:21:26,876 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/kundu2.cil.c [2024-10-14 03:21:26,889 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56fa67882/bf27c41290cc4456915b1859af3f75f5/FLAG389c5339c [2024-10-14 03:21:27,235 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56fa67882/bf27c41290cc4456915b1859af3f75f5 [2024-10-14 03:21:27,237 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:21:27,239 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:21:27,239 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:21:27,240 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:21:27,245 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:21:27,246 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:21:27" (1/1) ... [2024-10-14 03:21:27,246 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@331d051e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:21:27, skipping insertion in model container [2024-10-14 03:21:27,247 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:21:27" (1/1) ... [2024-10-14 03:21:27,288 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:21:27,429 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/kundu2.cil.c[636,649] [2024-10-14 03:21:27,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:21:27,514 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:21:27,528 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/kundu2.cil.c[636,649] [2024-10-14 03:21:27,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:21:27,580 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:21:27,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:21:27 WrapperNode [2024-10-14 03:21:27,581 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:21:27,582 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:21:27,582 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:21:27,582 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:21:27,589 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:21:27" (1/1) ... [2024-10-14 03:21:27,600 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:21:27" (1/1) ... [2024-10-14 03:21:27,627 INFO L138 Inliner]: procedures = 34, calls = 40, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 312 [2024-10-14 03:21:27,628 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:21:27,628 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:21:27,629 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:21:27,629 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:21:27,637 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:21:27" (1/1) ... [2024-10-14 03:21:27,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:21:27" (1/1) ... [2024-10-14 03:21:27,640 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:21:27" (1/1) ... [2024-10-14 03:21:27,654 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-14 03:21:27,655 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:21:27" (1/1) ... [2024-10-14 03:21:27,655 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:21:27" (1/1) ... [2024-10-14 03:21:27,660 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:21:27" (1/1) ... [2024-10-14 03:21:27,666 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:21:27" (1/1) ... [2024-10-14 03:21:27,670 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:21:27" (1/1) ... [2024-10-14 03:21:27,671 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:21:27" (1/1) ... [2024-10-14 03:21:27,674 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:21:27,676 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:21:27,676 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:21:27,676 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:21:27,677 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:21:27" (1/1) ... [2024-10-14 03:21:27,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:21:27,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:21:27,717 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-14 03:21:27,720 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-14 03:21:27,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:21:27,774 INFO L130 BoogieDeclarations]: Found specification of procedure write_data [2024-10-14 03:21:27,774 INFO L138 BoogieDeclarations]: Found implementation of procedure write_data [2024-10-14 03:21:27,774 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-10-14 03:21:27,774 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-10-14 03:21:27,775 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-14 03:21:27,775 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-14 03:21:27,775 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-14 03:21:27,776 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-14 03:21:27,777 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-14 03:21:27,777 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-14 03:21:27,778 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-14 03:21:27,778 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-14 03:21:27,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 03:21:27,778 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-14 03:21:27,778 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-14 03:21:27,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:21:27,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:21:27,924 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:21:27,926 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:21:28,322 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2024-10-14 03:21:28,325 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:21:28,369 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:21:28,369 INFO L314 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-14 03:21:28,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:21:28 BoogieIcfgContainer [2024-10-14 03:21:28,370 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:21:28,372 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:21:28,372 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:21:28,375 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:21:28,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:21:27" (1/3) ... [2024-10-14 03:21:28,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d2ace8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:21:28, skipping insertion in model container [2024-10-14 03:21:28,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:21:27" (2/3) ... [2024-10-14 03:21:28,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d2ace8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:21:28, skipping insertion in model container [2024-10-14 03:21:28,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:21:28" (3/3) ... [2024-10-14 03:21:28,378 INFO L112 eAbstractionObserver]: Analyzing ICFG kundu2.cil.c [2024-10-14 03:21:28,393 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:21:28,393 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 03:21:28,448 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:21:28,453 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;@3e05c942, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:21:28,454 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 03:21:28,460 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 94 states have (on average 1.5851063829787233) internal successors, (149), 98 states have internal predecessors, (149), 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-14 03:21:28,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-14 03:21:28,469 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:21:28,471 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-14 03:21:28,471 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:21:28,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:21:28,478 INFO L85 PathProgramCache]: Analyzing trace with hash 545397817, now seen corresponding path program 1 times [2024-10-14 03:21:28,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:21:28,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164667831] [2024-10-14 03:21:28,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:21:28,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:21:28,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:28,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:21:28,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:28,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 03:21:28,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:28,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 03:21:28,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:28,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:21:28,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:28,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:21:28,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:28,789 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-14 03:21:28,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:21:28,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164667831] [2024-10-14 03:21:28,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164667831] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:21:28,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:21:28,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:21:28,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971464295] [2024-10-14 03:21:28,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:21:28,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:21:28,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:21:28,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:21:28,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:21:28,827 INFO L87 Difference]: Start difference. First operand has 121 states, 94 states have (on average 1.5851063829787233) internal successors, (149), 98 states have internal predecessors, (149), 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-14 03:21:29,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:21:29,119 INFO L93 Difference]: Finished difference Result 252 states and 392 transitions. [2024-10-14 03:21:29,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:21:29,122 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-14 03:21:29,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:21:29,134 INFO L225 Difference]: With dead ends: 252 [2024-10-14 03:21:29,134 INFO L226 Difference]: Without dead ends: 133 [2024-10-14 03:21:29,138 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-14 03:21:29,143 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 205 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:21:29,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 254 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:21:29,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-14 03:21:29,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 117. [2024-10-14 03:21:29,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 92 states have (on average 1.4891304347826086) internal successors, (137), 95 states have internal predecessors, (137), 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-14 03:21:29,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 170 transitions. [2024-10-14 03:21:29,199 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 170 transitions. Word has length 52 [2024-10-14 03:21:29,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:21:29,199 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 170 transitions. [2024-10-14 03:21:29,200 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-14 03:21:29,200 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 170 transitions. [2024-10-14 03:21:29,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-14 03:21:29,205 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:21:29,205 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-14 03:21:29,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 03:21:29,206 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:21:29,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:21:29,208 INFO L85 PathProgramCache]: Analyzing trace with hash 898486199, now seen corresponding path program 1 times [2024-10-14 03:21:29,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:21:29,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299574698] [2024-10-14 03:21:29,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:21:29,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:21:29,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:29,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:21:29,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:29,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 03:21:29,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:29,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 03:21:29,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:29,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:21:29,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:29,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:21:29,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:29,442 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-14 03:21:29,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:21:29,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299574698] [2024-10-14 03:21:29,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299574698] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:21:29,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:21:29,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:21:29,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192343241] [2024-10-14 03:21:29,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:21:29,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:21:29,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:21:29,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:21:29,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:21:29,447 INFO L87 Difference]: Start difference. First operand 117 states and 170 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-14 03:21:29,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:21:29,927 INFO L93 Difference]: Finished difference Result 362 states and 533 transitions. [2024-10-14 03:21:29,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:21:29,927 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-14 03:21:29,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:21:29,934 INFO L225 Difference]: With dead ends: 362 [2024-10-14 03:21:29,934 INFO L226 Difference]: Without dead ends: 254 [2024-10-14 03:21:29,936 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-14 03:21:29,937 INFO L432 NwaCegarLoop]: 306 mSDtfsCounter, 364 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:21:29,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 706 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:21:29,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-10-14 03:21:29,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 216. [2024-10-14 03:21:29,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 174 states have (on average 1.4770114942528736) internal successors, (257), 178 states have internal predecessors, (257), 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-14 03:21:29,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 312 transitions. [2024-10-14 03:21:29,994 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 312 transitions. Word has length 52 [2024-10-14 03:21:29,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:21:29,995 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 312 transitions. [2024-10-14 03:21:29,995 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-14 03:21:29,996 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 312 transitions. [2024-10-14 03:21:29,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-14 03:21:29,997 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:21:29,998 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-14 03:21:29,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 03:21:29,998 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:21:29,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:21:29,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1421806870, now seen corresponding path program 1 times [2024-10-14 03:21:29,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:21:30,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901879463] [2024-10-14 03:21:30,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:21:30,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:21:30,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:30,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:21:30,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:30,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 03:21:30,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:30,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 03:21:30,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:30,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:21:30,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:30,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:21:30,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:30,180 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-14 03:21:30,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:21:30,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901879463] [2024-10-14 03:21:30,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901879463] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:21:30,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:21:30,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:21:30,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031157923] [2024-10-14 03:21:30,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:21:30,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:21:30,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:21:30,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:21:30,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:21:30,186 INFO L87 Difference]: Start difference. First operand 216 states and 312 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-14 03:21:30,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:21:30,387 INFO L93 Difference]: Finished difference Result 451 states and 664 transitions. [2024-10-14 03:21:30,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:21:30,387 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-14 03:21:30,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:21:30,390 INFO L225 Difference]: With dead ends: 451 [2024-10-14 03:21:30,390 INFO L226 Difference]: Without dead ends: 244 [2024-10-14 03:21:30,391 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-14 03:21:30,393 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 50 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:21:30,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 535 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:21:30,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-10-14 03:21:30,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 218. [2024-10-14 03:21:30,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 176 states have (on average 1.4659090909090908) internal successors, (258), 180 states have internal predecessors, (258), 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-14 03:21:30,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 313 transitions. [2024-10-14 03:21:30,416 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 313 transitions. Word has length 52 [2024-10-14 03:21:30,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:21:30,417 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 313 transitions. [2024-10-14 03:21:30,417 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-14 03:21:30,417 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 313 transitions. [2024-10-14 03:21:30,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-14 03:21:30,418 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:21:30,419 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-14 03:21:30,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 03:21:30,419 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:21:30,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:21:30,420 INFO L85 PathProgramCache]: Analyzing trace with hash 577801368, now seen corresponding path program 1 times [2024-10-14 03:21:30,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:21:30,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573136065] [2024-10-14 03:21:30,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:21:30,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:21:30,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:30,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:21:30,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:30,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 03:21:30,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:30,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 03:21:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:30,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:21:30,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:30,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:21:30,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:30,538 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-14 03:21:30,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:21:30,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573136065] [2024-10-14 03:21:30,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573136065] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:21:30,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:21:30,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:21:30,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464528084] [2024-10-14 03:21:30,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:21:30,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:21:30,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:21:30,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:21:30,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:21:30,541 INFO L87 Difference]: Start difference. First operand 218 states and 313 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-14 03:21:30,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:21:30,734 INFO L93 Difference]: Finished difference Result 459 states and 672 transitions. [2024-10-14 03:21:30,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:21:30,735 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-14 03:21:30,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:21:30,737 INFO L225 Difference]: With dead ends: 459 [2024-10-14 03:21:30,737 INFO L226 Difference]: Without dead ends: 250 [2024-10-14 03:21:30,738 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-14 03:21:30,739 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 50 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:21:30,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 498 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:21:30,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-10-14 03:21:30,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 222. [2024-10-14 03:21:30,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 180 states have (on average 1.4555555555555555) internal successors, (262), 184 states have internal predecessors, (262), 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-14 03:21:30,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 317 transitions. [2024-10-14 03:21:30,762 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 317 transitions. Word has length 52 [2024-10-14 03:21:30,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:21:30,762 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 317 transitions. [2024-10-14 03:21:30,764 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-14 03:21:30,765 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 317 transitions. [2024-10-14 03:21:30,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-14 03:21:30,766 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:21:30,766 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-14 03:21:30,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 03:21:30,767 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:21:30,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:21:30,767 INFO L85 PathProgramCache]: Analyzing trace with hash 600433622, now seen corresponding path program 1 times [2024-10-14 03:21:30,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:21:30,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156884304] [2024-10-14 03:21:30,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:21:30,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:21:30,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:30,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:21:30,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:30,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 03:21:30,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:30,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 03:21:30,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:30,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:21:30,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:30,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:21:30,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:30,922 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-14 03:21:30,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:21:30,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156884304] [2024-10-14 03:21:30,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156884304] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:21:30,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:21:30,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:21:30,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978518355] [2024-10-14 03:21:30,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:21:30,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:21:30,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:21:30,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:21:30,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:21:30,926 INFO L87 Difference]: Start difference. First operand 222 states and 317 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-14 03:21:31,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:21:31,590 INFO L93 Difference]: Finished difference Result 921 states and 1353 transitions. [2024-10-14 03:21:31,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 03:21:31,590 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-14 03:21:31,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:21:31,597 INFO L225 Difference]: With dead ends: 921 [2024-10-14 03:21:31,598 INFO L226 Difference]: Without dead ends: 708 [2024-10-14 03:21:31,600 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-14 03:21:31,601 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 710 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 03:21:31,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 834 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 03:21:31,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2024-10-14 03:21:31,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 417. [2024-10-14 03:21:31,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 341 states have (on average 1.4428152492668622) internal successors, (492), 347 states have internal predecessors, (492), 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-14 03:21:31,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 594 transitions. [2024-10-14 03:21:31,665 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 594 transitions. Word has length 52 [2024-10-14 03:21:31,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:21:31,665 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 594 transitions. [2024-10-14 03:21:31,665 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-14 03:21:31,666 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 594 transitions. [2024-10-14 03:21:31,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-14 03:21:31,669 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:21:31,669 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-14 03:21:31,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 03:21:31,670 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:21:31,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:21:31,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1825380819, now seen corresponding path program 1 times [2024-10-14 03:21:31,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:21:31,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151760460] [2024-10-14 03:21:31,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:21:31,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:21:31,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:31,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:21:31,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:31,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 03:21:31,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:31,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 03:21:31,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:31,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 03:21:31,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:31,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:21:31,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:31,745 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-14 03:21:31,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:21:31,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151760460] [2024-10-14 03:21:31,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151760460] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:21:31,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:21:31,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:21:31,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764407682] [2024-10-14 03:21:31,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:21:31,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:21:31,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:21:31,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:21:31,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:21:31,749 INFO L87 Difference]: Start difference. First operand 417 states and 594 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-14 03:21:31,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:21:31,946 INFO L93 Difference]: Finished difference Result 888 states and 1294 transitions. [2024-10-14 03:21:31,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:21:31,947 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-14 03:21:31,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:21:31,950 INFO L225 Difference]: With dead ends: 888 [2024-10-14 03:21:31,950 INFO L226 Difference]: Without dead ends: 480 [2024-10-14 03:21:31,953 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-14 03:21:31,955 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 50 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:21:31,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 498 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:21:31,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2024-10-14 03:21:31,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 425. [2024-10-14 03:21:31,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 349 states have (on average 1.4326647564469914) internal successors, (500), 355 states have internal predecessors, (500), 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-14 03:21:31,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 602 transitions. [2024-10-14 03:21:31,999 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 602 transitions. Word has length 53 [2024-10-14 03:21:31,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:21:31,999 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 602 transitions. [2024-10-14 03:21:31,999 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-14 03:21:32,000 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 602 transitions. [2024-10-14 03:21:32,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-14 03:21:32,000 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:21:32,001 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-14 03:21:32,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 03:21:32,001 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:21:32,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:21:32,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1684832209, now seen corresponding path program 1 times [2024-10-14 03:21:32,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:21:32,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992204382] [2024-10-14 03:21:32,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:21:32,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:21:32,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:32,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:21:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:32,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 03:21:32,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:32,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 03:21:32,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:32,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 03:21:32,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:32,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:21:32,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:32,100 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-14 03:21:32,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:21:32,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992204382] [2024-10-14 03:21:32,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992204382] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:21:32,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:21:32,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:21:32,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625112803] [2024-10-14 03:21:32,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:21:32,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:21:32,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:21:32,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:21:32,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:21:32,103 INFO L87 Difference]: Start difference. First operand 425 states and 602 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-14 03:21:32,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:21:32,409 INFO L93 Difference]: Finished difference Result 1325 states and 1891 transitions. [2024-10-14 03:21:32,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:21:32,410 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-14 03:21:32,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:21:32,416 INFO L225 Difference]: With dead ends: 1325 [2024-10-14 03:21:32,416 INFO L226 Difference]: Without dead ends: 910 [2024-10-14 03:21:32,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:21:32,418 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 230 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:21:32,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 718 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:21:32,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2024-10-14 03:21:32,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 792. [2024-10-14 03:21:32,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 792 states, 652 states have (on average 1.4233128834355828) internal successors, (928), 666 states have internal predecessors, (928), 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-14 03:21:32,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1112 transitions. [2024-10-14 03:21:32,481 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1112 transitions. Word has length 53 [2024-10-14 03:21:32,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:21:32,482 INFO L471 AbstractCegarLoop]: Abstraction has 792 states and 1112 transitions. [2024-10-14 03:21:32,482 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-14 03:21:32,482 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1112 transitions. [2024-10-14 03:21:32,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-14 03:21:32,483 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:21:32,485 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-14 03:21:32,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 03:21:32,485 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:21:32,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:21:32,486 INFO L85 PathProgramCache]: Analyzing trace with hash -657803255, now seen corresponding path program 1 times [2024-10-14 03:21:32,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:21:32,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742320544] [2024-10-14 03:21:32,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:21:32,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:21:32,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:32,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:21:32,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:32,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 03:21:32,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:32,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 03:21:32,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:32,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 03:21:32,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:32,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:21:32,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:32,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 03:21:32,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:32,643 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-14 03:21:32,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:21:32,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742320544] [2024-10-14 03:21:32,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742320544] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:21:32,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179073232] [2024-10-14 03:21:32,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:21:32,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:21:32,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:21:32,646 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-14 03:21:32,648 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-14 03:21:32,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:32,729 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 03:21:32,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:21:32,893 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-14 03:21:32,893 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:21:32,996 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-14 03:21:32,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179073232] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-14 03:21:32,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-14 03:21:32,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 5] total 8 [2024-10-14 03:21:32,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734747602] [2024-10-14 03:21:32,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:21:32,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:21:32,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:21:32,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:21:32,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:21:32,999 INFO L87 Difference]: Start difference. First operand 792 states and 1112 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-14 03:21:33,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:21:33,284 INFO L93 Difference]: Finished difference Result 2188 states and 3089 transitions. [2024-10-14 03:21:33,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:21:33,285 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-14 03:21:33,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:21:33,294 INFO L225 Difference]: With dead ends: 2188 [2024-10-14 03:21:33,294 INFO L226 Difference]: Without dead ends: 1495 [2024-10-14 03:21:33,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-14 03:21:33,298 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 271 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:21:33,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 1119 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:21:33,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2024-10-14 03:21:33,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1480. [2024-10-14 03:21:33,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1480 states, 1224 states have (on average 1.4199346405228759) internal successors, (1738), 1247 states have internal predecessors, (1738), 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-14 03:21:33,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 2075 transitions. [2024-10-14 03:21:33,438 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 2075 transitions. Word has length 64 [2024-10-14 03:21:33,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:21:33,438 INFO L471 AbstractCegarLoop]: Abstraction has 1480 states and 2075 transitions. [2024-10-14 03:21:33,439 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-14 03:21:33,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 2075 transitions. [2024-10-14 03:21:33,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-14 03:21:33,440 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:21:33,440 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-14 03:21:33,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 03:21:33,640 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-14 03:21:33,642 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:21:33,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:21:33,642 INFO L85 PathProgramCache]: Analyzing trace with hash -486902863, now seen corresponding path program 1 times [2024-10-14 03:21:33,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:21:33,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9128005] [2024-10-14 03:21:33,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:21:33,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:21:33,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:33,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:21:33,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:33,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 03:21:33,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:33,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 03:21:33,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:33,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 03:21:33,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:33,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:21:33,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:33,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 03:21:33,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:33,749 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-14 03:21:33,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:21:33,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9128005] [2024-10-14 03:21:33,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9128005] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:21:33,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:21:33,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:21:33,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220707774] [2024-10-14 03:21:33,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:21:33,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:21:33,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:21:33,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:21:33,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:21:33,751 INFO L87 Difference]: Start difference. First operand 1480 states and 2075 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-14 03:21:34,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:21:34,426 INFO L93 Difference]: Finished difference Result 4662 states and 6646 transitions. [2024-10-14 03:21:34,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 03:21:34,427 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-14 03:21:34,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:21:34,445 INFO L225 Difference]: With dead ends: 4662 [2024-10-14 03:21:34,445 INFO L226 Difference]: Without dead ends: 3192 [2024-10-14 03:21:34,450 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-14 03:21:34,452 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 349 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:21:34,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 596 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:21:34,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3192 states. [2024-10-14 03:21:34,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3192 to 2904. [2024-10-14 03:21:34,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2904 states, 2427 states have (on average 1.4009064688916357) internal successors, (3400), 2468 states have internal predecessors, (3400), 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-14 03:21:34,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2904 states to 2904 states and 4093 transitions. [2024-10-14 03:21:34,671 INFO L78 Accepts]: Start accepts. Automaton has 2904 states and 4093 transitions. Word has length 66 [2024-10-14 03:21:34,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:21:34,672 INFO L471 AbstractCegarLoop]: Abstraction has 2904 states and 4093 transitions. [2024-10-14 03:21:34,672 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-14 03:21:34,672 INFO L276 IsEmpty]: Start isEmpty. Operand 2904 states and 4093 transitions. [2024-10-14 03:21:34,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-14 03:21:34,674 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:21:34,674 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-14 03:21:34,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 03:21:34,675 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:21:34,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:21:34,675 INFO L85 PathProgramCache]: Analyzing trace with hash -285078929, now seen corresponding path program 1 times [2024-10-14 03:21:34,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:21:34,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711510336] [2024-10-14 03:21:34,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:21:34,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:21:34,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:34,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:21:34,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:34,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 03:21:34,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:34,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 03:21:34,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:34,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 03:21:34,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:34,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:21:34,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:34,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 03:21:34,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:34,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:21:34,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:21:34,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711510336] [2024-10-14 03:21:34,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711510336] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:21:34,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:21:34,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:21:34,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562582436] [2024-10-14 03:21:34,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:21:34,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:21:34,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:21:34,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:21:34,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:21:34,741 INFO L87 Difference]: Start difference. First operand 2904 states and 4093 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-14 03:21:35,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:21:35,212 INFO L93 Difference]: Finished difference Result 6105 states and 8643 transitions. [2024-10-14 03:21:35,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:21:35,213 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-14 03:21:35,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:21:35,234 INFO L225 Difference]: With dead ends: 6105 [2024-10-14 03:21:35,234 INFO L226 Difference]: Without dead ends: 3210 [2024-10-14 03:21:35,244 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-14 03:21:35,245 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 284 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:21:35,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 254 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:21:35,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3210 states. [2024-10-14 03:21:35,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3210 to 2899. [2024-10-14 03:21:35,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2899 states, 2425 states have (on average 1.4004123711340206) internal successors, (3396), 2465 states have internal predecessors, (3396), 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-14 03:21:35,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2899 states to 2899 states and 4082 transitions. [2024-10-14 03:21:35,475 INFO L78 Accepts]: Start accepts. Automaton has 2899 states and 4082 transitions. Word has length 66 [2024-10-14 03:21:35,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:21:35,475 INFO L471 AbstractCegarLoop]: Abstraction has 2899 states and 4082 transitions. [2024-10-14 03:21:35,476 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-14 03:21:35,476 INFO L276 IsEmpty]: Start isEmpty. Operand 2899 states and 4082 transitions. [2024-10-14 03:21:35,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-14 03:21:35,478 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:21:35,478 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-14 03:21:35,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 03:21:35,478 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:21:35,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:21:35,479 INFO L85 PathProgramCache]: Analyzing trace with hash -421143662, now seen corresponding path program 1 times [2024-10-14 03:21:35,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:21:35,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357096862] [2024-10-14 03:21:35,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:21:35,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:21:35,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:35,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:21:35,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:35,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 03:21:35,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:35,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 03:21:35,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:35,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 03:21:35,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:35,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:21:35,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:35,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 03:21:35,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:35,545 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-14 03:21:35,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:21:35,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357096862] [2024-10-14 03:21:35,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357096862] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:21:35,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:21:35,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:21:35,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534874569] [2024-10-14 03:21:35,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:21:35,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:21:35,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:21:35,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:21:35,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:21:35,547 INFO L87 Difference]: Start difference. First operand 2899 states and 4082 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-14 03:21:36,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:21:36,214 INFO L93 Difference]: Finished difference Result 8395 states and 11934 transitions. [2024-10-14 03:21:36,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 03:21:36,215 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-14 03:21:36,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:21:36,245 INFO L225 Difference]: With dead ends: 8395 [2024-10-14 03:21:36,245 INFO L226 Difference]: Without dead ends: 5505 [2024-10-14 03:21:36,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:21:36,257 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 346 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:21:36,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 392 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:21:36,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5505 states. [2024-10-14 03:21:36,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5505 to 4578. [2024-10-14 03:21:36,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4578 states, 3795 states have (on average 1.361528326745718) internal successors, (5167), 3859 states have internal predecessors, (5167), 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-14 03:21:36,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4578 states to 4578 states and 6307 transitions. [2024-10-14 03:21:36,677 INFO L78 Accepts]: Start accepts. Automaton has 4578 states and 6307 transitions. Word has length 67 [2024-10-14 03:21:36,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:21:36,678 INFO L471 AbstractCegarLoop]: Abstraction has 4578 states and 6307 transitions. [2024-10-14 03:21:36,678 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-14 03:21:36,678 INFO L276 IsEmpty]: Start isEmpty. Operand 4578 states and 6307 transitions. [2024-10-14 03:21:36,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-14 03:21:36,680 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:21:36,680 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-14 03:21:36,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 03:21:36,680 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:21:36,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:21:36,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1085136470, now seen corresponding path program 1 times [2024-10-14 03:21:36,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:21:36,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939302620] [2024-10-14 03:21:36,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:21:36,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:21:36,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:36,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:21:36,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:36,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 03:21:36,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:36,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 03:21:36,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:36,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 03:21:36,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:36,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:21:36,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:36,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 03:21:36,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:36,793 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-14 03:21:36,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:21:36,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939302620] [2024-10-14 03:21:36,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939302620] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:21:36,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:21:36,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 03:21:36,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243412698] [2024-10-14 03:21:36,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:21:36,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:21:36,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:21:36,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:21:36,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:21:36,796 INFO L87 Difference]: Start difference. First operand 4578 states and 6307 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-14 03:21:37,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:21:37,869 INFO L93 Difference]: Finished difference Result 11915 states and 16475 transitions. [2024-10-14 03:21:37,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 03:21:37,870 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-14 03:21:37,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:21:37,911 INFO L225 Difference]: With dead ends: 11915 [2024-10-14 03:21:37,911 INFO L226 Difference]: Without dead ends: 7504 [2024-10-14 03:21:37,927 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-14 03:21:37,928 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 711 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 03:21:37,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 471 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 03:21:37,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7504 states. [2024-10-14 03:21:38,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7504 to 6716. [2024-10-14 03:21:38,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6716 states, 5581 states have (on average 1.3619423042465508) internal successors, (7601), 5661 states have internal predecessors, (7601), 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-14 03:21:38,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6716 states to 6716 states and 9259 transitions. [2024-10-14 03:21:38,596 INFO L78 Accepts]: Start accepts. Automaton has 6716 states and 9259 transitions. Word has length 68 [2024-10-14 03:21:38,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:21:38,596 INFO L471 AbstractCegarLoop]: Abstraction has 6716 states and 9259 transitions. [2024-10-14 03:21:38,596 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-14 03:21:38,597 INFO L276 IsEmpty]: Start isEmpty. Operand 6716 states and 9259 transitions. [2024-10-14 03:21:38,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 03:21:38,598 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:21:38,598 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-14 03:21:38,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 03:21:38,599 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:21:38,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:21:38,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1794577429, now seen corresponding path program 1 times [2024-10-14 03:21:38,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:21:38,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242557185] [2024-10-14 03:21:38,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:21:38,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:21:38,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:38,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:21:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:38,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 03:21:38,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:38,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 03:21:38,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:38,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 03:21:38,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:38,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:21:38,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:38,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 03:21:38,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:38,686 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-14 03:21:38,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:21:38,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242557185] [2024-10-14 03:21:38,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242557185] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:21:38,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548806372] [2024-10-14 03:21:38,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:21:38,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:21:38,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:21:38,690 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-14 03:21:38,691 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-14 03:21:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:38,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 03:21:38,766 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:21:38,800 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-14 03:21:38,800 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 03:21:38,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548806372] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:21:38,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 03:21:38,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-14 03:21:38,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191966627] [2024-10-14 03:21:38,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:21:38,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:21:38,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:21:38,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:21:38,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:21:38,802 INFO L87 Difference]: Start difference. First operand 6716 states and 9259 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-14 03:21:39,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:21:39,612 INFO L93 Difference]: Finished difference Result 17623 states and 24569 transitions. [2024-10-14 03:21:39,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:21:39,612 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-14 03:21:39,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:21:39,741 INFO L225 Difference]: With dead ends: 17623 [2024-10-14 03:21:39,741 INFO L226 Difference]: Without dead ends: 10917 [2024-10-14 03:21:39,762 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-14 03:21:39,763 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 122 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:21:39,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 425 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:21:39,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10917 states. [2024-10-14 03:21:40,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10917 to 10407. [2024-10-14 03:21:40,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10407 states, 8594 states have (on average 1.351873400046544) internal successors, (11618), 8724 states have internal predecessors, (11618), 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-14 03:21:40,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10407 states to 10407 states and 14432 transitions. [2024-10-14 03:21:40,589 INFO L78 Accepts]: Start accepts. Automaton has 10407 states and 14432 transitions. Word has length 71 [2024-10-14 03:21:40,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:21:40,589 INFO L471 AbstractCegarLoop]: Abstraction has 10407 states and 14432 transitions. [2024-10-14 03:21:40,594 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-14 03:21:40,594 INFO L276 IsEmpty]: Start isEmpty. Operand 10407 states and 14432 transitions. [2024-10-14 03:21:40,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-14 03:21:40,600 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:21:40,601 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-14 03:21:40,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 03:21:40,801 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-14 03:21:40,802 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:21:40,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:21:40,803 INFO L85 PathProgramCache]: Analyzing trace with hash -913772689, now seen corresponding path program 1 times [2024-10-14 03:21:40,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:21:40,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034205348] [2024-10-14 03:21:40,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:21:40,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:21:40,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:40,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:21:40,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:40,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 03:21:40,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:40,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 03:21:40,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:40,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 03:21:40,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:40,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:21:40,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:40,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 03:21:40,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:40,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 03:21:40,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:40,920 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-14 03:21:40,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:21:40,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034205348] [2024-10-14 03:21:40,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034205348] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:21:40,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:21:40,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:21:40,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860906247] [2024-10-14 03:21:40,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:21:40,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:21:40,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:21:40,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:21:40,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:21:40,925 INFO L87 Difference]: Start difference. First operand 10407 states and 14432 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-14 03:21:43,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:21:43,210 INFO L93 Difference]: Finished difference Result 26070 states and 36370 transitions. [2024-10-14 03:21:43,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 03:21:43,211 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-14 03:21:43,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:21:43,294 INFO L225 Difference]: With dead ends: 26070 [2024-10-14 03:21:43,294 INFO L226 Difference]: Without dead ends: 16996 [2024-10-14 03:21:43,327 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-14 03:21:43,328 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 746 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 778 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 03:21:43,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [778 Valid, 925 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 03:21:43,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16996 states. [2024-10-14 03:21:44,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16996 to 14303. [2024-10-14 03:21:44,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14303 states, 11894 states have (on average 1.3632924163443754) internal successors, (16215), 12104 states have internal predecessors, (16215), 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-14 03:21:44,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14303 states to 14303 states and 20083 transitions. [2024-10-14 03:21:44,447 INFO L78 Accepts]: Start accepts. Automaton has 14303 states and 20083 transitions. Word has length 77 [2024-10-14 03:21:44,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:21:44,448 INFO L471 AbstractCegarLoop]: Abstraction has 14303 states and 20083 transitions. [2024-10-14 03:21:44,448 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-14 03:21:44,448 INFO L276 IsEmpty]: Start isEmpty. Operand 14303 states and 20083 transitions. [2024-10-14 03:21:44,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 03:21:44,452 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:21:44,452 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-14 03:21:44,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 03:21:44,452 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:21:44,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:21:44,453 INFO L85 PathProgramCache]: Analyzing trace with hash -725910813, now seen corresponding path program 1 times [2024-10-14 03:21:44,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:21:44,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067043733] [2024-10-14 03:21:44,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:21:44,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:21:44,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:44,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:21:44,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:44,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 03:21:44,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:44,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 03:21:44,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:44,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 03:21:44,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:44,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:21:44,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:44,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 03:21:44,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:44,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 03:21:44,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:44,603 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-14 03:21:44,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:21:44,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067043733] [2024-10-14 03:21:44,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067043733] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:21:44,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:21:44,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 03:21:44,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280192199] [2024-10-14 03:21:44,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:21:44,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:21:44,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:21:44,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:21:44,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:21:44,605 INFO L87 Difference]: Start difference. First operand 14303 states and 20083 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-14 03:21:46,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:21:46,761 INFO L93 Difference]: Finished difference Result 37253 states and 52427 transitions. [2024-10-14 03:21:46,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-14 03:21:46,762 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-14 03:21:46,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:21:46,869 INFO L225 Difference]: With dead ends: 37253 [2024-10-14 03:21:46,870 INFO L226 Difference]: Without dead ends: 24283 [2024-10-14 03:21:46,911 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-14 03:21:46,912 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 838 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 1312 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 1248 SdHoareTripleChecker+Invalid, 1422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 03:21:46,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 1248 Invalid, 1422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1312 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 03:21:46,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24283 states. [2024-10-14 03:21:48,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24283 to 20617. [2024-10-14 03:21:48,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20617 states, 17200 states have (on average 1.369767441860465) internal successors, (23560), 17480 states have internal predecessors, (23560), 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-14 03:21:49,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20617 states to 20617 states and 29112 transitions. [2024-10-14 03:21:49,022 INFO L78 Accepts]: Start accepts. Automaton has 20617 states and 29112 transitions. Word has length 80 [2024-10-14 03:21:49,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:21:49,022 INFO L471 AbstractCegarLoop]: Abstraction has 20617 states and 29112 transitions. [2024-10-14 03:21:49,023 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-14 03:21:49,023 INFO L276 IsEmpty]: Start isEmpty. Operand 20617 states and 29112 transitions. [2024-10-14 03:21:49,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-14 03:21:49,028 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:21:49,028 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-14 03:21:49,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 03:21:49,028 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:21:49,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:21:49,029 INFO L85 PathProgramCache]: Analyzing trace with hash 980379788, now seen corresponding path program 1 times [2024-10-14 03:21:49,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:21:49,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550518992] [2024-10-14 03:21:49,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:21:49,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:21:49,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:49,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:21:49,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:49,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 03:21:49,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:49,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 03:21:49,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:49,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 03:21:49,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:49,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:21:49,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:49,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 03:21:49,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:49,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 03:21:49,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:49,122 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-14 03:21:49,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:21:49,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550518992] [2024-10-14 03:21:49,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550518992] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:21:49,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:21:49,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:21:49,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268127038] [2024-10-14 03:21:49,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:21:49,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:21:49,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:21:49,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:21:49,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:21:49,125 INFO L87 Difference]: Start difference. First operand 20617 states and 29112 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-14 03:21:52,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:21:52,281 INFO L93 Difference]: Finished difference Result 62772 states and 90180 transitions. [2024-10-14 03:21:52,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-14 03:21:52,282 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-14 03:21:52,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:21:52,548 INFO L225 Difference]: With dead ends: 62772 [2024-10-14 03:21:52,548 INFO L226 Difference]: Without dead ends: 42169 [2024-10-14 03:21:52,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2024-10-14 03:21:52,604 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 1073 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1088 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 03:21:52,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1088 Valid, 818 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 03:21:52,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42169 states. [2024-10-14 03:21:55,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42169 to 39663. [2024-10-14 03:21:55,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39663 states, 32956 states have (on average 1.3404842820730671) internal successors, (44177), 33491 states have internal predecessors, (44177), 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-14 03:21:55,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39663 states to 39663 states and 55085 transitions. [2024-10-14 03:21:55,422 INFO L78 Accepts]: Start accepts. Automaton has 39663 states and 55085 transitions. Word has length 86 [2024-10-14 03:21:55,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:21:55,423 INFO L471 AbstractCegarLoop]: Abstraction has 39663 states and 55085 transitions. [2024-10-14 03:21:55,423 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-14 03:21:55,423 INFO L276 IsEmpty]: Start isEmpty. Operand 39663 states and 55085 transitions. [2024-10-14 03:21:55,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-14 03:21:55,428 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:21:55,428 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-14 03:21:55,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 03:21:55,429 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:21:55,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:21:55,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1303924748, now seen corresponding path program 1 times [2024-10-14 03:21:55,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:21:55,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182618519] [2024-10-14 03:21:55,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:21:55,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:21:55,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:55,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:21:55,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:55,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 03:21:55,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:55,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 03:21:55,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:55,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 03:21:55,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:55,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:21:55,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:55,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 03:21:55,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:55,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 03:21:55,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:55,523 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-14 03:21:55,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:21:55,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182618519] [2024-10-14 03:21:55,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182618519] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:21:55,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332360082] [2024-10-14 03:21:55,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:21:55,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:21:55,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:21:55,525 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-14 03:21:55,526 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-14 03:21:55,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:55,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-14 03:21:55,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:21:55,711 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-14 03:21:55,711 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:21:55,900 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-14 03:21:55,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332360082] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-14 03:21:55,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-14 03:21:55,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 6] total 15 [2024-10-14 03:21:55,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312595925] [2024-10-14 03:21:55,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:21:55,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:21:55,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:21:55,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:21:55,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-10-14 03:21:55,902 INFO L87 Difference]: Start difference. First operand 39663 states and 55085 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-14 03:21:58,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:21:58,694 INFO L93 Difference]: Finished difference Result 41805 states and 57812 transitions. [2024-10-14 03:21:58,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 03:21:58,695 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-14 03:21:58,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:21:58,868 INFO L225 Difference]: With dead ends: 41805 [2024-10-14 03:21:58,868 INFO L226 Difference]: Without dead ends: 41802 [2024-10-14 03:21:58,892 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-14 03:21:58,893 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 273 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:21:58,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 891 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:21:58,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41802 states. [2024-10-14 03:22:01,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41802 to 40635. [2024-10-14 03:22:01,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40635 states, 33747 states have (on average 1.337155895338845) internal successors, (45125), 34300 states have internal predecessors, (45125), 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-14 03:22:01,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40635 states to 40635 states and 56286 transitions. [2024-10-14 03:22:01,865 INFO L78 Accepts]: Start accepts. Automaton has 40635 states and 56286 transitions. Word has length 87 [2024-10-14 03:22:01,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:22:01,866 INFO L471 AbstractCegarLoop]: Abstraction has 40635 states and 56286 transitions. [2024-10-14 03:22:01,866 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-14 03:22:01,866 INFO L276 IsEmpty]: Start isEmpty. Operand 40635 states and 56286 transitions. [2024-10-14 03:22:01,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-14 03:22:01,872 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:22:01,872 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-14 03:22:01,889 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-14 03:22:02,072 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-14 03:22:02,073 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:22:02,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:22:02,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1824724012, now seen corresponding path program 1 times [2024-10-14 03:22:02,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:22:02,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858463307] [2024-10-14 03:22:02,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:22:02,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:22:02,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:22:02,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:22:02,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:22:02,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 03:22:02,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:22:02,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 03:22:02,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:22:02,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 03:22:02,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:22:02,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:22:02,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:22:02,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 03:22:02,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:22:02,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 03:22:02,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:22:02,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 03:22:02,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:22:02,176 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-14 03:22:02,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:22:02,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858463307] [2024-10-14 03:22:02,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858463307] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:22:02,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:22:02,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:22:02,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487413387] [2024-10-14 03:22:02,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:22:02,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:22:02,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:22:02,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:22:02,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:22:02,180 INFO L87 Difference]: Start difference. First operand 40635 states and 56286 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-14 03:22:05,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:22:05,477 INFO L93 Difference]: Finished difference Result 84591 states and 117108 transitions. [2024-10-14 03:22:05,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 03:22:05,478 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-14 03:22:05,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:22:05,665 INFO L225 Difference]: With dead ends: 84591 [2024-10-14 03:22:05,665 INFO L226 Difference]: Without dead ends: 43970 [2024-10-14 03:22:05,745 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-14 03:22:05,746 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 346 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:22:05,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 442 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:22:05,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43970 states. [2024-10-14 03:22:08,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43970 to 40579. [2024-10-14 03:22:08,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40579 states, 33579 states have (on average 1.3273474492986688) internal successors, (44571), 34244 states have internal predecessors, (44571), 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-14 03:22:08,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40579 states to 40579 states and 55284 transitions. [2024-10-14 03:22:08,846 INFO L78 Accepts]: Start accepts. Automaton has 40579 states and 55284 transitions. Word has length 89 [2024-10-14 03:22:08,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:22:08,846 INFO L471 AbstractCegarLoop]: Abstraction has 40579 states and 55284 transitions. [2024-10-14 03:22:08,847 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-14 03:22:08,847 INFO L276 IsEmpty]: Start isEmpty. Operand 40579 states and 55284 transitions. [2024-10-14 03:22:08,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-14 03:22:08,854 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:22:08,854 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-14 03:22:08,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 03:22:08,854 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:22:08,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:22:08,855 INFO L85 PathProgramCache]: Analyzing trace with hash -903485334, now seen corresponding path program 1 times [2024-10-14 03:22:08,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:22:08,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122021578] [2024-10-14 03:22:08,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:22:08,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:22:08,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:22:08,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:22:08,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:22:08,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 03:22:08,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:22:08,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 03:22:08,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:22:08,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 03:22:08,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:22:08,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:22:08,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:22:08,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 03:22:08,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:22:08,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 03:22:08,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:22:08,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 03:22:08,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:22:08,911 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-14 03:22:08,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:22:08,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122021578] [2024-10-14 03:22:08,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122021578] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:22:08,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:22:08,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:22:08,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108859304] [2024-10-14 03:22:08,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:22:08,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:22:08,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:22:08,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:22:08,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:22:08,914 INFO L87 Difference]: Start difference. First operand 40579 states and 55284 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-14 03:22:11,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:22:11,869 INFO L93 Difference]: Finished difference Result 45987 states and 62885 transitions. [2024-10-14 03:22:11,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:22:11,870 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-14 03:22:11,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:22:12,052 INFO L225 Difference]: With dead ends: 45987 [2024-10-14 03:22:12,053 INFO L226 Difference]: Without dead ends: 43767 [2024-10-14 03:22:12,082 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-14 03:22:12,083 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 288 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:22:12,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 252 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:22:12,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43767 states. [2024-10-14 03:22:14,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43767 to 40433. [2024-10-14 03:22:14,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40433 states, 33463 states have (on average 1.3276454591638527) internal successors, (44427), 34126 states have internal predecessors, (44427), 3987 states have call successors, (3987), 2433 states have call predecessors, (3987), 2982 states have return successors, (6686), 3874 states have call predecessors, (6686), 3984 states have call successors, (6686) [2024-10-14 03:22:14,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40433 states to 40433 states and 55100 transitions. [2024-10-14 03:22:14,782 INFO L78 Accepts]: Start accepts. Automaton has 40433 states and 55100 transitions. Word has length 89 [2024-10-14 03:22:14,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:22:14,783 INFO L471 AbstractCegarLoop]: Abstraction has 40433 states and 55100 transitions. [2024-10-14 03:22:14,783 INFO L472 AbstractCegarLoop]: INTERPOLANT 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) [2024-10-14 03:22:14,783 INFO L276 IsEmpty]: Start isEmpty. Operand 40433 states and 55100 transitions. [2024-10-14 03:22:14,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-14 03:22:14,788 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:22:14,789 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, 1] [2024-10-14 03:22:14,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 03:22:14,789 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:22:14,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:22:14,789 INFO L85 PathProgramCache]: Analyzing trace with hash 344553963, now seen corresponding path program 1 times [2024-10-14 03:22:14,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:22:14,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31152526] [2024-10-14 03:22:14,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:22:14,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:22:14,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:22:14,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:22:14,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:22:14,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 03:22:14,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:22:14,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 03:22:14,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:22:14,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 03:22:14,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:22:14,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:22:14,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:22:14,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 03:22:14,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:22:14,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 03:22:14,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:22:14,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 03:22:14,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:22:14,876 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-14 03:22:14,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:22:14,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31152526] [2024-10-14 03:22:14,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31152526] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:22:14,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:22:14,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:22:14,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530757410] [2024-10-14 03:22:14,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:22:14,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:22:14,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:22:14,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:22:14,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:22:14,879 INFO L87 Difference]: Start difference. First operand 40433 states and 55100 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, (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)