./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/transmitter.02.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/systemc/transmitter.02.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 2cbfaf31aa56f767af01fea9a12ccb47d60ab19076d72b85e8ca46d6ff778e4c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 08:09:31,735 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 08:09:31,821 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 08:09:31,825 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 08:09:31,826 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 08:09:31,851 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 08:09:31,852 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 08:09:31,852 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 08:09:31,853 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 08:09:31,853 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 08:09:31,854 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 08:09:31,854 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 08:09:31,854 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 08:09:31,855 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 08:09:31,857 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 08:09:31,858 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 08:09:31,858 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 08:09:31,861 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 08:09:31,861 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 08:09:31,862 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 08:09:31,862 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 08:09:31,862 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 08:09:31,863 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 08:09:31,864 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 08:09:31,864 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 08:09:31,865 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 08:09:31,865 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 08:09:31,865 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 08:09:31,865 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 08:09:31,866 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 08:09:31,866 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 08:09:31,866 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 08:09:31,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 08:09:31,867 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 08:09:31,868 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 08:09:31,868 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 08:09:31,868 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 08:09:31,869 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 08:09:31,869 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 08:09:31,869 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 08:09:31,870 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 08:09:31,870 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 08:09:31,870 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 -> 2cbfaf31aa56f767af01fea9a12ccb47d60ab19076d72b85e8ca46d6ff778e4c [2024-11-16 08:09:32,145 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 08:09:32,171 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 08:09:32,174 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 08:09:32,175 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 08:09:32,176 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 08:09:32,177 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/transmitter.02.cil.c [2024-11-16 08:09:33,728 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 08:09:33,939 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 08:09:33,940 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.02.cil.c [2024-11-16 08:09:33,954 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b592fd90/239d70d3000d45d3a5f57275caab4c5c/FLAGa1a7ac201 [2024-11-16 08:09:34,309 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b592fd90/239d70d3000d45d3a5f57275caab4c5c [2024-11-16 08:09:34,312 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 08:09:34,314 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 08:09:34,315 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 08:09:34,315 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 08:09:34,324 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 08:09:34,325 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:09:34" (1/1) ... [2024-11-16 08:09:34,327 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e1b1097 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:09:34, skipping insertion in model container [2024-11-16 08:09:34,327 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:09:34" (1/1) ... [2024-11-16 08:09:34,370 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 08:09:34,556 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.02.cil.c[706,719] [2024-11-16 08:09:34,631 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 08:09:34,646 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 08:09:34,657 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.02.cil.c[706,719] [2024-11-16 08:09:34,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 08:09:34,720 INFO L204 MainTranslator]: Completed translation [2024-11-16 08:09:34,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:09:34 WrapperNode [2024-11-16 08:09:34,720 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 08:09:34,721 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 08:09:34,722 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 08:09:34,722 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 08:09:34,729 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:09:34" (1/1) ... [2024-11-16 08:09:34,742 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:09:34" (1/1) ... [2024-11-16 08:09:34,773 INFO L138 Inliner]: procedures = 32, calls = 36, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 263 [2024-11-16 08:09:34,774 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 08:09:34,775 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 08:09:34,775 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 08:09:34,775 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 08:09:34,786 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:09:34" (1/1) ... [2024-11-16 08:09:34,786 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:09:34" (1/1) ... [2024-11-16 08:09:34,789 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:09:34" (1/1) ... [2024-11-16 08:09:34,816 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-11-16 08:09:34,818 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:09:34" (1/1) ... [2024-11-16 08:09:34,818 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:09:34" (1/1) ... [2024-11-16 08:09:34,825 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:09:34" (1/1) ... [2024-11-16 08:09:34,829 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:09:34" (1/1) ... [2024-11-16 08:09:34,830 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:09:34" (1/1) ... [2024-11-16 08:09:34,835 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:09:34" (1/1) ... [2024-11-16 08:09:34,837 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 08:09:34,838 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 08:09:34,838 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 08:09:34,839 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 08:09:34,839 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:09:34" (1/1) ... [2024-11-16 08:09:34,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 08:09:34,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 08:09:34,888 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-11-16 08:09:34,894 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-11-16 08:09:34,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 08:09:34,940 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-16 08:09:34,940 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-16 08:09:34,941 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-16 08:09:34,941 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-16 08:09:34,941 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-16 08:09:34,941 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-16 08:09:34,941 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-16 08:09:34,942 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-16 08:09:34,943 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-16 08:09:34,943 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-16 08:09:34,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 08:09:34,943 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-16 08:09:34,944 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-16 08:09:34,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 08:09:34,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 08:09:35,033 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 08:09:35,035 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 08:09:35,471 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2024-11-16 08:09:35,472 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 08:09:35,491 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 08:09:35,492 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 08:09:35,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 08:09:35 BoogieIcfgContainer [2024-11-16 08:09:35,493 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 08:09:35,495 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 08:09:35,495 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 08:09:35,498 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 08:09:35,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 08:09:34" (1/3) ... [2024-11-16 08:09:35,500 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3143c172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:09:35, skipping insertion in model container [2024-11-16 08:09:35,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:09:34" (2/3) ... [2024-11-16 08:09:35,501 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3143c172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:09:35, skipping insertion in model container [2024-11-16 08:09:35,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 08:09:35" (3/3) ... [2024-11-16 08:09:35,504 INFO L112 eAbstractionObserver]: Analyzing ICFG transmitter.02.cil.c [2024-11-16 08:09:35,520 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 08:09:35,520 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 08:09:35,589 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 08:09:35,596 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;@22a66c68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 08:09:35,596 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 08:09:35,601 INFO L276 IsEmpty]: Start isEmpty. Operand has 153 states, 130 states have (on average 1.4538461538461538) internal successors, (189), 132 states have internal predecessors, (189), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 08:09:35,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-16 08:09:35,613 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:09:35,614 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:09:35,615 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:09:35,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:09:35,623 INFO L85 PathProgramCache]: Analyzing trace with hash -757817904, now seen corresponding path program 1 times [2024-11-16 08:09:35,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:09:35,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854073453] [2024-11-16 08:09:35,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:09:35,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:09:35,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:35,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 08:09:36,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:36,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 08:09:36,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:36,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-16 08:09:36,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:36,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 08:09:36,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:36,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 08:09:36,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:36,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:09:36,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:09:36,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854073453] [2024-11-16 08:09:36,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854073453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:09:36,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:09:36,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 08:09:36,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485006437] [2024-11-16 08:09:36,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:09:36,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 08:09:36,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:09:36,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 08:09:36,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 08:09:36,179 INFO L87 Difference]: Start difference. First operand has 153 states, 130 states have (on average 1.4538461538461538) internal successors, (189), 132 states have internal predecessors, (189), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 08:09:37,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:09:37,123 INFO L93 Difference]: Finished difference Result 484 states and 715 transitions. [2024-11-16 08:09:37,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 08:09:37,126 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2024-11-16 08:09:37,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:09:37,139 INFO L225 Difference]: With dead ends: 484 [2024-11-16 08:09:37,139 INFO L226 Difference]: Without dead ends: 331 [2024-11-16 08:09:37,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-16 08:09:37,146 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 410 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 08:09:37,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 557 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 08:09:37,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-11-16 08:09:37,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 270. [2024-11-16 08:09:37,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 231 states have (on average 1.3766233766233766) internal successors, (318), 233 states have internal predecessors, (318), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2024-11-16 08:09:37,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 371 transitions. [2024-11-16 08:09:37,219 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 371 transitions. Word has length 71 [2024-11-16 08:09:37,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:09:37,219 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 371 transitions. [2024-11-16 08:09:37,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 08:09:37,220 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 371 transitions. [2024-11-16 08:09:37,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-16 08:09:37,223 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:09:37,223 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:09:37,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 08:09:37,224 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:09:37,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:09:37,225 INFO L85 PathProgramCache]: Analyzing trace with hash -691173299, now seen corresponding path program 1 times [2024-11-16 08:09:37,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:09:37,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996364312] [2024-11-16 08:09:37,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:09:37,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:09:37,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:37,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 08:09:37,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:37,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 08:09:37,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:37,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-16 08:09:37,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:37,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 08:09:37,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:37,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 08:09:37,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:37,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:09:37,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:09:37,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996364312] [2024-11-16 08:09:37,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996364312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:09:37,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:09:37,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 08:09:37,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18969460] [2024-11-16 08:09:37,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:09:37,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 08:09:37,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:09:37,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 08:09:37,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 08:09:37,408 INFO L87 Difference]: Start difference. First operand 270 states and 371 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 08:09:37,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:09:37,930 INFO L93 Difference]: Finished difference Result 590 states and 825 transitions. [2024-11-16 08:09:37,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 08:09:37,930 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2024-11-16 08:09:37,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:09:37,934 INFO L225 Difference]: With dead ends: 590 [2024-11-16 08:09:37,934 INFO L226 Difference]: Without dead ends: 330 [2024-11-16 08:09:37,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-16 08:09:37,936 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 311 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 08:09:37,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 477 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 08:09:37,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2024-11-16 08:09:37,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 270. [2024-11-16 08:09:37,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 231 states have (on average 1.367965367965368) internal successors, (316), 233 states have internal predecessors, (316), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2024-11-16 08:09:37,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 369 transitions. [2024-11-16 08:09:37,968 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 369 transitions. Word has length 71 [2024-11-16 08:09:37,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:09:37,968 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 369 transitions. [2024-11-16 08:09:37,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 08:09:37,969 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 369 transitions. [2024-11-16 08:09:37,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-16 08:09:37,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:09:37,971 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:09:37,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 08:09:37,971 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:09:37,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:09:37,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1673174892, now seen corresponding path program 1 times [2024-11-16 08:09:37,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:09:37,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186679788] [2024-11-16 08:09:37,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:09:37,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:09:37,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:38,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 08:09:38,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:38,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 08:09:38,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:38,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-16 08:09:38,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:38,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 08:09:38,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:38,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 08:09:38,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:38,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:09:38,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:09:38,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186679788] [2024-11-16 08:09:38,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186679788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:09:38,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:09:38,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 08:09:38,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706729025] [2024-11-16 08:09:38,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:09:38,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 08:09:38,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:09:38,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 08:09:38,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 08:09:38,115 INFO L87 Difference]: Start difference. First operand 270 states and 369 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 08:09:39,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:09:39,197 INFO L93 Difference]: Finished difference Result 782 states and 1080 transitions. [2024-11-16 08:09:39,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-16 08:09:39,198 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2024-11-16 08:09:39,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:09:39,203 INFO L225 Difference]: With dead ends: 782 [2024-11-16 08:09:39,208 INFO L226 Difference]: Without dead ends: 522 [2024-11-16 08:09:39,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-16 08:09:39,214 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 411 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 1101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 08:09:39,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 980 Invalid, 1101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 08:09:39,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2024-11-16 08:09:39,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 392. [2024-11-16 08:09:39,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 336 states have (on average 1.3571428571428572) internal successors, (456), 339 states have internal predecessors, (456), 35 states have call successors, (35), 18 states have call predecessors, (35), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) [2024-11-16 08:09:39,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 531 transitions. [2024-11-16 08:09:39,279 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 531 transitions. Word has length 71 [2024-11-16 08:09:39,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:09:39,280 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 531 transitions. [2024-11-16 08:09:39,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 08:09:39,280 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 531 transitions. [2024-11-16 08:09:39,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-16 08:09:39,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:09:39,285 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:09:39,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 08:09:39,286 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:09:39,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:09:39,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1991333779, now seen corresponding path program 1 times [2024-11-16 08:09:39,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:09:39,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268171313] [2024-11-16 08:09:39,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:09:39,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:09:39,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:39,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 08:09:39,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:39,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 08:09:39,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:39,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-16 08:09:39,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:39,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 08:09:39,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:39,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 08:09:39,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:39,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:09:39,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:09:39,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268171313] [2024-11-16 08:09:39,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268171313] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:09:39,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:09:39,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 08:09:39,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291698086] [2024-11-16 08:09:39,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:09:39,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 08:09:39,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:09:39,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 08:09:39,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 08:09:39,469 INFO L87 Difference]: Start difference. First operand 392 states and 531 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 08:09:39,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:09:39,930 INFO L93 Difference]: Finished difference Result 862 states and 1186 transitions. [2024-11-16 08:09:39,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 08:09:39,931 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2024-11-16 08:09:39,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:09:39,934 INFO L225 Difference]: With dead ends: 862 [2024-11-16 08:09:39,934 INFO L226 Difference]: Without dead ends: 480 [2024-11-16 08:09:39,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-16 08:09:39,940 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 312 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 08:09:39,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 474 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 08:09:39,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2024-11-16 08:09:39,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 392. [2024-11-16 08:09:39,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 336 states have (on average 1.3482142857142858) internal successors, (453), 339 states have internal predecessors, (453), 35 states have call successors, (35), 18 states have call predecessors, (35), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) [2024-11-16 08:09:39,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 528 transitions. [2024-11-16 08:09:39,969 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 528 transitions. Word has length 71 [2024-11-16 08:09:39,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:09:39,970 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 528 transitions. [2024-11-16 08:09:39,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 08:09:39,970 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 528 transitions. [2024-11-16 08:09:39,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-16 08:09:39,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:09:39,972 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:09:39,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 08:09:39,972 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:09:39,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:09:39,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1970996404, now seen corresponding path program 1 times [2024-11-16 08:09:39,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:09:39,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556754880] [2024-11-16 08:09:39,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:09:39,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:09:39,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:40,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 08:09:40,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:40,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 08:09:40,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:40,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-16 08:09:40,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:40,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 08:09:40,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:40,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 08:09:40,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:40,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:09:40,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:09:40,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556754880] [2024-11-16 08:09:40,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556754880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:09:40,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:09:40,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 08:09:40,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430939308] [2024-11-16 08:09:40,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:09:40,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 08:09:40,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:09:40,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 08:09:40,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 08:09:40,085 INFO L87 Difference]: Start difference. First operand 392 states and 528 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 08:09:41,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:09:41,064 INFO L93 Difference]: Finished difference Result 1215 states and 1649 transitions. [2024-11-16 08:09:41,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-16 08:09:41,064 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2024-11-16 08:09:41,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:09:41,069 INFO L225 Difference]: With dead ends: 1215 [2024-11-16 08:09:41,070 INFO L226 Difference]: Without dead ends: 833 [2024-11-16 08:09:41,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2024-11-16 08:09:41,072 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 418 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 08:09:41,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 964 Invalid, 1009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 963 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 08:09:41,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2024-11-16 08:09:41,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 634. [2024-11-16 08:09:41,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 546 states have (on average 1.3424908424908424) internal successors, (733), 551 states have internal predecessors, (733), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2024-11-16 08:09:41,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 852 transitions. [2024-11-16 08:09:41,125 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 852 transitions. Word has length 71 [2024-11-16 08:09:41,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:09:41,126 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 852 transitions. [2024-11-16 08:09:41,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 08:09:41,126 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 852 transitions. [2024-11-16 08:09:41,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-16 08:09:41,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:09:41,129 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:09:41,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 08:09:41,130 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:09:41,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:09:41,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1277603699, now seen corresponding path program 1 times [2024-11-16 08:09:41,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:09:41,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653019278] [2024-11-16 08:09:41,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:09:41,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:09:41,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:41,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 08:09:41,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:41,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 08:09:41,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:41,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-16 08:09:41,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:41,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 08:09:41,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:41,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 08:09:41,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:41,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:09:41,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:09:41,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653019278] [2024-11-16 08:09:41,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653019278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:09:41,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:09:41,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 08:09:41,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503260630] [2024-11-16 08:09:41,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:09:41,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 08:09:41,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:09:41,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 08:09:41,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 08:09:41,247 INFO L87 Difference]: Start difference. First operand 634 states and 852 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 08:09:41,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:09:41,794 INFO L93 Difference]: Finished difference Result 1346 states and 1835 transitions. [2024-11-16 08:09:41,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 08:09:41,794 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2024-11-16 08:09:41,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:09:41,800 INFO L225 Difference]: With dead ends: 1346 [2024-11-16 08:09:41,801 INFO L226 Difference]: Without dead ends: 723 [2024-11-16 08:09:41,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-16 08:09:41,805 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 137 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 08:09:41,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 648 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 08:09:41,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2024-11-16 08:09:41,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 637. [2024-11-16 08:09:41,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 549 states have (on average 1.3333333333333333) internal successors, (732), 554 states have internal predecessors, (732), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2024-11-16 08:09:41,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 851 transitions. [2024-11-16 08:09:41,850 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 851 transitions. Word has length 71 [2024-11-16 08:09:41,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:09:41,850 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 851 transitions. [2024-11-16 08:09:41,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 08:09:41,850 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 851 transitions. [2024-11-16 08:09:41,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-16 08:09:41,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:09:41,854 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:09:41,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 08:09:41,855 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:09:41,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:09:41,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1834016300, now seen corresponding path program 1 times [2024-11-16 08:09:41,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:09:41,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060586728] [2024-11-16 08:09:41,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:09:41,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:09:41,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:41,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 08:09:41,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:41,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 08:09:41,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:41,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-16 08:09:41,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:41,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 08:09:41,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:41,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 08:09:41,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:41,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:09:41,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:09:41,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060586728] [2024-11-16 08:09:41,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060586728] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:09:41,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:09:41,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 08:09:41,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277551354] [2024-11-16 08:09:41,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:09:41,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 08:09:41,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:09:41,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 08:09:41,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 08:09:41,951 INFO L87 Difference]: Start difference. First operand 637 states and 851 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 08:09:42,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:09:42,672 INFO L93 Difference]: Finished difference Result 2035 states and 2740 transitions. [2024-11-16 08:09:42,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 08:09:42,672 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2024-11-16 08:09:42,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:09:42,679 INFO L225 Difference]: With dead ends: 2035 [2024-11-16 08:09:42,680 INFO L226 Difference]: Without dead ends: 1409 [2024-11-16 08:09:42,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-16 08:09:42,683 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 582 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 08:09:42,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 711 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 08:09:42,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2024-11-16 08:09:42,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1214. [2024-11-16 08:09:42,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1214 states, 1046 states have (on average 1.3279158699808795) internal successors, (1389), 1055 states have internal predecessors, (1389), 99 states have call successors, (99), 60 states have call predecessors, (99), 68 states have return successors, (122), 102 states have call predecessors, (122), 99 states have call successors, (122) [2024-11-16 08:09:42,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 1610 transitions. [2024-11-16 08:09:42,761 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 1610 transitions. Word has length 71 [2024-11-16 08:09:42,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:09:42,761 INFO L471 AbstractCegarLoop]: Abstraction has 1214 states and 1610 transitions. [2024-11-16 08:09:42,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 08:09:42,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1610 transitions. [2024-11-16 08:09:42,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-16 08:09:42,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:09:42,763 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:09:42,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 08:09:42,764 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:09:42,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:09:42,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1706715657, now seen corresponding path program 1 times [2024-11-16 08:09:42,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:09:42,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950244856] [2024-11-16 08:09:42,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:09:42,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:09:42,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:42,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 08:09:42,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:42,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 08:09:42,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:42,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-16 08:09:42,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:42,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 08:09:42,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:42,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 08:09:42,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:42,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:09:42,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:09:42,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950244856] [2024-11-16 08:09:42,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950244856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:09:42,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:09:42,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 08:09:42,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718240174] [2024-11-16 08:09:42,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:09:42,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 08:09:42,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:09:42,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 08:09:42,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 08:09:42,866 INFO L87 Difference]: Start difference. First operand 1214 states and 1610 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 08:09:43,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:09:43,457 INFO L93 Difference]: Finished difference Result 2578 states and 3463 transitions. [2024-11-16 08:09:43,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 08:09:43,458 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2024-11-16 08:09:43,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:09:43,466 INFO L225 Difference]: With dead ends: 2578 [2024-11-16 08:09:43,466 INFO L226 Difference]: Without dead ends: 1375 [2024-11-16 08:09:43,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-16 08:09:43,472 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 150 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 08:09:43,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 648 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 08:09:43,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2024-11-16 08:09:43,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 1229. [2024-11-16 08:09:43,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1229 states, 1061 states have (on average 1.3185673892554195) internal successors, (1399), 1070 states have internal predecessors, (1399), 99 states have call successors, (99), 60 states have call predecessors, (99), 68 states have return successors, (122), 102 states have call predecessors, (122), 99 states have call successors, (122) [2024-11-16 08:09:43,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 1620 transitions. [2024-11-16 08:09:43,559 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 1620 transitions. Word has length 71 [2024-11-16 08:09:43,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:09:43,559 INFO L471 AbstractCegarLoop]: Abstraction has 1229 states and 1620 transitions. [2024-11-16 08:09:43,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 08:09:43,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1620 transitions. [2024-11-16 08:09:43,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-16 08:09:43,561 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:09:43,561 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:09:43,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 08:09:43,561 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:09:43,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:09:43,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1126671640, now seen corresponding path program 1 times [2024-11-16 08:09:43,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:09:43,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221176994] [2024-11-16 08:09:43,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:09:43,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:09:43,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:43,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 08:09:43,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:43,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 08:09:43,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:43,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-16 08:09:43,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:43,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 08:09:43,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:43,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 08:09:43,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:43,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:09:43,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:09:43,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221176994] [2024-11-16 08:09:43,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221176994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:09:43,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:09:43,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 08:09:43,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849843933] [2024-11-16 08:09:43,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:09:43,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 08:09:43,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:09:43,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 08:09:43,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 08:09:43,698 INFO L87 Difference]: Start difference. First operand 1229 states and 1620 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 08:09:45,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:09:45,058 INFO L93 Difference]: Finished difference Result 6302 states and 8609 transitions. [2024-11-16 08:09:45,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-16 08:09:45,059 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2024-11-16 08:09:45,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:09:45,083 INFO L225 Difference]: With dead ends: 6302 [2024-11-16 08:09:45,084 INFO L226 Difference]: Without dead ends: 5084 [2024-11-16 08:09:45,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2024-11-16 08:09:45,092 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 1097 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1112 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 08:09:45,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1112 Valid, 900 Invalid, 987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 08:09:45,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5084 states. [2024-11-16 08:09:45,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5084 to 3342. [2024-11-16 08:09:45,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3342 states, 2872 states have (on average 1.323816155988858) internal successors, (3802), 2907 states have internal predecessors, (3802), 272 states have call successors, (272), 173 states have call predecessors, (272), 197 states have return successors, (353), 265 states have call predecessors, (353), 272 states have call successors, (353) [2024-11-16 08:09:45,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3342 states to 3342 states and 4427 transitions. [2024-11-16 08:09:45,378 INFO L78 Accepts]: Start accepts. Automaton has 3342 states and 4427 transitions. Word has length 71 [2024-11-16 08:09:45,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:09:45,379 INFO L471 AbstractCegarLoop]: Abstraction has 3342 states and 4427 transitions. [2024-11-16 08:09:45,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 08:09:45,379 INFO L276 IsEmpty]: Start isEmpty. Operand 3342 states and 4427 transitions. [2024-11-16 08:09:45,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-16 08:09:45,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:09:45,382 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:09:45,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 08:09:45,382 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:09:45,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:09:45,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1899785674, now seen corresponding path program 1 times [2024-11-16 08:09:45,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:09:45,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988479802] [2024-11-16 08:09:45,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:09:45,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:09:45,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:45,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 08:09:45,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:45,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 08:09:45,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:45,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-16 08:09:45,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:45,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 08:09:45,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:45,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 08:09:45,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:45,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 08:09:45,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:45,491 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-16 08:09:45,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:09:45,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988479802] [2024-11-16 08:09:45,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988479802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:09:45,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:09:45,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 08:09:45,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121736189] [2024-11-16 08:09:45,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:09:45,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 08:09:45,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:09:45,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 08:09:45,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 08:09:45,493 INFO L87 Difference]: Start difference. First operand 3342 states and 4427 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 08:09:46,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:09:46,207 INFO L93 Difference]: Finished difference Result 7119 states and 9564 transitions. [2024-11-16 08:09:46,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 08:09:46,208 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), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 94 [2024-11-16 08:09:46,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:09:46,253 INFO L225 Difference]: With dead ends: 7119 [2024-11-16 08:09:46,253 INFO L226 Difference]: Without dead ends: 3788 [2024-11-16 08:09:46,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-16 08:09:46,261 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 152 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 08:09:46,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 647 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 08:09:46,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3788 states. [2024-11-16 08:09:46,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3788 to 3402. [2024-11-16 08:09:46,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3402 states, 2932 states have (on average 1.3137789904502046) internal successors, (3852), 2967 states have internal predecessors, (3852), 272 states have call successors, (272), 173 states have call predecessors, (272), 197 states have return successors, (353), 265 states have call predecessors, (353), 272 states have call successors, (353) [2024-11-16 08:09:46,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3402 states to 3402 states and 4477 transitions. [2024-11-16 08:09:46,540 INFO L78 Accepts]: Start accepts. Automaton has 3402 states and 4477 transitions. Word has length 94 [2024-11-16 08:09:46,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:09:46,541 INFO L471 AbstractCegarLoop]: Abstraction has 3402 states and 4477 transitions. [2024-11-16 08:09:46,541 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), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 08:09:46,541 INFO L276 IsEmpty]: Start isEmpty. Operand 3402 states and 4477 transitions. [2024-11-16 08:09:46,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-16 08:09:46,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:09:46,544 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:09:46,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 08:09:46,545 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:09:46,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:09:46,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1764722997, now seen corresponding path program 1 times [2024-11-16 08:09:46,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:09:46,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370458453] [2024-11-16 08:09:46,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:09:46,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:09:46,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:46,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 08:09:46,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:46,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 08:09:46,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:46,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-16 08:09:46,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:46,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 08:09:46,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:46,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 08:09:46,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:46,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 08:09:46,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:46,666 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-16 08:09:46,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:09:46,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370458453] [2024-11-16 08:09:46,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370458453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:09:46,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:09:46,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 08:09:46,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37416837] [2024-11-16 08:09:46,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:09:46,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 08:09:46,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:09:46,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 08:09:46,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 08:09:46,669 INFO L87 Difference]: Start difference. First operand 3402 states and 4477 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 08:09:47,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:09:47,191 INFO L93 Difference]: Finished difference Result 7136 states and 9448 transitions. [2024-11-16 08:09:47,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 08:09:47,191 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), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 94 [2024-11-16 08:09:47,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:09:47,211 INFO L225 Difference]: With dead ends: 7136 [2024-11-16 08:09:47,211 INFO L226 Difference]: Without dead ends: 3746 [2024-11-16 08:09:47,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-16 08:09:47,220 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 421 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 08:09:47,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 390 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 08:09:47,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3746 states. [2024-11-16 08:09:47,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3746 to 3378. [2024-11-16 08:09:47,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3378 states, 2908 states have (on average 1.2916093535075652) internal successors, (3756), 2943 states have internal predecessors, (3756), 272 states have call successors, (272), 173 states have call predecessors, (272), 197 states have return successors, (353), 265 states have call predecessors, (353), 272 states have call successors, (353) [2024-11-16 08:09:47,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3378 states to 3378 states and 4381 transitions. [2024-11-16 08:09:47,534 INFO L78 Accepts]: Start accepts. Automaton has 3378 states and 4381 transitions. Word has length 94 [2024-11-16 08:09:47,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:09:47,535 INFO L471 AbstractCegarLoop]: Abstraction has 3378 states and 4381 transitions. [2024-11-16 08:09:47,535 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), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 08:09:47,536 INFO L276 IsEmpty]: Start isEmpty. Operand 3378 states and 4381 transitions. [2024-11-16 08:09:47,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-16 08:09:47,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:09:47,540 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:09:47,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 08:09:47,541 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:09:47,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:09:47,541 INFO L85 PathProgramCache]: Analyzing trace with hash -995552982, now seen corresponding path program 1 times [2024-11-16 08:09:47,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:09:47,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231191608] [2024-11-16 08:09:47,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:09:47,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:09:47,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:47,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 08:09:47,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:47,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 08:09:47,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:47,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-16 08:09:47,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:47,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 08:09:47,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:47,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 08:09:47,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:47,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 08:09:47,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:47,710 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-16 08:09:47,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:09:47,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231191608] [2024-11-16 08:09:47,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231191608] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:09:47,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:09:47,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 08:09:47,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895790143] [2024-11-16 08:09:47,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:09:47,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 08:09:47,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:09:47,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 08:09:47,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-16 08:09:47,713 INFO L87 Difference]: Start difference. First operand 3378 states and 4381 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 08:09:48,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:09:48,621 INFO L93 Difference]: Finished difference Result 5284 states and 6882 transitions. [2024-11-16 08:09:48,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-16 08:09:48,622 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 94 [2024-11-16 08:09:48,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:09:48,639 INFO L225 Difference]: With dead ends: 5284 [2024-11-16 08:09:48,639 INFO L226 Difference]: Without dead ends: 3192 [2024-11-16 08:09:48,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2024-11-16 08:09:48,646 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 610 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 08:09:48,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [619 Valid, 617 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 08:09:48,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3192 states. [2024-11-16 08:09:48,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3192 to 2684. [2024-11-16 08:09:48,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2684 states, 2310 states have (on average 1.2818181818181817) internal successors, (2961), 2331 states have internal predecessors, (2961), 222 states have call successors, (222), 139 states have call predecessors, (222), 151 states have return successors, (257), 215 states have call predecessors, (257), 222 states have call successors, (257) [2024-11-16 08:09:48,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2684 states to 2684 states and 3440 transitions. [2024-11-16 08:09:48,872 INFO L78 Accepts]: Start accepts. Automaton has 2684 states and 3440 transitions. Word has length 94 [2024-11-16 08:09:48,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:09:48,874 INFO L471 AbstractCegarLoop]: Abstraction has 2684 states and 3440 transitions. [2024-11-16 08:09:48,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 08:09:48,874 INFO L276 IsEmpty]: Start isEmpty. Operand 2684 states and 3440 transitions. [2024-11-16 08:09:48,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-16 08:09:48,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:09:48,876 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:09:48,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 08:09:48,876 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:09:48,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:09:48,877 INFO L85 PathProgramCache]: Analyzing trace with hash 137637611, now seen corresponding path program 1 times [2024-11-16 08:09:48,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:09:48,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447174010] [2024-11-16 08:09:48,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:09:48,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:09:48,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:48,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 08:09:48,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:48,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 08:09:48,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:48,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-16 08:09:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:48,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 08:09:48,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:48,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 08:09:48,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:48,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 08:09:48,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:48,985 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-16 08:09:48,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:09:48,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447174010] [2024-11-16 08:09:48,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447174010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:09:48,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:09:48,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 08:09:48,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192721187] [2024-11-16 08:09:48,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:09:48,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 08:09:48,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:09:48,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 08:09:48,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 08:09:48,988 INFO L87 Difference]: Start difference. First operand 2684 states and 3440 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 08:09:49,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:09:49,573 INFO L93 Difference]: Finished difference Result 6147 states and 7868 transitions. [2024-11-16 08:09:49,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 08:09:49,574 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), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 94 [2024-11-16 08:09:49,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:09:49,589 INFO L225 Difference]: With dead ends: 6147 [2024-11-16 08:09:49,589 INFO L226 Difference]: Without dead ends: 3475 [2024-11-16 08:09:49,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-16 08:09:49,596 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 513 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 08:09:49,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 392 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 08:09:49,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3475 states. [2024-11-16 08:09:49,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3475 to 3044. [2024-11-16 08:09:49,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3044 states, 2642 states have (on average 1.237320211960636) internal successors, (3269), 2663 states have internal predecessors, (3269), 228 states have call successors, (228), 161 states have call predecessors, (228), 173 states have return successors, (277), 221 states have call predecessors, (277), 228 states have call successors, (277) [2024-11-16 08:09:49,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3044 states to 3044 states and 3774 transitions. [2024-11-16 08:09:49,807 INFO L78 Accepts]: Start accepts. Automaton has 3044 states and 3774 transitions. Word has length 94 [2024-11-16 08:09:49,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:09:49,807 INFO L471 AbstractCegarLoop]: Abstraction has 3044 states and 3774 transitions. [2024-11-16 08:09:49,808 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), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 08:09:49,808 INFO L276 IsEmpty]: Start isEmpty. Operand 3044 states and 3774 transitions. [2024-11-16 08:09:49,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-16 08:09:49,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:09:49,809 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:09:49,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 08:09:49,810 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:09:49,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:09:49,810 INFO L85 PathProgramCache]: Analyzing trace with hash -102902518, now seen corresponding path program 1 times [2024-11-16 08:09:49,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:09:49,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958431265] [2024-11-16 08:09:49,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:09:49,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:09:49,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:49,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 08:09:49,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:49,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 08:09:49,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:49,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-16 08:09:49,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:49,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 08:09:49,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:49,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 08:09:49,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:49,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 08:09:49,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:49,966 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-16 08:09:49,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:09:49,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958431265] [2024-11-16 08:09:49,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958431265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:09:49,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:09:49,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 08:09:49,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761631363] [2024-11-16 08:09:49,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:09:49,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 08:09:49,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:09:49,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 08:09:49,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-16 08:09:49,969 INFO L87 Difference]: Start difference. First operand 3044 states and 3774 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 08:09:51,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:09:51,109 INFO L93 Difference]: Finished difference Result 5956 states and 7401 transitions. [2024-11-16 08:09:51,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-16 08:09:51,110 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 94 [2024-11-16 08:09:51,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:09:51,129 INFO L225 Difference]: With dead ends: 5956 [2024-11-16 08:09:51,129 INFO L226 Difference]: Without dead ends: 3159 [2024-11-16 08:09:51,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2024-11-16 08:09:51,139 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 487 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 08:09:51,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 701 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 08:09:51,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3159 states. [2024-11-16 08:09:51,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3159 to 2686. [2024-11-16 08:09:51,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2686 states, 2334 states have (on average 1.2369323050556984) internal successors, (2887), 2348 states have internal predecessors, (2887), 203 states have call successors, (203), 142 states have call predecessors, (203), 148 states have return successors, (238), 196 states have call predecessors, (238), 203 states have call successors, (238) [2024-11-16 08:09:51,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2686 states to 2686 states and 3328 transitions. [2024-11-16 08:09:51,399 INFO L78 Accepts]: Start accepts. Automaton has 2686 states and 3328 transitions. Word has length 94 [2024-11-16 08:09:51,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:09:51,400 INFO L471 AbstractCegarLoop]: Abstraction has 2686 states and 3328 transitions. [2024-11-16 08:09:51,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 08:09:51,400 INFO L276 IsEmpty]: Start isEmpty. Operand 2686 states and 3328 transitions. [2024-11-16 08:09:51,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-16 08:09:51,401 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:09:51,401 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:09:51,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 08:09:51,402 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:09:51,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:09:51,402 INFO L85 PathProgramCache]: Analyzing trace with hash -110661877, now seen corresponding path program 1 times [2024-11-16 08:09:51,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:09:51,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146455827] [2024-11-16 08:09:51,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:09:51,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:09:51,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:51,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 08:09:51,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:51,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 08:09:51,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:51,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-16 08:09:51,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:51,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 08:09:51,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:51,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 08:09:51,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:51,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 08:09:51,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:51,501 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-16 08:09:51,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:09:51,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146455827] [2024-11-16 08:09:51,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146455827] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 08:09:51,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245408308] [2024-11-16 08:09:51,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:09:51,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 08:09:51,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 08:09:51,504 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-11-16 08:09:51,507 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-11-16 08:09:51,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:51,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 08:09:51,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 08:09:51,658 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:09:51,658 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 08:09:51,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245408308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:09:51,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 08:09:51,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-16 08:09:51,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959910759] [2024-11-16 08:09:51,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:09:51,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:09:51,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:09:51,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:09:51,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 08:09:51,663 INFO L87 Difference]: Start difference. First operand 2686 states and 3328 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-16 08:09:51,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:09:51,940 INFO L93 Difference]: Finished difference Result 7880 states and 9867 transitions. [2024-11-16 08:09:51,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:09:51,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 94 [2024-11-16 08:09:51,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:09:51,961 INFO L225 Difference]: With dead ends: 7880 [2024-11-16 08:09:51,961 INFO L226 Difference]: Without dead ends: 5206 [2024-11-16 08:09:51,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 08:09:51,971 INFO L432 NwaCegarLoop]: 338 mSDtfsCounter, 145 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:09:51,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 519 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:09:51,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5206 states. [2024-11-16 08:09:52,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5206 to 5206. [2024-11-16 08:09:52,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5206 states, 4504 states have (on average 1.2231349911190053) internal successors, (5509), 4532 states have internal predecessors, (5509), 405 states have call successors, (405), 284 states have call predecessors, (405), 296 states have return successors, (539), 391 states have call predecessors, (539), 405 states have call successors, (539) [2024-11-16 08:09:52,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5206 states to 5206 states and 6453 transitions. [2024-11-16 08:09:52,380 INFO L78 Accepts]: Start accepts. Automaton has 5206 states and 6453 transitions. Word has length 94 [2024-11-16 08:09:52,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:09:52,381 INFO L471 AbstractCegarLoop]: Abstraction has 5206 states and 6453 transitions. [2024-11-16 08:09:52,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-16 08:09:52,382 INFO L276 IsEmpty]: Start isEmpty. Operand 5206 states and 6453 transitions. [2024-11-16 08:09:52,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-16 08:09:52,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:09:52,385 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:09:52,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 08:09:52,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-16 08:09:52,589 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:09:52,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:09:52,589 INFO L85 PathProgramCache]: Analyzing trace with hash 230211805, now seen corresponding path program 1 times [2024-11-16 08:09:52,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:09:52,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553688587] [2024-11-16 08:09:52,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:09:52,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:09:52,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:52,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 08:09:52,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:52,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 08:09:52,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:52,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-16 08:09:52,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:52,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 08:09:52,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:52,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 08:09:52,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:52,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 08:09:52,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:52,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-16 08:09:52,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:52,827 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-16 08:09:52,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:09:52,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553688587] [2024-11-16 08:09:52,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553688587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:09:52,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:09:52,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 08:09:52,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294572783] [2024-11-16 08:09:52,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:09:52,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 08:09:52,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:09:52,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 08:09:52,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-16 08:09:52,829 INFO L87 Difference]: Start difference. First operand 5206 states and 6453 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-16 08:09:54,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:09:54,116 INFO L93 Difference]: Finished difference Result 16117 states and 20166 transitions. [2024-11-16 08:09:54,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 08:09:54,117 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 108 [2024-11-16 08:09:54,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:09:54,157 INFO L225 Difference]: With dead ends: 16117 [2024-11-16 08:09:54,157 INFO L226 Difference]: Without dead ends: 10927 [2024-11-16 08:09:54,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2024-11-16 08:09:54,174 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 406 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 08:09:54,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 718 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 08:09:54,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10927 states. [2024-11-16 08:09:55,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10927 to 10337. [2024-11-16 08:09:55,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10337 states, 8899 states have (on average 1.2086751320373075) internal successors, (10756), 9009 states have internal predecessors, (10756), 773 states have call successors, (773), 550 states have call predecessors, (773), 664 states have return successors, (1269), 781 states have call predecessors, (1269), 773 states have call successors, (1269) [2024-11-16 08:09:55,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10337 states to 10337 states and 12798 transitions. [2024-11-16 08:09:55,166 INFO L78 Accepts]: Start accepts. Automaton has 10337 states and 12798 transitions. Word has length 108 [2024-11-16 08:09:55,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:09:55,167 INFO L471 AbstractCegarLoop]: Abstraction has 10337 states and 12798 transitions. [2024-11-16 08:09:55,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-16 08:09:55,168 INFO L276 IsEmpty]: Start isEmpty. Operand 10337 states and 12798 transitions. [2024-11-16 08:09:55,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-16 08:09:55,172 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:09:55,172 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:09:55,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 08:09:55,172 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:09:55,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:09:55,173 INFO L85 PathProgramCache]: Analyzing trace with hash -968523460, now seen corresponding path program 1 times [2024-11-16 08:09:55,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:09:55,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606793013] [2024-11-16 08:09:55,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:09:55,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:09:55,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:55,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 08:09:55,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:55,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 08:09:55,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:55,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-16 08:09:55,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:55,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 08:09:55,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:55,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 08:09:55,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:55,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 08:09:55,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:55,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-16 08:09:55,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:55,254 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-16 08:09:55,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:09:55,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606793013] [2024-11-16 08:09:55,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606793013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:09:55,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:09:55,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 08:09:55,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421277126] [2024-11-16 08:09:55,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:09:55,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 08:09:55,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:09:55,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 08:09:55,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 08:09:55,257 INFO L87 Difference]: Start difference. First operand 10337 states and 12798 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-16 08:09:56,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:09:56,176 INFO L93 Difference]: Finished difference Result 19211 states and 23743 transitions. [2024-11-16 08:09:56,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 08:09:56,177 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 108 [2024-11-16 08:09:56,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:09:56,208 INFO L225 Difference]: With dead ends: 19211 [2024-11-16 08:09:56,209 INFO L226 Difference]: Without dead ends: 8890 [2024-11-16 08:09:56,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-16 08:09:56,227 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 346 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 08:09:56,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 290 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 08:09:56,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8890 states. [2024-11-16 08:09:56,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8890 to 8268. [2024-11-16 08:09:56,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8268 states, 7123 states have (on average 1.2077776217885723) internal successors, (8603), 7211 states have internal predecessors, (8603), 611 states have call successors, (611), 436 states have call predecessors, (611), 533 states have return successors, (1005), 622 states have call predecessors, (1005), 611 states have call successors, (1005) [2024-11-16 08:09:56,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8268 states to 8268 states and 10219 transitions. [2024-11-16 08:09:56,858 INFO L78 Accepts]: Start accepts. Automaton has 8268 states and 10219 transitions. Word has length 108 [2024-11-16 08:09:56,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:09:56,859 INFO L471 AbstractCegarLoop]: Abstraction has 8268 states and 10219 transitions. [2024-11-16 08:09:56,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-16 08:09:56,859 INFO L276 IsEmpty]: Start isEmpty. Operand 8268 states and 10219 transitions. [2024-11-16 08:09:56,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-16 08:09:56,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:09:56,862 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:09:56,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-16 08:09:56,863 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:09:56,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:09:56,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1166801388, now seen corresponding path program 1 times [2024-11-16 08:09:56,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:09:56,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071356264] [2024-11-16 08:09:56,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:09:56,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:09:56,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:56,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 08:09:56,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:56,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 08:09:56,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:56,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-16 08:09:56,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:56,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 08:09:56,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:56,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 08:09:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:56,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 08:09:56,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:56,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-16 08:09:56,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:56,957 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-16 08:09:56,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:09:56,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071356264] [2024-11-16 08:09:56,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071356264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:09:56,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:09:56,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 08:09:56,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423407304] [2024-11-16 08:09:56,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:09:56,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 08:09:56,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:09:56,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 08:09:56,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 08:09:56,960 INFO L87 Difference]: Start difference. First operand 8268 states and 10219 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-16 08:09:58,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:09:58,441 INFO L93 Difference]: Finished difference Result 19808 states and 24917 transitions. [2024-11-16 08:09:58,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 08:09:58,442 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 110 [2024-11-16 08:09:58,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:09:58,489 INFO L225 Difference]: With dead ends: 19808 [2024-11-16 08:09:58,489 INFO L226 Difference]: Without dead ends: 10205 [2024-11-16 08:09:58,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-16 08:09:58,513 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 415 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 08:09:58,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 445 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 08:09:58,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10205 states. [2024-11-16 08:09:59,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10205 to 9286. [2024-11-16 08:09:59,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9286 states, 8009 states have (on average 1.2131352228742665) internal successors, (9716), 8085 states have internal predecessors, (9716), 688 states have call successors, (688), 488 states have call predecessors, (688), 588 states have return successors, (1117), 713 states have call predecessors, (1117), 688 states have call successors, (1117) [2024-11-16 08:09:59,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9286 states to 9286 states and 11521 transitions. [2024-11-16 08:09:59,580 INFO L78 Accepts]: Start accepts. Automaton has 9286 states and 11521 transitions. Word has length 110 [2024-11-16 08:09:59,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:09:59,586 INFO L471 AbstractCegarLoop]: Abstraction has 9286 states and 11521 transitions. [2024-11-16 08:09:59,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-16 08:09:59,586 INFO L276 IsEmpty]: Start isEmpty. Operand 9286 states and 11521 transitions. [2024-11-16 08:09:59,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-16 08:09:59,594 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:09:59,594 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 08:09:59,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-16 08:09:59,599 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:09:59,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:09:59,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1185406200, now seen corresponding path program 1 times [2024-11-16 08:09:59,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:09:59,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173359537] [2024-11-16 08:09:59,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:09:59,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:09:59,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:59,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 08:09:59,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:59,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 08:09:59,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:59,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-16 08:09:59,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:59,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 08:09:59,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:59,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 08:09:59,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:59,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 08:09:59,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:59,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 08:09:59,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:59,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-16 08:09:59,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:59,752 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-16 08:09:59,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:09:59,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173359537] [2024-11-16 08:09:59,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173359537] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 08:09:59,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753122803] [2024-11-16 08:09:59,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:09:59,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 08:09:59,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 08:09:59,755 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-11-16 08:09:59,756 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-11-16 08:09:59,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:09:59,846 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 08:09:59,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 08:09:59,954 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 08:09:59,955 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 08:09:59,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753122803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:09:59,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 08:09:59,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-16 08:09:59,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089395831] [2024-11-16 08:09:59,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:09:59,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:09:59,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:09:59,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:09:59,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 08:09:59,958 INFO L87 Difference]: Start difference. First operand 9286 states and 11521 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-16 08:10:00,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:10:00,663 INFO L93 Difference]: Finished difference Result 18735 states and 23640 transitions. [2024-11-16 08:10:00,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:10:00,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 135 [2024-11-16 08:10:00,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:10:00,700 INFO L225 Difference]: With dead ends: 18735 [2024-11-16 08:10:00,701 INFO L226 Difference]: Without dead ends: 10412 [2024-11-16 08:10:00,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 08:10:00,716 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 127 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:10:00,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 232 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:10:00,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10412 states. [2024-11-16 08:10:01,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10412 to 10327. [2024-11-16 08:10:01,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10327 states, 8931 states have (on average 1.1888926212070317) internal successors, (10618), 8992 states have internal predecessors, (10618), 752 states have call successors, (752), 564 states have call predecessors, (752), 643 states have return successors, (1237), 771 states have call predecessors, (1237), 752 states have call successors, (1237) [2024-11-16 08:10:01,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10327 states to 10327 states and 12607 transitions. [2024-11-16 08:10:01,509 INFO L78 Accepts]: Start accepts. Automaton has 10327 states and 12607 transitions. Word has length 135 [2024-11-16 08:10:01,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:10:01,510 INFO L471 AbstractCegarLoop]: Abstraction has 10327 states and 12607 transitions. [2024-11-16 08:10:01,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-16 08:10:01,510 INFO L276 IsEmpty]: Start isEmpty. Operand 10327 states and 12607 transitions. [2024-11-16 08:10:01,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-16 08:10:01,514 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:10:01,514 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-16 08:10:01,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 08:10:01,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 08:10:01,715 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:10:01,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:10:01,716 INFO L85 PathProgramCache]: Analyzing trace with hash 501005856, now seen corresponding path program 1 times [2024-11-16 08:10:01,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:10:01,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970974768] [2024-11-16 08:10:01,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:10:01,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:10:01,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:01,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 08:10:01,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:01,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 08:10:01,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:01,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-16 08:10:01,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:01,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 08:10:01,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:01,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 08:10:01,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:01,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-16 08:10:01,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:01,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 08:10:01,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:01,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-16 08:10:01,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:01,835 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 08:10:01,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:10:01,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970974768] [2024-11-16 08:10:01,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970974768] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 08:10:01,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475613473] [2024-11-16 08:10:01,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:10:01,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 08:10:01,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 08:10:01,839 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-11-16 08:10:01,842 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-11-16 08:10:01,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:01,927 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 08:10:01,929 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 08:10:01,973 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:10:01,973 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 08:10:01,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475613473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:10:01,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 08:10:01,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-16 08:10:01,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419767828] [2024-11-16 08:10:01,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:10:01,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:10:01,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:10:01,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:10:01,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 08:10:01,976 INFO L87 Difference]: Start difference. First operand 10327 states and 12607 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-16 08:10:02,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:10:02,592 INFO L93 Difference]: Finished difference Result 17923 states and 21864 transitions. [2024-11-16 08:10:02,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:10:02,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 138 [2024-11-16 08:10:02,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:10:02,633 INFO L225 Difference]: With dead ends: 17923 [2024-11-16 08:10:02,633 INFO L226 Difference]: Without dead ends: 10142 [2024-11-16 08:10:02,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 08:10:02,650 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 127 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:10:02,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 491 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:10:02,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10142 states. [2024-11-16 08:10:03,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10142 to 10042. [2024-11-16 08:10:03,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10042 states, 8737 states have (on average 1.1839304108961886) internal successors, (10344), 8797 states have internal predecessors, (10344), 692 states have call successors, (692), 536 states have call predecessors, (692), 612 states have return successors, (1050), 709 states have call predecessors, (1050), 692 states have call successors, (1050) [2024-11-16 08:10:03,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10042 states to 10042 states and 12086 transitions. [2024-11-16 08:10:03,590 INFO L78 Accepts]: Start accepts. Automaton has 10042 states and 12086 transitions. Word has length 138 [2024-11-16 08:10:03,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:10:03,591 INFO L471 AbstractCegarLoop]: Abstraction has 10042 states and 12086 transitions. [2024-11-16 08:10:03,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-16 08:10:03,592 INFO L276 IsEmpty]: Start isEmpty. Operand 10042 states and 12086 transitions. [2024-11-16 08:10:03,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-16 08:10:03,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:10:03,599 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:10:03,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-16 08:10:03,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 08:10:03,803 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:10:03,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:10:03,804 INFO L85 PathProgramCache]: Analyzing trace with hash -214757445, now seen corresponding path program 1 times [2024-11-16 08:10:03,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:10:03,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780005929] [2024-11-16 08:10:03,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:10:03,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:10:03,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:03,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 08:10:03,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:03,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 08:10:03,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:03,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-16 08:10:03,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:03,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 08:10:03,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:03,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 08:10:03,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:03,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-16 08:10:03,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:03,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 08:10:03,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:03,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-16 08:10:03,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:03,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-16 08:10:03,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:03,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-16 08:10:03,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:03,949 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 7 proven. 39 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-16 08:10:03,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:10:03,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780005929] [2024-11-16 08:10:03,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780005929] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 08:10:03,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132826039] [2024-11-16 08:10:03,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:10:03,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 08:10:03,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 08:10:03,953 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 08:10:03,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-16 08:10:04,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:04,054 INFO L255 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 08:10:04,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 08:10:04,084 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-16 08:10:04,085 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 08:10:04,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132826039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:10:04,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 08:10:04,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2024-11-16 08:10:04,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428121919] [2024-11-16 08:10:04,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:10:04,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:10:04,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:10:04,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:10:04,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 08:10:04,087 INFO L87 Difference]: Start difference. First operand 10042 states and 12086 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-16 08:10:05,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:10:05,843 INFO L93 Difference]: Finished difference Result 28322 states and 34572 transitions. [2024-11-16 08:10:05,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:10:05,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 175 [2024-11-16 08:10:05,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:10:05,902 INFO L225 Difference]: With dead ends: 28322 [2024-11-16 08:10:05,902 INFO L226 Difference]: Without dead ends: 18292 [2024-11-16 08:10:05,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 08:10:05,921 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 156 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:10:05,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 404 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:10:05,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18292 states. [2024-11-16 08:10:07,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18292 to 18288. [2024-11-16 08:10:07,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18288 states, 15840 states have (on average 1.1760732323232324) internal successors, (18629), 15943 states have internal predecessors, (18629), 1317 states have call successors, (1317), 1006 states have call predecessors, (1317), 1130 states have return successors, (2224), 1340 states have call predecessors, (2224), 1317 states have call successors, (2224) [2024-11-16 08:10:07,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18288 states to 18288 states and 22170 transitions. [2024-11-16 08:10:07,125 INFO L78 Accepts]: Start accepts. Automaton has 18288 states and 22170 transitions. Word has length 175 [2024-11-16 08:10:07,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:10:07,125 INFO L471 AbstractCegarLoop]: Abstraction has 18288 states and 22170 transitions. [2024-11-16 08:10:07,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-16 08:10:07,126 INFO L276 IsEmpty]: Start isEmpty. Operand 18288 states and 22170 transitions. [2024-11-16 08:10:07,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-16 08:10:07,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:10:07,142 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:10:07,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-16 08:10:07,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 08:10:07,344 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:10:07,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:10:07,344 INFO L85 PathProgramCache]: Analyzing trace with hash 306356765, now seen corresponding path program 1 times [2024-11-16 08:10:07,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:10:07,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224416239] [2024-11-16 08:10:07,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:10:07,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:10:07,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:07,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 08:10:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:07,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 08:10:07,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:07,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-16 08:10:07,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:07,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 08:10:07,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:07,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 08:10:07,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:07,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-16 08:10:07,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:07,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 08:10:07,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:07,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-16 08:10:07,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:07,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 08:10:07,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:07,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-16 08:10:07,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:07,418 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2024-11-16 08:10:07,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:10:07,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224416239] [2024-11-16 08:10:07,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224416239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:10:07,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:10:07,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 08:10:07,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782589420] [2024-11-16 08:10:07,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:10:07,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 08:10:07,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:10:07,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 08:10:07,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 08:10:07,421 INFO L87 Difference]: Start difference. First operand 18288 states and 22170 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-16 08:10:08,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:10:08,949 INFO L93 Difference]: Finished difference Result 37236 states and 45175 transitions. [2024-11-16 08:10:08,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 08:10:08,950 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 176 [2024-11-16 08:10:08,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:10:09,000 INFO L225 Difference]: With dead ends: 37236 [2024-11-16 08:10:09,001 INFO L226 Difference]: Without dead ends: 18960 [2024-11-16 08:10:09,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 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-11-16 08:10:09,036 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 344 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 08:10:09,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 282 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 08:10:09,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18960 states. [2024-11-16 08:10:10,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18960 to 17971. [2024-11-16 08:10:10,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17971 states, 15573 states have (on average 1.1749181275284146) internal successors, (18297), 15715 states have internal predecessors, (18297), 1262 states have call successors, (1262), 968 states have call predecessors, (1262), 1135 states have return successors, (2200), 1288 states have call predecessors, (2200), 1262 states have call successors, (2200) [2024-11-16 08:10:10,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17971 states to 17971 states and 21759 transitions. [2024-11-16 08:10:10,365 INFO L78 Accepts]: Start accepts. Automaton has 17971 states and 21759 transitions. Word has length 176 [2024-11-16 08:10:10,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:10:10,365 INFO L471 AbstractCegarLoop]: Abstraction has 17971 states and 21759 transitions. [2024-11-16 08:10:10,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-16 08:10:10,366 INFO L276 IsEmpty]: Start isEmpty. Operand 17971 states and 21759 transitions. [2024-11-16 08:10:10,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-16 08:10:10,374 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:10:10,374 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:10:10,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-16 08:10:10,375 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:10:10,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:10:10,375 INFO L85 PathProgramCache]: Analyzing trace with hash 820201726, now seen corresponding path program 1 times [2024-11-16 08:10:10,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:10:10,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342530945] [2024-11-16 08:10:10,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:10:10,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:10:10,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:10,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 08:10:10,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:10,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 08:10:10,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:10,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-16 08:10:10,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:10,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 08:10:10,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:10,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 08:10:10,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:10,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 08:10:10,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:10,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-16 08:10:10,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:10,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-16 08:10:10,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:10,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 08:10:10,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:10,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-16 08:10:10,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:10,487 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-16 08:10:10,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:10:10,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342530945] [2024-11-16 08:10:10,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342530945] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 08:10:10,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448350700] [2024-11-16 08:10:10,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:10:10,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 08:10:10,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 08:10:10,490 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 08:10:10,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-16 08:10:10,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:10,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 08:10:10,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 08:10:10,652 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-16 08:10:10,653 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 08:10:10,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448350700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:10:10,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 08:10:10,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2024-11-16 08:10:10,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652959695] [2024-11-16 08:10:10,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:10:10,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:10:10,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:10:10,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:10:10,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 08:10:10,656 INFO L87 Difference]: Start difference. First operand 17971 states and 21759 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-16 08:10:12,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:10:12,145 INFO L93 Difference]: Finished difference Result 28959 states and 35758 transitions. [2024-11-16 08:10:12,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:10:12,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 177 [2024-11-16 08:10:12,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:10:12,206 INFO L225 Difference]: With dead ends: 28959 [2024-11-16 08:10:12,206 INFO L226 Difference]: Without dead ends: 17687 [2024-11-16 08:10:12,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 08:10:12,230 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 126 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:10:12,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 495 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:10:12,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17687 states. [2024-11-16 08:10:14,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17687 to 17625. [2024-11-16 08:10:14,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17625 states, 15227 states have (on average 1.1612924410586458) internal successors, (17683), 15369 states have internal predecessors, (17683), 1262 states have call successors, (1262), 968 states have call predecessors, (1262), 1135 states have return successors, (2200), 1288 states have call predecessors, (2200), 1262 states have call successors, (2200) [2024-11-16 08:10:14,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17625 states to 17625 states and 21145 transitions. [2024-11-16 08:10:14,126 INFO L78 Accepts]: Start accepts. Automaton has 17625 states and 21145 transitions. Word has length 177 [2024-11-16 08:10:14,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:10:14,127 INFO L471 AbstractCegarLoop]: Abstraction has 17625 states and 21145 transitions. [2024-11-16 08:10:14,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-16 08:10:14,127 INFO L276 IsEmpty]: Start isEmpty. Operand 17625 states and 21145 transitions. [2024-11-16 08:10:14,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-16 08:10:14,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:10:14,134 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:10:14,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-16 08:10:14,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-16 08:10:14,335 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:10:14,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:10:14,336 INFO L85 PathProgramCache]: Analyzing trace with hash 111254397, now seen corresponding path program 1 times [2024-11-16 08:10:14,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:10:14,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912253240] [2024-11-16 08:10:14,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:10:14,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:10:14,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:14,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 08:10:14,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:14,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 08:10:14,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:14,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-16 08:10:14,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:14,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 08:10:14,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:14,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 08:10:14,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:14,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 08:10:14,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:14,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-16 08:10:14,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:14,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-16 08:10:14,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:14,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 08:10:14,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:14,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-16 08:10:14,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:14,435 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-16 08:10:14,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:10:14,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912253240] [2024-11-16 08:10:14,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912253240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:10:14,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:10:14,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 08:10:14,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533331152] [2024-11-16 08:10:14,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:10:14,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 08:10:14,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:10:14,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 08:10:14,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 08:10:14,437 INFO L87 Difference]: Start difference. First operand 17625 states and 21145 transitions. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 4 states have internal predecessors, (132), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-16 08:10:15,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:10:15,542 INFO L93 Difference]: Finished difference Result 27457 states and 33155 transitions. [2024-11-16 08:10:15,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 08:10:15,543 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 4 states have internal predecessors, (132), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 178 [2024-11-16 08:10:15,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:10:15,598 INFO L225 Difference]: With dead ends: 27457 [2024-11-16 08:10:15,598 INFO L226 Difference]: Without dead ends: 10622 [2024-11-16 08:10:15,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-16 08:10:15,631 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 571 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 08:10:15,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [601 Valid, 634 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 08:10:15,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10622 states. [2024-11-16 08:10:16,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10622 to 9951. [2024-11-16 08:10:16,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9951 states, 8641 states have (on average 1.1498669135516724) internal successors, (9936), 8712 states have internal predecessors, (9936), 690 states have call successors, (690), 522 states have call predecessors, (690), 619 states have return successors, (1069), 717 states have call predecessors, (1069), 690 states have call successors, (1069) [2024-11-16 08:10:16,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9951 states to 9951 states and 11695 transitions. [2024-11-16 08:10:16,462 INFO L78 Accepts]: Start accepts. Automaton has 9951 states and 11695 transitions. Word has length 178 [2024-11-16 08:10:16,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:10:16,463 INFO L471 AbstractCegarLoop]: Abstraction has 9951 states and 11695 transitions. [2024-11-16 08:10:16,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 4 states have internal predecessors, (132), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-16 08:10:16,463 INFO L276 IsEmpty]: Start isEmpty. Operand 9951 states and 11695 transitions. [2024-11-16 08:10:16,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-16 08:10:16,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:10:16,469 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:10:16,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-16 08:10:16,469 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:10:16,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:10:16,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1934001302, now seen corresponding path program 1 times [2024-11-16 08:10:16,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:10:16,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710884221] [2024-11-16 08:10:16,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:10:16,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:10:16,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:16,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 08:10:16,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:16,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 08:10:16,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:16,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-16 08:10:16,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:16,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 08:10:16,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:16,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 08:10:16,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:16,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 08:10:16,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:16,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-16 08:10:16,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:16,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-16 08:10:16,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:16,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 08:10:16,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:16,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-16 08:10:16,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:16,569 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 43 proven. 13 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-16 08:10:16,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:10:16,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710884221] [2024-11-16 08:10:16,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710884221] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 08:10:16,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415189770] [2024-11-16 08:10:16,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:10:16,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 08:10:16,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 08:10:16,573 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 08:10:16,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-16 08:10:16,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:10:16,668 INFO L255 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 08:10:16,671 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 08:10:16,754 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-16 08:10:16,754 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 08:10:16,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415189770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:10:16,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 08:10:16,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2024-11-16 08:10:16,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004537919] [2024-11-16 08:10:16,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:10:16,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:10:16,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:10:16,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:10:16,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 08:10:16,756 INFO L87 Difference]: Start difference. First operand 9951 states and 11695 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-16 08:10:17,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:10:17,303 INFO L93 Difference]: Finished difference Result 16720 states and 19920 transitions. [2024-11-16 08:10:17,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:10:17,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 179 [2024-11-16 08:10:17,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:10:17,340 INFO L225 Difference]: With dead ends: 16720 [2024-11-16 08:10:17,340 INFO L226 Difference]: Without dead ends: 9993 [2024-11-16 08:10:17,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 08:10:17,357 INFO L432 NwaCegarLoop]: 287 mSDtfsCounter, 92 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:10:17,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 450 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:10:17,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9993 states. [2024-11-16 08:10:17,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9993 to 9951. [2024-11-16 08:10:18,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9951 states, 8641 states have (on average 1.1340122670987154) internal successors, (9799), 8712 states have internal predecessors, (9799), 690 states have call successors, (690), 522 states have call predecessors, (690), 619 states have return successors, (1069), 717 states have call predecessors, (1069), 690 states have call successors, (1069) [2024-11-16 08:10:18,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9951 states to 9951 states and 11558 transitions. [2024-11-16 08:10:18,030 INFO L78 Accepts]: Start accepts. Automaton has 9951 states and 11558 transitions. Word has length 179 [2024-11-16 08:10:18,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:10:18,031 INFO L471 AbstractCegarLoop]: Abstraction has 9951 states and 11558 transitions. [2024-11-16 08:10:18,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-16 08:10:18,031 INFO L276 IsEmpty]: Start isEmpty. Operand 9951 states and 11558 transitions. [2024-11-16 08:10:18,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-16 08:10:18,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:10:18,036 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:10:18,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-16 08:10:18,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 08:10:18,237 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:10:18,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:10:18,238 INFO L85 PathProgramCache]: Analyzing trace with hash -897030793, now seen corresponding path program 1 times [2024-11-16 08:10:18,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:10:18,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756920552] [2024-11-16 08:10:18,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:10:18,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:10:18,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 08:10:18,253 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 08:10:18,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 08:10:18,315 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 08:10:18,316 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 08:10:18,317 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 08:10:18,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-16 08:10:18,324 INFO L407 BasicCegarLoop]: Path program 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] [2024-11-16 08:10:18,452 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 08:10:18,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 08:10:18 BoogieIcfgContainer [2024-11-16 08:10:18,455 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 08:10:18,456 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 08:10:18,456 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 08:10:18,456 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 08:10:18,456 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 08:09:35" (3/4) ... [2024-11-16 08:10:18,457 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-16 08:10:18,578 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 08:10:18,578 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 08:10:18,578 INFO L158 Benchmark]: Toolchain (without parser) took 44264.69ms. Allocated memory was 165.7MB in the beginning and 5.2GB in the end (delta: 5.0GB). Free memory was 95.7MB in the beginning and 4.7GB in the end (delta: -4.6GB). Peak memory consumption was 377.5MB. Max. memory is 16.1GB. [2024-11-16 08:10:18,579 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 117.4MB. Free memory is still 78.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 08:10:18,579 INFO L158 Benchmark]: CACSL2BoogieTranslator took 405.59ms. Allocated memory is still 165.7MB. Free memory was 95.4MB in the beginning and 79.7MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-16 08:10:18,579 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.12ms. Allocated memory is still 165.7MB. Free memory was 79.7MB in the beginning and 77.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 08:10:18,579 INFO L158 Benchmark]: Boogie Preprocessor took 62.51ms. Allocated memory is still 165.7MB. Free memory was 77.6MB in the beginning and 75.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 08:10:18,579 INFO L158 Benchmark]: IcfgBuilder took 654.45ms. Allocated memory is still 165.7MB. Free memory was 75.5MB in the beginning and 130.5MB in the end (delta: -55.0MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. [2024-11-16 08:10:18,579 INFO L158 Benchmark]: TraceAbstraction took 42960.39ms. Allocated memory was 165.7MB in the beginning and 5.2GB in the end (delta: 5.0GB). Free memory was 130.5MB in the beginning and 4.7GB in the end (delta: -4.6GB). Peak memory consumption was 395.7MB. Max. memory is 16.1GB. [2024-11-16 08:10:18,580 INFO L158 Benchmark]: Witness Printer took 122.25ms. Allocated memory is still 5.2GB. Free memory was 4.7GB in the beginning and 4.7GB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 08:10:18,584 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 117.4MB. Free memory is still 78.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 405.59ms. Allocated memory is still 165.7MB. Free memory was 95.4MB in the beginning and 79.7MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.12ms. Allocated memory is still 165.7MB. Free memory was 79.7MB in the beginning and 77.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.51ms. Allocated memory is still 165.7MB. Free memory was 77.6MB in the beginning and 75.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 654.45ms. Allocated memory is still 165.7MB. Free memory was 75.5MB in the beginning and 130.5MB in the end (delta: -55.0MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. * TraceAbstraction took 42960.39ms. Allocated memory was 165.7MB in the beginning and 5.2GB in the end (delta: 5.0GB). Free memory was 130.5MB in the beginning and 4.7GB in the end (delta: -4.6GB). Peak memory consumption was 395.7MB. Max. memory is 16.1GB. * Witness Printer took 122.25ms. Allocated memory is still 5.2GB. Free memory was 4.7GB in the beginning and 4.7GB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] int m_pc = 0; [L26] int t1_pc = 0; [L27] int t2_pc = 0; [L28] int m_st ; [L29] int t1_st ; [L30] int t2_st ; [L31] int m_i ; [L32] int t1_i ; [L33] int t2_i ; [L34] int M_E = 2; [L35] int T1_E = 2; [L36] int T2_E = 2; [L37] int E_1 = 2; [L38] int E_2 = 2; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=0, m_pc=0, m_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0] [L573] int __retres1 ; [L577] CALL init_model() [L487] m_i = 1 [L488] t1_i = 1 [L489] t2_i = 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L577] RET init_model() [L578] CALL start_simulation() [L514] int kernel_st ; [L515] int tmp ; [L516] int tmp___0 ; [L520] kernel_st = 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L521] FCALL update_channels() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L522] CALL init_threads() [L221] COND TRUE m_i == 1 [L222] m_st = 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L226] COND TRUE t1_i == 1 [L227] t1_st = 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L231] COND TRUE t2_i == 1 [L232] t2_st = 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L522] RET init_threads() [L523] CALL fire_delta_events() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L334] COND FALSE !(M_E == 0) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L339] COND FALSE !(T1_E == 0) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L344] COND FALSE !(T2_E == 0) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L349] COND FALSE !(E_1 == 0) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L354] COND FALSE !(E_2 == 0) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L523] RET fire_delta_events() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L524] CALL activate_threads() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; [L403] CALL, EXPR is_master_triggered() [L153] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L156] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L166] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L168] return (__retres1); VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L403] RET, EXPR is_master_triggered() [L403] tmp = is_master_triggered() [L405] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L411] CALL, EXPR is_transmit1_triggered() [L172] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L175] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L185] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L187] return (__retres1); VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L411] RET, EXPR is_transmit1_triggered() [L411] tmp___0 = is_transmit1_triggered() [L413] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L419] CALL, EXPR is_transmit2_triggered() [L191] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L194] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L204] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L206] return (__retres1); VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L419] RET, EXPR is_transmit2_triggered() [L419] tmp___1 = is_transmit2_triggered() [L421] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L524] RET activate_threads() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L525] CALL reset_delta_events() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L367] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L372] COND FALSE !(T1_E == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L377] COND FALSE !(T2_E == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L382] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L387] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L525] RET reset_delta_events() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L528] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L531] kernel_st = 1 [L532] CALL eval() [L267] int tmp ; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L271] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L274] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L241] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L244] COND TRUE m_st == 0 [L245] __retres1 = 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, __retres1=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L262] return (__retres1); VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \result=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L274] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L274] tmp = exists_runnable_thread() [L276] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L281] COND TRUE m_st == 0 [L282] int tmp_ndt_1; [L283] tmp_ndt_1 = __VERIFIER_nondet_int() [L284] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L295] COND TRUE t1_st == 0 [L296] int tmp_ndt_2; [L297] tmp_ndt_2 = __VERIFIER_nondet_int() [L298] COND TRUE \read(tmp_ndt_2) [L300] t1_st = 1 [L301] CALL transmit1() [L88] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, t2_i=1, t2_pc=0, t2_st=0] [L99] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, t2_i=1, t2_pc=0, t2_st=0] [L101] t1_pc = 1 [L102] t1_st = 2 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0] [L301] RET transmit1() [L309] COND TRUE t2_st == 0 [L310] int tmp_ndt_3; [L311] tmp_ndt_3 = __VERIFIER_nondet_int() [L312] COND TRUE \read(tmp_ndt_3) [L314] t2_st = 1 [L315] CALL transmit2() [L123] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=1] [L134] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=1] [L136] t2_pc = 1 [L137] t2_st = 2 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L315] RET transmit2() [L271] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L274] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L241] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L244] COND TRUE m_st == 0 [L245] __retres1 = 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, __retres1=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L262] return (__retres1); VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \result=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L274] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L274] tmp = exists_runnable_thread() [L276] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L281] COND TRUE m_st == 0 [L282] int tmp_ndt_1; [L283] tmp_ndt_1 = __VERIFIER_nondet_int() [L284] COND TRUE \read(tmp_ndt_1) [L286] m_st = 1 [L287] CALL master() [L47] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L58] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L61] E_1 = 1 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L62] CALL immediate_notify() VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L435] CALL activate_threads() VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; [L403] CALL, EXPR is_master_triggered() [L153] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L156] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L166] __retres1 = 0 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L168] return (__retres1); VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L403] RET, EXPR is_master_triggered() [L403] tmp = is_master_triggered() [L405] COND FALSE !(\read(tmp)) VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L411] CALL, EXPR is_transmit1_triggered() [L172] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L175] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L176] COND TRUE E_1 == 1 [L177] __retres1 = 1 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L187] return (__retres1); VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L411] RET, EXPR is_transmit1_triggered() [L411] tmp___0 = is_transmit1_triggered() [L413] COND TRUE \read(tmp___0) [L414] t1_st = 0 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L419] CALL, EXPR is_transmit2_triggered() [L191] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L194] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L195] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L204] __retres1 = 0 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L206] return (__retres1); VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L419] RET, EXPR is_transmit2_triggered() [L419] tmp___1 = is_transmit2_triggered() [L421] COND FALSE !(\read(tmp___1)) VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L435] RET activate_threads() VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L62] RET immediate_notify() VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L63] E_1 = 2 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L66] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L68] m_pc = 1 [L69] m_st = 2 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L287] RET master() [L295] COND TRUE t1_st == 0 [L296] int tmp_ndt_2; [L297] tmp_ndt_2 = __VERIFIER_nondet_int() [L298] COND TRUE \read(tmp_ndt_2) [L300] t1_st = 1 [L301] CALL transmit1() [L88] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L91] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L107] E_2 = 1 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L108] CALL immediate_notify() VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L435] CALL activate_threads() VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; [L403] CALL, EXPR is_master_triggered() [L153] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L156] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L157] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L166] __retres1 = 0 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L168] return (__retres1); VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L403] RET, EXPR is_master_triggered() [L403] tmp = is_master_triggered() [L405] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L411] CALL, EXPR is_transmit1_triggered() [L172] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L175] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L176] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L185] __retres1 = 0 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L187] return (__retres1); VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L411] RET, EXPR is_transmit1_triggered() [L411] tmp___0 = is_transmit1_triggered() [L413] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L419] CALL, EXPR is_transmit2_triggered() [L191] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L194] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L195] COND TRUE E_2 == 1 [L196] __retres1 = 1 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L206] return (__retres1); VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L419] RET, EXPR is_transmit2_triggered() [L419] tmp___1 = is_transmit2_triggered() [L421] COND TRUE \read(tmp___1) [L422] t2_st = 0 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0] [L435] RET activate_threads() VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0] [L108] RET immediate_notify() VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0] [L109] E_2 = 2 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0] [L99] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0] [L101] t1_pc = 1 [L102] t1_st = 2 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=0] [L301] RET transmit1() [L309] COND TRUE t2_st == 0 [L310] int tmp_ndt_3; [L311] tmp_ndt_3 = __VERIFIER_nondet_int() [L312] COND TRUE \read(tmp_ndt_3) [L314] t2_st = 1 [L315] CALL transmit2() [L123] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1] [L126] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1] [L142] CALL error() [L21] reach_error() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 153 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 42.8s, OverallIterations: 26, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 23.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9069 SdHoareTripleChecker+Valid, 8.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8866 mSDsluCounter, 14066 SdHoareTripleChecker+Invalid, 7.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9374 mSDsCounter, 1093 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10014 IncrementalHoareTripleChecker+Invalid, 11107 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1093 mSolverCounterUnsat, 4692 mSDtfsCounter, 10014 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1539 GetRequests, 1299 SyntacticMatches, 0 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18288occurred in iteration=21, InterpolantAutomatonStates: 222, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 12.6s AutomataMinimizationTime, 25 MinimizatonAttempts, 8957 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 3765 NumberOfCodeBlocks, 3765 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 3554 ConstructedInterpolants, 0 QuantifiedInterpolants, 6912 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2434 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 31 InterpolantComputations, 25 PerfectInterpolantSequences, 905/1009 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-16 08:10:18,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE