/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 18:50:40,383 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 18:50:40,384 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 18:50:40,422 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 18:50:40,423 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 18:50:40,428 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 18:50:40,428 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 18:50:40,429 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 18:50:40,430 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 18:50:40,431 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 18:50:40,431 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 18:50:40,432 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 18:50:40,432 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 18:50:40,433 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 18:50:40,433 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 18:50:40,434 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 18:50:40,434 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 18:50:40,435 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 18:50:40,436 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 18:50:40,437 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 18:50:40,438 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 18:50:40,438 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 18:50:40,439 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 18:50:40,439 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 18:50:40,441 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 18:50:40,441 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 18:50:40,441 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 18:50:40,442 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 18:50:40,442 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 18:50:40,442 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 18:50:40,443 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 18:50:40,443 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 18:50:40,444 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 18:50:40,444 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 18:50:40,445 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 18:50:40,445 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 18:50:40,445 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 18:50:40,445 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 18:50:40,445 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 18:50:40,446 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 18:50:40,446 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 18:50:40,447 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 18:50:40,460 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 18:50:40,460 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 18:50:40,460 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 18:50:40,461 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 18:50:40,461 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 18:50:40,461 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 18:50:40,461 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 18:50:40,461 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 18:50:40,461 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 18:50:40,462 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 18:50:40,462 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 18:50:40,462 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 18:50:40,462 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 18:50:40,462 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 18:50:40,462 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 18:50:40,462 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 18:50:40,462 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 18:50:40,462 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 18:50:40,463 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 18:50:40,463 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 18:50:40,463 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 18:50:40,463 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 18:50:40,463 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 18:50:40,463 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 18:50:40,463 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 18:50:40,463 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 18:50:40,464 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 18:50:40,464 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 18:50:40,464 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 18:50:40,464 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 18:50:40,464 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 18:50:40,464 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 18:50:40,464 INFO L138 SettingsManager]: * Interpolant automaton=MCR 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 [2022-03-15 18:50:40,626 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 18:50:40,639 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 18:50:40,640 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 18:50:40,641 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 18:50:40,643 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 18:50:40,644 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c [2022-03-15 18:50:40,692 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c60ed600a/35b38c1c26ef4867840fa4cdf38faf89/FLAG9b99ef85f [2022-03-15 18:50:41,073 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 18:50:41,073 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c [2022-03-15 18:50:41,083 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c60ed600a/35b38c1c26ef4867840fa4cdf38faf89/FLAG9b99ef85f [2022-03-15 18:50:41,095 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c60ed600a/35b38c1c26ef4867840fa4cdf38faf89 [2022-03-15 18:50:41,097 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 18:50:41,099 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 18:50:41,101 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 18:50:41,101 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 18:50:41,103 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 18:50:41,104 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 06:50:41" (1/1) ... [2022-03-15 18:50:41,105 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c6963f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:50:41, skipping insertion in model container [2022-03-15 18:50:41,106 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 06:50:41" (1/1) ... [2022-03-15 18:50:41,110 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 18:50:41,136 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 18:50:41,326 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c[5426,5439] [2022-03-15 18:50:41,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 18:50:41,332 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 18:50:41,356 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c[5426,5439] [2022-03-15 18:50:41,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 18:50:41,370 INFO L208 MainTranslator]: Completed translation [2022-03-15 18:50:41,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:50:41 WrapperNode [2022-03-15 18:50:41,370 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 18:50:41,371 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 18:50:41,371 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 18:50:41,371 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 18:50:41,376 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:50:41" (1/1) ... [2022-03-15 18:50:41,381 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:50:41" (1/1) ... [2022-03-15 18:50:41,399 INFO L137 Inliner]: procedures = 22, calls = 110, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 279 [2022-03-15 18:50:41,399 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 18:50:41,399 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 18:50:41,399 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 18:50:41,400 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 18:50:41,405 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:50:41" (1/1) ... [2022-03-15 18:50:41,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:50:41" (1/1) ... [2022-03-15 18:50:41,407 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:50:41" (1/1) ... [2022-03-15 18:50:41,408 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:50:41" (1/1) ... [2022-03-15 18:50:41,412 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:50:41" (1/1) ... [2022-03-15 18:50:41,413 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:50:41" (1/1) ... [2022-03-15 18:50:41,414 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:50:41" (1/1) ... [2022-03-15 18:50:41,416 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 18:50:41,417 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 18:50:41,417 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 18:50:41,417 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 18:50:41,418 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:50:41" (1/1) ... [2022-03-15 18:50:41,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 18:50:41,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:50:41,442 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-15 18:50:41,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-15 18:50:41,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 18:50:41,467 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 18:50:41,467 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 18:50:41,467 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 18:50:41,467 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 18:50:41,468 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 18:50:41,468 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 18:50:41,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 18:50:41,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 18:50:41,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 18:50:41,468 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-15 18:50:41,468 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-15 18:50:41,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 18:50:41,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 18:50:41,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 18:50:41,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 18:50:41,469 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 18:50:41,524 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 18:50:41,525 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 18:50:41,765 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 18:50:41,869 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 18:50:41,869 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 18:50:41,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 06:50:41 BoogieIcfgContainer [2022-03-15 18:50:41,871 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 18:50:41,873 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 18:50:41,873 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 18:50:41,875 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 18:50:41,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 06:50:41" (1/3) ... [2022-03-15 18:50:41,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7abd9ebb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 06:50:41, skipping insertion in model container [2022-03-15 18:50:41,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:50:41" (2/3) ... [2022-03-15 18:50:41,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7abd9ebb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 06:50:41, skipping insertion in model container [2022-03-15 18:50:41,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 06:50:41" (3/3) ... [2022-03-15 18:50:41,877 INFO L111 eAbstractionObserver]: Analyzing ICFG parallel-bakery-3.wvr.c [2022-03-15 18:50:41,881 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 18:50:41,881 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 18:50:41,881 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 18:50:41,881 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 18:50:41,922 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,923 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,923 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,923 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,923 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,924 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,924 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,924 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,924 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,926 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,926 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,927 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,927 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,927 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,928 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,928 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,928 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,928 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,930 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,930 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,930 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,930 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,931 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,931 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,931 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,931 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,932 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,933 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,933 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,933 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,933 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,933 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,934 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,934 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,935 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,935 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,935 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,936 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,936 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,937 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,937 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,937 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,937 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,937 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,938 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,938 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,938 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,938 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,938 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,939 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,939 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,939 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,939 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,940 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,940 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,940 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,941 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,943 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,943 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,943 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,944 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,944 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,944 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,944 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,944 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,945 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,945 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,945 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,945 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,945 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,946 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,946 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,946 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,947 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,947 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,947 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,947 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,948 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,951 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,951 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,951 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,952 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,952 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,953 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,953 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,954 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,955 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,955 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,956 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,958 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,962 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,962 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,962 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,963 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,963 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,963 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,963 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,963 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,963 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:50:41,966 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-15 18:50:41,994 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 18:50:41,998 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 18:50:41,999 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-15 18:50:42,010 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 18:50:42,017 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 152 transitions, 328 flow [2022-03-15 18:50:42,019 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 160 places, 152 transitions, 328 flow [2022-03-15 18:50:42,020 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 160 places, 152 transitions, 328 flow [2022-03-15 18:50:42,083 INFO L129 PetriNetUnfolder]: 2/149 cut-off events. [2022-03-15 18:50:42,084 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-03-15 18:50:42,086 INFO L84 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 149 events. 2/149 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 105 event pairs, 0 based on Foata normal form. 0/146 useless extension candidates. Maximal degree in co-relation 107. Up to 2 conditions per place. [2022-03-15 18:50:42,088 INFO L116 LiptonReduction]: Number of co-enabled transitions 2184 [2022-03-15 18:50:45,471 INFO L131 LiptonReduction]: Checked pairs total: 18996 [2022-03-15 18:50:45,471 INFO L133 LiptonReduction]: Total number of compositions: 104 [2022-03-15 18:50:45,476 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 63 places, 53 transitions, 130 flow [2022-03-15 18:50:45,615 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 5126 states, 5125 states have (on average 3.1986341463414636) internal successors, (16393), 5125 states have internal predecessors, (16393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:50:45,628 INFO L276 IsEmpty]: Start isEmpty. Operand has 5126 states, 5125 states have (on average 3.1986341463414636) internal successors, (16393), 5125 states have internal predecessors, (16393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:50:45,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-15 18:50:45,653 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:50:45,653 INFO L514 BasicCegarLoop]: 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] [2022-03-15 18:50:45,654 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:50:45,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:50:45,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1788822741, now seen corresponding path program 1 times [2022-03-15 18:50:45,669 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:50:45,669 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538642227] [2022-03-15 18:50:45,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:50:45,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:50:45,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:50:45,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:50:45,927 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:50:45,927 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538642227] [2022-03-15 18:50:45,927 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538642227] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:50:45,927 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:50:45,927 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 18:50:45,928 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [922045133] [2022-03-15 18:50:45,929 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:50:45,937 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:50:46,076 INFO L252 McrAutomatonBuilder]: Finished intersection with 354 states and 855 transitions. [2022-03-15 18:50:46,076 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:50:47,704 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [10418#(not (= (mod ~e1~0 256) 0))] [2022-03-15 18:50:47,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 18:50:47,705 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:50:47,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 18:50:47,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 18:50:47,729 INFO L87 Difference]: Start difference. First operand has 5126 states, 5125 states have (on average 3.1986341463414636) internal successors, (16393), 5125 states have internal predecessors, (16393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:50:47,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:50:47,849 INFO L93 Difference]: Finished difference Result 5126 states and 16177 transitions. [2022-03-15 18:50:47,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 18:50:47,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-03-15 18:50:47,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:50:47,881 INFO L225 Difference]: With dead ends: 5126 [2022-03-15 18:50:47,881 INFO L226 Difference]: Without dead ends: 5126 [2022-03-15 18:50:47,882 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 269 SyntacticMatches, 37 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 18:50:47,884 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 35 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 18:50:47,884 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 30 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 18:50:47,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5126 states. [2022-03-15 18:50:48,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5126 to 5126. [2022-03-15 18:50:48,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5126 states, 5125 states have (on average 3.156487804878049) internal successors, (16177), 5125 states have internal predecessors, (16177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:50:48,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5126 states to 5126 states and 16177 transitions. [2022-03-15 18:50:48,070 INFO L78 Accepts]: Start accepts. Automaton has 5126 states and 16177 transitions. Word has length 49 [2022-03-15 18:50:48,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:50:48,071 INFO L470 AbstractCegarLoop]: Abstraction has 5126 states and 16177 transitions. [2022-03-15 18:50:48,071 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:50:48,071 INFO L276 IsEmpty]: Start isEmpty. Operand 5126 states and 16177 transitions. [2022-03-15 18:50:48,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-15 18:50:48,084 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:50:48,084 INFO L514 BasicCegarLoop]: 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] [2022-03-15 18:50:48,084 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 18:50:48,085 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:50:48,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:50:48,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1212291385, now seen corresponding path program 2 times [2022-03-15 18:50:48,088 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:50:48,090 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631552144] [2022-03-15 18:50:48,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:50:48,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:50:48,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:50:48,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:50:48,309 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:50:48,309 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631552144] [2022-03-15 18:50:48,309 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631552144] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:50:48,309 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:50:48,309 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-15 18:50:48,309 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [4445080] [2022-03-15 18:50:48,309 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:50:48,315 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:50:48,382 INFO L252 McrAutomatonBuilder]: Finished intersection with 358 states and 845 transitions. [2022-03-15 18:50:48,382 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:50:52,453 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [25809#(and (or (< ~n3~0 ~n1~0) (< ~n2~0 ~n1~0)) (or (not (= ~n3~0 0)) (not (= ~n2~0 0))) (or (not (= ~n2~0 0)) (< ~n3~0 ~n1~0)) (or (not (= ~n3~0 0)) (< ~n2~0 ~n1~0))), 25808#(and (not (= ~n3~0 0)) (< ~n3~0 ~n1~0)), 25806#(and (not (= ~n3~0 0)) (< ~n3~0 ~n2~0)), 25807#(and (or (not (= ~n3~0 0)) (not (= ~n1~0 0))) (or (= ~n2~0 ~n1~0) (< ~n3~0 ~n2~0) (< ~n1~0 ~n2~0)) (or (= ~n2~0 ~n1~0) (not (= ~n3~0 0)) (< ~n1~0 ~n2~0)) (or (not (= ~n1~0 0)) (< ~n3~0 ~n2~0))), 25805#(and (or (< ~n1~0 ~n3~0) (= ~n1~0 ~n3~0)) (not (= ~n1~0 0))), 25812#(= ~n1~0 0), 25811#(and (or (not (< ~n3~0 ~n2~0)) (<= ~n1~0 ~n2~0)) (or (<= ~n1~0 ~n3~0) (< ~n3~0 ~n2~0)) (= ~n1~0 0)), 25813#(and (= ~n2~0 0) (= ~n1~0 0) (or (= ~n1~0 ~n3~0) (< ~n3~0 ~n1~0))), 25810#(and (<= ~n1~0 ~n3~0) (= ~n1~0 0))] [2022-03-15 18:50:52,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 18:50:52,454 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:50:52,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 18:50:52,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2022-03-15 18:50:52,455 INFO L87 Difference]: Start difference. First operand 5126 states and 16177 transitions. Second operand has 17 states, 17 states have (on average 7.9411764705882355) internal successors, (135), 16 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:50:53,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:50:53,228 INFO L93 Difference]: Finished difference Result 9124 states and 27738 transitions. [2022-03-15 18:50:53,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 18:50:53,229 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 7.9411764705882355) internal successors, (135), 16 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-03-15 18:50:53,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:50:53,268 INFO L225 Difference]: With dead ends: 9124 [2022-03-15 18:50:53,269 INFO L226 Difference]: Without dead ends: 9124 [2022-03-15 18:50:53,269 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 300 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2022-03-15 18:50:53,270 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 333 mSDsluCounter, 914 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 18:50:53,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [333 Valid, 402 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1177 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 18:50:53,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9124 states. [2022-03-15 18:50:53,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9124 to 7588. [2022-03-15 18:50:53,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7588 states, 7587 states have (on average 3.1340450771055752) internal successors, (23778), 7587 states have internal predecessors, (23778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:50:53,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7588 states to 7588 states and 23778 transitions. [2022-03-15 18:50:53,515 INFO L78 Accepts]: Start accepts. Automaton has 7588 states and 23778 transitions. Word has length 49 [2022-03-15 18:50:53,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:50:53,515 INFO L470 AbstractCegarLoop]: Abstraction has 7588 states and 23778 transitions. [2022-03-15 18:50:53,515 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.9411764705882355) internal successors, (135), 16 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:50:53,516 INFO L276 IsEmpty]: Start isEmpty. Operand 7588 states and 23778 transitions. [2022-03-15 18:50:53,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-15 18:50:53,533 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:50:53,533 INFO L514 BasicCegarLoop]: 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] [2022-03-15 18:50:53,533 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 18:50:53,534 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:50:53,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:50:53,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1198692761, now seen corresponding path program 3 times [2022-03-15 18:50:53,537 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:50:53,538 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870350785] [2022-03-15 18:50:53,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:50:53,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:50:53,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:50:53,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:50:53,674 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:50:53,674 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870350785] [2022-03-15 18:50:53,674 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870350785] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:50:53,674 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:50:53,674 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-15 18:50:53,674 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [982314297] [2022-03-15 18:50:53,674 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:50:53,680 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:50:53,756 INFO L252 McrAutomatonBuilder]: Finished intersection with 418 states and 1099 transitions. [2022-03-15 18:50:53,757 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:50:56,482 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 18:50:56,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 18:50:56,482 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:50:56,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 18:50:56,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-03-15 18:50:56,483 INFO L87 Difference]: Start difference. First operand 7588 states and 23778 transitions. Second operand has 9 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:50:56,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:50:56,934 INFO L93 Difference]: Finished difference Result 8633 states and 26372 transitions. [2022-03-15 18:50:56,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 18:50:56,935 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-03-15 18:50:56,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:50:56,965 INFO L225 Difference]: With dead ends: 8633 [2022-03-15 18:50:56,966 INFO L226 Difference]: Without dead ends: 8248 [2022-03-15 18:50:56,966 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 353 SyntacticMatches, 15 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-03-15 18:50:56,967 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 156 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:50:56,967 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 126 Invalid, 923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:50:56,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8248 states. [2022-03-15 18:50:57,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8248 to 7392. [2022-03-15 18:50:57,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7392 states, 7391 states have (on average 3.123258016506562) internal successors, (23084), 7391 states have internal predecessors, (23084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:50:57,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7392 states to 7392 states and 23084 transitions. [2022-03-15 18:50:57,134 INFO L78 Accepts]: Start accepts. Automaton has 7392 states and 23084 transitions. Word has length 49 [2022-03-15 18:50:57,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:50:57,134 INFO L470 AbstractCegarLoop]: Abstraction has 7392 states and 23084 transitions. [2022-03-15 18:50:57,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:50:57,135 INFO L276 IsEmpty]: Start isEmpty. Operand 7392 states and 23084 transitions. [2022-03-15 18:50:57,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-15 18:50:57,150 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:50:57,150 INFO L514 BasicCegarLoop]: 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] [2022-03-15 18:50:57,150 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 18:50:57,150 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:50:57,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:50:57,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1079300889, now seen corresponding path program 4 times [2022-03-15 18:50:57,151 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:50:57,151 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54196237] [2022-03-15 18:50:57,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:50:57,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:50:57,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:50:57,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:50:57,235 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:50:57,235 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54196237] [2022-03-15 18:50:57,236 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54196237] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:50:57,236 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:50:57,236 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-15 18:50:57,236 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1150530822] [2022-03-15 18:50:57,236 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:50:57,241 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:50:57,398 INFO L252 McrAutomatonBuilder]: Finished intersection with 514 states and 1378 transitions. [2022-03-15 18:50:57,399 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:51:09,265 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [73586#(and (or (<= (+ ~n3~0 1) ~n2~0) (not (= ~n1~0 0)) (< ~n2~0 ~n1~0)) (or (< ~n1~0 ~n3~0) (<= 1 ~n3~0) (= ~n1~0 ~n3~0) (< ~n2~0 ~n1~0)) (or (<= 1 ~n3~0) (not (= ~n1~0 0)) (< ~n2~0 ~n1~0)) (or (< ~n1~0 ~n3~0) (= ~n1~0 ~n3~0) (not (= ~n2~0 0)))), 73587#(and (or (= ~n2~0 0) (< ~n2~0 ~n1~0)) (<= 1 ~n3~0) (= ~n1~0 0)), 73588#(and (= ~n2~0 0) (<= 0 ~n3~0) (= ~n1~0 0)), 73584#(and (or (not (= ~n3~0 0)) (not (= ~n1~0 0))) (or (< ~n1~0 ~n3~0) (<= 1 ~n3~0) (= ~n1~0 ~n3~0)) (or (< ~n1~0 ~n3~0) (= ~n1~0 ~n3~0) (< ~n3~0 ~n2~0)) (or (not (= ~n1~0 0)) (< ~n3~0 ~n2~0))), 73585#(and (or (not (= ~n1~0 0)) (< ~n2~0 ~n1~0)) (or (< ~n1~0 ~n3~0) (= ~n1~0 ~n3~0) (< ~n2~0 ~n1~0)) (or (< ~n1~0 ~n3~0) (= ~n1~0 ~n3~0) (not (= ~n2~0 0)))), 73590#(and (or (= ~n2~0 0) (< ~n2~0 ~n1~0)) (= ~n1~0 0) (or (<= 0 ~n3~0) (< ~n3~0 ~n2~0)) (or (= ~n2~0 0) (not (< ~n3~0 ~n2~0)))), 73591#(and (= ~n1~0 0) (<= ~n2~0 ~n1~0)), 73579#(and (or (not (= ~n2~0 0)) (< ~n3~0 ~n2~0)) (or (< ~n3~0 ~n2~0) (< ~n2~0 ~n1~0)) (or (not (= ~n3~0 0)) (< ~n2~0 ~n1~0))), 73582#(and (or (<= (+ ~n3~0 1) ~n2~0) (< ~n2~0 ~n1~0)) (or (<= 1 ~n3~0) (< ~n2~0 ~n1~0)) (not (= ~n2~0 0))), 73578#(and (not (= ~n2~0 0)) (< ~n2~0 ~n1~0)), 73581#(and (or (not (= ~n3~0 0)) (not (= ~n1~0 0)) (< ~n2~0 ~n1~0)) (or (not (= ~n2~0 0)) (< ~n3~0 ~n2~0) (< ~n1~0 ~n2~0)) (or (not (= ~n1~0 0)) (< ~n3~0 ~n2~0) (< ~n2~0 ~n1~0))), 73580#(and (or (not (= ~n3~0 0)) (not (= ~n1~0 0))) (or (= ~n2~0 ~n1~0) (< ~n3~0 ~n2~0) (< ~n1~0 ~n2~0)) (or (= ~n2~0 ~n1~0) (not (= ~n3~0 0)) (< ~n1~0 ~n2~0)) (or (not (= ~n1~0 0)) (< ~n3~0 ~n2~0))), 73592#(and (= ~n2~0 0) (or (= ~n3~0 0) (< ~n3~0 ~n1~0)) (= ~n1~0 0)), 73583#(and (or (< ~n1~0 ~n3~0) (= ~n1~0 ~n3~0)) (not (= ~n1~0 0))), 73589#(and (or (= ~n2~0 0) (< ~n2~0 ~n1~0)) (<= 0 ~n3~0) (= ~n1~0 0)), 73577#(and (not (= ~n3~0 0)) (< ~n3~0 ~n2~0))] [2022-03-15 18:51:09,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 18:51:09,266 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:51:09,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 18:51:09,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2022-03-15 18:51:09,267 INFO L87 Difference]: Start difference. First operand 7392 states and 23084 transitions. Second operand has 23 states, 23 states have (on average 7.739130434782608) internal successors, (178), 22 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:51:09,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:51:09,779 INFO L93 Difference]: Finished difference Result 9290 states and 28659 transitions. [2022-03-15 18:51:09,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 18:51:09,780 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 7.739130434782608) internal successors, (178), 22 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-03-15 18:51:09,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:51:09,804 INFO L225 Difference]: With dead ends: 9290 [2022-03-15 18:51:09,805 INFO L226 Difference]: Without dead ends: 9290 [2022-03-15 18:51:09,805 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 405 SyntacticMatches, 35 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2022-03-15 18:51:09,806 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 250 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 18:51:09,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [250 Valid, 385 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 18:51:09,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9290 states. [2022-03-15 18:51:09,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9290 to 8074. [2022-03-15 18:51:09,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8074 states, 8073 states have (on average 3.100334448160535) internal successors, (25029), 8073 states have internal predecessors, (25029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:51:09,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8074 states to 8074 states and 25029 transitions. [2022-03-15 18:51:09,981 INFO L78 Accepts]: Start accepts. Automaton has 8074 states and 25029 transitions. Word has length 49 [2022-03-15 18:51:09,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:51:09,981 INFO L470 AbstractCegarLoop]: Abstraction has 8074 states and 25029 transitions. [2022-03-15 18:51:09,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.739130434782608) internal successors, (178), 22 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:51:09,981 INFO L276 IsEmpty]: Start isEmpty. Operand 8074 states and 25029 transitions. [2022-03-15 18:51:09,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-15 18:51:09,997 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:51:09,997 INFO L514 BasicCegarLoop]: 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] [2022-03-15 18:51:09,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 18:51:09,997 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:51:09,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:51:09,997 INFO L85 PathProgramCache]: Analyzing trace with hash -91307397, now seen corresponding path program 5 times [2022-03-15 18:51:09,998 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:51:09,998 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898092412] [2022-03-15 18:51:09,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:51:09,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:51:10,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:51:10,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:51:10,194 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:51:10,194 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898092412] [2022-03-15 18:51:10,194 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898092412] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:51:10,194 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:51:10,194 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 18:51:10,194 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [842328086] [2022-03-15 18:51:10,194 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:51:10,199 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:51:10,293 INFO L252 McrAutomatonBuilder]: Finished intersection with 468 states and 1235 transitions. [2022-03-15 18:51:10,293 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:51:16,589 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [99054#(and (or (not (= ~n1~0 0)) (< ~n2~0 ~n1~0)) (or (< ~n1~0 ~n3~0) (= ~n1~0 ~n3~0) (< ~n2~0 ~n1~0)) (or (< ~n1~0 ~n3~0) (= ~n1~0 ~n3~0) (not (= ~n2~0 0)))), 99046#(and (not (= ~n3~0 0)) (< ~n3~0 ~n1~0)), 99056#(<= 2 ~n2~0), 99052#(and (or (not (= ~n2~0 0)) (< ~n1~0 ~n2~0)) (or (not (= ~n1~0 0)) (< ~n2~0 ~n1~0))), 99059#(and (= ~n2~0 0) (= ~n1~0 0)), 99053#(and (or (< ~n1~0 ~n3~0) (= ~n1~0 ~n3~0)) (not (= ~n1~0 0))), 99047#(and (or (< ~n3~0 ~n1~0) (< ~n2~0 ~n1~0)) (or (not (= ~n3~0 0)) (not (= ~n2~0 0))) (or (not (= ~n2~0 0)) (< ~n3~0 ~n1~0)) (or (not (= ~n3~0 0)) (< ~n2~0 ~n1~0))), 99050#(and (or (not (= ~n3~0 0)) (not (= ~n1~0 0))) (or (= ~n2~0 ~n1~0) (< ~n3~0 ~n2~0) (< ~n1~0 ~n2~0)) (or (= ~n2~0 ~n1~0) (not (= ~n3~0 0)) (< ~n1~0 ~n2~0)) (or (not (= ~n1~0 0)) (< ~n3~0 ~n2~0))), 99058#(= ~n1~0 0), 99051#(and (not (= ~n1~0 0)) (or (= ~n2~0 ~n1~0) (< ~n1~0 ~n2~0))), 99055#(and (or (<= ~n2~0 ~n3~0) (not (< ~n1~0 ~n3~0))) (<= 2 ~n2~0) (or (< ~n1~0 ~n3~0) (<= ~n2~0 ~n1~0))), 99048#(and (not (= ~n2~0 0)) (< ~n2~0 ~n1~0)), 99057#(and (or (not (< ~n3~0 ~n2~0)) (<= ~n1~0 ~n2~0)) (or (<= ~n1~0 ~n3~0) (< ~n3~0 ~n2~0)) (= ~n1~0 0)), 99049#(and (not (= ~n3~0 0)) (< ~n3~0 ~n2~0))] [2022-03-15 18:51:16,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 18:51:16,590 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:51:16,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 18:51:16,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2022-03-15 18:51:16,590 INFO L87 Difference]: Start difference. First operand 8074 states and 25029 transitions. Second operand has 25 states, 25 states have (on average 6.8) internal successors, (170), 24 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:51:17,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:51:17,735 INFO L93 Difference]: Finished difference Result 12350 states and 36781 transitions. [2022-03-15 18:51:17,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 18:51:17,736 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 6.8) internal successors, (170), 24 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-03-15 18:51:17,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:51:17,770 INFO L225 Difference]: With dead ends: 12350 [2022-03-15 18:51:17,770 INFO L226 Difference]: Without dead ends: 12350 [2022-03-15 18:51:17,771 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 379 SyntacticMatches, 27 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=200, Invalid=1060, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 18:51:17,771 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 541 mSDsluCounter, 1931 mSDsCounter, 0 mSdLazyCounter, 2287 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 2430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 2287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 18:51:17,771 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [541 Valid, 879 Invalid, 2430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 2287 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 18:51:17,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12350 states. [2022-03-15 18:51:17,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12350 to 8586. [2022-03-15 18:51:17,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8586 states, 8585 states have (on average 3.0708211997670354) internal successors, (26363), 8585 states have internal predecessors, (26363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:51:18,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8586 states to 8586 states and 26363 transitions. [2022-03-15 18:51:18,002 INFO L78 Accepts]: Start accepts. Automaton has 8586 states and 26363 transitions. Word has length 49 [2022-03-15 18:51:18,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:51:18,002 INFO L470 AbstractCegarLoop]: Abstraction has 8586 states and 26363 transitions. [2022-03-15 18:51:18,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 6.8) internal successors, (170), 24 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:51:18,002 INFO L276 IsEmpty]: Start isEmpty. Operand 8586 states and 26363 transitions. [2022-03-15 18:51:18,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-15 18:51:18,019 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:51:18,019 INFO L514 BasicCegarLoop]: 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] [2022-03-15 18:51:18,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 18:51:18,020 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:51:18,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:51:18,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1655991177, now seen corresponding path program 6 times [2022-03-15 18:51:18,022 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:51:18,022 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876650344] [2022-03-15 18:51:18,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:51:18,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:51:18,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:51:18,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:51:18,125 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:51:18,125 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876650344] [2022-03-15 18:51:18,125 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876650344] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:51:18,125 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:51:18,125 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-15 18:51:18,125 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1498594099] [2022-03-15 18:51:18,125 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:51:18,130 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:51:18,180 INFO L252 McrAutomatonBuilder]: Finished intersection with 304 states and 738 transitions. [2022-03-15 18:51:18,180 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:51:19,765 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 18:51:19,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 18:51:19,766 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:51:19,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 18:51:19,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-03-15 18:51:19,766 INFO L87 Difference]: Start difference. First operand 8586 states and 26363 transitions. Second operand has 9 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:51:20,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:51:20,136 INFO L93 Difference]: Finished difference Result 9383 states and 28332 transitions. [2022-03-15 18:51:20,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 18:51:20,136 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-03-15 18:51:20,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:51:20,157 INFO L225 Difference]: With dead ends: 9383 [2022-03-15 18:51:20,157 INFO L226 Difference]: Without dead ends: 8578 [2022-03-15 18:51:20,157 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 247 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-03-15 18:51:20,158 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 156 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:51:20,158 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 132 Invalid, 907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:51:20,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8578 states. [2022-03-15 18:51:20,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8578 to 7962. [2022-03-15 18:51:20,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7962 states, 7961 states have (on average 3.083155382489637) internal successors, (24545), 7961 states have internal predecessors, (24545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:51:20,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7962 states to 7962 states and 24545 transitions. [2022-03-15 18:51:20,308 INFO L78 Accepts]: Start accepts. Automaton has 7962 states and 24545 transitions. Word has length 49 [2022-03-15 18:51:20,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:51:20,308 INFO L470 AbstractCegarLoop]: Abstraction has 7962 states and 24545 transitions. [2022-03-15 18:51:20,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:51:20,308 INFO L276 IsEmpty]: Start isEmpty. Operand 7962 states and 24545 transitions. [2022-03-15 18:51:20,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-15 18:51:20,323 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:51:20,323 INFO L514 BasicCegarLoop]: 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] [2022-03-15 18:51:20,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-15 18:51:20,323 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:51:20,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:51:20,323 INFO L85 PathProgramCache]: Analyzing trace with hash -438497031, now seen corresponding path program 7 times [2022-03-15 18:51:20,324 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:51:20,324 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932484791] [2022-03-15 18:51:20,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:51:20,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:51:20,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:51:20,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:51:20,450 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:51:20,450 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932484791] [2022-03-15 18:51:20,450 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932484791] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:51:20,450 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:51:20,450 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-15 18:51:20,450 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1475975564] [2022-03-15 18:51:20,450 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:51:20,455 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:51:20,576 INFO L252 McrAutomatonBuilder]: Finished intersection with 518 states and 1388 transitions. [2022-03-15 18:51:20,577 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:51:31,969 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [153943#(and (or (< ~n1~0 ~n3~0) (= ~n1~0 ~n3~0)) (not (= ~n1~0 0))), 153958#(and (= ~n2~0 ~n1~0) (or (= ~n2~0 ~n3~0) (< ~n3~0 ~n1~0)) (= ~n1~0 0)), 153953#(and (or (= ~n2~0 0) (< ~n2~0 ~n1~0)) (<= 1 ~n3~0) (= ~n1~0 0)), 153944#(and (or (not (= ~n3~0 0)) (not (= ~n1~0 0))) (or (< ~n1~0 ~n3~0) (<= 1 ~n3~0) (= ~n1~0 ~n3~0)) (or (< ~n1~0 ~n3~0) (= ~n1~0 ~n3~0) (< ~n3~0 ~n2~0)) (or (not (= ~n1~0 0)) (< ~n3~0 ~n2~0))), 153951#(and (or (not (= ~n3~0 0)) (not (= ~n1~0 0)) (< ~n2~0 ~n1~0)) (or (not (= ~n2~0 0)) (< ~n3~0 ~n2~0) (< ~n1~0 ~n2~0)) (or (not (= ~n1~0 0)) (< ~n3~0 ~n2~0) (< ~n2~0 ~n1~0))), 153956#(and (or (= ~n2~0 0) (< ~n2~0 ~n1~0)) (= ~n1~0 0)), 153946#(and (or (not (= ~n1~0 0)) (< ~n2~0 ~n1~0)) (or (< ~n1~0 ~n3~0) (= ~n1~0 ~n3~0) (< ~n2~0 ~n1~0)) (or (< ~n1~0 ~n3~0) (= ~n1~0 ~n3~0) (not (= ~n2~0 0)))), 153945#(and (not (= ~n2~0 0)) (< ~n2~0 ~n1~0)), 153950#(and (or (not (= ~n3~0 0)) (not (= ~n1~0 0))) (or (= ~n2~0 ~n1~0) (< ~n3~0 ~n2~0) (< ~n1~0 ~n2~0)) (or (= ~n2~0 ~n1~0) (not (= ~n3~0 0)) (< ~n1~0 ~n2~0)) (or (not (= ~n1~0 0)) (< ~n3~0 ~n2~0))), 153949#(and (or (<= (+ ~n3~0 1) ~n2~0) (not (= ~n1~0 0)) (< ~n2~0 ~n1~0)) (or (< ~n1~0 ~n3~0) (<= 1 ~n3~0) (= ~n1~0 ~n3~0) (< ~n2~0 ~n1~0)) (or (<= 1 ~n3~0) (not (= ~n1~0 0)) (< ~n2~0 ~n1~0)) (or (< ~n1~0 ~n3~0) (= ~n1~0 ~n3~0) (not (= ~n2~0 0)))), 153942#(and (not (= ~n3~0 0)) (< ~n3~0 ~n2~0)), 153954#(and (or (= ~n2~0 0) (< ~n2~0 ~n1~0)) (<= 0 ~n3~0) (= ~n1~0 0)), 153947#(and (or (not (= ~n2~0 0)) (< ~n3~0 ~n2~0)) (or (< ~n3~0 ~n2~0) (< ~n2~0 ~n1~0)) (or (not (= ~n3~0 0)) (< ~n2~0 ~n1~0))), 153957#(and (<= ~n3~0 ~n2~0) (<= 1 ~n3~0)), 153952#(and (not (= (+ ~n2~0 1) 0)) (or (<= ~n3~0 ~n2~0) (< (+ ~n2~0 1) ~n1~0)) (or (<= 1 ~n3~0) (< (+ ~n2~0 1) ~n1~0))), 153955#(and (or (= ~n2~0 0) (< ~n2~0 ~n1~0)) (= ~n1~0 0) (or (<= 0 ~n3~0) (< ~n3~0 ~n2~0)) (or (= ~n2~0 0) (not (< ~n3~0 ~n2~0)))), 153948#(and (or (<= (+ ~n3~0 1) ~n2~0) (< ~n2~0 ~n1~0)) (or (<= 1 ~n3~0) (< ~n2~0 ~n1~0)) (not (= ~n2~0 0)))] [2022-03-15 18:51:31,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 18:51:31,969 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:51:31,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 18:51:31,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2022-03-15 18:51:31,970 INFO L87 Difference]: Start difference. First operand 7962 states and 24545 transitions. Second operand has 25 states, 25 states have (on average 7.32) internal successors, (183), 24 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:51:32,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:51:32,630 INFO L93 Difference]: Finished difference Result 9932 states and 30297 transitions. [2022-03-15 18:51:32,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 18:51:32,630 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 7.32) internal successors, (183), 24 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-03-15 18:51:32,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:51:32,653 INFO L225 Difference]: With dead ends: 9932 [2022-03-15 18:51:32,653 INFO L226 Difference]: Without dead ends: 9932 [2022-03-15 18:51:32,654 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 402 SyntacticMatches, 40 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=136, Invalid=620, Unknown=0, NotChecked=0, Total=756 [2022-03-15 18:51:32,654 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 207 mSDsluCounter, 1051 mSDsCounter, 0 mSdLazyCounter, 1408 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 1480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 18:51:32,655 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 524 Invalid, 1480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1408 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 18:51:32,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9932 states. [2022-03-15 18:51:32,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9932 to 8066. [2022-03-15 18:51:32,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8066 states, 8065 states have (on average 3.08307501549907) internal successors, (24865), 8065 states have internal predecessors, (24865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:51:32,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8066 states to 8066 states and 24865 transitions. [2022-03-15 18:51:32,816 INFO L78 Accepts]: Start accepts. Automaton has 8066 states and 24865 transitions. Word has length 49 [2022-03-15 18:51:32,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:51:32,816 INFO L470 AbstractCegarLoop]: Abstraction has 8066 states and 24865 transitions. [2022-03-15 18:51:32,816 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 7.32) internal successors, (183), 24 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:51:32,816 INFO L276 IsEmpty]: Start isEmpty. Operand 8066 states and 24865 transitions. [2022-03-15 18:51:32,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-15 18:51:32,832 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:51:32,832 INFO L514 BasicCegarLoop]: 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] [2022-03-15 18:51:32,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-15 18:51:32,832 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:51:32,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:51:32,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1423720727, now seen corresponding path program 8 times [2022-03-15 18:51:32,833 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:51:32,833 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933537363] [2022-03-15 18:51:32,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:51:32,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:51:32,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:51:33,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:51:33,062 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:51:33,062 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933537363] [2022-03-15 18:51:33,062 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933537363] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:51:33,062 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:51:33,062 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-15 18:51:33,062 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [474011612] [2022-03-15 18:51:33,062 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:51:33,067 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:51:33,193 INFO L252 McrAutomatonBuilder]: Finished intersection with 474 states and 1243 transitions. [2022-03-15 18:51:33,194 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:51:41,257 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [180046#(and (or (< 0 ~n1~0) (< ~n2~0 ~n1~0)) (not (= ~n2~0 0)) (<= ~n2~0 ~n1~0)), 180047#(and (or (< ~n1~0 ~n3~0) (= ~n1~0 ~n3~0)) (not (= ~n1~0 0))), 180048#(and (or (< ~n1~0 ~n3~0) (= ~n2~0 ~n1~0) (= ~n1~0 ~n3~0)) (or (< ~n1~0 ~n3~0) (< 0 ~n1~0) (= ~n1~0 ~n3~0)) (not (= ~n1~0 0))), 180053#(and (< ~n1~0 (+ 2 ~n2~0)) (< 0 ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 180051#(and (or (<= 1 ~n1~0) (< ~n1~0 ~n3~0)) (or (<= 1 ~n3~0) (not (< ~n1~0 ~n3~0))) (<= (+ ~n1~0 1) ~n2~0) (<= (+ ~n3~0 1) ~n2~0) (or (< ~n1~0 ~n3~0) (<= ~n2~0 (+ ~n1~0 1))) (or (not (< ~n1~0 ~n3~0)) (<= ~n2~0 (+ ~n3~0 1)))), 180041#(and (not (= ~n2~0 0)) (< ~n2~0 ~n1~0)), 180057#(and (= ~n2~0 0) (or (<= 0 ~n1~0) (not (< ~n3~0 ~n1~0))) (or (<= 0 ~n3~0) (< ~n3~0 ~n1~0))), 180050#(and (or (not (= ~n1~0 0)) (< ~n2~0 ~n1~0)) (or (< ~n1~0 ~n3~0) (= ~n2~0 ~n1~0) (= ~n1~0 ~n3~0) (< ~n2~0 ~n1~0)) (or (< ~n1~0 ~n3~0) (< 0 ~n1~0) (= ~n1~0 ~n3~0) (< ~n2~0 ~n1~0)) (or (< ~n1~0 ~n3~0) (= ~n1~0 ~n3~0) (not (= ~n2~0 0)))), 180049#(and (or (not (= ~n1~0 0)) (< ~n2~0 ~n1~0)) (or (< ~n1~0 ~n3~0) (= ~n1~0 ~n3~0) (< ~n2~0 ~n1~0)) (or (< ~n1~0 ~n3~0) (= ~n1~0 ~n3~0) (not (= ~n2~0 0)))), 180055#(and (or (not (< ~n3~0 ~n2~0)) (<= ~n1~0 ~n2~0)) (or (<= ~n1~0 ~n3~0) (< ~n3~0 ~n2~0)) (or (<= 0 ~n3~0) (< ~n3~0 ~n2~0)) (or (not (< ~n3~0 ~n2~0)) (<= 0 ~n2~0))), 180056#(and (or (<= 0 ~n1~0) (< ~n1~0 ~n2~0) (not (< ~n3~0 ~n1~0))) (or (not (< ~n1~0 ~n2~0)) (<= 0 ~n2~0) (not (< ~n3~0 ~n1~0))) (or (not (< ~n3~0 ~n2~0)) (<= 0 ~n2~0) (< ~n3~0 ~n1~0)) (or (<= 0 ~n3~0) (< ~n3~0 ~n2~0) (< ~n3~0 ~n1~0))), 180054#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n3~0) (<= (+ ~n1~0 1) ~n3~0)), 180043#(and (or (not (= ~n3~0 0)) (not (= ~n1~0 0))) (or (= ~n2~0 ~n1~0) (< ~n3~0 ~n2~0) (< ~n1~0 ~n2~0)) (or (= ~n2~0 ~n1~0) (not (= ~n3~0 0)) (< ~n1~0 ~n2~0)) (or (not (= ~n1~0 0)) (< ~n3~0 ~n2~0))), 180042#(and (not (= ~n3~0 0)) (< ~n3~0 ~n2~0)), 180045#(and (or (not (= ~n2~0 0)) (< ~n1~0 ~n2~0)) (or (not (= ~n1~0 0)) (< ~n2~0 ~n1~0))), 180052#(and (not (= (+ ~n2~0 1) 0)) (<= (+ ~n2~0 1) ~n1~0) (or (< 0 ~n1~0) (< (+ ~n2~0 1) ~n1~0))), 180044#(and (not (= ~n1~0 0)) (or (= ~n2~0 ~n1~0) (< ~n1~0 ~n2~0)))] [2022-03-15 18:51:41,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 18:51:41,257 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:51:41,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 18:51:41,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=676, Unknown=0, NotChecked=0, Total=812 [2022-03-15 18:51:41,258 INFO L87 Difference]: Start difference. First operand 8066 states and 24865 transitions. Second operand has 29 states, 29 states have (on average 6.482758620689655) internal successors, (188), 28 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:51:44,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:51:44,009 INFO L93 Difference]: Finished difference Result 26766 states and 80315 transitions. [2022-03-15 18:51:44,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-03-15 18:51:44,009 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 6.482758620689655) internal successors, (188), 28 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-03-15 18:51:44,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:51:44,070 INFO L225 Difference]: With dead ends: 26766 [2022-03-15 18:51:44,071 INFO L226 Difference]: Without dead ends: 26646 [2022-03-15 18:51:44,072 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 390 SyntacticMatches, 14 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1256 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=646, Invalid=3260, Unknown=0, NotChecked=0, Total=3906 [2022-03-15 18:51:44,072 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 1158 mSDsluCounter, 3385 mSDsCounter, 0 mSdLazyCounter, 4202 mSolverCounterSat, 422 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1158 SdHoareTripleChecker+Valid, 1705 SdHoareTripleChecker+Invalid, 4624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 422 IncrementalHoareTripleChecker+Valid, 4202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-15 18:51:44,072 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1158 Valid, 1705 Invalid, 4624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [422 Valid, 4202 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-15 18:51:44,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26646 states. [2022-03-15 18:51:44,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26646 to 10554. [2022-03-15 18:51:44,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10554 states, 10553 states have (on average 3.0833886098739693) internal successors, (32539), 10553 states have internal predecessors, (32539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:51:44,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10554 states to 10554 states and 32539 transitions. [2022-03-15 18:51:44,368 INFO L78 Accepts]: Start accepts. Automaton has 10554 states and 32539 transitions. Word has length 49 [2022-03-15 18:51:44,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:51:44,369 INFO L470 AbstractCegarLoop]: Abstraction has 10554 states and 32539 transitions. [2022-03-15 18:51:44,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 6.482758620689655) internal successors, (188), 28 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:51:44,369 INFO L276 IsEmpty]: Start isEmpty. Operand 10554 states and 32539 transitions. [2022-03-15 18:51:44,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-15 18:51:44,388 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:51:44,388 INFO L514 BasicCegarLoop]: 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] [2022-03-15 18:51:44,388 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-15 18:51:44,388 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:51:44,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:51:44,389 INFO L85 PathProgramCache]: Analyzing trace with hash 2029703481, now seen corresponding path program 9 times [2022-03-15 18:51:44,389 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:51:44,390 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782032078] [2022-03-15 18:51:44,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:51:44,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:51:44,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:51:44,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:51:44,469 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:51:44,469 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782032078] [2022-03-15 18:51:44,469 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782032078] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:51:44,469 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:51:44,469 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-15 18:51:44,469 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1110574130] [2022-03-15 18:51:44,469 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:51:44,474 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:51:44,534 INFO L252 McrAutomatonBuilder]: Finished intersection with 322 states and 776 transitions. [2022-03-15 18:51:44,534 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:51:46,331 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 18:51:46,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 18:51:46,332 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:51:46,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 18:51:46,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-03-15 18:51:46,332 INFO L87 Difference]: Start difference. First operand 10554 states and 32539 transitions. Second operand has 9 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:51:46,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:51:46,697 INFO L93 Difference]: Finished difference Result 11465 states and 34815 transitions. [2022-03-15 18:51:46,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 18:51:46,697 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-03-15 18:51:46,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:51:46,718 INFO L225 Difference]: With dead ends: 11465 [2022-03-15 18:51:46,718 INFO L226 Difference]: Without dead ends: 10382 [2022-03-15 18:51:46,718 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 264 SyntacticMatches, 8 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-03-15 18:51:46,718 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 158 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:51:46,719 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 132 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 875 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:51:46,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10382 states. [2022-03-15 18:51:46,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10382 to 9564. [2022-03-15 18:51:46,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9564 states, 9563 states have (on average 3.0634738052912267) internal successors, (29296), 9563 states have internal predecessors, (29296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:51:46,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9564 states to 9564 states and 29296 transitions. [2022-03-15 18:51:46,876 INFO L78 Accepts]: Start accepts. Automaton has 9564 states and 29296 transitions. Word has length 49 [2022-03-15 18:51:46,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:51:46,876 INFO L470 AbstractCegarLoop]: Abstraction has 9564 states and 29296 transitions. [2022-03-15 18:51:46,876 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:51:46,876 INFO L276 IsEmpty]: Start isEmpty. Operand 9564 states and 29296 transitions. [2022-03-15 18:51:46,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-15 18:51:46,891 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:51:46,891 INFO L514 BasicCegarLoop]: 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] [2022-03-15 18:51:46,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-15 18:51:46,891 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:51:46,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:51:46,891 INFO L85 PathProgramCache]: Analyzing trace with hash -2142516455, now seen corresponding path program 10 times [2022-03-15 18:51:46,892 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:51:46,892 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548892879] [2022-03-15 18:51:46,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:51:46,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:51:46,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:51:47,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:51:47,011 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:51:47,011 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548892879] [2022-03-15 18:51:47,011 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548892879] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:51:47,011 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:51:47,011 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-15 18:51:47,011 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2139492338] [2022-03-15 18:51:47,011 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:51:47,015 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:51:47,189 INFO L252 McrAutomatonBuilder]: Finished intersection with 532 states and 1427 transitions. [2022-03-15 18:51:47,189 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:51:59,713 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 23 new interpolants: [258642#(and (<= ~n1~0 ~n3~0) (<= ~n2~0 ~n3~0) (<= 0 ~n3~0)), 258630#(and (or (not (= ~n2~0 0)) (< ~n3~0 ~n2~0)) (or (< ~n3~0 ~n2~0) (< ~n2~0 ~n1~0)) (or (not (= ~n3~0 0)) (< ~n2~0 ~n1~0))), 258625#(and (not (= ~n3~0 0)) (< ~n3~0 ~n2~0)), 258626#(and (or (< ~n1~0 ~n3~0) (= ~n1~0 ~n3~0)) (not (= ~n1~0 0))), 258627#(and (or (not (= ~n3~0 0)) (not (= ~n1~0 0))) (or (< ~n1~0 ~n3~0) (<= 1 ~n3~0) (= ~n1~0 ~n3~0)) (or (< ~n1~0 ~n3~0) (= ~n1~0 ~n3~0) (< ~n3~0 ~n2~0)) (or (not (= ~n1~0 0)) (< ~n3~0 ~n2~0))), 258637#(and (<= 1 ~n3~0) (= ~n2~0 ~n3~0) (or (< ~n1~0 ~n3~0) (= ~n2~0 ~n1~0))), 258636#(and (or (not (= ~n3~0 0)) (not (= ~n1~0 0)) (< ~n2~0 ~n1~0)) (or (not (= ~n2~0 0)) (< ~n3~0 ~n2~0) (< ~n1~0 ~n2~0)) (or (not (= ~n1~0 0)) (< ~n3~0 ~n2~0) (< ~n2~0 ~n1~0))), 258639#(and (<= ~n3~0 ~n2~0) (<= 1 ~n3~0)), 258645#(and (or (= ~n2~0 ~n1~0) (< ~n2~0 ~n1~0)) (or (= ~n2~0 ~n1~0) (not (< ~n3~0 ~n2~0))) (or (<= ~n1~0 ~n3~0) (< ~n3~0 ~n2~0)) (= ~n1~0 0)), 258647#(and (= ~n2~0 ~n1~0) (= ~n1~0 0) (or (= ~n1~0 ~n3~0) (< ~n3~0 ~n1~0))), 258646#(and (= ~n1~0 0) (<= ~n2~0 ~n1~0)), 258638#(and (not (= (+ ~n2~0 1) 0)) (or (<= ~n3~0 ~n2~0) (< (+ ~n2~0 1) ~n1~0)) (or (<= 1 ~n3~0) (< (+ ~n2~0 1) ~n1~0))), 258631#(and (or (<= (+ ~n3~0 1) ~n2~0) (< ~n2~0 ~n1~0)) (or (<= 1 ~n3~0) (< ~n2~0 ~n1~0)) (not (= ~n2~0 0))), 258643#(and (= ~n2~0 ~n1~0) (<= ~n1~0 ~n3~0) (= ~n1~0 0)), 258634#(and (<= 1 ~n3~0) (or (< ~n1~0 ~n3~0) (= ~n1~0 ~n3~0)) (<= (+ ~n3~0 1) ~n2~0)), 258644#(and (or (= ~n2~0 ~n1~0) (< ~n2~0 ~n1~0)) (<= ~n1~0 ~n3~0) (= ~n1~0 0)), 258640#(and (or (not (= (+ ~n3~0 1) 0)) (not (< ~n2~0 ~n3~0))) (or (<= 1 ~n3~0) (< (+ ~n2~0 1) ~n1~0)) (or (<= 1 ~n3~0) (< (+ ~n3~0 1) ~n1~0)) (or (not (= (+ ~n2~0 1) 0)) (< ~n2~0 ~n3~0))), 258633#(and (or (= ~n2~0 ~n1~0) (< ~n2~0 ~n1~0)) (= ~n1~0 0) (<= (+ ~n1~0 1) ~n3~0)), 258628#(and (not (= ~n2~0 0)) (< ~n2~0 ~n1~0)), 258632#(and (or (<= (+ ~n3~0 1) ~n2~0) (not (= ~n1~0 0)) (< ~n2~0 ~n1~0)) (or (< ~n1~0 ~n3~0) (<= 1 ~n3~0) (= ~n1~0 ~n3~0) (< ~n2~0 ~n1~0)) (or (<= 1 ~n3~0) (not (= ~n1~0 0)) (< ~n2~0 ~n1~0)) (or (< ~n1~0 ~n3~0) (= ~n1~0 ~n3~0) (not (= ~n2~0 0)))), 258641#(<= 1 ~n3~0), 258635#(and (or (not (= ~n3~0 0)) (not (= ~n1~0 0))) (or (= ~n2~0 ~n1~0) (< ~n3~0 ~n2~0) (< ~n1~0 ~n2~0)) (or (= ~n2~0 ~n1~0) (not (= ~n3~0 0)) (< ~n1~0 ~n2~0)) (or (not (= ~n1~0 0)) (< ~n3~0 ~n2~0))), 258629#(and (or (not (= ~n1~0 0)) (< ~n2~0 ~n1~0)) (or (< ~n1~0 ~n3~0) (= ~n1~0 ~n3~0) (< ~n2~0 ~n1~0)) (or (< ~n1~0 ~n3~0) (= ~n1~0 ~n3~0) (not (= ~n2~0 0))))] [2022-03-15 18:51:59,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-15 18:51:59,714 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:51:59,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-15 18:51:59,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=812, Unknown=0, NotChecked=0, Total=992 [2022-03-15 18:51:59,714 INFO L87 Difference]: Start difference. First operand 9564 states and 29296 transitions. Second operand has 32 states, 32 states have (on average 6.5) internal successors, (208), 31 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:52:00,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:52:00,602 INFO L93 Difference]: Finished difference Result 13626 states and 41102 transitions. [2022-03-15 18:52:00,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 18:52:00,602 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 6.5) internal successors, (208), 31 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-03-15 18:52:00,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:52:00,628 INFO L225 Difference]: With dead ends: 13626 [2022-03-15 18:52:00,628 INFO L226 Difference]: Without dead ends: 13626 [2022-03-15 18:52:00,629 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 406 SyntacticMatches, 45 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 982 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=297, Invalid=1263, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 18:52:00,629 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 490 mSDsluCounter, 1342 mSDsCounter, 0 mSdLazyCounter, 1736 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 1916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 1736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 18:52:00,629 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [490 Valid, 653 Invalid, 1916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 1736 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 18:52:00,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13626 states. [2022-03-15 18:52:00,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13626 to 9390. [2022-03-15 18:52:00,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9390 states, 9389 states have (on average 3.0609223559484504) internal successors, (28739), 9389 states have internal predecessors, (28739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:52:00,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9390 states to 9390 states and 28739 transitions. [2022-03-15 18:52:00,788 INFO L78 Accepts]: Start accepts. Automaton has 9390 states and 28739 transitions. Word has length 49 [2022-03-15 18:52:00,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:52:00,789 INFO L470 AbstractCegarLoop]: Abstraction has 9390 states and 28739 transitions. [2022-03-15 18:52:00,789 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 6.5) internal successors, (208), 31 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:52:00,789 INFO L276 IsEmpty]: Start isEmpty. Operand 9390 states and 28739 transitions. [2022-03-15 18:52:00,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-15 18:52:00,803 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:52:00,803 INFO L514 BasicCegarLoop]: 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] [2022-03-15 18:52:00,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-15 18:52:00,803 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:52:00,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:52:00,803 INFO L85 PathProgramCache]: Analyzing trace with hash -280298697, now seen corresponding path program 11 times [2022-03-15 18:52:00,804 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:52:00,804 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621400417] [2022-03-15 18:52:00,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:52:00,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:52:00,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:52:01,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:52:01,013 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:52:01,013 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621400417] [2022-03-15 18:52:01,013 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621400417] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:52:01,013 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:52:01,013 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-15 18:52:01,013 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [717199834] [2022-03-15 18:52:01,013 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:52:01,017 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:52:01,108 INFO L252 McrAutomatonBuilder]: Finished intersection with 488 states and 1282 transitions. [2022-03-15 18:52:01,108 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:52:09,405 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 22 new interpolants: [291099#(and (<= ~n2~0 0) (= ~n1~0 0) (<= ~n3~0 0)), 291079#(and (not (= ~n3~0 0)) (< ~n3~0 ~n2~0)), 291096#(and (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (= (+ ~n3~0 1) 1) (<= ~n2~0 ~n1~0)), 291085#(and (or (< ~n1~0 ~n3~0) (= ~n1~0 ~n3~0)) (not (= ~n1~0 0))), 291082#(and (not (= ~n1~0 0)) (or (= ~n2~0 ~n1~0) (< ~n1~0 ~n2~0))), 291086#(and (or (< ~n1~0 ~n3~0) (= ~n1~0 ~n3~0) (= ~n3~0 1)) (not (= ~n1~0 0)) (or (< ~n1~0 ~n3~0) (= ~n1~0 ~n3~0) (< ~n1~0 (+ ~n2~0 1)))), 291098#(and (or (not (< ~n3~0 ~n2~0)) (<= ~n1~0 ~n2~0)) (or (<= ~n1~0 ~n3~0) (< ~n3~0 ~n2~0)) (<= ~n2~0 0) (= ~n1~0 0) (<= ~n3~0 0)), 291100#(and (= ~n2~0 ~n1~0) (or (= ~n2~0 ~n3~0) (< ~n3~0 ~n1~0)) (= ~n1~0 0)), 291094#(and (<= (+ ~n1~0 1) ~n2~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n3~0 1)), 291093#(and (or (not (< ~n2~0 ~n3~0)) (< ~n1~0 (+ 2 ~n3~0))) (or (< ~n1~0 (+ 2 ~n2~0)) (< ~n2~0 ~n3~0)) (<= 2 ~n1~0) (= ~n3~0 1)), 291089#(and (<= (+ ~n2~0 1) ~n3~0) (= ~n1~0 0) (<= (+ ~n1~0 1) ~n3~0) (<= ~n3~0 1)), 291090#(and (not (= (+ ~n2~0 1) 0)) (or (< (+ ~n2~0 1) ~n1~0) (<= 2 ~n1~0)) (or (< (+ ~n2~0 1) ~n1~0) (= ~n3~0 1))), 291095#(and (= ~n2~0 1) (<= ~n1~0 ~n2~0) (= ~n3~0 1)), 291087#(and (or (not (= ~n1~0 0)) (< ~n2~0 ~n1~0)) (or (< ~n1~0 ~n3~0) (= ~n1~0 ~n3~0) (< ~n2~0 ~n1~0)) (or (< ~n1~0 ~n3~0) (= ~n1~0 ~n3~0) (not (= ~n2~0 0)))), 291097#(and (<= ~n1~0 ~n3~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0) (<= ~n3~0 0)), 291088#(and (or (< ~n1~0 ~n3~0) (= ~n1~0 ~n3~0) (= ~n3~0 1) (< ~n2~0 ~n1~0)) (or (not (= ~n1~0 0)) (< ~n2~0 ~n1~0)) (or (< ~n1~0 ~n3~0) (= ~n1~0 ~n3~0) (not (= ~n2~0 0)))), 291091#(and (< ~n1~0 (+ 2 ~n2~0)) (<= 2 ~n1~0) (= ~n3~0 1)), 291080#(and (not (= ~n2~0 0)) (< ~n2~0 ~n1~0)), 291083#(and (or (not (= ~n2~0 0)) (< ~n1~0 ~n2~0)) (or (not (= ~n1~0 0)) (< ~n2~0 ~n1~0))), 291081#(and (or (not (= ~n3~0 0)) (not (= ~n1~0 0))) (or (= ~n2~0 ~n1~0) (< ~n3~0 ~n2~0) (< ~n1~0 ~n2~0)) (or (= ~n2~0 ~n1~0) (not (= ~n3~0 0)) (< ~n1~0 ~n2~0)) (or (not (= ~n1~0 0)) (< ~n3~0 ~n2~0))), 291084#(and (or (<= 2 ~n1~0) (< ~n2~0 ~n1~0)) (or (= ~n3~0 1) (< ~n2~0 ~n1~0)) (not (= ~n2~0 0))), 291092#(and (or (not (= (+ ~n3~0 1) 0)) (not (< ~n2~0 ~n3~0))) (or (< (+ ~n3~0 1) ~n1~0) (= ~n3~0 1)) (or (not (= (+ ~n2~0 1) 0)) (< ~n2~0 ~n3~0)) (or (< (+ ~n2~0 1) ~n1~0) (= ~n3~0 1)) (or (< (+ ~n3~0 1) ~n1~0) (<= 2 ~n1~0)))] [2022-03-15 18:52:09,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 18:52:09,405 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:52:09,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 18:52:09,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=806, Unknown=0, NotChecked=0, Total=930 [2022-03-15 18:52:09,406 INFO L87 Difference]: Start difference. First operand 9390 states and 28739 transitions. Second operand has 31 states, 31 states have (on average 6.516129032258065) internal successors, (202), 30 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:52:10,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:52:10,703 INFO L93 Difference]: Finished difference Result 13046 states and 38945 transitions. [2022-03-15 18:52:10,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 18:52:10,704 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 6.516129032258065) internal successors, (202), 30 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-03-15 18:52:10,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:52:10,732 INFO L225 Difference]: With dead ends: 13046 [2022-03-15 18:52:10,732 INFO L226 Difference]: Without dead ends: 12448 [2022-03-15 18:52:10,732 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 396 SyntacticMatches, 20 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=238, Invalid=1322, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 18:52:10,733 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 507 mSDsluCounter, 2414 mSDsCounter, 0 mSdLazyCounter, 2931 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 3083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 2931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 18:52:10,733 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [507 Valid, 1174 Invalid, 3083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 2931 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 18:52:10,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12448 states. [2022-03-15 18:52:10,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12448 to 9972. [2022-03-15 18:52:10,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9972 states, 9971 states have (on average 3.0371076120750176) internal successors, (30283), 9971 states have internal predecessors, (30283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:52:10,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9972 states to 9972 states and 30283 transitions. [2022-03-15 18:52:10,913 INFO L78 Accepts]: Start accepts. Automaton has 9972 states and 30283 transitions. Word has length 49 [2022-03-15 18:52:10,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:52:10,913 INFO L470 AbstractCegarLoop]: Abstraction has 9972 states and 30283 transitions. [2022-03-15 18:52:10,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 6.516129032258065) internal successors, (202), 30 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:52:10,913 INFO L276 IsEmpty]: Start isEmpty. Operand 9972 states and 30283 transitions. [2022-03-15 18:52:10,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-15 18:52:10,929 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:52:10,929 INFO L514 BasicCegarLoop]: 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] [2022-03-15 18:52:10,929 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-15 18:52:10,929 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:52:10,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:52:10,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1118455149, now seen corresponding path program 12 times [2022-03-15 18:52:10,930 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:52:10,930 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412460163] [2022-03-15 18:52:10,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:52:10,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:52:10,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:52:10,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:52:10,961 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:52:10,961 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412460163] [2022-03-15 18:52:10,962 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412460163] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:52:10,962 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:52:10,962 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 18:52:10,962 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1737128361] [2022-03-15 18:52:10,962 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:52:10,966 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:52:11,030 INFO L252 McrAutomatonBuilder]: Finished intersection with 350 states and 853 transitions. [2022-03-15 18:52:11,030 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:52:12,247 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [324112#(not (= (mod ~e2~0 256) 0))] [2022-03-15 18:52:12,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 18:52:12,248 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:52:12,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 18:52:12,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 18:52:12,248 INFO L87 Difference]: Start difference. First operand 9972 states and 30283 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:52:12,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:52:12,340 INFO L93 Difference]: Finished difference Result 8612 states and 25484 transitions. [2022-03-15 18:52:12,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 18:52:12,341 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-03-15 18:52:12,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:52:12,356 INFO L225 Difference]: With dead ends: 8612 [2022-03-15 18:52:12,356 INFO L226 Difference]: Without dead ends: 8510 [2022-03-15 18:52:12,356 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 233 SyntacticMatches, 63 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 18:52:12,356 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 28 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 18:52:12,357 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 40 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 18:52:12,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8510 states. [2022-03-15 18:52:12,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8510 to 8310. [2022-03-15 18:52:12,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8310 states, 8309 states have (on average 2.962691057889036) internal successors, (24617), 8309 states have internal predecessors, (24617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:52:12,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8310 states to 8310 states and 24617 transitions. [2022-03-15 18:52:12,484 INFO L78 Accepts]: Start accepts. Automaton has 8310 states and 24617 transitions. Word has length 49 [2022-03-15 18:52:12,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:52:12,484 INFO L470 AbstractCegarLoop]: Abstraction has 8310 states and 24617 transitions. [2022-03-15 18:52:12,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:52:12,484 INFO L276 IsEmpty]: Start isEmpty. Operand 8310 states and 24617 transitions. [2022-03-15 18:52:12,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-15 18:52:12,496 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:52:12,496 INFO L514 BasicCegarLoop]: 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] [2022-03-15 18:52:12,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-15 18:52:12,497 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:52:12,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:52:12,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1618861371, now seen corresponding path program 13 times [2022-03-15 18:52:12,497 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:52:12,498 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671227834] [2022-03-15 18:52:12,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:52:12,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:52:12,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:52:12,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:52:12,658 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:52:12,658 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671227834] [2022-03-15 18:52:12,658 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671227834] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:52:12,658 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:52:12,658 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-15 18:52:12,658 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2044637412] [2022-03-15 18:52:12,658 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:52:12,663 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:52:12,693 INFO L252 McrAutomatonBuilder]: Finished intersection with 178 states and 342 transitions. [2022-03-15 18:52:12,694 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:52:14,758 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [349365#(and (= ~n2~0 ~n1~0) (or (= ~n2~0 ~n3~0) (< ~n3~0 ~n1~0)) (= ~n1~0 0)), 349363#(and (or (= ~n2~0 0) (< ~n2~0 ~n1~0)) (= ~n1~0 0) (<= (+ ~n1~0 1) ~n3~0)), 349361#(and (<= (+ ~n1~0 1) ~n2~0) (= ~n1~0 0)), 349357#(and (not (= ~n3~0 0)) (< ~n3~0 ~n1~0)), 349364#(and (or (<= (+ 2 ~n1~0) ~n2~0) (not (= ~n1~0 0))) (or (< ~n1~0 ~n3~0) (= ~n1~0 0) (= ~n1~0 ~n3~0))), 349358#(and (or (<= 1 ~n1~0) (< ~n3~0 ~n1~0)) (or (<= (+ ~n1~0 1) ~n2~0) (not (= ~n3~0 0))) (or (<= (+ ~n1~0 1) ~n2~0) (< ~n3~0 ~n1~0))), 349359#(and (or (< ~n3~0 ~n1~0) (< ~n2~0 ~n1~0)) (or (not (= ~n3~0 0)) (not (= ~n2~0 0))) (or (not (= ~n2~0 0)) (< ~n3~0 ~n1~0)) (or (not (= ~n3~0 0)) (< ~n2~0 ~n1~0))), 349360#(and (or (<= (+ ~n1~0 1) ~n2~0) (not (= ~n3~0 0)) (< ~n2~0 ~n1~0)) (or (not (= ~n3~0 0)) (not (= ~n2~0 0))) (or (<= (+ ~n1~0 1) ~n2~0) (< ~n3~0 ~n1~0) (< ~n2~0 ~n1~0)) (or (<= 1 ~n1~0) (< ~n3~0 ~n1~0) (< ~n2~0 ~n1~0)) (or (not (= ~n2~0 0)) (< ~n3~0 ~n1~0))), 349362#(and (or (not (< ~n2~0 ~n3~0)) (<= (+ ~n1~0 1) ~n3~0)) (= ~n1~0 0) (or (<= (+ ~n1~0 1) ~n2~0) (< ~n2~0 ~n3~0)))] [2022-03-15 18:52:14,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 18:52:14,759 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:52:14,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 18:52:14,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2022-03-15 18:52:14,759 INFO L87 Difference]: Start difference. First operand 8310 states and 24617 transitions. Second operand has 21 states, 21 states have (on average 4.9523809523809526) internal successors, (104), 20 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:52:15,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:52:15,389 INFO L93 Difference]: Finished difference Result 9342 states and 27475 transitions. [2022-03-15 18:52:15,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 18:52:15,391 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.9523809523809526) internal successors, (104), 20 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-03-15 18:52:15,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:52:15,409 INFO L225 Difference]: With dead ends: 9342 [2022-03-15 18:52:15,410 INFO L226 Difference]: Without dead ends: 9274 [2022-03-15 18:52:15,410 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 110 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2022-03-15 18:52:15,410 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 176 mSDsluCounter, 1165 mSDsCounter, 0 mSdLazyCounter, 1552 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 1607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 18:52:15,411 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 554 Invalid, 1607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1552 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 18:52:15,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9274 states. [2022-03-15 18:52:15,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9274 to 8274. [2022-03-15 18:52:15,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8274 states, 8273 states have (on average 2.966154961924332) internal successors, (24539), 8273 states have internal predecessors, (24539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:52:15,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8274 states to 8274 states and 24539 transitions. [2022-03-15 18:52:15,555 INFO L78 Accepts]: Start accepts. Automaton has 8274 states and 24539 transitions. Word has length 49 [2022-03-15 18:52:15,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:52:15,556 INFO L470 AbstractCegarLoop]: Abstraction has 8274 states and 24539 transitions. [2022-03-15 18:52:15,556 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.9523809523809526) internal successors, (104), 20 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:52:15,556 INFO L276 IsEmpty]: Start isEmpty. Operand 8274 states and 24539 transitions. [2022-03-15 18:52:15,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-15 18:52:15,569 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:52:15,569 INFO L514 BasicCegarLoop]: 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] [2022-03-15 18:52:15,570 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-15 18:52:15,570 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:52:15,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:52:15,570 INFO L85 PathProgramCache]: Analyzing trace with hash -2004936109, now seen corresponding path program 14 times [2022-03-15 18:52:15,571 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:52:15,571 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484600761] [2022-03-15 18:52:15,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:52:15,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:52:15,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:52:15,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:52:15,695 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:52:15,695 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484600761] [2022-03-15 18:52:15,695 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484600761] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:52:15,695 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:52:15,695 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-15 18:52:15,695 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [267095542] [2022-03-15 18:52:15,695 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:52:15,700 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:52:15,781 INFO L252 McrAutomatonBuilder]: Finished intersection with 374 states and 922 transitions. [2022-03-15 18:52:15,781 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:52:22,602 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [375270#(and (or (<= 2 ~n2~0) (< ~n3~0 ~n1~0)) (or (= ~n2~0 ~n1~0) (< ~n3~0 ~n1~0)) (or (= ~n2~0 ~n1~0) (not (= ~n3~0 0))) (or (<= 2 ~n2~0) (not (= ~n3~0 0)))), 375286#(and (= ~n2~0 ~n1~0) (or (= ~n2~0 ~n3~0) (< ~n3~0 ~n1~0)) (= ~n1~0 0)), 375276#(and (or (<= 2 ~n2~0) (= ~n2~0 ~n3~0) (< ~n2~0 ~n3~0)) (or (= ~n2~0 ~n1~0) (= ~n2~0 ~n3~0) (< ~n2~0 ~n3~0)) (not (= ~n2~0 0))), 375278#(and (or (= ~n2~0 ~n3~0) (< ~n2~0 ~n3~0) (< ~n2~0 ~n1~0)) (not (= ~n2~0 0))), 375284#(and (or (<= (+ ~n3~0 1) ~n2~0) (not (= ~n1~0 0))) (or (< ~n1~0 ~n3~0) (<= 2 ~n2~0) (= ~n1~0 ~n3~0)) (or (< ~n1~0 ~n3~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n1~0 ~n3~0)) (or (< ~n1~0 ~n3~0) (= ~n1~0 ~n3~0) (<= ~n2~0 (+ ~n1~0 1))) (or (<= ~n2~0 (+ ~n3~0 1)) (not (= ~n1~0 0))) (or (< ~n1~0 ~n3~0) (not (= ~n1~0 0)))), 375271#(and (or (< ~n3~0 ~n1~0) (< ~n2~0 ~n1~0)) (or (not (= ~n3~0 0)) (not (= ~n2~0 0))) (or (not (= ~n2~0 0)) (< ~n3~0 ~n1~0)) (or (not (= ~n3~0 0)) (< ~n2~0 ~n1~0))), 375275#(and (or (= ~n2~0 ~n3~0) (< ~n2~0 ~n3~0)) (not (= ~n2~0 0))), 375282#(and (<= 2 ~n2~0) (<= (+ ~n1~0 1) ~n2~0) (<= (+ ~n3~0 1) ~n2~0) (or (< ~n1~0 ~n3~0) (<= ~n2~0 (+ ~n1~0 1))) (or (not (< ~n1~0 ~n3~0)) (<= ~n2~0 (+ ~n3~0 1)))), 375280#(and (or (< (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= (+ ~n2~0 1) ~n3~0)) (not (= (+ ~n2~0 1) 0)) (or (< (+ ~n2~0 1) ~n3~0) (= (+ ~n2~0 1) ~n3~0) (= (+ ~n2~0 1) ~n1~0))), 375281#(and (or (not (< ~n2~0 ~n3~0)) (<= 1 ~n3~0)) (or (< ~n2~0 ~n3~0) (= (+ ~n2~0 1) ~n1~0)) (or (<= 1 ~n2~0) (< ~n2~0 ~n3~0)) (or (not (< ~n2~0 ~n3~0)) (= (+ ~n3~0 1) ~n1~0))), 375274#(and (or (<= 2 ~n2~0) (< ~n2~0 ~n1~0)) (not (= ~n2~0 0)) (<= ~n2~0 ~n1~0)), 375273#(and (not (= ~n2~0 0)) (< ~n2~0 ~n1~0)), 375277#(and (or (= ~n2~0 ~n1~0) (< ~n2~0 ~n1~0)) (<= 1 ~n3~0) (= ~n1~0 0)), 375279#(and (or (<= 2 ~n2~0) (= ~n2~0 ~n3~0) (< ~n2~0 ~n3~0) (< ~n2~0 ~n1~0)) (not (= ~n2~0 0)) (or (= ~n2~0 ~n1~0) (= ~n2~0 ~n3~0) (< ~n2~0 ~n3~0) (< ~n2~0 ~n1~0))), 375269#(and (not (= ~n3~0 0)) (< ~n3~0 ~n1~0)), 375285#(and (or (< ~n1~0 ~n3~0) (= ~n1~0 ~n3~0)) (or (<= ~n2~0 ~n3~0) (not (= ~n1~0 0))) (or (<= ~n3~0 ~n2~0) (not (= ~n1~0 0))) (or (< ~n1~0 ~n3~0) (not (= ~n1~0 0)))), 375283#(and (<= ~n3~0 ~n2~0) (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0)), 375272#(and (or (<= 2 ~n2~0) (not (= ~n3~0 0)) (< ~n2~0 ~n1~0)) (or (= ~n2~0 ~n1~0) (< ~n3~0 ~n1~0) (< ~n2~0 ~n1~0)) (or (= ~n2~0 ~n1~0) (not (= ~n3~0 0)) (< ~n2~0 ~n1~0)) (or (not (= ~n3~0 0)) (not (= ~n2~0 0))) (or (<= 2 ~n2~0) (< ~n3~0 ~n1~0) (< ~n2~0 ~n1~0)) (or (not (= ~n2~0 0)) (< ~n3~0 ~n1~0)))] [2022-03-15 18:52:22,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 18:52:22,602 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:52:22,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 18:52:22,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2022-03-15 18:52:22,603 INFO L87 Difference]: Start difference. First operand 8274 states and 24539 transitions. Second operand has 27 states, 27 states have (on average 6.333333333333333) internal successors, (171), 26 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:52:23,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:52:23,727 INFO L93 Difference]: Finished difference Result 9656 states and 28433 transitions. [2022-03-15 18:52:23,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 18:52:23,728 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 6.333333333333333) internal successors, (171), 26 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-03-15 18:52:23,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:52:23,750 INFO L225 Difference]: With dead ends: 9656 [2022-03-15 18:52:23,750 INFO L226 Difference]: Without dead ends: 8740 [2022-03-15 18:52:23,750 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 278 SyntacticMatches, 26 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=219, Invalid=1263, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 18:52:23,751 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 379 mSDsluCounter, 1451 mSDsCounter, 0 mSdLazyCounter, 1769 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 1880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 1769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 18:52:23,751 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [379 Valid, 775 Invalid, 1880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 1769 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 18:52:23,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8740 states. [2022-03-15 18:52:23,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8740 to 8032. [2022-03-15 18:52:23,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8032 states, 8031 states have (on average 2.985805005603287) internal successors, (23979), 8031 states have internal predecessors, (23979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:52:23,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8032 states to 8032 states and 23979 transitions. [2022-03-15 18:52:23,919 INFO L78 Accepts]: Start accepts. Automaton has 8032 states and 23979 transitions. Word has length 49 [2022-03-15 18:52:23,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:52:23,919 INFO L470 AbstractCegarLoop]: Abstraction has 8032 states and 23979 transitions. [2022-03-15 18:52:23,919 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 6.333333333333333) internal successors, (171), 26 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:52:23,919 INFO L276 IsEmpty]: Start isEmpty. Operand 8032 states and 23979 transitions. [2022-03-15 18:52:23,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-15 18:52:23,931 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:52:23,931 INFO L514 BasicCegarLoop]: 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] [2022-03-15 18:52:23,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-15 18:52:23,931 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:52:23,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:52:23,933 INFO L85 PathProgramCache]: Analyzing trace with hash 281215483, now seen corresponding path program 15 times [2022-03-15 18:52:23,933 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:52:23,933 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000399979] [2022-03-15 18:52:23,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:52:23,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:52:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:52:24,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:52:24,012 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:52:24,012 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000399979] [2022-03-15 18:52:24,012 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000399979] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:52:24,012 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:52:24,013 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-15 18:52:24,013 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2107715931] [2022-03-15 18:52:24,013 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:52:24,017 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:52:24,124 INFO L252 McrAutomatonBuilder]: Finished intersection with 506 states and 1354 transitions. [2022-03-15 18:52:24,124 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:52:39,978 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [401038#(and (not (= ~n3~0 0)) (< ~n3~0 ~n2~0)), 401054#(and (or (= ~n3~0 0) (< ~n3~0 ~n2~0) (< ~n3~0 ~n1~0)) (or (= ~n2~0 0) (< ~n2~0 ~n1~0)) (or (not (< ~n2~0 ~n1~0)) (= ~n1~0 0))), 401051#(and (<= (+ ~n2~0 1) ~n3~0) (< ~n3~0 (+ 2 ~n2~0)) (<= 0 ~n2~0)), 401049#(and (or (<= ~n2~0 ~n3~0) (not (= ~n1~0 0)) (< ~n2~0 ~n1~0)) (or (< ~n1~0 ~n3~0) (= ~n1~0 ~n3~0) (< ~n2~0 ~n1~0)) (or (< ~n1~0 ~n3~0) (= ~n1~0 ~n3~0) (not (= ~n2~0 0))) (or (< ~n3~0 (+ ~n2~0 1)) (not (= ~n1~0 0)) (< ~n2~0 ~n1~0)) (or (not (= ~n2~0 0)) (not (= ~n1~0 0)))), 401050#(and (or (= ~n2~0 0) (< ~n2~0 ~n1~0)) (= ~n3~0 0) (or (not (< ~n2~0 ~n1~0)) (= ~n1~0 0))), 401046#(and (or (< ~n3~0 (+ ~n2~0 1)) (not (= ~n1~0 0))) (or (not (= ~n3~0 0)) (not (= ~n1~0 0))) (or (= ~n2~0 ~n1~0) (< ~n3~0 (+ ~n2~0 1)) (< ~n1~0 ~n2~0)) (or (= ~n2~0 ~n1~0) (not (= ~n3~0 0)) (< ~n1~0 ~n2~0)) (or (= ~n2~0 ~n1~0) (<= 1 ~n2~0) (< ~n3~0 ~n2~0) (< ~n1~0 ~n2~0))), 401044#(and (or (< ~n3~0 (+ ~n2~0 1)) (< ~n2~0 ~n1~0)) (or (<= 1 ~n2~0) (< ~n2~0 ~n1~0)) (or (<= ~n2~0 ~n3~0) (< ~n2~0 ~n1~0)) (not (= ~n2~0 0))), 401041#(and (or (not (= ~n3~0 0)) (not (= ~n1~0 0))) (or (= ~n2~0 ~n1~0) (< ~n3~0 ~n2~0) (< ~n1~0 ~n2~0)) (or (= ~n2~0 ~n1~0) (not (= ~n3~0 0)) (< ~n1~0 ~n2~0)) (or (not (= ~n1~0 0)) (< ~n3~0 ~n2~0))), 401052#(and (<= 1 ~n2~0) (<= ~n2~0 (+ ~n3~0 1)) (< ~n3~0 ~n2~0)), 401053#(and (or (= ~n2~0 0) (< ~n2~0 ~n1~0)) (or (= ~n3~0 0) (< ~n3~0 ~n2~0)) (or (not (< ~n2~0 ~n1~0)) (not (< ~n3~0 ~n2~0))) (or (not (< ~n2~0 ~n1~0)) (= ~n1~0 0))), 401045#(and (or (not (= ~n2~0 0)) (< ~n3~0 ~n2~0)) (or (< ~n3~0 (+ ~n2~0 1)) (< ~n2~0 ~n1~0)) (or (<= 1 ~n2~0) (< ~n3~0 ~n2~0) (< ~n2~0 ~n1~0)) (or (not (= ~n3~0 0)) (< ~n2~0 ~n1~0))), 401048#(and (or (< ~n3~0 (+ ~n2~0 1)) (not (= ~n1~0 0))) (or (< ~n1~0 ~n3~0) (<= 1 ~n2~0) (= ~n1~0 ~n3~0)) (or (<= ~n2~0 ~n3~0) (not (= ~n1~0 0))) (or (< ~n1~0 ~n3~0) (<= ~n2~0 ~n3~0) (= ~n1~0 ~n3~0)) (or (<= 1 ~n2~0) (not (= ~n1~0 0))) (or (< ~n1~0 ~n3~0) (= ~n1~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1)))), 401040#(and (or (not (= ~n2~0 0)) (< ~n3~0 ~n2~0)) (or (< ~n3~0 ~n2~0) (< ~n2~0 ~n1~0)) (or (not (= ~n3~0 0)) (< ~n2~0 ~n1~0))), 401047#(and (or (not (= ~n3~0 0)) (not (= ~n1~0 0)) (< ~n2~0 ~n1~0)) (or (< ~n3~0 (+ ~n2~0 1)) (not (= ~n1~0 0)) (< ~n2~0 ~n1~0)) (or (not (= ~n2~0 0)) (< ~n3~0 ~n2~0) (< ~n1~0 ~n2~0))), 401043#(and (or (<= 1 ~n2~0) (< ~n3~0 ~n2~0)) (< ~n3~0 (+ ~n2~0 1)) (not (= ~n3~0 0))), 401042#(and (or (not (= ~n3~0 0)) (not (= ~n1~0 0)) (< ~n2~0 ~n1~0)) (or (not (= ~n2~0 0)) (< ~n3~0 ~n2~0) (< ~n1~0 ~n2~0)) (or (not (= ~n1~0 0)) (< ~n3~0 ~n2~0) (< ~n2~0 ~n1~0))), 401055#(and (or (= ~n1~0 0) (not (< ~n3~0 ~n1~0))) (= ~n2~0 0) (or (= ~n3~0 0) (< ~n3~0 ~n1~0))), 401039#(and (not (= ~n2~0 0)) (< ~n2~0 ~n1~0))] [2022-03-15 18:52:39,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 18:52:39,978 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:52:39,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 18:52:39,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2022-03-15 18:52:39,979 INFO L87 Difference]: Start difference. First operand 8032 states and 23979 transitions. Second operand has 25 states, 25 states have (on average 7.4) internal successors, (185), 24 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:52:41,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:52:41,040 INFO L93 Difference]: Finished difference Result 16242 states and 48602 transitions. [2022-03-15 18:52:41,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 18:52:41,040 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 7.4) internal successors, (185), 24 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-03-15 18:52:41,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:52:41,071 INFO L225 Difference]: With dead ends: 16242 [2022-03-15 18:52:41,072 INFO L226 Difference]: Without dead ends: 15366 [2022-03-15 18:52:41,072 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 390 SyntacticMatches, 39 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=210, Invalid=1050, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 18:52:41,073 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 408 mSDsluCounter, 1309 mSDsCounter, 0 mSdLazyCounter, 1788 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 1922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 18:52:41,073 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [408 Valid, 665 Invalid, 1922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1788 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 18:52:41,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15366 states. [2022-03-15 18:52:41,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15366 to 10280. [2022-03-15 18:52:41,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10280 states, 10279 states have (on average 3.007491001070143) internal successors, (30914), 10279 states have internal predecessors, (30914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:52:41,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10280 states to 10280 states and 30914 transitions. [2022-03-15 18:52:41,266 INFO L78 Accepts]: Start accepts. Automaton has 10280 states and 30914 transitions. Word has length 49 [2022-03-15 18:52:41,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:52:41,266 INFO L470 AbstractCegarLoop]: Abstraction has 10280 states and 30914 transitions. [2022-03-15 18:52:41,266 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 7.4) internal successors, (185), 24 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:52:41,266 INFO L276 IsEmpty]: Start isEmpty. Operand 10280 states and 30914 transitions. [2022-03-15 18:52:41,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-15 18:52:41,280 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:52:41,280 INFO L514 BasicCegarLoop]: 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] [2022-03-15 18:52:41,280 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-15 18:52:41,281 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:52:41,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:52:41,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1584601607, now seen corresponding path program 16 times [2022-03-15 18:52:41,281 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:52:41,282 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310310169] [2022-03-15 18:52:41,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:52:41,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:52:41,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:52:41,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:52:41,357 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:52:41,357 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310310169] [2022-03-15 18:52:41,358 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310310169] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:52:41,358 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:52:41,358 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-15 18:52:41,358 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [129029441] [2022-03-15 18:52:41,359 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:52:41,368 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:52:41,427 INFO L252 McrAutomatonBuilder]: Finished intersection with 350 states and 821 transitions. [2022-03-15 18:52:41,427 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:52:43,976 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 18:52:43,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 18:52:43,976 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:52:43,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 18:52:43,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-03-15 18:52:43,977 INFO L87 Difference]: Start difference. First operand 10280 states and 30914 transitions. Second operand has 9 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:52:44,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:52:44,352 INFO L93 Difference]: Finished difference Result 11499 states and 33975 transitions. [2022-03-15 18:52:44,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 18:52:44,353 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-03-15 18:52:44,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:52:44,372 INFO L225 Difference]: With dead ends: 11499 [2022-03-15 18:52:44,373 INFO L226 Difference]: Without dead ends: 10756 [2022-03-15 18:52:44,373 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 295 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-03-15 18:52:44,373 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 180 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:52:44,373 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 126 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:52:44,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10756 states. [2022-03-15 18:52:44,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10756 to 9894. [2022-03-15 18:52:44,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9894 states, 9893 states have (on average 2.998989184271707) internal successors, (29669), 9893 states have internal predecessors, (29669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:52:44,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9894 states to 9894 states and 29669 transitions. [2022-03-15 18:52:44,590 INFO L78 Accepts]: Start accepts. Automaton has 9894 states and 29669 transitions. Word has length 49 [2022-03-15 18:52:44,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:52:44,590 INFO L470 AbstractCegarLoop]: Abstraction has 9894 states and 29669 transitions. [2022-03-15 18:52:44,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:52:44,590 INFO L276 IsEmpty]: Start isEmpty. Operand 9894 states and 29669 transitions. [2022-03-15 18:52:44,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-15 18:52:44,606 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:52:44,606 INFO L514 BasicCegarLoop]: 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] [2022-03-15 18:52:44,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-03-15 18:52:44,606 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:52:44,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:52:44,608 INFO L85 PathProgramCache]: Analyzing trace with hash 370054137, now seen corresponding path program 17 times [2022-03-15 18:52:44,608 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:52:44,608 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147245375] [2022-03-15 18:52:44,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:52:44,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:52:44,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:52:44,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:52:44,673 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:52:44,673 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147245375] [2022-03-15 18:52:44,673 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147245375] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:52:44,673 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:52:44,673 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-15 18:52:44,673 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [186390905] [2022-03-15 18:52:44,673 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:52:44,678 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:52:44,800 INFO L252 McrAutomatonBuilder]: Finished intersection with 532 states and 1406 transitions. [2022-03-15 18:52:44,800 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:52:55,064 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [469201#(and (or (< ~n3~0 ~n1~0) (< ~n2~0 ~n1~0)) (or (not (= ~n3~0 0)) (not (= ~n2~0 0))) (or (not (= ~n2~0 0)) (< ~n3~0 ~n1~0)) (or (not (= ~n3~0 0)) (< ~n2~0 ~n1~0))), 469209#(and (or (<= 0 ~n3~0) (< ~n3~0 ~n2~0)) (or (not (< ~n3~0 ~n2~0)) (<= 0 ~n2~0))), 469200#(and (not (= ~n3~0 0)) (< ~n3~0 ~n1~0)), 469203#(and (or (not (= ~n3~0 0)) (not (= ~n2~0 0))) (or (not (= ~n2~0 0)) (< ~n3~0 ~n2~0) (< ~n3~0 ~n1~0)) (or (< ~n3~0 ~n2~0) (< ~n2~0 ~n1~0)) (or (not (= ~n3~0 0)) (< ~n2~0 ~n1~0))), 469207#(and (or (not (= ~n1~0 0)) (< ~n3~0 ~n1~0)) (or (< ~n1~0 ~n3~0) (not (= ~n3~0 0)))), 469205#(and (or (= ~n2~0 ~n1~0) (< ~n1~0 ~n2~0) (< ~n3~0 ~n1~0)) (or (not (= ~n1~0 0)) (< ~n3~0 ~n2~0) (< ~n3~0 ~n1~0)) (or (not (= ~n3~0 0)) (not (= ~n1~0 0))) (or (= ~n2~0 ~n1~0) (not (= ~n3~0 0)) (< ~n1~0 ~n2~0))), 469208#(and (or (< ~n1~0 ~n3~0) (not (= ~n3~0 0)) (< ~n2~0 ~n1~0)) (or (not (= ~n1~0 0)) (< ~n3~0 ~n1~0) (< ~n2~0 ~n1~0)) (or (< ~n1~0 ~n3~0) (not (= ~n3~0 0)) (not (= ~n2~0 0)))), 469210#(and (or (<= 0 ~n1~0) (< ~n1~0 ~n2~0) (not (< ~n3~0 ~n1~0))) (or (not (< ~n1~0 ~n2~0)) (<= 0 ~n2~0) (not (< ~n3~0 ~n1~0))) (or (not (< ~n3~0 ~n2~0)) (<= 0 ~n2~0) (< ~n3~0 ~n1~0)) (or (<= 0 ~n3~0) (< ~n3~0 ~n2~0) (< ~n3~0 ~n1~0))), 469202#(and (or (< ~n3~0 ~n2~0) (< ~n3~0 ~n1~0)) (not (= ~n3~0 0))), 469199#(and (or (< ~n1~0 ~n3~0) (= ~n1~0 ~n3~0)) (not (= ~n1~0 0))), 469198#(and (not (= ~n3~0 0)) (< ~n3~0 ~n2~0)), 469206#(and (or (not (= ~n3~0 0)) (not (= ~n1~0 0)) (< ~n2~0 ~n1~0)) (or (not (= ~n3~0 0)) (not (= ~n2~0 0)) (< ~n1~0 ~n2~0)) (or (not (= ~n1~0 0)) (< ~n3~0 ~n2~0) (< ~n2~0 ~n1~0)) (or (not (= ~n2~0 0)) (< ~n1~0 ~n2~0) (< ~n3~0 ~n1~0))), 469204#(and (or (not (= ~n3~0 0)) (not (= ~n1~0 0))) (or (= ~n2~0 ~n1~0) (< ~n3~0 ~n2~0) (< ~n1~0 ~n2~0)) (or (= ~n2~0 ~n1~0) (not (= ~n3~0 0)) (< ~n1~0 ~n2~0)) (or (not (= ~n1~0 0)) (< ~n3~0 ~n2~0)))] [2022-03-15 18:52:55,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 18:52:55,064 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:52:55,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 18:52:55,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2022-03-15 18:52:55,065 INFO L87 Difference]: Start difference. First operand 9894 states and 29669 transitions. Second operand has 21 states, 21 states have (on average 8.238095238095237) internal successors, (173), 20 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:52:55,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:52:55,619 INFO L93 Difference]: Finished difference Result 11428 states and 34062 transitions. [2022-03-15 18:52:55,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 18:52:55,620 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 8.238095238095237) internal successors, (173), 20 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-03-15 18:52:55,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:52:55,640 INFO L225 Difference]: With dead ends: 11428 [2022-03-15 18:52:55,641 INFO L226 Difference]: Without dead ends: 10708 [2022-03-15 18:52:55,641 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 444 SyntacticMatches, 10 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=178, Invalid=578, Unknown=0, NotChecked=0, Total=756 [2022-03-15 18:52:55,641 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 289 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 873 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:52:55,641 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [289 Valid, 342 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 873 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:52:55,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10708 states. [2022-03-15 18:52:55,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10708 to 9950. [2022-03-15 18:52:55,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9950 states, 9949 states have (on average 2.9917579656246858) internal successors, (29765), 9949 states have internal predecessors, (29765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:52:55,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9950 states to 9950 states and 29765 transitions. [2022-03-15 18:52:55,789 INFO L78 Accepts]: Start accepts. Automaton has 9950 states and 29765 transitions. Word has length 49 [2022-03-15 18:52:55,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:52:55,789 INFO L470 AbstractCegarLoop]: Abstraction has 9950 states and 29765 transitions. [2022-03-15 18:52:55,789 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 8.238095238095237) internal successors, (173), 20 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:52:55,790 INFO L276 IsEmpty]: Start isEmpty. Operand 9950 states and 29765 transitions. [2022-03-15 18:52:55,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-15 18:52:55,804 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:52:55,804 INFO L514 BasicCegarLoop]: 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] [2022-03-15 18:52:55,805 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-03-15 18:52:55,805 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:52:55,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:52:55,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1078624357, now seen corresponding path program 18 times [2022-03-15 18:52:55,807 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:52:55,807 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62775779] [2022-03-15 18:52:55,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:52:55,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:52:55,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:52:56,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:52:56,062 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:52:56,062 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62775779] [2022-03-15 18:52:56,062 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62775779] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:52:56,062 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:52:56,063 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 18:52:56,063 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [259729054] [2022-03-15 18:52:56,063 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:52:56,067 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:52:56,176 INFO L252 McrAutomatonBuilder]: Finished intersection with 528 states and 1394 transitions. [2022-03-15 18:52:56,176 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:53:08,931 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [500575#(and (or (< ~n1~0 (+ ~n3~0 1)) (not (= (+ ~n3~0 1) 0))) (or (< (+ ~n3~0 1) ~n1~0) (not (= ~n1~0 0)))), 500569#(and (or (not (= ~n3~0 0)) (not (= ~n2~0 0))) (or (not (= ~n2~0 0)) (< ~n3~0 ~n2~0) (< ~n3~0 ~n1~0)) (or (< ~n3~0 ~n2~0) (< ~n2~0 ~n1~0)) (or (not (= ~n3~0 0)) (< ~n2~0 ~n1~0))), 500582#(and (or (= ~n1~0 0) (not (< ~n3~0 ~n1~0))) (or (= ~n3~0 0) (< ~n3~0 ~n1~0))), 500564#(and (not (= ~n3~0 0)) (< ~n3~0 ~n2~0)), 500577#(and (<= (+ 2 ~n3~0) ~n1~0) (<= 0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), 500565#(and (or (< ~n1~0 ~n3~0) (= ~n1~0 ~n3~0)) (not (= ~n1~0 0))), 500571#(and (or (= ~n2~0 ~n1~0) (< ~n1~0 ~n2~0) (< ~n3~0 ~n1~0)) (or (not (= ~n1~0 0)) (< ~n3~0 ~n2~0) (< ~n3~0 ~n1~0)) (or (not (= ~n3~0 0)) (not (= ~n1~0 0))) (or (= ~n2~0 ~n1~0) (not (= ~n3~0 0)) (< ~n1~0 ~n2~0))), 500580#(and (or (not (< ~n2~0 ~n1~0)) (<= ~n3~0 ~n1~0) (= ~n3~0 0)) (or (<= 1 ~n3~0) (<= ~n1~0 0) (< ~n3~0 ~n2~0)) (or (not (< ~n3~0 ~n2~0)) (<= 1 ~n2~0) (<= ~n1~0 0)) (or (<= 1 ~n3~0) (= ~n3~0 0) (< ~n3~0 ~n2~0)) (or (= ~n2~0 0) (not (< ~n3~0 ~n2~0)) (<= 1 ~n2~0)) (or (<= ~n3~0 ~n2~0) (= ~n3~0 0) (< ~n2~0 ~n1~0))), 500578#(and (or (<= (+ ~n3~0 1) ~n1~0) (< ~n1~0 ~n2~0)) (or (not (< ~n1~0 ~n2~0)) (<= (+ ~n3~0 1) ~n2~0)) (or (<= 1 ~n3~0) (= ~n3~0 0))), 500570#(and (or (not (= ~n3~0 0)) (not (= ~n1~0 0))) (or (= ~n2~0 ~n1~0) (< ~n3~0 ~n2~0) (< ~n1~0 ~n2~0)) (or (= ~n2~0 ~n1~0) (not (= ~n3~0 0)) (< ~n1~0 ~n2~0)) (or (not (= ~n1~0 0)) (< ~n3~0 ~n2~0))), 500568#(and (or (< ~n3~0 ~n2~0) (< ~n3~0 ~n1~0)) (not (= ~n3~0 0))), 500579#(and (or (not (< ~n2~0 ~n1~0)) (<= ~n3~0 ~n1~0) (= ~n3~0 0)) (or (<= 1 ~n3~0) (<= ~n1~0 0)) (or (<= 1 ~n3~0) (= ~n3~0 0)) (or (<= ~n3~0 ~n2~0) (= ~n3~0 0) (< ~n2~0 ~n1~0)) (or (= ~n2~0 ~n1~0) (= ~n2~0 ~n3~0) (= ~n3~0 0) (< ~n2~0 ~n1~0))), 500576#(and (or (< ~n1~0 (+ ~n3~0 1)) (not (= (+ ~n3~0 1) 0)) (< ~n2~0 ~n1~0)) (or (< (+ ~n3~0 1) ~n1~0) (not (= ~n1~0 0)) (< ~n2~0 ~n1~0)) (or (< ~n1~0 (+ ~n3~0 1)) (not (= (+ ~n3~0 1) 0)) (not (= ~n2~0 0)))), 500581#(and (or (<= 1 ~n3~0) (= ~n3~0 0) (< ~n3~0 ~n2~0) (< ~n3~0 ~n1~0)) (or (= ~n2~0 0) (not (< ~n1~0 ~n2~0)) (<= 1 ~n2~0) (not (< ~n3~0 ~n1~0))) (or (<= ~n3~0 ~n2~0) (= ~n3~0 0) (< ~n2~0 ~n1~0)) (or (<= 1 ~n1~0) (= ~n1~0 0) (< ~n1~0 ~n2~0) (not (< ~n3~0 ~n1~0))) (or (= ~n2~0 0) (not (< ~n3~0 ~n2~0)) (<= 1 ~n2~0) (< ~n3~0 ~n1~0)) (or (<= ~n3~0 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0))), 500572#(and (or (not (= ~n3~0 0)) (not (= ~n1~0 0)) (< ~n2~0 ~n1~0)) (or (not (= ~n3~0 0)) (not (= ~n2~0 0)) (< ~n1~0 ~n2~0)) (or (not (= ~n1~0 0)) (< ~n3~0 ~n2~0) (< ~n2~0 ~n1~0)) (or (not (= ~n2~0 0)) (< ~n1~0 ~n2~0) (< ~n3~0 ~n1~0))), 500573#(and (or (not (= ~n1~0 0)) (< ~n3~0 ~n1~0)) (or (< ~n1~0 ~n3~0) (not (= ~n3~0 0)))), 500567#(and (or (< ~n3~0 ~n1~0) (< ~n2~0 ~n1~0)) (or (not (= ~n3~0 0)) (not (= ~n2~0 0))) (or (not (= ~n2~0 0)) (< ~n3~0 ~n1~0)) (or (not (= ~n3~0 0)) (< ~n2~0 ~n1~0))), 500574#(and (or (< ~n1~0 ~n3~0) (not (= ~n3~0 0)) (< ~n2~0 ~n1~0)) (or (not (= ~n1~0 0)) (< ~n3~0 ~n1~0) (< ~n2~0 ~n1~0)) (or (< ~n1~0 ~n3~0) (not (= ~n3~0 0)) (not (= ~n2~0 0)))), 500566#(and (not (= ~n3~0 0)) (< ~n3~0 ~n1~0))] [2022-03-15 18:53:08,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-03-15 18:53:08,931 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:53:08,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-03-15 18:53:08,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=725, Unknown=0, NotChecked=0, Total=870 [2022-03-15 18:53:08,932 INFO L87 Difference]: Start difference. First operand 9950 states and 29765 transitions. Second operand has 30 states, 30 states have (on average 6.733333333333333) internal successors, (202), 29 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:10,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:53:10,615 INFO L93 Difference]: Finished difference Result 15888 states and 47265 transitions. [2022-03-15 18:53:10,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 18:53:10,615 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 6.733333333333333) internal successors, (202), 29 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-03-15 18:53:10,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:53:10,645 INFO L225 Difference]: With dead ends: 15888 [2022-03-15 18:53:10,645 INFO L226 Difference]: Without dead ends: 15232 [2022-03-15 18:53:10,645 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 422 SyntacticMatches, 24 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 581 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=391, Invalid=1771, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 18:53:10,646 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 852 mSDsluCounter, 1890 mSDsCounter, 0 mSdLazyCounter, 2336 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 852 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 2607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 2336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 18:53:10,646 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [852 Valid, 983 Invalid, 2607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 2336 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 18:53:10,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15232 states. [2022-03-15 18:53:10,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15232 to 10430. [2022-03-15 18:53:10,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10430 states, 10429 states have (on average 2.999232908236648) internal successors, (31279), 10429 states have internal predecessors, (31279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:10,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10430 states to 10430 states and 31279 transitions. [2022-03-15 18:53:10,831 INFO L78 Accepts]: Start accepts. Automaton has 10430 states and 31279 transitions. Word has length 49 [2022-03-15 18:53:10,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:53:10,831 INFO L470 AbstractCegarLoop]: Abstraction has 10430 states and 31279 transitions. [2022-03-15 18:53:10,831 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 6.733333333333333) internal successors, (202), 29 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:10,831 INFO L276 IsEmpty]: Start isEmpty. Operand 10430 states and 31279 transitions. [2022-03-15 18:53:10,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-15 18:53:10,846 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:53:10,846 INFO L514 BasicCegarLoop]: 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] [2022-03-15 18:53:10,846 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-03-15 18:53:10,846 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:53:10,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:53:10,848 INFO L85 PathProgramCache]: Analyzing trace with hash -616532955, now seen corresponding path program 19 times [2022-03-15 18:53:10,849 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:53:10,849 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420502193] [2022-03-15 18:53:10,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:53:10,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:53:10,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:53:10,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:53:10,889 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:53:10,889 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420502193] [2022-03-15 18:53:10,889 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420502193] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:53:10,889 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:53:10,889 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 18:53:10,889 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1539142972] [2022-03-15 18:53:10,889 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:53:10,893 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:53:10,929 INFO L252 McrAutomatonBuilder]: Finished intersection with 198 states and 387 transitions. [2022-03-15 18:53:10,929 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:53:11,480 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 18:53:11,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 18:53:11,481 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:53:11,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 18:53:11,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 18:53:11,481 INFO L87 Difference]: Start difference. First operand 10430 states and 31279 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:11,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:53:11,555 INFO L93 Difference]: Finished difference Result 9788 states and 28711 transitions. [2022-03-15 18:53:11,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 18:53:11,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-03-15 18:53:11,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:53:11,574 INFO L225 Difference]: With dead ends: 9788 [2022-03-15 18:53:11,574 INFO L226 Difference]: Without dead ends: 9734 [2022-03-15 18:53:11,574 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 101 SyntacticMatches, 50 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 18:53:11,575 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 14 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 18:53:11,575 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 30 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 18:53:11,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9734 states. [2022-03-15 18:53:11,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9734 to 9636. [2022-03-15 18:53:11,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9636 states, 9635 states have (on average 2.9429164504411003) internal successors, (28355), 9635 states have internal predecessors, (28355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:11,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9636 states to 9636 states and 28355 transitions. [2022-03-15 18:53:11,711 INFO L78 Accepts]: Start accepts. Automaton has 9636 states and 28355 transitions. Word has length 49 [2022-03-15 18:53:11,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:53:11,711 INFO L470 AbstractCegarLoop]: Abstraction has 9636 states and 28355 transitions. [2022-03-15 18:53:11,711 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:11,712 INFO L276 IsEmpty]: Start isEmpty. Operand 9636 states and 28355 transitions. [2022-03-15 18:53:11,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-15 18:53:11,726 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:53:11,726 INFO L514 BasicCegarLoop]: 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] [2022-03-15 18:53:11,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-03-15 18:53:11,726 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:53:11,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:53:11,726 INFO L85 PathProgramCache]: Analyzing trace with hash 122044125, now seen corresponding path program 20 times [2022-03-15 18:53:11,727 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:53:11,727 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894761520] [2022-03-15 18:53:11,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:53:11,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:53:11,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:53:11,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:53:11,811 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:53:11,811 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894761520] [2022-03-15 18:53:11,811 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894761520] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:53:11,812 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:53:11,812 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 18:53:11,812 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1421555274] [2022-03-15 18:53:11,812 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:53:11,816 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:53:11,937 INFO L252 McrAutomatonBuilder]: Finished intersection with 394 states and 955 transitions. [2022-03-15 18:53:11,938 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:53:18,152 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [566440#(and (or (= ~n3~0 0) (< ~n3~0 ~n2~0)) (= ~n1~0 0) (or (= ~n2~0 0) (not (< ~n3~0 ~n2~0)))), 566435#(and (or (< ~n3~0 ~n1~0) (< ~n2~0 ~n1~0)) (or (not (= ~n3~0 0)) (not (= ~n2~0 0))) (or (not (= ~n2~0 0)) (< ~n3~0 ~n1~0)) (or (not (= ~n3~0 0)) (< ~n2~0 ~n1~0))), 566437#(and (or (= ~n2~0 ~n1~0) (< ~n3~0 ~n1~0) (< ~n2~0 ~n1~0)) (or (= ~n2~0 ~n1~0) (not (= ~n3~0 0)) (< ~n2~0 ~n1~0)) (or (not (= ~n3~0 0)) (not (= ~n2~0 0))) (or (<= 1 ~n1~0) (< ~n3~0 ~n1~0) (< ~n2~0 ~n1~0)) (or (not (= ~n2~0 0)) (< ~n3~0 ~n1~0))), 566443#(and (or (< (+ ~n3~0 1) ~n1~0) (< ~n2~0 ~n1~0)) (or (< (+ ~n3~0 1) ~n1~0) (not (= ~n2~0 0))) (or (not (= (+ ~n3~0 1) 0)) (not (= ~n2~0 0))) (or (not (= (+ ~n3~0 1) 0)) (< ~n2~0 ~n1~0))), 566449#(and (= ~n2~0 0) (or (= ~n3~0 0) (< ~n3~0 ~n1~0)) (= ~n1~0 0)), 566444#(and (or (<= 1 ~n1~0) (< (+ ~n3~0 1) ~n1~0)) (or (= ~n2~0 ~n1~0) (< (+ ~n3~0 1) ~n1~0)) (or (= ~n2~0 ~n1~0) (not (= (+ ~n3~0 1) 0)))), 566442#(and (not (= (+ ~n3~0 1) 0)) (< (+ ~n3~0 1) ~n1~0)), 566439#(and (or (= ~n2~0 0) (< ~n2~0 ~n1~0)) (= ~n3~0 0) (= ~n1~0 0)), 566441#(and (or (= ~n3~0 0) (< ~n3~0 ~n1~0)) (= ~n1~0 0) (<= ~n2~0 ~n1~0)), 566436#(and (or (<= 1 ~n1~0) (< ~n3~0 ~n1~0)) (or (= ~n2~0 ~n1~0) (< ~n3~0 ~n1~0)) (or (= ~n2~0 ~n1~0) (not (= ~n3~0 0)))), 566446#(and (<= 1 ~n1~0) (< ~n1~0 (+ 2 ~n2~0)) (<= (+ ~n2~0 1) ~n1~0)), 566445#(and (or (< (+ ~n3~0 1) ~n1~0) (not (= ~n2~0 0))) (or (not (= (+ ~n3~0 1) 0)) (not (= ~n2~0 0))) (or (= ~n2~0 ~n1~0) (< (+ ~n3~0 1) ~n1~0) (< ~n2~0 ~n1~0)) (or (<= 1 ~n1~0) (< (+ ~n3~0 1) ~n1~0) (< ~n2~0 ~n1~0)) (or (= ~n2~0 ~n1~0) (not (= (+ ~n3~0 1) 0)) (< ~n2~0 ~n1~0))), 566438#(and (or (not (= (+ ~n2~0 1) 0)) (not (= ~n3~0 0))) (or (= (+ ~n2~0 1) ~n1~0) (< (+ ~n2~0 1) ~n1~0) (not (= ~n3~0 0))) (or (= (+ ~n2~0 1) ~n1~0) (< (+ ~n2~0 1) ~n1~0) (< ~n3~0 ~n1~0)) (or (not (= (+ ~n2~0 1) 0)) (< ~n3~0 ~n1~0)) (or (<= 1 ~n1~0) (< (+ ~n2~0 1) ~n1~0) (< ~n3~0 ~n1~0))), 566447#(and (= ~n1~0 0) (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)), 566434#(and (not (= ~n3~0 0)) (< ~n3~0 ~n1~0)), 566448#(and (<= 1 ~n2~0) (<= ~n2~0 1) (or (< ~n1~0 ~n3~0) (= ~n1~0 0)) (or (not (< ~n1~0 ~n3~0)) (= ~n3~0 0)))] [2022-03-15 18:53:18,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 18:53:18,153 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:53:18,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 18:53:18,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2022-03-15 18:53:18,153 INFO L87 Difference]: Start difference. First operand 9636 states and 28355 transitions. Second operand has 22 states, 22 states have (on average 7.0) internal successors, (154), 21 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:19,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:53:19,113 INFO L93 Difference]: Finished difference Result 12960 states and 37655 transitions. [2022-03-15 18:53:19,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 18:53:19,114 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 7.0) internal successors, (154), 21 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-03-15 18:53:19,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:53:19,138 INFO L225 Difference]: With dead ends: 12960 [2022-03-15 18:53:19,139 INFO L226 Difference]: Without dead ends: 12398 [2022-03-15 18:53:19,139 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 292 SyntacticMatches, 23 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=118, Invalid=638, Unknown=0, NotChecked=0, Total=756 [2022-03-15 18:53:19,139 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 388 mSDsluCounter, 1169 mSDsCounter, 0 mSdLazyCounter, 1596 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 1672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 18:53:19,140 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [388 Valid, 598 Invalid, 1672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1596 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 18:53:19,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12398 states. [2022-03-15 18:53:19,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12398 to 9846. [2022-03-15 18:53:19,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9846 states, 9845 states have (on average 2.946368715083799) internal successors, (29007), 9845 states have internal predecessors, (29007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:19,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9846 states to 9846 states and 29007 transitions. [2022-03-15 18:53:19,315 INFO L78 Accepts]: Start accepts. Automaton has 9846 states and 29007 transitions. Word has length 49 [2022-03-15 18:53:19,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:53:19,315 INFO L470 AbstractCegarLoop]: Abstraction has 9846 states and 29007 transitions. [2022-03-15 18:53:19,315 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 7.0) internal successors, (154), 21 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:19,316 INFO L276 IsEmpty]: Start isEmpty. Operand 9846 states and 29007 transitions. [2022-03-15 18:53:19,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-15 18:53:19,330 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:53:19,330 INFO L514 BasicCegarLoop]: 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] [2022-03-15 18:53:19,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-03-15 18:53:19,330 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:53:19,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:53:19,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1836349287, now seen corresponding path program 21 times [2022-03-15 18:53:19,332 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:53:19,332 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425399402] [2022-03-15 18:53:19,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:53:19,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:53:19,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:53:19,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:53:19,409 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:53:19,410 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425399402] [2022-03-15 18:53:19,410 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425399402] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:53:19,410 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:53:19,410 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-15 18:53:19,411 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [417382311] [2022-03-15 18:53:19,411 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:53:19,419 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:53:19,478 INFO L252 McrAutomatonBuilder]: Finished intersection with 324 states and 757 transitions. [2022-03-15 18:53:19,478 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:53:21,725 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 18:53:21,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 18:53:21,726 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:53:21,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 18:53:21,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-03-15 18:53:21,726 INFO L87 Difference]: Start difference. First operand 9846 states and 29007 transitions. Second operand has 9 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:22,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:53:22,094 INFO L93 Difference]: Finished difference Result 10969 states and 31802 transitions. [2022-03-15 18:53:22,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 18:53:22,094 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-03-15 18:53:22,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:53:22,113 INFO L225 Difference]: With dead ends: 10969 [2022-03-15 18:53:22,113 INFO L226 Difference]: Without dead ends: 10106 [2022-03-15 18:53:22,114 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 270 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-03-15 18:53:22,114 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 174 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:53:22,114 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 127 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:53:22,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10106 states. [2022-03-15 18:53:22,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10106 to 9264. [2022-03-15 18:53:22,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9264 states, 9263 states have (on average 2.9387887293533415) internal successors, (27222), 9263 states have internal predecessors, (27222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:22,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9264 states to 9264 states and 27222 transitions. [2022-03-15 18:53:22,260 INFO L78 Accepts]: Start accepts. Automaton has 9264 states and 27222 transitions. Word has length 49 [2022-03-15 18:53:22,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:53:22,260 INFO L470 AbstractCegarLoop]: Abstraction has 9264 states and 27222 transitions. [2022-03-15 18:53:22,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:22,260 INFO L276 IsEmpty]: Start isEmpty. Operand 9264 states and 27222 transitions. [2022-03-15 18:53:22,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-15 18:53:22,273 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:53:22,274 INFO L514 BasicCegarLoop]: 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] [2022-03-15 18:53:22,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-03-15 18:53:22,274 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:53:22,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:53:22,274 INFO L85 PathProgramCache]: Analyzing trace with hash -538732737, now seen corresponding path program 22 times [2022-03-15 18:53:22,275 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:53:22,275 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540015348] [2022-03-15 18:53:22,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:53:22,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:53:22,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:53:22,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:53:22,411 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:53:22,411 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540015348] [2022-03-15 18:53:22,411 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540015348] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:53:22,411 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:53:22,411 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 18:53:22,411 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2048802802] [2022-03-15 18:53:22,411 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:53:22,415 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:53:22,525 INFO L252 McrAutomatonBuilder]: Finished intersection with 514 states and 1360 transitions. [2022-03-15 18:53:22,525 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:53:32,102 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [628642#(and (not (= ~n3~0 0)) (< ~n3~0 ~n2~0)), 628655#(and (= ~n2~0 0) (= ~n1~0 0) (or (= ~n1~0 ~n3~0) (< ~n3~0 ~n1~0))), 628649#(and (or (< ~n1~0 ~n3~0) (not (= ~n3~0 0)) (< ~n2~0 ~n1~0)) (or (not (= ~n1~0 0)) (< ~n3~0 ~n1~0) (< ~n2~0 ~n1~0)) (or (< ~n1~0 ~n3~0) (not (= ~n3~0 0)) (not (= ~n2~0 0)))), 628651#(and (<= 0 ~n1~0) (< ~n3~0 (+ 2 ~n1~0)) (<= (+ ~n1~0 1) ~n3~0)), 628648#(and (or (not (= ~n1~0 0)) (< ~n3~0 ~n1~0) (< ~n2~0 ~n1~0)) (or (not (= ~n3~0 0)) (not (= ~n2~0 0)) (< ~n1~0 ~n2~0)) (or (not (= ~n2~0 0)) (< ~n1~0 ~n2~0) (< ~n3~0 ~n1~0))), 628653#(and (or (= ~n2~0 ~n1~0) (not (< ~n3~0 ~n2~0))) (= ~n1~0 0) (or (= ~n1~0 ~n3~0) (< ~n3~0 ~n2~0))), 628645#(and (or (= ~n2~0 ~n1~0) (< ~n1~0 ~n2~0) (< ~n3~0 ~n1~0)) (or (not (= ~n1~0 0)) (< ~n3~0 ~n1~0)) (or (= ~n2~0 ~n1~0) (not (= ~n3~0 0)) (< ~n1~0 ~n2~0))), 628643#(and (or (= ~n2~0 0) (< ~n2~0 ~n1~0)) (= ~n1~0 0) (= ~n1~0 ~n3~0)), 628646#(and (or (< ~n1~0 ~n3~0) (= ~n1~0 ~n3~0)) (not (= ~n1~0 0))), 628641#(and (or (< ~n3~0 ~n1~0) (< ~n2~0 ~n1~0)) (or (not (= ~n3~0 0)) (not (= ~n2~0 0))) (or (not (= ~n2~0 0)) (< ~n3~0 ~n1~0)) (or (not (= ~n3~0 0)) (< ~n2~0 ~n1~0))), 628647#(and (or (not (= ~n1~0 0)) (< ~n3~0 ~n1~0)) (or (< ~n1~0 ~n3~0) (not (= ~n3~0 0)))), 628650#(and (or (= (+ ~n1~0 1) ~n3~0) (< (+ ~n1~0 1) ~n3~0)) (not (= (+ ~n1~0 1) 0))), 628654#(and (= ~n1~0 0) (or (= ~n1~0 ~n3~0) (< ~n3~0 ~n1~0)) (<= ~n2~0 ~n1~0)), 628652#(and (<= ~n3~0 (+ ~n1~0 1)) (= ~n2~0 0) (<= 1 ~n3~0) (<= (+ ~n1~0 1) ~n3~0)), 628644#(and (not (= ~n1~0 0)) (or (= ~n2~0 ~n1~0) (< ~n1~0 ~n2~0))), 628640#(and (not (= ~n3~0 0)) (< ~n3~0 ~n1~0))] [2022-03-15 18:53:32,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 18:53:32,102 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:53:32,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 18:53:32,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2022-03-15 18:53:32,103 INFO L87 Difference]: Start difference. First operand 9264 states and 27222 transitions. Second operand has 22 states, 22 states have (on average 8.181818181818182) internal successors, (180), 21 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:33,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:53:33,107 INFO L93 Difference]: Finished difference Result 10166 states and 28778 transitions. [2022-03-15 18:53:33,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 18:53:33,108 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 8.181818181818182) internal successors, (180), 21 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-03-15 18:53:33,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:53:33,125 INFO L225 Difference]: With dead ends: 10166 [2022-03-15 18:53:33,126 INFO L226 Difference]: Without dead ends: 9646 [2022-03-15 18:53:33,127 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 413 SyntacticMatches, 26 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=199, Invalid=991, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 18:53:33,128 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 358 mSDsluCounter, 1449 mSDsCounter, 0 mSdLazyCounter, 1887 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 2004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 1887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 18:53:33,128 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [358 Valid, 706 Invalid, 2004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 1887 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 18:53:33,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9646 states. [2022-03-15 18:53:33,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9646 to 7630. [2022-03-15 18:53:33,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7630 states, 7629 states have (on average 2.8951369773233715) internal successors, (22087), 7629 states have internal predecessors, (22087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:33,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7630 states to 7630 states and 22087 transitions. [2022-03-15 18:53:33,282 INFO L78 Accepts]: Start accepts. Automaton has 7630 states and 22087 transitions. Word has length 49 [2022-03-15 18:53:33,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:53:33,283 INFO L470 AbstractCegarLoop]: Abstraction has 7630 states and 22087 transitions. [2022-03-15 18:53:33,283 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 8.181818181818182) internal successors, (180), 21 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:33,283 INFO L276 IsEmpty]: Start isEmpty. Operand 7630 states and 22087 transitions. [2022-03-15 18:53:33,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-15 18:53:33,293 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:53:33,293 INFO L514 BasicCegarLoop]: 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] [2022-03-15 18:53:33,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-03-15 18:53:33,294 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:53:33,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:53:33,295 INFO L85 PathProgramCache]: Analyzing trace with hash -110129641, now seen corresponding path program 23 times [2022-03-15 18:53:33,296 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:53:33,296 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465525176] [2022-03-15 18:53:33,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:53:33,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:53:33,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:53:33,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:53:33,368 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:53:33,368 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465525176] [2022-03-15 18:53:33,368 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465525176] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:53:33,368 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:53:33,369 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-15 18:53:33,369 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1421625076] [2022-03-15 18:53:33,369 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:53:33,373 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:53:33,418 INFO L252 McrAutomatonBuilder]: Finished intersection with 274 states and 619 transitions. [2022-03-15 18:53:33,418 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:53:34,784 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 18:53:34,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 18:53:34,785 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:53:34,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 18:53:34,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-03-15 18:53:34,785 INFO L87 Difference]: Start difference. First operand 7630 states and 22087 transitions. Second operand has 9 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:35,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:53:35,141 INFO L93 Difference]: Finished difference Result 8281 states and 23630 transitions. [2022-03-15 18:53:35,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 18:53:35,141 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-03-15 18:53:35,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:53:35,154 INFO L225 Difference]: With dead ends: 8281 [2022-03-15 18:53:35,154 INFO L226 Difference]: Without dead ends: 7728 [2022-03-15 18:53:35,154 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 219 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-03-15 18:53:35,155 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 186 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:53:35,155 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 125 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:53:35,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7728 states. [2022-03-15 18:53:35,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7728 to 7062. [2022-03-15 18:53:35,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7062 states, 7061 states have (on average 2.878912335363263) internal successors, (20328), 7061 states have internal predecessors, (20328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:35,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7062 states to 7062 states and 20328 transitions. [2022-03-15 18:53:35,251 INFO L78 Accepts]: Start accepts. Automaton has 7062 states and 20328 transitions. Word has length 49 [2022-03-15 18:53:35,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:53:35,251 INFO L470 AbstractCegarLoop]: Abstraction has 7062 states and 20328 transitions. [2022-03-15 18:53:35,251 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:35,251 INFO L276 IsEmpty]: Start isEmpty. Operand 7062 states and 20328 transitions. [2022-03-15 18:53:35,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-15 18:53:35,261 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:53:35,261 INFO L514 BasicCegarLoop]: 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] [2022-03-15 18:53:35,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-03-15 18:53:35,262 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:53:35,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:53:35,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1422289143, now seen corresponding path program 24 times [2022-03-15 18:53:35,263 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:53:35,263 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334955292] [2022-03-15 18:53:35,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:53:35,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:53:35,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:53:35,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:53:35,330 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:53:35,330 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334955292] [2022-03-15 18:53:35,330 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334955292] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:53:35,330 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:53:35,330 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-15 18:53:35,330 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [945084993] [2022-03-15 18:53:35,330 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:53:35,334 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:53:35,453 INFO L252 McrAutomatonBuilder]: Finished intersection with 434 states and 1068 transitions. [2022-03-15 18:53:35,454 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:53:43,310 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [676555#(and (= ~n1~0 0) (or (= ~n1~0 ~n3~0) (< ~n3~0 ~n1~0)) (<= ~n2~0 ~n1~0)), 676544#(and (not (= ~n3~0 0)) (< ~n3~0 ~n2~0)), 676548#(and (or (< ~n1~0 ~n3~0) (<= 1 ~n3~0) (= ~n1~0 ~n3~0)) (or (<= (+ ~n3~0 1) ~n2~0) (not (= ~n1~0 0))) (or (< ~n1~0 ~n3~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0)) (or (<= 1 ~n3~0) (not (= ~n1~0 0)))), 676549#(and (or (< ~n1~0 ~n3~0) (not (= ~n3~0 0))) (or (<= (+ ~n3~0 1) ~n2~0) (not (= ~n1~0 0)) (< ~n3~0 ~n1~0))), 676545#(and (or (not (= ~n3~0 0)) (not (= ~n1~0 0))) (or (= ~n2~0 ~n1~0) (< ~n3~0 ~n2~0) (< ~n1~0 ~n2~0)) (or (= ~n2~0 ~n1~0) (not (= ~n3~0 0)) (< ~n1~0 ~n2~0)) (or (not (= ~n1~0 0)) (< ~n3~0 ~n2~0))), 676546#(and (or (< ~n3~0 ~n2~0) (< ~n3~0 ~n1~0)) (not (= ~n3~0 0))), 676554#(and (or (= ~n2~0 ~n1~0) (not (< ~n3~0 ~n2~0))) (= ~n1~0 0) (or (= ~n1~0 ~n3~0) (< ~n3~0 ~n2~0))), 676550#(and (or (not (= ~n3~0 0)) (not (= ~n2~0 0))) (or (not (= ~n2~0 0)) (< ~n3~0 ~n2~0) (< ~n3~0 ~n1~0)) (or (< ~n3~0 ~n2~0) (< ~n2~0 ~n1~0)) (or (not (= ~n3~0 0)) (< ~n2~0 ~n1~0))), 676552#(and (or (< ~n1~0 ~n3~0) (not (= ~n3~0 0)) (< ~n2~0 ~n1~0)) (or (<= (+ ~n3~0 1) ~n2~0) (not (= ~n1~0 0)) (< ~n2~0 ~n1~0)) (or (< ~n1~0 ~n3~0) (not (= ~n3~0 0)) (not (= ~n2~0 0)))), 676553#(and (or (<= 0 ~n3~0) (< ~n3~0 ~n2~0)) (or (not (< ~n3~0 ~n2~0)) (<= 0 ~n2~0))), 676551#(and (or (not (= ~n3~0 0)) (not (= ~n2~0 0))) (or (<= (+ ~n3~0 1) ~n2~0) (< ~n2~0 ~n1~0)) (or (not (= ~n2~0 0)) (< ~n3~0 ~n1~0)) (or (<= 1 ~n3~0) (< ~n3~0 ~n1~0) (< ~n2~0 ~n1~0)) (or (not (= ~n3~0 0)) (< ~n2~0 ~n1~0))), 676547#(and (or (<= (+ ~n3~0 1) ~n2~0) (< ~n3~0 ~n1~0)) (or (<= 1 ~n3~0) (< ~n3~0 ~n1~0)) (not (= ~n3~0 0)))] [2022-03-15 18:53:43,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 18:53:43,311 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:53:43,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 18:53:43,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2022-03-15 18:53:43,311 INFO L87 Difference]: Start difference. First operand 7062 states and 20328 transitions. Second operand has 20 states, 20 states have (on average 8.0) internal successors, (160), 19 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:43,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:53:43,787 INFO L93 Difference]: Finished difference Result 7556 states and 21655 transitions. [2022-03-15 18:53:43,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 18:53:43,787 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 8.0) internal successors, (160), 19 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-03-15 18:53:43,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:53:43,800 INFO L225 Difference]: With dead ends: 7556 [2022-03-15 18:53:43,800 INFO L226 Difference]: Without dead ends: 7168 [2022-03-15 18:53:43,800 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 350 SyntacticMatches, 15 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2022-03-15 18:53:43,801 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 231 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 922 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:53:43,801 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [231 Valid, 397 Invalid, 982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 922 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:53:43,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7168 states. [2022-03-15 18:53:43,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7168 to 7134. [2022-03-15 18:53:43,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7134 states, 7133 states have (on average 2.8790130379924297) internal successors, (20536), 7133 states have internal predecessors, (20536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:43,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7134 states to 7134 states and 20536 transitions. [2022-03-15 18:53:43,896 INFO L78 Accepts]: Start accepts. Automaton has 7134 states and 20536 transitions. Word has length 49 [2022-03-15 18:53:43,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:53:43,896 INFO L470 AbstractCegarLoop]: Abstraction has 7134 states and 20536 transitions. [2022-03-15 18:53:43,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 8.0) internal successors, (160), 19 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:43,896 INFO L276 IsEmpty]: Start isEmpty. Operand 7134 states and 20536 transitions. [2022-03-15 18:53:43,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-15 18:53:43,906 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:53:43,906 INFO L514 BasicCegarLoop]: 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] [2022-03-15 18:53:43,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-03-15 18:53:43,906 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:53:43,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:53:43,906 INFO L85 PathProgramCache]: Analyzing trace with hash -327013127, now seen corresponding path program 25 times [2022-03-15 18:53:43,907 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:53:43,907 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544858391] [2022-03-15 18:53:43,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:53:43,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:53:43,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:53:44,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:53:44,050 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:53:44,050 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544858391] [2022-03-15 18:53:44,051 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544858391] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:53:44,051 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:53:44,051 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-15 18:53:44,051 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1853875507] [2022-03-15 18:53:44,051 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:53:44,056 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:53:44,130 INFO L252 McrAutomatonBuilder]: Finished intersection with 386 states and 934 transitions. [2022-03-15 18:53:44,130 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:53:48,869 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [698401#(and (or (not (= ~n1~0 0)) (< ~n3~0 ~n1~0)) (or (< ~n1~0 ~n3~0) (not (= ~n3~0 0)))), 698402#(and (or (< ~n1~0 ~n3~0) (not (= ~n3~0 0)) (< ~n2~0 ~n1~0)) (or (not (= ~n1~0 0)) (< ~n3~0 ~n1~0) (< ~n2~0 ~n1~0)) (or (< ~n1~0 ~n3~0) (not (= ~n3~0 0)) (not (= ~n2~0 0)))), 698399#(and (not (= ~n1~0 0)) (or (= ~n2~0 ~n1~0) (< ~n1~0 ~n2~0))), 698404#(and (= ~n2~0 0) (or (= ~n3~0 0) (< ~n3~0 ~n2~0)) (= ~n1~0 0)), 698397#(and (not (= ~n3~0 0)) (< ~n3~0 ~n2~0)), 698400#(and (or (< ~n1~0 ~n3~0) (= ~n1~0 ~n3~0)) (not (= ~n1~0 0))), 698403#(and (<= 0 ~n1~0) (<= (+ ~n1~0 1) ~n3~0)), 698395#(and (not (= ~n3~0 0)) (< ~n3~0 ~n1~0)), 698396#(and (or (< ~n3~0 ~n1~0) (< ~n2~0 ~n1~0)) (or (not (= ~n3~0 0)) (not (= ~n2~0 0))) (or (not (= ~n2~0 0)) (< ~n3~0 ~n1~0)) (or (not (= ~n3~0 0)) (< ~n2~0 ~n1~0))), 698398#(and (or (not (= ~n3~0 0)) (not (= ~n1~0 0))) (or (= ~n2~0 ~n1~0) (< ~n3~0 ~n2~0) (< ~n1~0 ~n2~0)) (or (= ~n2~0 ~n1~0) (not (= ~n3~0 0)) (< ~n1~0 ~n2~0)) (or (not (= ~n1~0 0)) (< ~n3~0 ~n2~0)))] [2022-03-15 18:53:48,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 18:53:48,870 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:53:48,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 18:53:48,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2022-03-15 18:53:48,870 INFO L87 Difference]: Start difference. First operand 7134 states and 20536 transitions. Second operand has 17 states, 17 states have (on average 8.529411764705882) internal successors, (145), 16 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:49,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:53:49,450 INFO L93 Difference]: Finished difference Result 8064 states and 22793 transitions. [2022-03-15 18:53:49,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 18:53:49,451 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 8.529411764705882) internal successors, (145), 16 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-03-15 18:53:49,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:53:49,464 INFO L225 Difference]: With dead ends: 8064 [2022-03-15 18:53:49,464 INFO L226 Difference]: Without dead ends: 7802 [2022-03-15 18:53:49,464 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 288 SyntacticMatches, 23 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2022-03-15 18:53:49,465 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 246 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 1266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 18:53:49,465 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [246 Valid, 426 Invalid, 1266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1156 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 18:53:49,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7802 states. [2022-03-15 18:53:49,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7802 to 6590. [2022-03-15 18:53:49,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6590 states, 6589 states have (on average 2.8884504477158903) internal successors, (19032), 6589 states have internal predecessors, (19032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:49,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6590 states to 6590 states and 19032 transitions. [2022-03-15 18:53:49,556 INFO L78 Accepts]: Start accepts. Automaton has 6590 states and 19032 transitions. Word has length 49 [2022-03-15 18:53:49,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:53:49,556 INFO L470 AbstractCegarLoop]: Abstraction has 6590 states and 19032 transitions. [2022-03-15 18:53:49,556 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 8.529411764705882) internal successors, (145), 16 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:49,556 INFO L276 IsEmpty]: Start isEmpty. Operand 6590 states and 19032 transitions. [2022-03-15 18:53:49,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-15 18:53:49,565 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:53:49,565 INFO L514 BasicCegarLoop]: 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] [2022-03-15 18:53:49,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-03-15 18:53:49,566 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:53:49,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:53:49,566 INFO L85 PathProgramCache]: Analyzing trace with hash -692477827, now seen corresponding path program 26 times [2022-03-15 18:53:49,570 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:53:49,571 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593770256] [2022-03-15 18:53:49,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:53:49,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:53:49,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:53:49,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:53:49,684 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:53:49,684 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593770256] [2022-03-15 18:53:49,684 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593770256] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:53:49,684 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:53:49,684 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-15 18:53:49,684 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [960476263] [2022-03-15 18:53:49,684 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:53:49,688 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:53:49,751 INFO L252 McrAutomatonBuilder]: Finished intersection with 368 states and 865 transitions. [2022-03-15 18:53:49,751 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:53:56,290 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [719679#(and (or (<= (+ ~n3~0 1) ~n2~0) (< ~n3~0 ~n1~0)) (or (<= 1 ~n3~0) (< ~n3~0 ~n1~0)) (not (= ~n3~0 0))), 719683#(and (< 0 ~n1~0) (<= 0 ~n3~0) (<= (+ ~n1~0 ~n3~0 1) ~n2~0)), 719675#(and (not (= ~n3~0 0)) (< ~n3~0 ~n2~0)), 719684#(and (= ~n2~0 ~n1~0) (= ~n1~0 0) (or (= ~n1~0 ~n3~0) (< ~n3~0 ~n2~0))), 719678#(and (or (not (= ~n3~0 0)) (not (= ~n1~0 0))) (or (= ~n2~0 ~n1~0) (< ~n3~0 ~n2~0) (< ~n1~0 ~n2~0)) (or (= ~n2~0 ~n1~0) (not (= ~n3~0 0)) (< ~n1~0 ~n2~0)) (or (not (= ~n1~0 0)) (< ~n3~0 ~n2~0))), 719680#(and (or (not (= ~n3~0 0)) (not (= ~n2~0 0))) (or (<= (+ ~n3~0 1) ~n2~0) (< ~n2~0 ~n1~0)) (or (not (= ~n2~0 0)) (< ~n3~0 ~n1~0)) (or (<= 1 ~n3~0) (< ~n3~0 ~n1~0) (< ~n2~0 ~n1~0)) (or (not (= ~n3~0 0)) (< ~n2~0 ~n1~0))), 719676#(and (or (< ~n1~0 ~n3~0) (= ~n1~0 ~n3~0)) (not (= ~n1~0 0))), 719681#(and (not (= (+ ~n3~0 1) 0)) (or (< (+ ~n3~0 1) ~n1~0) (<= (+ 2 ~n3~0) ~n2~0)) (or (< (+ ~n3~0 1) ~n1~0) (<= 0 ~n3~0))), 719682#(and (or (< (+ ~n3~0 1) ~n1~0) (not (= ~n2~0 0))) (or (not (= (+ ~n3~0 1) 0)) (not (= ~n2~0 0))) (or (<= (+ 2 ~n3~0) ~n2~0) (< ~n2~0 ~n1~0)) (or (not (= (+ ~n3~0 1) 0)) (< ~n2~0 ~n1~0)) (or (< (+ ~n3~0 1) ~n1~0) (<= 0 ~n3~0) (< ~n2~0 ~n1~0))), 719677#(and (or (not (= ~n3~0 0)) (not (= ~n1~0 0))) (or (< ~n1~0 ~n3~0) (<= 1 ~n3~0) (= ~n1~0 ~n3~0)) (or (< ~n1~0 ~n3~0) (= ~n1~0 ~n3~0) (< ~n3~0 ~n2~0)) (or (not (= ~n1~0 0)) (< ~n3~0 ~n2~0)))] [2022-03-15 18:53:56,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 18:53:56,291 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:53:56,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 18:53:56,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2022-03-15 18:53:56,291 INFO L87 Difference]: Start difference. First operand 6590 states and 19032 transitions. Second operand has 18 states, 18 states have (on average 7.611111111111111) internal successors, (137), 17 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:56,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:53:56,942 INFO L93 Difference]: Finished difference Result 7522 states and 21491 transitions. [2022-03-15 18:53:56,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 18:53:56,942 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 7.611111111111111) internal successors, (137), 17 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-03-15 18:53:56,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:53:56,970 INFO L225 Difference]: With dead ends: 7522 [2022-03-15 18:53:56,970 INFO L226 Difference]: Without dead ends: 7252 [2022-03-15 18:53:56,970 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 285 SyntacticMatches, 19 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2022-03-15 18:53:56,971 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 158 mSDsluCounter, 1241 mSDsCounter, 0 mSdLazyCounter, 1617 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 1659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 18:53:56,971 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 578 Invalid, 1659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1617 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 18:53:56,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7252 states. [2022-03-15 18:53:57,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7252 to 6646. [2022-03-15 18:53:57,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6646 states, 6645 states have (on average 2.8809631301730625) internal successors, (19144), 6645 states have internal predecessors, (19144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:57,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6646 states to 6646 states and 19144 transitions. [2022-03-15 18:53:57,053 INFO L78 Accepts]: Start accepts. Automaton has 6646 states and 19144 transitions. Word has length 49 [2022-03-15 18:53:57,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:53:57,054 INFO L470 AbstractCegarLoop]: Abstraction has 6646 states and 19144 transitions. [2022-03-15 18:53:57,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.611111111111111) internal successors, (137), 17 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:57,054 INFO L276 IsEmpty]: Start isEmpty. Operand 6646 states and 19144 transitions. [2022-03-15 18:53:57,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-15 18:53:57,063 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:53:57,063 INFO L514 BasicCegarLoop]: 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] [2022-03-15 18:53:57,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-03-15 18:53:57,063 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:53:57,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:53:57,065 INFO L85 PathProgramCache]: Analyzing trace with hash 2107344151, now seen corresponding path program 27 times [2022-03-15 18:53:57,065 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:53:57,065 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737949619] [2022-03-15 18:53:57,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:53:57,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:53:57,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:53:57,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:53:57,153 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:53:57,153 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737949619] [2022-03-15 18:53:57,153 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737949619] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:53:57,153 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:53:57,153 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-15 18:53:57,153 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1699221510] [2022-03-15 18:53:57,154 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:53:57,157 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:53:57,257 INFO L252 McrAutomatonBuilder]: Finished intersection with 514 states and 1376 transitions. [2022-03-15 18:53:57,257 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:54:09,855 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [740526#(and (= ~n2~0 0) (or (= ~n3~0 0) (< ~n3~0 ~n1~0)) (= ~n1~0 0)), 740530#(and (or (= ~n2~0 0) (< ~n2~0 ~n1~0)) (or (= ~n3~0 0) (< ~n3~0 ~n1~0)) (= ~n1~0 0)), 740520#(and (or (<= 1 ~n2~0) (< ~n2~0 ~n1~0)) (not (= ~n2~0 0)) (or (<= (+ ~n2~0 1) ~n3~0) (< ~n2~0 ~n1~0))), 740518#(and (or (not (= ~n3~0 0)) (not (= ~n1~0 0)) (< ~n2~0 ~n1~0)) (or (not (= ~n2~0 0)) (< ~n3~0 ~n2~0) (< ~n1~0 ~n2~0)) (or (not (= ~n1~0 0)) (< ~n3~0 ~n2~0) (< ~n2~0 ~n1~0))), 740514#(and (not (= ~n3~0 0)) (< ~n3~0 ~n2~0)), 740519#(and (or (<= (+ ~n2~0 1) ~n3~0) (< ~n3~0 ~n2~0)) (or (<= 1 ~n2~0) (< ~n3~0 ~n2~0)) (not (= ~n3~0 0))), 740517#(and (or (not (= ~n3~0 0)) (not (= ~n1~0 0))) (or (= ~n2~0 ~n1~0) (< ~n3~0 ~n2~0) (< ~n1~0 ~n2~0)) (or (= ~n2~0 ~n1~0) (not (= ~n3~0 0)) (< ~n1~0 ~n2~0)) (or (not (= ~n1~0 0)) (< ~n3~0 ~n2~0))), 740525#(and (or (< ~n1~0 ~n3~0) (= ~n1~0 ~n3~0) (< ~n2~0 ~n1~0)) (or (< ~n1~0 ~n3~0) (= ~n1~0 ~n3~0) (not (= ~n2~0 0))) (or (<= (+ ~n2~0 1) ~n3~0) (not (= ~n1~0 0)) (< ~n2~0 ~n1~0)) (or (not (= ~n2~0 0)) (not (= ~n1~0 0)))), 740528#(<= 1 ~n2~0), 740521#(and (or (not (= ~n2~0 0)) (< ~n3~0 ~n2~0)) (or (<= 1 ~n2~0) (< ~n3~0 ~n2~0) (< ~n2~0 ~n1~0)) (or (<= (+ ~n2~0 1) ~n3~0) (< ~n3~0 ~n2~0) (< ~n2~0 ~n1~0)) (or (not (= ~n3~0 0)) (< ~n2~0 ~n1~0))), 740515#(and (not (= ~n2~0 0)) (< ~n2~0 ~n1~0)), 740527#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0)), 740522#(and (or (not (= ~n3~0 0)) (not (= ~n1~0 0))) (or (= ~n2~0 ~n1~0) (not (= ~n3~0 0)) (< ~n1~0 ~n2~0)) (or (= ~n2~0 ~n1~0) (<= (+ ~n2~0 1) ~n3~0) (< ~n3~0 ~n2~0) (< ~n1~0 ~n2~0)) (or (= ~n2~0 ~n1~0) (<= 1 ~n2~0) (< ~n3~0 ~n2~0) (< ~n1~0 ~n2~0)) (or (<= (+ ~n2~0 1) ~n3~0) (not (= ~n1~0 0)) (< ~n3~0 ~n2~0)) (or (<= 1 ~n2~0) (not (= ~n1~0 0)) (< ~n3~0 ~n2~0))), 740523#(and (or (<= (+ ~n2~0 1) ~n3~0) (not (= ~n1~0 0)) (< ~n3~0 ~n2~0) (< ~n2~0 ~n1~0)) (or (not (= ~n3~0 0)) (not (= ~n1~0 0)) (< ~n2~0 ~n1~0)) (or (not (= ~n2~0 0)) (< ~n3~0 ~n2~0) (< ~n1~0 ~n2~0))), 740524#(and (or (< ~n1~0 ~n3~0) (<= 1 ~n2~0) (= ~n1~0 ~n3~0)) (or (<= (+ ~n2~0 1) ~n3~0) (not (= ~n1~0 0))) (or (<= 1 ~n2~0) (not (= ~n1~0 0))) (or (< ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n3~0) (= ~n1~0 ~n3~0))), 740516#(and (or (not (= ~n2~0 0)) (< ~n3~0 ~n2~0)) (or (< ~n3~0 ~n2~0) (< ~n2~0 ~n1~0)) (or (not (= ~n3~0 0)) (< ~n2~0 ~n1~0))), 740529#(and (or (= ~n2~0 0) (< ~n2~0 ~n1~0)) (= ~n3~0 0) (= ~n1~0 0))] [2022-03-15 18:54:09,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 18:54:09,856 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:54:09,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 18:54:09,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2022-03-15 18:54:09,856 INFO L87 Difference]: Start difference. First operand 6646 states and 19144 transitions. Second operand has 24 states, 24 states have (on average 7.958333333333333) internal successors, (191), 23 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:10,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:54:10,541 INFO L93 Difference]: Finished difference Result 6472 states and 17848 transitions. [2022-03-15 18:54:10,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 18:54:10,542 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 7.958333333333333) internal successors, (191), 23 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-03-15 18:54:10,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:54:10,548 INFO L225 Difference]: With dead ends: 6472 [2022-03-15 18:54:10,549 INFO L226 Difference]: Without dead ends: 4602 [2022-03-15 18:54:10,549 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 415 SyntacticMatches, 24 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=191, Invalid=739, Unknown=0, NotChecked=0, Total=930 [2022-03-15 18:54:10,549 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 334 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 1155 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 1260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 18:54:10,549 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [334 Valid, 439 Invalid, 1260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1155 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 18:54:10,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4602 states. [2022-03-15 18:54:10,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4602 to 4026. [2022-03-15 18:54:10,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4026 states, 4025 states have (on average 2.7224844720496892) internal successors, (10958), 4025 states have internal predecessors, (10958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:10,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4026 states to 4026 states and 10958 transitions. [2022-03-15 18:54:10,621 INFO L78 Accepts]: Start accepts. Automaton has 4026 states and 10958 transitions. Word has length 49 [2022-03-15 18:54:10,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:54:10,621 INFO L470 AbstractCegarLoop]: Abstraction has 4026 states and 10958 transitions. [2022-03-15 18:54:10,621 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 7.958333333333333) internal successors, (191), 23 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:10,621 INFO L276 IsEmpty]: Start isEmpty. Operand 4026 states and 10958 transitions. [2022-03-15 18:54:10,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-15 18:54:10,626 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:54:10,626 INFO L514 BasicCegarLoop]: 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] [2022-03-15 18:54:10,626 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-03-15 18:54:10,626 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:54:10,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:54:10,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1843651465, now seen corresponding path program 28 times [2022-03-15 18:54:10,628 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:54:10,628 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632526108] [2022-03-15 18:54:10,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:54:10,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:54:10,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:54:10,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:54:10,731 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:54:10,731 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632526108] [2022-03-15 18:54:10,731 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632526108] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:54:10,731 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:54:10,731 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-15 18:54:10,731 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1629702112] [2022-03-15 18:54:10,731 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:54:10,735 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:54:10,791 INFO L252 McrAutomatonBuilder]: Finished intersection with 354 states and 847 transitions. [2022-03-15 18:54:10,791 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:54:15,095 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [755081#(and (or (< ~n3~0 ~n2~0) (< ~n3~0 ~n1~0)) (not (= ~n3~0 0))), 755090#(and (= ~n1~0 0) (= ~n1~0 ~n3~0) (or (= ~n2~0 ~n3~0) (< ~n2~0 ~n1~0))), 755079#(and (not (= ~n3~0 0)) (< ~n3~0 ~n1~0)), 755084#(and (<= 2 ~n1~0) (< ~n1~0 (+ 2 ~n3~0))), 755089#(and (= ~n2~0 ~n1~0) (or (= ~n2~0 ~n3~0) (< ~n3~0 ~n1~0)) (= ~n1~0 0)), 755085#(and (<= ~n1~0 ~n3~0) (<= 1 ~n3~0)), 755087#(and (or (not (< ~n3~0 ~n2~0)) (<= ~n1~0 ~n2~0)) (or (not (< ~n3~0 ~n2~0)) (<= 1 ~n2~0)) (or (<= ~n1~0 ~n3~0) (< ~n3~0 ~n2~0)) (or (<= 1 ~n3~0) (< ~n3~0 ~n2~0))), 755082#(and (or (= ~n2~0 ~n1~0) (< ~n1~0 ~n2~0) (< ~n3~0 ~n1~0)) (or (not (= ~n1~0 0)) (< ~n3~0 ~n2~0) (< ~n3~0 ~n1~0)) (or (not (= ~n3~0 0)) (not (= ~n1~0 0))) (or (= ~n2~0 ~n1~0) (not (= ~n3~0 0)) (< ~n1~0 ~n2~0))), 755086#(and (<= ~n1~0 ~n3~0) (<= 1 ~n3~0) (<= ~n2~0 ~n3~0)), 755080#(and (or (< ~n3~0 ~n1~0) (< ~n2~0 ~n1~0)) (or (not (= ~n3~0 0)) (not (= ~n2~0 0))) (or (not (= ~n2~0 0)) (< ~n3~0 ~n1~0)) (or (not (= ~n3~0 0)) (< ~n2~0 ~n1~0))), 755091#(and (or (= ~n2~0 ~n1~0) (< ~n2~0 ~n1~0)) (= ~n1~0 0) (or (= ~n1~0 ~n3~0) (< ~n3~0 ~n1~0))), 755078#(and (or (< ~n1~0 ~n3~0) (= ~n1~0 ~n3~0)) (not (= ~n1~0 0))), 755088#(and (or (= (+ (* (- 1) ~n1~0) ~n3~0) 0) (< ~n3~0 ~n2~0)) (= ~n2~0 ~n1~0) (<= 1 ~n2~0)), 755083#(and (or (< ~n1~0 (+ ~n3~0 1)) (= (+ ~n3~0 1) ~n1~0)) (not (= ~n1~0 0)))] [2022-03-15 18:54:15,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 18:54:15,096 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:54:15,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 18:54:15,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2022-03-15 18:54:15,096 INFO L87 Difference]: Start difference. First operand 4026 states and 10958 transitions. Second operand has 23 states, 23 states have (on average 6.782608695652174) internal successors, (156), 22 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:16,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:54:16,105 INFO L93 Difference]: Finished difference Result 4922 states and 13151 transitions. [2022-03-15 18:54:16,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 18:54:16,106 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 6.782608695652174) internal successors, (156), 22 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-03-15 18:54:16,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:54:16,112 INFO L225 Difference]: With dead ends: 4922 [2022-03-15 18:54:16,112 INFO L226 Difference]: Without dead ends: 4184 [2022-03-15 18:54:16,113 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 267 SyntacticMatches, 20 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=189, Invalid=933, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 18:54:16,113 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 343 mSDsluCounter, 1657 mSDsCounter, 0 mSdLazyCounter, 2103 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 2213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 2103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 18:54:16,113 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [343 Valid, 868 Invalid, 2213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 2103 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 18:54:16,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4184 states. [2022-03-15 18:54:16,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4184 to 3060. [2022-03-15 18:54:16,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3060 states, 3059 states have (on average 2.667538411245505) internal successors, (8160), 3059 states have internal predecessors, (8160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:16,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3060 states to 3060 states and 8160 transitions. [2022-03-15 18:54:16,151 INFO L78 Accepts]: Start accepts. Automaton has 3060 states and 8160 transitions. Word has length 49 [2022-03-15 18:54:16,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:54:16,151 INFO L470 AbstractCegarLoop]: Abstraction has 3060 states and 8160 transitions. [2022-03-15 18:54:16,152 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.782608695652174) internal successors, (156), 22 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:16,152 INFO L276 IsEmpty]: Start isEmpty. Operand 3060 states and 8160 transitions. [2022-03-15 18:54:16,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-15 18:54:16,155 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:54:16,155 INFO L514 BasicCegarLoop]: 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] [2022-03-15 18:54:16,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-03-15 18:54:16,155 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:54:16,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:54:16,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1775834999, now seen corresponding path program 29 times [2022-03-15 18:54:16,167 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:54:16,168 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357669499] [2022-03-15 18:54:16,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:54:16,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:54:16,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:54:16,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:54:16,273 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:54:16,273 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357669499] [2022-03-15 18:54:16,274 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357669499] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:54:16,274 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:54:16,274 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-15 18:54:16,274 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [741061333] [2022-03-15 18:54:16,274 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:54:16,278 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:54:16,350 INFO L252 McrAutomatonBuilder]: Finished intersection with 412 states and 1006 transitions. [2022-03-15 18:54:16,350 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:54:21,502 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [766164#(and (or (< ~n3~0 ~n1~0) (< ~n2~0 ~n1~0)) (or (not (= ~n3~0 0)) (not (= ~n2~0 0))) (or (not (= ~n2~0 0)) (< ~n3~0 ~n1~0)) (or (not (= ~n3~0 0)) (< ~n2~0 ~n1~0))), 766166#(and (or (< (+ ~n3~0 1) ~n1~0) (< ~n2~0 ~n1~0)) (or (< (+ ~n3~0 1) ~n1~0) (not (= ~n2~0 0))) (or (not (= (+ ~n3~0 1) 0)) (not (= ~n2~0 0))) (or (not (= (+ ~n3~0 1) 0)) (< ~n2~0 ~n1~0))), 766173#(and (or (= ~n2~0 ~n1~0) (< ~n2~0 ~n1~0)) (= ~n1~0 0) (or (= ~n1~0 ~n3~0) (< ~n3~0 ~n1~0))), 766168#(and (or (< (+ ~n3~0 1) ~n1~0) (not (= ~n2~0 0))) (or (< (+ ~n2~0 1) ~n1~0) (not (= ~n2~0 0))) (< ~n2~0 ~n1~0)), 766171#(<= 1 ~n2~0), 766167#(and (or (not (= (+ ~n2~0 1) 0)) (not (< ~n3~0 ~n2~0))) (< (+ ~n3~0 1) ~n1~0) (< (+ ~n2~0 1) ~n1~0) (or (not (= (+ ~n3~0 1) 0)) (< ~n3~0 ~n2~0))), 766172#(and (= ~n1~0 0) (= ~n1~0 ~n3~0) (or (= ~n2~0 ~n3~0) (< ~n2~0 ~n1~0))), 766169#(and (= ~n2~0 ~n1~0) (= ~n1~0 0) (or (= ~n1~0 ~n3~0) (< ~n3~0 ~n1~0))), 766170#(and (or (<= ~n2~0 ~n3~0) (not (< ~n1~0 ~n3~0))) (<= 1 ~n2~0) (or (< ~n1~0 ~n3~0) (<= ~n2~0 ~n1~0))), 766165#(and (not (= (+ ~n3~0 1) 0)) (< (+ ~n3~0 1) ~n1~0)), 766163#(and (not (= ~n3~0 0)) (< ~n3~0 ~n1~0))] [2022-03-15 18:54:21,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 18:54:21,502 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:54:21,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 18:54:21,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-03-15 18:54:21,502 INFO L87 Difference]: Start difference. First operand 3060 states and 8160 transitions. Second operand has 18 states, 18 states have (on average 7.611111111111111) internal successors, (137), 17 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:21,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:54:21,796 INFO L93 Difference]: Finished difference Result 2722 states and 7203 transitions. [2022-03-15 18:54:21,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 18:54:21,796 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 7.611111111111111) internal successors, (137), 17 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-03-15 18:54:21,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:54:21,799 INFO L225 Difference]: With dead ends: 2722 [2022-03-15 18:54:21,799 INFO L226 Difference]: Without dead ends: 2098 [2022-03-15 18:54:21,799 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 324 SyntacticMatches, 11 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2022-03-15 18:54:21,800 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 96 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:54:21,800 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 256 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:54:21,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2098 states. [2022-03-15 18:54:21,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2098 to 2098. [2022-03-15 18:54:21,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2098 states, 2097 states have (on average 2.6223175965665235) internal successors, (5499), 2097 states have internal predecessors, (5499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:21,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 5499 transitions. [2022-03-15 18:54:21,821 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 5499 transitions. Word has length 49 [2022-03-15 18:54:21,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:54:21,821 INFO L470 AbstractCegarLoop]: Abstraction has 2098 states and 5499 transitions. [2022-03-15 18:54:21,821 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.611111111111111) internal successors, (137), 17 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:21,821 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 5499 transitions. [2022-03-15 18:54:21,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-15 18:54:21,823 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:54:21,823 INFO L514 BasicCegarLoop]: 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] [2022-03-15 18:54:21,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-03-15 18:54:21,823 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:54:21,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:54:21,824 INFO L85 PathProgramCache]: Analyzing trace with hash 207557985, now seen corresponding path program 30 times [2022-03-15 18:54:21,833 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:54:21,833 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883083336] [2022-03-15 18:54:21,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:54:21,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:54:21,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:54:21,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:54:21,892 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:54:21,892 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883083336] [2022-03-15 18:54:21,892 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883083336] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:54:21,892 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:54:21,892 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-15 18:54:21,892 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [848424460] [2022-03-15 18:54:21,892 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:54:21,896 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:54:21,968 INFO L252 McrAutomatonBuilder]: Finished intersection with 388 states and 923 transitions. [2022-03-15 18:54:21,968 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:54:29,462 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [773112#(and (or (<= 1 ~n2~0) (< ~n3~0 ~n1~0) (< ~n2~0 ~n1~0)) (or (not (= ~n3~0 0)) (not (= ~n2~0 0))) (or (not (= ~n2~0 0)) (< ~n3~0 ~n1~0)) (or (<= (+ ~n2~0 1) ~n3~0) (< ~n3~0 ~n1~0)) (or (not (= ~n3~0 0)) (< ~n2~0 ~n1~0))), 773113#(and (or (<= 1 ~n2~0) (< (+ ~n3~0 1) ~n1~0)) (not (= (+ ~n3~0 1) 0)) (or (<= ~n2~0 ~n3~0) (< (+ ~n3~0 1) ~n1~0))), 773109#(and (or (not (= ~n3~0 0)) (not (= ~n1~0 0))) (or (= ~n2~0 ~n1~0) (< ~n3~0 ~n2~0) (< ~n1~0 ~n2~0)) (or (= ~n2~0 ~n1~0) (not (= ~n3~0 0)) (< ~n1~0 ~n2~0)) (or (not (= ~n1~0 0)) (< ~n3~0 ~n2~0))), 773106#(and (not (= ~n3~0 0)) (< ~n3~0 ~n2~0)), 773111#(and (or (<= 1 ~n2~0) (< ~n3~0 ~n1~0)) (or (<= (+ ~n2~0 1) ~n3~0) (< ~n3~0 ~n1~0)) (not (= ~n3~0 0))), 773108#(and (or (< ~n1~0 ~n3~0) (<= 1 ~n2~0) (= ~n1~0 ~n3~0)) (or (<= (+ ~n2~0 1) ~n3~0) (not (= ~n1~0 0))) (or (<= 1 ~n2~0) (not (= ~n1~0 0))) (or (< ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n3~0) (= ~n1~0 ~n3~0))), 773119#(and (or (<= 0 ~n1~0) (not (< ~n3~0 ~n1~0))) (or (<= 0 ~n3~0) (< ~n3~0 ~n1~0))), 773115#(and (or (< (+ ~n3~0 1) ~n1~0) (not (= ~n2~0 0))) (or (not (= (+ ~n3~0 1) 0)) (not (= ~n2~0 0))) (or (not (= (+ ~n3~0 1) 0)) (< ~n2~0 ~n1~0)) (or (<= ~n2~0 ~n3~0) (< (+ ~n3~0 1) ~n1~0)) (or (<= 1 ~n2~0) (< (+ ~n3~0 1) ~n1~0) (< ~n2~0 ~n1~0))), 773110#(and (or (not (= ~n3~0 0)) (not (= ~n1~0 0))) (or (= ~n2~0 ~n1~0) (not (= ~n3~0 0)) (< ~n1~0 ~n2~0)) (or (= ~n2~0 ~n1~0) (<= (+ ~n2~0 1) ~n3~0) (< ~n3~0 ~n2~0) (< ~n1~0 ~n2~0)) (or (= ~n2~0 ~n1~0) (<= 1 ~n2~0) (< ~n3~0 ~n2~0) (< ~n1~0 ~n2~0)) (or (<= (+ ~n2~0 1) ~n3~0) (not (= ~n1~0 0)) (< ~n3~0 ~n2~0)) (or (<= 1 ~n2~0) (not (= ~n1~0 0)) (< ~n3~0 ~n2~0))), 773114#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0)), 773118#(<= 1 ~n2~0), 773107#(and (or (<= (+ ~n2~0 1) ~n3~0) (< ~n3~0 ~n2~0)) (or (<= 1 ~n2~0) (< ~n3~0 ~n2~0)) (not (= ~n3~0 0))), 773117#(and (or (< (+ ~n3~0 1) ~n1~0) (not (= ~n2~0 0))) (or (< (+ ~n2~0 1) ~n1~0) (not (= ~n2~0 0))) (or (<= 1 ~n2~0) (< ~n2~0 ~n1~0))), 773116#(and (or (<= 1 ~n2~0) (< (+ ~n3~0 1) ~n1~0)) (or (not (= (+ ~n2~0 1) 0)) (not (< ~n3~0 ~n2~0))) (or (<= 1 ~n2~0) (< (+ ~n2~0 1) ~n1~0)) (or (not (= (+ ~n3~0 1) 0)) (< ~n3~0 ~n2~0)))] [2022-03-15 18:54:29,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 18:54:29,462 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:54:29,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 18:54:29,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2022-03-15 18:54:29,463 INFO L87 Difference]: Start difference. First operand 2098 states and 5499 transitions. Second operand has 22 states, 22 states have (on average 7.181818181818182) internal successors, (158), 21 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:29,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:54:29,909 INFO L93 Difference]: Finished difference Result 3112 states and 8190 transitions. [2022-03-15 18:54:29,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 18:54:29,909 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 7.181818181818182) internal successors, (158), 21 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-03-15 18:54:29,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:54:29,912 INFO L225 Difference]: With dead ends: 3112 [2022-03-15 18:54:29,912 INFO L226 Difference]: Without dead ends: 2314 [2022-03-15 18:54:29,912 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 302 SyntacticMatches, 15 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=145, Invalid=557, Unknown=0, NotChecked=0, Total=702 [2022-03-15 18:54:29,913 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 347 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:54:29,913 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [347 Valid, 333 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 849 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:54:29,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2022-03-15 18:54:29,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 1846. [2022-03-15 18:54:29,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1846 states, 1845 states have (on average 2.564769647696477) internal successors, (4732), 1845 states have internal predecessors, (4732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:29,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1846 states to 1846 states and 4732 transitions. [2022-03-15 18:54:29,932 INFO L78 Accepts]: Start accepts. Automaton has 1846 states and 4732 transitions. Word has length 49 [2022-03-15 18:54:29,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:54:29,932 INFO L470 AbstractCegarLoop]: Abstraction has 1846 states and 4732 transitions. [2022-03-15 18:54:29,932 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 7.181818181818182) internal successors, (158), 21 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:29,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1846 states and 4732 transitions. [2022-03-15 18:54:29,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-15 18:54:29,934 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:54:29,934 INFO L514 BasicCegarLoop]: 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] [2022-03-15 18:54:29,934 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-03-15 18:54:29,934 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:54:29,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:54:29,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1733263229, now seen corresponding path program 31 times [2022-03-15 18:54:29,937 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:54:29,937 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561223105] [2022-03-15 18:54:29,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:54:29,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:54:29,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:54:30,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:54:30,050 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:54:30,050 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561223105] [2022-03-15 18:54:30,050 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561223105] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:54:30,050 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:54:30,050 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-15 18:54:30,050 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1930546823] [2022-03-15 18:54:30,050 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:54:30,054 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:54:30,113 INFO L252 McrAutomatonBuilder]: Finished intersection with 360 states and 841 transitions. [2022-03-15 18:54:30,113 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:54:38,883 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [779946#(and (or (not (= ~n3~0 0)) (not (= ~n1~0 0))) (or (= ~n2~0 ~n1~0) (< ~n3~0 ~n2~0) (< ~n1~0 ~n2~0)) (or (= ~n2~0 ~n1~0) (not (= ~n3~0 0)) (< ~n1~0 ~n2~0)) (or (not (= ~n1~0 0)) (< ~n3~0 ~n2~0))), 779947#(and (or (not (= ~n3~0 0)) (not (= ~n1~0 0))) (or (= ~n2~0 ~n1~0) (not (= ~n3~0 0)) (< ~n1~0 ~n2~0)) (or (<= ~n3~0 ~n2~0) (= ~n2~0 ~n1~0) (< ~n1~0 ~n2~0)) (or (<= ~n3~0 ~n2~0) (not (= ~n1~0 0))) (or (= ~n2~0 ~n1~0) (<= 2 ~n2~0) (< ~n3~0 ~n2~0) (< ~n1~0 ~n2~0)) (or (<= 2 ~n2~0) (not (= ~n1~0 0)) (< ~n3~0 ~n2~0))), 779948#(and (or (<= 2 ~n2~0) (< ~n3~0 ~n1~0)) (or (<= ~n3~0 ~n2~0) (< ~n3~0 ~n1~0)) (or (< ~n2~0 (+ ~n3~0 1)) (< ~n3~0 ~n1~0)) (not (= ~n3~0 0))), 779952#(and (< ~n2~0 (+ 2 ~n3~0)) (<= 2 ~n2~0) (<= (+ ~n3~0 1) ~n2~0)), 779945#(and (or (< ~n1~0 ~n3~0) (<= ~n3~0 ~n2~0) (= ~n1~0 ~n3~0)) (or (< ~n1~0 ~n3~0) (< ~n2~0 (+ ~n3~0 1)) (= ~n1~0 ~n3~0)) (or (< ~n1~0 ~n3~0) (<= 2 ~n2~0) (= ~n1~0 ~n3~0)) (or (< ~n2~0 (+ ~n3~0 1)) (not (= ~n1~0 0))) (or (<= 2 ~n2~0) (not (= ~n1~0 0))) (or (<= ~n3~0 ~n2~0) (not (= ~n1~0 0)))), 779953#(and (= ~n2~0 0) (= ~n1~0 0) (or (= ~n1~0 ~n3~0) (< ~n3~0 ~n1~0))), 779943#(and (not (= ~n3~0 0)) (< ~n3~0 ~n2~0)), 779949#(and (or (not (= ~n3~0 0)) (not (= ~n2~0 0))) (or (<= 2 ~n2~0) (< ~n3~0 ~n1~0) (< ~n2~0 ~n1~0)) (or (not (= ~n2~0 0)) (< ~n3~0 ~n1~0)) (or (<= ~n3~0 ~n2~0) (< ~n2~0 ~n1~0)) (or (< ~n2~0 (+ ~n3~0 1)) (< ~n3~0 ~n1~0)) (or (not (= ~n3~0 0)) (< ~n2~0 ~n1~0))), 779944#(and (<= ~n3~0 ~n2~0) (or (<= 2 ~n2~0) (< ~n3~0 ~n2~0)) (not (= ~n3~0 0))), 779950#(and (or (< ~n2~0 (+ 2 ~n3~0)) (< (+ ~n3~0 1) ~n1~0)) (not (= (+ ~n3~0 1) 0)) (or (<= 2 ~n2~0) (< (+ ~n3~0 1) ~n1~0)) (or (<= (+ ~n3~0 1) ~n2~0) (< (+ ~n3~0 1) ~n1~0))), 779951#(and (or (< ~n2~0 (+ 2 ~n3~0)) (< (+ ~n3~0 1) ~n1~0)) (or (< (+ ~n3~0 1) ~n1~0) (not (= ~n2~0 0))) (or (not (= (+ ~n3~0 1) 0)) (not (= ~n2~0 0))) (or (<= 2 ~n2~0) (< (+ ~n3~0 1) ~n1~0) (< ~n2~0 ~n1~0)) (or (<= (+ ~n3~0 1) ~n2~0) (< ~n2~0 ~n1~0)) (or (not (= (+ ~n3~0 1) 0)) (< ~n2~0 ~n1~0)))] [2022-03-15 18:54:38,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 18:54:38,884 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:54:38,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 18:54:38,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2022-03-15 18:54:38,884 INFO L87 Difference]: Start difference. First operand 1846 states and 4732 transitions. Second operand has 20 states, 20 states have (on average 7.1) internal successors, (142), 19 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:39,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:54:39,471 INFO L93 Difference]: Finished difference Result 2418 states and 6213 transitions. [2022-03-15 18:54:39,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 18:54:39,471 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 7.1) internal successors, (142), 19 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-03-15 18:54:39,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:54:39,474 INFO L225 Difference]: With dead ends: 2418 [2022-03-15 18:54:39,474 INFO L226 Difference]: Without dead ends: 2036 [2022-03-15 18:54:39,474 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 264 SyntacticMatches, 29 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2022-03-15 18:54:39,475 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 195 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 1267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 18:54:39,475 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 444 Invalid, 1267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 18:54:39,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2036 states. [2022-03-15 18:54:39,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2036 to 1778. [2022-03-15 18:54:39,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1778 states, 1777 states have (on average 2.534608891389983) internal successors, (4504), 1777 states have internal predecessors, (4504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:39,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1778 states and 4504 transitions. [2022-03-15 18:54:39,493 INFO L78 Accepts]: Start accepts. Automaton has 1778 states and 4504 transitions. Word has length 49 [2022-03-15 18:54:39,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:54:39,493 INFO L470 AbstractCegarLoop]: Abstraction has 1778 states and 4504 transitions. [2022-03-15 18:54:39,493 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 7.1) internal successors, (142), 19 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:39,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 4504 transitions. [2022-03-15 18:54:39,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-15 18:54:39,495 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:54:39,495 INFO L514 BasicCegarLoop]: 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] [2022-03-15 18:54:39,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-03-15 18:54:39,496 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:54:39,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:54:39,496 INFO L85 PathProgramCache]: Analyzing trace with hash -370497021, now seen corresponding path program 32 times [2022-03-15 18:54:39,497 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:54:39,497 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251011466] [2022-03-15 18:54:39,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:54:39,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:54:39,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:54:39,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:54:39,657 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:54:39,657 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251011466] [2022-03-15 18:54:39,657 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251011466] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:54:39,657 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:54:39,657 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-15 18:54:39,657 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [888162707] [2022-03-15 18:54:39,658 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:54:39,661 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:54:39,692 INFO L252 McrAutomatonBuilder]: Finished intersection with 202 states and 409 transitions. [2022-03-15 18:54:39,693 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:54:42,280 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [785957#(and (or (<= 1 ~n1~0) (= ~n2~0 ~n3~0) (< ~n2~0 ~n3~0)) (or (= ~n2~0 ~n3~0) (< ~n2~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)) (or (<= 1 ~n1~0) (< ~n1~0 ~n3~0) (not (= ~n2~0 0))) (or (<= (+ ~n2~0 1) ~n3~0) (not (< ~n1~0 ~n3~0)) (not (= ~n2~0 0)))), 785950#(and (or (= ~n2~0 ~n1~0) (< ~n1~0 ~n2~0) (< ~n3~0 ~n1~0)) (or (<= 2 ~n1~0) (< ~n3~0 ~n1~0)) (or (= ~n2~0 ~n1~0) (not (= ~n3~0 0)) (< ~n1~0 ~n2~0)) (or (<= 2 ~n1~0) (not (= ~n3~0 0)))), 785952#(and (or (<= 2 ~n1~0) (< ~n3~0 ~n1~0) (< ~n2~0 ~n1~0)) (or (<= 2 ~n1~0) (not (= ~n3~0 0)) (< ~n2~0 ~n1~0)) (or (not (= ~n3~0 0)) (not (= ~n2~0 0))) (or (not (= ~n2~0 0)) (< ~n3~0 ~n1~0))), 785955#(and (or (< ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)) (or (<= 1 ~n1~0) (< ~n1~0 ~n3~0)) (or (<= 1 ~n3~0) (not (< ~n1~0 ~n3~0))) (or (<= (+ ~n2~0 1) ~n3~0) (not (< ~n1~0 ~n3~0)))), 785954#(and (or (not (< ~n2~0 ~n3~0)) (< ~n1~0 (+ 2 ~n3~0))) (or (< ~n1~0 (+ 2 ~n2~0)) (< ~n2~0 ~n3~0)) (<= 2 ~n1~0)), 785953#(and (< ~n1~0 (+ 2 ~n2~0)) (<= 2 ~n1~0)), 785956#(and (or (<= 1 ~n1~0) (not (= ~n2~0 0))) (or (<= 1 ~n1~0) (= ~n2~0 ~n3~0) (< ~n2~0 ~n3~0)) (or (= ~n2~0 ~n3~0) (< ~n2~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0))), 785949#(and (not (= ~n3~0 0)) (< ~n3~0 ~n1~0)), 785958#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n3~0) (or (< ~n1~0 ~n3~0) (= ~n1~0 ~n3~0))), 785951#(and (or (< ~n3~0 ~n1~0) (< ~n2~0 ~n1~0)) (or (not (= ~n3~0 0)) (not (= ~n2~0 0))) (or (not (= ~n2~0 0)) (< ~n3~0 ~n1~0)) (or (not (= ~n3~0 0)) (< ~n2~0 ~n1~0)))] [2022-03-15 18:54:42,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 18:54:42,280 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:54:42,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 18:54:42,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2022-03-15 18:54:42,281 INFO L87 Difference]: Start difference. First operand 1778 states and 4504 transitions. Second operand has 23 states, 23 states have (on average 5.043478260869565) internal successors, (116), 22 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:43,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:54:43,363 INFO L93 Difference]: Finished difference Result 3254 states and 8028 transitions. [2022-03-15 18:54:43,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 18:54:43,363 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.043478260869565) internal successors, (116), 22 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-03-15 18:54:43,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:54:43,368 INFO L225 Difference]: With dead ends: 3254 [2022-03-15 18:54:43,368 INFO L226 Difference]: Without dead ends: 3112 [2022-03-15 18:54:43,368 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 126 SyntacticMatches, 14 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=211, Invalid=1121, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 18:54:43,368 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 437 mSDsluCounter, 1740 mSDsCounter, 0 mSdLazyCounter, 2171 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 2321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 2171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 18:54:43,369 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [437 Valid, 872 Invalid, 2321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 2171 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 18:54:43,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3112 states. [2022-03-15 18:54:43,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3112 to 1776. [2022-03-15 18:54:43,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1776 states, 1775 states have (on average 2.5222535211267605) internal successors, (4477), 1775 states have internal predecessors, (4477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:43,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1776 states and 4477 transitions. [2022-03-15 18:54:43,389 INFO L78 Accepts]: Start accepts. Automaton has 1776 states and 4477 transitions. Word has length 49 [2022-03-15 18:54:43,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:54:43,389 INFO L470 AbstractCegarLoop]: Abstraction has 1776 states and 4477 transitions. [2022-03-15 18:54:43,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.043478260869565) internal successors, (116), 22 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:43,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 4477 transitions. [2022-03-15 18:54:43,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-15 18:54:43,391 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:54:43,392 INFO L514 BasicCegarLoop]: 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] [2022-03-15 18:54:43,392 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-03-15 18:54:43,392 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:54:43,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:54:43,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1504657477, now seen corresponding path program 33 times [2022-03-15 18:54:43,393 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:54:43,393 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838190620] [2022-03-15 18:54:43,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:54:43,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:54:43,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:54:43,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:54:43,492 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:54:43,492 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838190620] [2022-03-15 18:54:43,492 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838190620] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:54:43,492 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:54:43,492 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-15 18:54:43,493 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1518862749] [2022-03-15 18:54:43,493 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:54:43,497 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:54:43,555 INFO L252 McrAutomatonBuilder]: Finished intersection with 336 states and 830 transitions. [2022-03-15 18:54:43,556 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:54:47,150 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [792803#(and (not (= ~n3~0 0)) (< ~n3~0 ~n1~0)), 792806#(and (or (<= 2 ~n1~0) (< ~n3~0 ~n1~0) (< ~n2~0 ~n1~0)) (or (<= 2 ~n1~0) (not (= ~n3~0 0)) (< ~n2~0 ~n1~0)) (or (not (= ~n3~0 0)) (not (= ~n2~0 0))) (or (not (= ~n2~0 0)) (< ~n3~0 ~n1~0))), 792810#(and (= ~n2~0 0) (<= (+ ~n2~0 1) ~n3~0) (or (< ~n1~0 ~n3~0) (= ~n1~0 ~n3~0))), 792805#(and (or (< ~n3~0 ~n1~0) (< ~n2~0 ~n1~0)) (or (not (= ~n3~0 0)) (not (= ~n2~0 0))) (or (not (= ~n2~0 0)) (< ~n3~0 ~n1~0)) (or (not (= ~n3~0 0)) (< ~n2~0 ~n1~0))), 792809#(and (< ~n1~0 (+ 2 ~n2~0)) (<= 2 ~n1~0)), 792804#(and (or (= ~n2~0 ~n1~0) (< ~n1~0 ~n2~0) (< ~n3~0 ~n1~0)) (or (<= 2 ~n1~0) (< ~n3~0 ~n1~0)) (or (= ~n2~0 ~n1~0) (not (= ~n3~0 0)) (< ~n1~0 ~n2~0)) (or (<= 2 ~n1~0) (not (= ~n3~0 0)))), 792812#(and (or (<= (+ ~n2~0 1) ~n3~0) (not (= ~n2~0 0))) (or (= ~n2~0 ~n3~0) (< ~n2~0 ~n3~0)) (or (= (+ (* (- 1) ~n1~0) ~n3~0) 0) (not (= ~n2~0 0)))), 792808#(and (or (<= 2 ~n1~0) (< ~n2~0 ~n1~0)) (not (= ~n2~0 0))), 792813#(and (or (<= (+ ~n2~0 1) ~n3~0) (not (= ~n2~0 0))) (or (< ~n1~0 ~n3~0) (= ~n1~0 ~n3~0) (not (= ~n2~0 0))) (or (= ~n2~0 ~n3~0) (< ~n2~0 ~n3~0))), 792807#(and (not (= ~n2~0 0)) (< ~n2~0 ~n1~0)), 792811#(and (or (not (< ~n2~0 ~n3~0)) (< ~n1~0 (+ 2 ~n3~0))) (or (< ~n1~0 (+ 2 ~n2~0)) (< ~n2~0 ~n3~0)) (<= 2 ~n1~0))] [2022-03-15 18:54:47,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 18:54:47,150 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:54:47,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 18:54:47,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2022-03-15 18:54:47,151 INFO L87 Difference]: Start difference. First operand 1776 states and 4477 transitions. Second operand has 21 states, 21 states have (on average 6.571428571428571) internal successors, (138), 20 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:47,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:54:47,484 INFO L93 Difference]: Finished difference Result 1846 states and 4608 transitions. [2022-03-15 18:54:47,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 18:54:47,485 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.571428571428571) internal successors, (138), 20 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-03-15 18:54:47,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:54:47,487 INFO L225 Difference]: With dead ends: 1846 [2022-03-15 18:54:47,487 INFO L226 Difference]: Without dead ends: 1734 [2022-03-15 18:54:47,487 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 247 SyntacticMatches, 25 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2022-03-15 18:54:47,488 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 66 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:54:47,488 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 315 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:54:47,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2022-03-15 18:54:47,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1734. [2022-03-15 18:54:47,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1734 states, 1733 states have (on average 2.5216387766878245) internal successors, (4370), 1733 states have internal predecessors, (4370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:47,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1734 states to 1734 states and 4370 transitions. [2022-03-15 18:54:47,504 INFO L78 Accepts]: Start accepts. Automaton has 1734 states and 4370 transitions. Word has length 49 [2022-03-15 18:54:47,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:54:47,504 INFO L470 AbstractCegarLoop]: Abstraction has 1734 states and 4370 transitions. [2022-03-15 18:54:47,505 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.571428571428571) internal successors, (138), 20 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:47,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1734 states and 4370 transitions. [2022-03-15 18:54:47,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-15 18:54:47,506 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:54:47,506 INFO L514 BasicCegarLoop]: 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] [2022-03-15 18:54:47,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-03-15 18:54:47,507 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:54:47,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:54:47,507 INFO L85 PathProgramCache]: Analyzing trace with hash 2099421233, now seen corresponding path program 34 times [2022-03-15 18:54:47,508 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:54:47,508 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550030008] [2022-03-15 18:54:47,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:54:47,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:54:47,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:54:47,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:54:47,607 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:54:47,608 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550030008] [2022-03-15 18:54:47,608 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550030008] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:54:47,608 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:54:47,608 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-15 18:54:47,608 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [374238644] [2022-03-15 18:54:47,608 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:54:47,612 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:54:47,663 INFO L252 McrAutomatonBuilder]: Finished intersection with 180 states and 348 transitions. [2022-03-15 18:54:47,663 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:54:49,220 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [798150#(and (<= (+ ~n1~0 ~n3~0) ~n2~0) (<= ~n3~0 ~n1~0) (= ~n3~0 0)), 798144#(and (not (= ~n3~0 0)) (< ~n3~0 ~n1~0)), 798151#(and (<= (+ (* 2 ~n3~0) 1) ~n2~0) (<= (+ ~n1~0 ~n3~0 1) ~n2~0) (= ~n3~0 0)), 798147#(and (or (not (= ~n3~0 0)) (not (= ~n2~0 0))) (or (not (= ~n2~0 0)) (< ~n3~0 ~n1~0)) (or (<= (+ ~n3~0 1) ~n1~0) (< ~n2~0 ~n1~0))), 798148#(<= ~n1~0 ~n2~0), 798145#(and (or (= ~n2~0 ~n1~0) (not (= ~n3~0 0)) (< ~n1~0 ~n2~0)) (<= (+ ~n3~0 1) ~n1~0)), 798146#(and (or (< ~n3~0 ~n1~0) (< ~n2~0 ~n1~0)) (or (not (= ~n3~0 0)) (not (= ~n2~0 0))) (or (not (= ~n2~0 0)) (< ~n3~0 ~n1~0)) (or (not (= ~n3~0 0)) (< ~n2~0 ~n1~0))), 798152#(and (<= (+ ~n1~0 ~n3~0) ~n2~0) (= ~n3~0 0) (<= (* 2 ~n3~0) ~n2~0)), 798149#(and (<= ~n3~0 ~n1~0) (<= (+ ~n1~0 ~n3~0 1) ~n2~0) (= ~n3~0 0))] [2022-03-15 18:54:49,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 18:54:49,221 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:54:49,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 18:54:49,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2022-03-15 18:54:49,221 INFO L87 Difference]: Start difference. First operand 1734 states and 4370 transitions. Second operand has 17 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 17 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:49,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:54:49,454 INFO L93 Difference]: Finished difference Result 2316 states and 5727 transitions. [2022-03-15 18:54:49,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 18:54:49,455 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 17 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-03-15 18:54:49,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:54:49,458 INFO L225 Difference]: With dead ends: 2316 [2022-03-15 18:54:49,458 INFO L226 Difference]: Without dead ends: 2248 [2022-03-15 18:54:49,458 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 110 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2022-03-15 18:54:49,458 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 262 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:54:49,458 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [262 Valid, 183 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:54:49,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2248 states. [2022-03-15 18:54:49,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2248 to 1710. [2022-03-15 18:54:49,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1710 states, 1709 states have (on average 2.518431831480398) internal successors, (4304), 1709 states have internal predecessors, (4304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:49,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 4304 transitions. [2022-03-15 18:54:49,483 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 4304 transitions. Word has length 49 [2022-03-15 18:54:49,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:54:49,483 INFO L470 AbstractCegarLoop]: Abstraction has 1710 states and 4304 transitions. [2022-03-15 18:54:49,483 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 17 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:49,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 4304 transitions. [2022-03-15 18:54:49,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-15 18:54:49,485 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:54:49,485 INFO L514 BasicCegarLoop]: 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] [2022-03-15 18:54:49,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-03-15 18:54:49,485 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:54:49,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:54:49,486 INFO L85 PathProgramCache]: Analyzing trace with hash 850949693, now seen corresponding path program 35 times [2022-03-15 18:54:49,486 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:54:49,486 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365086157] [2022-03-15 18:54:49,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:54:49,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:54:49,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:54:49,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:54:49,607 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:54:49,607 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365086157] [2022-03-15 18:54:49,607 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365086157] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:54:49,607 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:54:49,607 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-15 18:54:49,607 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [485489127] [2022-03-15 18:54:49,607 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:54:49,611 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:54:49,641 INFO L252 McrAutomatonBuilder]: Finished intersection with 186 states and 363 transitions. [2022-03-15 18:54:49,641 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:54:51,499 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [803902#(and (<= 2 ~n2~0) (or (< ~n1~0 ~n3~0) (= ~n1~0 0)) (= ~n3~0 0)), 803900#(and (or (< ~n3~0 ~n1~0) (< ~n2~0 ~n1~0)) (or (not (= ~n3~0 0)) (not (= ~n2~0 0))) (or (not (= ~n2~0 0)) (< ~n3~0 ~n1~0)) (or (not (= ~n3~0 0)) (< ~n2~0 ~n1~0))), 803898#(and (not (= ~n3~0 0)) (< ~n3~0 ~n1~0)), 803899#(and (or (<= (+ ~n1~0 1) ~n2~0) (not (= ~n3~0 0))) (< ~n3~0 ~n1~0)), 803903#(and (or (< ~n1~0 0) (= ~n1~0 0)) (<= 2 ~n2~0)), 803905#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), 803901#(and (or (<= (+ ~n1~0 1) ~n2~0) (not (= ~n3~0 0)) (< ~n2~0 ~n1~0)) (or (< ~n3~0 ~n1~0) (< ~n2~0 ~n1~0)) (or (not (= ~n3~0 0)) (not (= ~n2~0 0))) (or (not (= ~n2~0 0)) (< ~n3~0 ~n1~0))), 803906#(and (or (<= (+ ~n2~0 1) ~n3~0) (not (= ~n2~0 0))) (or (= ~n1~0 0) (not (= ~n2~0 0))) (or (= ~n2~0 ~n3~0) (< ~n2~0 ~n3~0))), 803904#(and (<= 2 ~n2~0) (= ~n1~0 0))] [2022-03-15 18:54:51,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 18:54:51,500 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:54:51,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 18:54:51,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2022-03-15 18:54:51,500 INFO L87 Difference]: Start difference. First operand 1710 states and 4304 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 17 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:51,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:54:51,817 INFO L93 Difference]: Finished difference Result 1812 states and 4495 transitions. [2022-03-15 18:54:51,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 18:54:51,817 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 17 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-03-15 18:54:51,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:54:51,820 INFO L225 Difference]: With dead ends: 1812 [2022-03-15 18:54:51,820 INFO L226 Difference]: Without dead ends: 1722 [2022-03-15 18:54:51,820 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 120 SyntacticMatches, 7 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2022-03-15 18:54:51,820 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 63 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:54:51,820 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 342 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:54:51,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2022-03-15 18:54:51,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1714. [2022-03-15 18:54:51,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1714 states, 1713 states have (on average 2.5102159953298306) internal successors, (4300), 1713 states have internal predecessors, (4300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:51,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1714 states to 1714 states and 4300 transitions. [2022-03-15 18:54:51,837 INFO L78 Accepts]: Start accepts. Automaton has 1714 states and 4300 transitions. Word has length 49 [2022-03-15 18:54:51,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:54:51,837 INFO L470 AbstractCegarLoop]: Abstraction has 1714 states and 4300 transitions. [2022-03-15 18:54:51,837 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 17 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:51,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 4300 transitions. [2022-03-15 18:54:51,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-15 18:54:51,839 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:54:51,839 INFO L514 BasicCegarLoop]: 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] [2022-03-15 18:54:51,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-03-15 18:54:51,839 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:54:51,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:54:51,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1345363391, now seen corresponding path program 36 times [2022-03-15 18:54:51,840 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:54:51,840 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025597671] [2022-03-15 18:54:51,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:54:51,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:54:51,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:54:51,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:54:51,954 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:54:51,954 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025597671] [2022-03-15 18:54:51,954 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025597671] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:54:51,954 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:54:51,954 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-15 18:54:51,954 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1539011442] [2022-03-15 18:54:51,954 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:54:51,957 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:54:51,985 INFO L252 McrAutomatonBuilder]: Finished intersection with 186 states and 363 transitions. [2022-03-15 18:54:51,986 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:54:53,713 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [809164#(and (or (= ~n1~0 0) (not (= ~n2~0 0))) (or (<= 1 ~n3~0) (not (= ~n2~0 0))) (or (= ~n2~0 ~n3~0) (< ~n2~0 ~n3~0))), 809162#(and (<= (+ 2 ~n3~0) ~n1~0) (<= (+ 2 ~n2~0) ~n1~0) (= ~n3~0 0)), 809161#(and (<= (+ 2 ~n2~0) ~n1~0) (<= 0 ~n2~0) (= ~n3~0 0)), 809159#(and (not (= ~n3~0 0)) (< ~n3~0 ~n1~0)), 809160#(and (or (< ~n3~0 ~n1~0) (< ~n2~0 ~n1~0)) (or (not (= ~n3~0 0)) (not (= ~n2~0 0))) (or (not (= ~n2~0 0)) (< ~n3~0 ~n1~0)) (or (not (= ~n3~0 0)) (< ~n2~0 ~n1~0))), 809163#(and (<= (+ 2 ~n2~0) ~n1~0) (<= 2 ~n1~0))] [2022-03-15 18:54:53,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 18:54:53,713 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:54:53,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 18:54:53,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-03-15 18:54:53,714 INFO L87 Difference]: Start difference. First operand 1714 states and 4300 transitions. Second operand has 16 states, 16 states have (on average 5.8125) internal successors, (93), 15 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:54,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:54:54,117 INFO L93 Difference]: Finished difference Result 2204 states and 5463 transitions. [2022-03-15 18:54:54,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 18:54:54,118 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.8125) internal successors, (93), 15 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-03-15 18:54:54,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:54:54,120 INFO L225 Difference]: With dead ends: 2204 [2022-03-15 18:54:54,120 INFO L226 Difference]: Without dead ends: 2106 [2022-03-15 18:54:54,121 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 117 SyntacticMatches, 12 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2022-03-15 18:54:54,121 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 161 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 1128 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 18:54:54,121 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 382 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1128 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 18:54:54,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2106 states. [2022-03-15 18:54:54,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2106 to 1656. [2022-03-15 18:54:54,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1656 states, 1655 states have (on average 2.505740181268882) internal successors, (4147), 1655 states have internal predecessors, (4147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:54,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 4147 transitions. [2022-03-15 18:54:54,138 INFO L78 Accepts]: Start accepts. Automaton has 1656 states and 4147 transitions. Word has length 49 [2022-03-15 18:54:54,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:54:54,138 INFO L470 AbstractCegarLoop]: Abstraction has 1656 states and 4147 transitions. [2022-03-15 18:54:54,138 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.8125) internal successors, (93), 15 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:54,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 4147 transitions. [2022-03-15 18:54:54,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-15 18:54:54,140 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:54:54,140 INFO L514 BasicCegarLoop]: 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] [2022-03-15 18:54:54,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-03-15 18:54:54,140 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:54:54,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:54:54,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1292859131, now seen corresponding path program 37 times [2022-03-15 18:54:54,141 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:54:54,141 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859322267] [2022-03-15 18:54:54,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:54:54,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:54:54,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:54:54,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:54:54,285 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:54:54,285 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859322267] [2022-03-15 18:54:54,285 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859322267] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:54:54,285 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:54:54,285 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-15 18:54:54,285 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [38034545] [2022-03-15 18:54:54,285 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:54:54,288 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:54:54,328 INFO L252 McrAutomatonBuilder]: Finished intersection with 242 states and 535 transitions. [2022-03-15 18:54:54,328 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:54:56,545 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [814700#(<= 2 ~n2~0), 814698#(and (or (< ~n3~0 ~n1~0) (< ~n2~0 ~n1~0)) (or (not (= ~n3~0 0)) (not (= ~n2~0 0))) (or (not (= ~n2~0 0)) (< ~n3~0 ~n1~0)) (or (not (= ~n3~0 0)) (< ~n2~0 ~n1~0))), 814697#(and (not (= ~n3~0 0)) (< ~n3~0 ~n1~0)), 814699#(and (or (<= ~n2~0 ~n3~0) (not (< ~n1~0 ~n3~0))) (<= 2 ~n2~0) (or (< ~n1~0 ~n3~0) (<= ~n2~0 ~n1~0))), 814702#(and (or (<= (+ ~n2~0 1) ~n3~0) (not (= ~n2~0 0))) (or (= ~n1~0 0) (not (= ~n2~0 0))) (or (= ~n2~0 ~n3~0) (< ~n2~0 ~n3~0))), 814701#(and (<= 2 ~n2~0) (= ~n1~0 0))] [2022-03-15 18:54:56,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 18:54:56,546 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:54:56,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 18:54:56,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-03-15 18:54:56,547 INFO L87 Difference]: Start difference. First operand 1656 states and 4147 transitions. Second operand has 18 states, 18 states have (on average 6.0) internal successors, (108), 17 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:56,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:54:56,771 INFO L93 Difference]: Finished difference Result 1694 states and 4218 transitions. [2022-03-15 18:54:56,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 18:54:56,771 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.0) internal successors, (108), 17 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-03-15 18:54:56,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:54:56,773 INFO L225 Difference]: With dead ends: 1694 [2022-03-15 18:54:56,773 INFO L226 Difference]: Without dead ends: 1598 [2022-03-15 18:54:56,773 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 176 SyntacticMatches, 7 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2022-03-15 18:54:56,773 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 76 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:54:56,774 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 218 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:54:56,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1598 states. [2022-03-15 18:54:56,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1598 to 1598. [2022-03-15 18:54:56,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1598 states, 1597 states have (on average 2.5134627426424547) internal successors, (4014), 1597 states have internal predecessors, (4014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:56,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1598 states and 4014 transitions. [2022-03-15 18:54:56,788 INFO L78 Accepts]: Start accepts. Automaton has 1598 states and 4014 transitions. Word has length 49 [2022-03-15 18:54:56,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:54:56,788 INFO L470 AbstractCegarLoop]: Abstraction has 1598 states and 4014 transitions. [2022-03-15 18:54:56,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.0) internal successors, (108), 17 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:56,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 4014 transitions. [2022-03-15 18:54:56,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-15 18:54:56,790 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:54:56,790 INFO L514 BasicCegarLoop]: 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] [2022-03-15 18:54:56,790 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-03-15 18:54:56,790 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:54:56,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:54:56,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1398578915, now seen corresponding path program 38 times [2022-03-15 18:54:56,791 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:54:56,791 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760812463] [2022-03-15 18:54:56,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:54:56,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:54:56,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:54:56,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:54:56,905 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:54:56,905 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760812463] [2022-03-15 18:54:56,905 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760812463] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:54:56,905 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:54:56,905 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-15 18:54:56,905 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [370329224] [2022-03-15 18:54:56,905 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:54:56,908 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:54:56,944 INFO L252 McrAutomatonBuilder]: Finished intersection with 224 states and 472 transitions. [2022-03-15 18:54:56,944 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:54:59,409 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [819607#(and (or (= ~n2~0 ~n1~0) (not (= ~n3~0 0))) (or (<= 2 ~n1~0) (not (= ~n3~0 0))) (< ~n3~0 ~n1~0)), 819613#(and (or (<= 1 ~n3~0) (not (= ~n2~0 0))) (or (= ~n2~0 ~n3~0) (< ~n2~0 ~n3~0)) (or (= ~n2~0 ~n1~0) (not (= ~n2~0 0)))), 819609#(and (or (<= 2 ~n1~0) (not (= ~n3~0 0)) (< ~n2~0 ~n1~0)) (or (= ~n2~0 ~n1~0) (not (= ~n3~0 0)) (< ~n2~0 ~n1~0)) (or (< ~n3~0 ~n1~0) (< ~n2~0 ~n1~0)) (or (not (= ~n3~0 0)) (not (= ~n2~0 0))) (or (not (= ~n2~0 0)) (< ~n3~0 ~n1~0))), 819610#(and (<= 1 ~n1~0) (< ~n2~0 (+ 2 ~n1~0)) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), 819611#(and (<= 1 ~n1~0) (< ~n2~0 (+ 2 ~n1~0)) (<= (+ ~n1~0 1) ~n2~0)), 819606#(and (not (= ~n3~0 0)) (< ~n3~0 ~n1~0)), 819612#(and (= ~n2~0 ~n1~0) (<= 1 ~n2~0)), 819608#(and (or (< ~n3~0 ~n1~0) (< ~n2~0 ~n1~0)) (or (not (= ~n3~0 0)) (not (= ~n2~0 0))) (or (not (= ~n2~0 0)) (< ~n3~0 ~n1~0)) (or (not (= ~n3~0 0)) (< ~n2~0 ~n1~0)))] [2022-03-15 18:54:59,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 18:54:59,410 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:54:59,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 18:54:59,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2022-03-15 18:54:59,410 INFO L87 Difference]: Start difference. First operand 1598 states and 4014 transitions. Second operand has 17 states, 17 states have (on average 6.117647058823529) internal successors, (104), 16 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:59,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:54:59,666 INFO L93 Difference]: Finished difference Result 1544 states and 3883 transitions. [2022-03-15 18:54:59,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 18:54:59,666 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.117647058823529) internal successors, (104), 16 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-03-15 18:54:59,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:54:59,668 INFO L225 Difference]: With dead ends: 1544 [2022-03-15 18:54:59,668 INFO L226 Difference]: Without dead ends: 1412 [2022-03-15 18:54:59,668 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 156 SyntacticMatches, 10 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2022-03-15 18:54:59,668 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 59 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:54:59,668 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 269 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:54:59,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2022-03-15 18:54:59,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 1412. [2022-03-15 18:54:59,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1412 states, 1411 states have (on average 2.5450035435861094) internal successors, (3591), 1411 states have internal predecessors, (3591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:59,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 3591 transitions. [2022-03-15 18:54:59,681 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 3591 transitions. Word has length 49 [2022-03-15 18:54:59,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:54:59,681 INFO L470 AbstractCegarLoop]: Abstraction has 1412 states and 3591 transitions. [2022-03-15 18:54:59,681 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.117647058823529) internal successors, (104), 16 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:59,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 3591 transitions. [2022-03-15 18:54:59,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-15 18:54:59,683 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:54:59,683 INFO L514 BasicCegarLoop]: 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] [2022-03-15 18:54:59,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-03-15 18:54:59,683 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:54:59,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:54:59,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1012210111, now seen corresponding path program 39 times [2022-03-15 18:54:59,684 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:54:59,684 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634349922] [2022-03-15 18:54:59,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:54:59,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:54:59,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:54:59,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:54:59,772 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:54:59,772 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634349922] [2022-03-15 18:54:59,772 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634349922] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:54:59,772 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:54:59,772 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-15 18:54:59,773 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1915561030] [2022-03-15 18:54:59,773 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:54:59,775 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:54:59,832 INFO L252 McrAutomatonBuilder]: Finished intersection with 350 states and 814 transitions. [2022-03-15 18:54:59,833 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:55:05,709 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [824000#(and (or (<= ~n3~0 ~n2~0) (< ~n3~0 ~n1~0)) (or (<= 1 ~n3~0) (< ~n3~0 ~n1~0)) (not (= ~n3~0 0))), 823998#(and (or (<= (+ ~n3~0 1) ~n2~0) (< ~n3~0 ~n1~0)) (or (<= 1 ~n3~0) (< ~n3~0 ~n1~0)) (not (= ~n3~0 0))), 823996#(and (not (= ~n3~0 0)) (< ~n3~0 ~n2~0)), 823997#(and (or (not (= ~n3~0 0)) (not (= ~n1~0 0))) (or (= ~n2~0 ~n1~0) (< ~n3~0 ~n2~0) (< ~n1~0 ~n2~0)) (or (= ~n2~0 ~n1~0) (not (= ~n3~0 0)) (< ~n1~0 ~n2~0)) (or (not (= ~n1~0 0)) (< ~n3~0 ~n2~0))), 823999#(and (not (= (+ ~n3~0 1) 0)) (or (< (+ ~n3~0 1) ~n1~0) (<= (+ 2 ~n3~0) ~n2~0)) (or (< (+ ~n3~0 1) ~n1~0) (<= 0 ~n3~0))), 823995#(and (or (not (= ~n3~0 0)) (not (= ~n1~0 0))) (or (< ~n1~0 ~n3~0) (<= 1 ~n3~0) (= ~n1~0 ~n3~0)) (or (< ~n1~0 ~n3~0) (= ~n1~0 ~n3~0) (< ~n3~0 ~n2~0)) (or (not (= ~n1~0 0)) (< ~n3~0 ~n2~0))), 824002#(and (= ~n2~0 0) (= ~n1~0 0) (or (= ~n1~0 ~n3~0) (< ~n3~0 ~n2~0))), 823994#(and (or (< ~n1~0 ~n3~0) (= ~n1~0 ~n3~0)) (not (= ~n1~0 0))), 824001#(and (or (<= 0 ~n3~0) (not (= ~n2~0 0))) (or (<= (+ ~n3~0 1) ~n1~0) (not (= ~n2~0 0))) (< ~n2~0 ~n1~0))] [2022-03-15 18:55:05,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 18:55:05,710 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:55:05,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 18:55:05,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2022-03-15 18:55:05,710 INFO L87 Difference]: Start difference. First operand 1412 states and 3591 transitions. Second operand has 17 states, 17 states have (on average 7.529411764705882) internal successors, (128), 16 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:06,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:55:06,281 INFO L93 Difference]: Finished difference Result 2146 states and 5397 transitions. [2022-03-15 18:55:06,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 18:55:06,282 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 7.529411764705882) internal successors, (128), 16 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-03-15 18:55:06,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:55:06,284 INFO L225 Difference]: With dead ends: 2146 [2022-03-15 18:55:06,284 INFO L226 Difference]: Without dead ends: 1970 [2022-03-15 18:55:06,285 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 260 SyntacticMatches, 26 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2022-03-15 18:55:06,285 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 229 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 1197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 18:55:06,285 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [229 Valid, 387 Invalid, 1197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1127 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 18:55:06,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states. [2022-03-15 18:55:06,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 1576. [2022-03-15 18:55:06,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1575 states have (on average 2.537777777777778) internal successors, (3997), 1575 states have internal predecessors, (3997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:06,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 3997 transitions. [2022-03-15 18:55:06,301 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 3997 transitions. Word has length 49 [2022-03-15 18:55:06,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:55:06,301 INFO L470 AbstractCegarLoop]: Abstraction has 1576 states and 3997 transitions. [2022-03-15 18:55:06,301 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.529411764705882) internal successors, (128), 16 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:06,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 3997 transitions. [2022-03-15 18:55:06,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-15 18:55:06,303 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:55:06,303 INFO L514 BasicCegarLoop]: 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] [2022-03-15 18:55:06,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-03-15 18:55:06,303 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:55:06,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:55:06,304 INFO L85 PathProgramCache]: Analyzing trace with hash 228056819, now seen corresponding path program 40 times [2022-03-15 18:55:06,304 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:55:06,304 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717917737] [2022-03-15 18:55:06,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:55:06,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:55:06,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:55:06,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:55:06,405 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:55:06,405 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717917737] [2022-03-15 18:55:06,405 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717917737] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:55:06,405 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:55:06,405 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-15 18:55:06,405 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1970801357] [2022-03-15 18:55:06,406 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:55:06,408 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:55:06,467 INFO L252 McrAutomatonBuilder]: Finished intersection with 346 states and 804 transitions. [2022-03-15 18:55:06,467 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:55:15,093 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [829324#(and (or (not (= ~n3~0 0)) (not (= ~n1~0 0))) (or (= ~n2~0 ~n1~0) (not (= ~n3~0 0)) (< ~n1~0 ~n2~0)) (or (<= ~n3~0 ~n2~0) (= ~n2~0 ~n1~0) (< ~n1~0 ~n2~0)) (or (<= ~n3~0 ~n2~0) (not (= ~n1~0 0))) (or (= ~n2~0 ~n1~0) (<= 2 ~n2~0) (< ~n3~0 ~n2~0) (< ~n1~0 ~n2~0)) (or (<= 2 ~n2~0) (not (= ~n1~0 0)) (< ~n3~0 ~n2~0))), 829327#(and (or (<= ~n3~0 (+ ~n2~0 1)) (< ~n3~0 ~n1~0)) (or (<= 1 ~n2~0) (< ~n3~0 ~n1~0)) (not (= ~n3~0 0)) (or (< ~n2~0 ~n3~0) (< ~n3~0 ~n1~0))), 829326#(and (or (< ~n2~0 (+ 2 ~n3~0)) (< (+ ~n3~0 1) ~n1~0)) (not (= (+ ~n3~0 1) 0)) (or (<= 2 ~n2~0) (< (+ ~n3~0 1) ~n1~0)) (or (<= (+ ~n3~0 1) ~n2~0) (< (+ ~n3~0 1) ~n1~0))), 829323#(and (or (not (= ~n3~0 0)) (not (= ~n1~0 0))) (or (= ~n2~0 ~n1~0) (< ~n3~0 ~n2~0) (< ~n1~0 ~n2~0)) (or (= ~n2~0 ~n1~0) (not (= ~n3~0 0)) (< ~n1~0 ~n2~0)) (or (not (= ~n1~0 0)) (< ~n3~0 ~n2~0))), 829325#(and (or (<= 2 ~n2~0) (< ~n3~0 ~n1~0)) (or (<= ~n3~0 ~n2~0) (< ~n3~0 ~n1~0)) (or (< ~n2~0 (+ ~n3~0 1)) (< ~n3~0 ~n1~0)) (not (= ~n3~0 0))), 829328#(and (or (= ~n3~0 0) (not (= ~n2~0 0))) (< ~n2~0 ~n1~0)), 829329#(and (= ~n2~0 0) (or (= ~n3~0 0) (< ~n3~0 ~n1~0)) (= ~n1~0 0)), 829322#(and (<= ~n3~0 ~n2~0) (or (<= 2 ~n2~0) (< ~n3~0 ~n2~0)) (not (= ~n3~0 0))), 829321#(and (not (= ~n3~0 0)) (< ~n3~0 ~n2~0)), 829320#(and (or (< ~n1~0 ~n3~0) (<= ~n3~0 ~n2~0) (= ~n1~0 ~n3~0)) (or (< ~n1~0 ~n3~0) (< ~n2~0 (+ ~n3~0 1)) (= ~n1~0 ~n3~0)) (or (< ~n1~0 ~n3~0) (<= 2 ~n2~0) (= ~n1~0 ~n3~0)) (or (< ~n2~0 (+ ~n3~0 1)) (not (= ~n1~0 0))) (or (<= 2 ~n2~0) (not (= ~n1~0 0))) (or (<= ~n3~0 ~n2~0) (not (= ~n1~0 0))))] [2022-03-15 18:55:15,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 18:55:15,093 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:55:15,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 18:55:15,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2022-03-15 18:55:15,094 INFO L87 Difference]: Start difference. First operand 1576 states and 3997 transitions. Second operand has 19 states, 19 states have (on average 7.0) internal successors, (133), 18 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:15,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:55:15,589 INFO L93 Difference]: Finished difference Result 2078 states and 5202 transitions. [2022-03-15 18:55:15,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 18:55:15,589 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.0) internal successors, (133), 18 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-03-15 18:55:15,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:55:15,591 INFO L225 Difference]: With dead ends: 2078 [2022-03-15 18:55:15,591 INFO L226 Difference]: Without dead ends: 1464 [2022-03-15 18:55:15,592 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 252 SyntacticMatches, 29 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2022-03-15 18:55:15,592 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 245 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 912 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 18:55:15,592 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [245 Valid, 350 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 912 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 18:55:15,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2022-03-15 18:55:15,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 1424. [2022-03-15 18:55:15,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1424 states, 1423 states have (on average 2.472944483485594) internal successors, (3519), 1423 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:15,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1424 states to 1424 states and 3519 transitions. [2022-03-15 18:55:15,605 INFO L78 Accepts]: Start accepts. Automaton has 1424 states and 3519 transitions. Word has length 49 [2022-03-15 18:55:15,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:55:15,605 INFO L470 AbstractCegarLoop]: Abstraction has 1424 states and 3519 transitions. [2022-03-15 18:55:15,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.0) internal successors, (133), 18 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:15,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1424 states and 3519 transitions. [2022-03-15 18:55:15,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-15 18:55:15,607 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:55:15,607 INFO L514 BasicCegarLoop]: 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] [2022-03-15 18:55:15,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-03-15 18:55:15,607 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:55:15,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:55:15,607 INFO L85 PathProgramCache]: Analyzing trace with hash 71996455, now seen corresponding path program 41 times [2022-03-15 18:55:15,615 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:55:15,615 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592479122] [2022-03-15 18:55:15,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:55:15,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:55:15,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:55:15,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:55:15,678 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:55:15,678 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592479122] [2022-03-15 18:55:15,678 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592479122] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:55:15,678 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:55:15,678 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-15 18:55:15,678 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [638874992] [2022-03-15 18:55:15,679 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:55:15,681 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:55:15,748 INFO L252 McrAutomatonBuilder]: Finished intersection with 402 states and 953 transitions. [2022-03-15 18:55:15,749 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:55:23,520 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [834277#(and (or (<= 1 ~n2~0) (< ~n3~0 ~n1~0) (< ~n2~0 ~n1~0)) (or (not (= ~n3~0 0)) (not (= ~n2~0 0))) (or (not (= ~n2~0 0)) (< ~n3~0 ~n1~0)) (or (<= (+ ~n2~0 1) ~n3~0) (< ~n3~0 ~n1~0)) (or (not (= ~n3~0 0)) (< ~n2~0 ~n1~0))), 834282#(and (or (< (+ ~n3~0 1) ~n1~0) (not (= ~n2~0 0))) (or (< (+ ~n2~0 1) ~n1~0) (not (= ~n2~0 0))) (or (<= 1 ~n2~0) (< ~n2~0 ~n1~0))), 834281#(and (or (<= 1 ~n2~0) (< (+ ~n3~0 1) ~n1~0)) (or (not (= (+ ~n2~0 1) 0)) (not (< ~n3~0 ~n2~0))) (or (<= 1 ~n2~0) (< (+ ~n2~0 1) ~n1~0)) (or (not (= (+ ~n3~0 1) 0)) (< ~n3~0 ~n2~0))), 834283#(<= 1 ~n2~0), 834274#(and (or (not (= ~n3~0 0)) (not (= ~n1~0 0))) (or (= ~n2~0 ~n1~0) (< ~n3~0 ~n2~0) (< ~n1~0 ~n2~0)) (or (= ~n2~0 ~n1~0) (not (= ~n3~0 0)) (< ~n1~0 ~n2~0)) (or (not (= ~n1~0 0)) (< ~n3~0 ~n2~0))), 834275#(and (or (not (= ~n3~0 0)) (not (= ~n1~0 0))) (or (= ~n2~0 ~n1~0) (not (= ~n3~0 0)) (< ~n1~0 ~n2~0)) (or (= ~n2~0 ~n1~0) (<= (+ ~n2~0 1) ~n3~0) (< ~n3~0 ~n2~0) (< ~n1~0 ~n2~0)) (or (= ~n2~0 ~n1~0) (<= 1 ~n2~0) (< ~n3~0 ~n2~0) (< ~n1~0 ~n2~0)) (or (<= (+ ~n2~0 1) ~n3~0) (not (= ~n1~0 0)) (< ~n3~0 ~n2~0)) (or (<= 1 ~n2~0) (not (= ~n1~0 0)) (< ~n3~0 ~n2~0))), 834285#(and (or (= ~n2~0 0) (< ~n2~0 ~n1~0)) (= ~n3~0 0) (= ~n1~0 0)), 834271#(and (not (= ~n3~0 0)) (< ~n3~0 ~n2~0)), 834276#(and (or (<= 1 ~n2~0) (< ~n3~0 ~n1~0)) (or (<= (+ ~n2~0 1) ~n3~0) (< ~n3~0 ~n1~0)) (not (= ~n3~0 0))), 834273#(and (or (< ~n1~0 ~n3~0) (<= 1 ~n2~0) (= ~n1~0 ~n3~0)) (or (<= (+ ~n2~0 1) ~n3~0) (not (= ~n1~0 0))) (or (<= 1 ~n2~0) (not (= ~n1~0 0))) (or (< ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n3~0) (= ~n1~0 ~n3~0))), 834280#(and (or (< (+ ~n3~0 1) ~n1~0) (not (= ~n2~0 0))) (or (not (= (+ ~n3~0 1) 0)) (not (= ~n2~0 0))) (or (not (= (+ ~n3~0 1) 0)) (< ~n2~0 ~n1~0)) (or (<= ~n2~0 ~n3~0) (< (+ ~n3~0 1) ~n1~0)) (or (<= 1 ~n2~0) (< (+ ~n3~0 1) ~n1~0) (< ~n2~0 ~n1~0))), 834278#(and (or (<= 1 ~n2~0) (< (+ ~n3~0 1) ~n1~0)) (not (= (+ ~n3~0 1) 0)) (or (<= ~n2~0 ~n3~0) (< (+ ~n3~0 1) ~n1~0))), 834284#(and (or (= ~n1~0 0) (not (< ~n3~0 ~n1~0))) (<= 1 ~n2~0) (or (= ~n3~0 0) (< ~n3~0 ~n1~0))), 834272#(and (or (<= (+ ~n2~0 1) ~n3~0) (< ~n3~0 ~n2~0)) (or (<= 1 ~n2~0) (< ~n3~0 ~n2~0)) (not (= ~n3~0 0))), 834279#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0))] [2022-03-15 18:55:23,521 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 18:55:23,521 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:55:23,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 18:55:23,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2022-03-15 18:55:23,521 INFO L87 Difference]: Start difference. First operand 1424 states and 3519 transitions. Second operand has 22 states, 22 states have (on average 7.454545454545454) internal successors, (164), 21 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:23,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:55:23,841 INFO L93 Difference]: Finished difference Result 1698 states and 4195 transitions. [2022-03-15 18:55:23,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 18:55:23,841 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 7.454545454545454) internal successors, (164), 21 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-03-15 18:55:23,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:55:23,843 INFO L225 Difference]: With dead ends: 1698 [2022-03-15 18:55:23,843 INFO L226 Difference]: Without dead ends: 1370 [2022-03-15 18:55:23,843 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 317 SyntacticMatches, 15 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2022-03-15 18:55:23,843 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 355 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:55:23,844 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [355 Valid, 232 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 699 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:55:23,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2022-03-15 18:55:23,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1370. [2022-03-15 18:55:23,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1370 states, 1369 states have (on average 2.4806428049671294) internal successors, (3396), 1369 states have internal predecessors, (3396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:23,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 3396 transitions. [2022-03-15 18:55:23,856 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 3396 transitions. Word has length 49 [2022-03-15 18:55:23,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:55:23,856 INFO L470 AbstractCegarLoop]: Abstraction has 1370 states and 3396 transitions. [2022-03-15 18:55:23,856 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 7.454545454545454) internal successors, (164), 21 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:23,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 3396 transitions. [2022-03-15 18:55:23,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-15 18:55:23,858 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:55:23,858 INFO L514 BasicCegarLoop]: 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] [2022-03-15 18:55:23,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-03-15 18:55:23,858 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:55:23,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:55:23,858 INFO L85 PathProgramCache]: Analyzing trace with hash -873356577, now seen corresponding path program 42 times [2022-03-15 18:55:23,867 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:55:23,867 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364538364] [2022-03-15 18:55:23,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:55:23,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:55:23,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:55:23,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:55:23,938 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:55:23,938 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364538364] [2022-03-15 18:55:23,938 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364538364] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:55:23,938 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:55:23,938 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-15 18:55:23,938 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [43256110] [2022-03-15 18:55:23,938 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:55:23,941 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:55:24,009 INFO L252 McrAutomatonBuilder]: Finished intersection with 380 states and 889 transitions. [2022-03-15 18:55:24,009 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:55:30,673 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [838746#(and (or (= ~n2~0 ~n1~0) (< ~n2~0 ~n1~0)) (= ~n3~0 0) (= ~n1~0 0)), 838738#(and (or (< ~n1~0 ~n3~0) (< ~n2~0 (+ ~n3~0 1)) (= ~n1~0 ~n3~0)) (or (< ~n1~0 ~n3~0) (<= 1 ~n2~0) (= ~n1~0 ~n3~0)) (or (< ~n2~0 (+ ~n3~0 1)) (not (= ~n1~0 0))) (or (<= 1 ~n2~0) (not (= ~n1~0 0)))), 838737#(and (or (<= 1 ~n2~0) (< ~n3~0 ~n2~0)) (not (= ~n3~0 0))), 838743#(and (or (<= 1 ~n2~0) (< (+ ~n3~0 1) ~n1~0)) (or (< ~n2~0 (+ 2 ~n3~0)) (< (+ ~n3~0 1) ~n1~0)) (not (= (+ ~n3~0 1) 0))), 838742#(and (or (<= 1 ~n2~0) (< ~n3~0 ~n1~0) (< ~n2~0 ~n1~0)) (or (not (= ~n3~0 0)) (not (= ~n2~0 0))) (or (not (= ~n2~0 0)) (< ~n3~0 ~n1~0)) (or (< ~n2~0 (+ ~n3~0 1)) (< ~n3~0 ~n1~0)) (or (not (= ~n3~0 0)) (< ~n2~0 ~n1~0))), 838745#(and (<= 1 ~n2~0) (< ~n2~0 (+ 2 ~n3~0))), 838739#(and (or (not (= ~n3~0 0)) (not (= ~n1~0 0))) (or (= ~n2~0 ~n1~0) (< ~n3~0 ~n2~0) (< ~n1~0 ~n2~0)) (or (= ~n2~0 ~n1~0) (not (= ~n3~0 0)) (< ~n1~0 ~n2~0)) (or (not (= ~n1~0 0)) (< ~n3~0 ~n2~0))), 838741#(and (or (<= 1 ~n2~0) (< ~n3~0 ~n1~0)) (or (< ~n2~0 (+ ~n3~0 1)) (< ~n3~0 ~n1~0)) (not (= ~n3~0 0))), 838744#(and (or (< ~n2~0 (+ 2 ~n3~0)) (< (+ ~n3~0 1) ~n1~0)) (or (< (+ ~n3~0 1) ~n1~0) (not (= ~n2~0 0))) (or (not (= (+ ~n3~0 1) 0)) (not (= ~n2~0 0))) (or (not (= (+ ~n3~0 1) 0)) (< ~n2~0 ~n1~0)) (or (<= 1 ~n2~0) (< (+ ~n3~0 1) ~n1~0) (< ~n2~0 ~n1~0))), 838740#(and (or (not (= ~n3~0 0)) (not (= ~n1~0 0))) (or (= ~n2~0 ~n1~0) (not (= ~n3~0 0)) (< ~n1~0 ~n2~0)) (or (= ~n2~0 ~n1~0) (<= 1 ~n2~0) (< ~n3~0 ~n2~0) (< ~n1~0 ~n2~0)) (or (not (= ~n2~0 0)) (not (= ~n1~0 0)) (< ~n3~0 ~n2~0))), 838736#(and (not (= ~n3~0 0)) (< ~n3~0 ~n2~0))] [2022-03-15 18:55:30,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 18:55:30,674 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:55:30,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 18:55:30,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2022-03-15 18:55:30,674 INFO L87 Difference]: Start difference. First operand 1370 states and 3396 transitions. Second operand has 19 states, 19 states have (on average 7.526315789473684) internal successors, (143), 18 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:31,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:55:31,034 INFO L93 Difference]: Finished difference Result 2002 states and 4917 transitions. [2022-03-15 18:55:31,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 18:55:31,034 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.526315789473684) internal successors, (143), 18 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-03-15 18:55:31,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:55:31,036 INFO L225 Difference]: With dead ends: 2002 [2022-03-15 18:55:31,036 INFO L226 Difference]: Without dead ends: 1174 [2022-03-15 18:55:31,036 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 300 SyntacticMatches, 12 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2022-03-15 18:55:31,036 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 254 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:55:31,036 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [254 Valid, 291 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 858 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:55:31,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2022-03-15 18:55:31,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 958. [2022-03-15 18:55:31,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 958 states, 957 states have (on average 2.3834900731452455) internal successors, (2281), 957 states have internal predecessors, (2281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:31,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 2281 transitions. [2022-03-15 18:55:31,045 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 2281 transitions. Word has length 49 [2022-03-15 18:55:31,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:55:31,046 INFO L470 AbstractCegarLoop]: Abstraction has 958 states and 2281 transitions. [2022-03-15 18:55:31,046 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.526315789473684) internal successors, (143), 18 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:31,046 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 2281 transitions. [2022-03-15 18:55:31,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-15 18:55:31,047 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:55:31,047 INFO L514 BasicCegarLoop]: 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] [2022-03-15 18:55:31,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-03-15 18:55:31,047 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:55:31,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:55:31,047 INFO L85 PathProgramCache]: Analyzing trace with hash -827395775, now seen corresponding path program 43 times [2022-03-15 18:55:31,048 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:55:31,048 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540595223] [2022-03-15 18:55:31,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:55:31,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:55:31,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:55:31,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:55:31,168 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:55:31,168 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540595223] [2022-03-15 18:55:31,168 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540595223] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:55:31,168 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:55:31,168 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-15 18:55:31,168 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [468005084] [2022-03-15 18:55:31,168 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:55:31,171 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:55:31,238 INFO L252 McrAutomatonBuilder]: Finished intersection with 408 states and 953 transitions. [2022-03-15 18:55:31,238 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:55:40,826 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [842680#(and (or (not (= ~n3~0 0)) (not (= ~n1~0 0))) (or (= ~n2~0 ~n1~0) (not (= ~n3~0 0)) (< ~n1~0 ~n2~0)) (or (<= ~n3~0 ~n2~0) (= ~n2~0 ~n1~0) (< ~n1~0 ~n2~0)) (or (<= ~n3~0 ~n2~0) (not (= ~n1~0 0))) (or (= ~n2~0 ~n1~0) (<= 2 ~n2~0) (< ~n3~0 ~n2~0) (< ~n1~0 ~n2~0)) (or (<= 2 ~n2~0) (not (= ~n1~0 0)) (< ~n3~0 ~n2~0))), 842683#(and (or (<= ~n3~0 ~n1~0) (not (= ~n2~0 0))) (< ~n2~0 ~n1~0)), 842678#(and (<= ~n3~0 ~n2~0) (or (<= 2 ~n2~0) (< ~n3~0 ~n2~0)) (not (= ~n3~0 0))), 842685#(and (or (< ~n2~0 (+ 2 ~n3~0)) (< (+ ~n3~0 1) ~n1~0)) (not (= (+ ~n3~0 1) 0)) (or (<= 2 ~n2~0) (< (+ ~n3~0 1) ~n1~0)) (or (<= (+ ~n3~0 1) ~n2~0) (< (+ ~n3~0 1) ~n1~0))), 842681#(and (<= 1 ~n1~0) (= ~n2~0 0) (<= ~n3~0 ~n1~0)), 842676#(and (or (< ~n1~0 ~n3~0) (<= ~n3~0 ~n2~0) (= ~n1~0 ~n3~0)) (or (< ~n1~0 ~n3~0) (< ~n2~0 (+ ~n3~0 1)) (= ~n1~0 ~n3~0)) (or (< ~n1~0 ~n3~0) (<= 2 ~n2~0) (= ~n1~0 ~n3~0)) (or (< ~n2~0 (+ ~n3~0 1)) (not (= ~n1~0 0))) (or (<= 2 ~n2~0) (not (= ~n1~0 0))) (or (<= ~n3~0 ~n2~0) (not (= ~n1~0 0)))), 842686#(and (or (<= ~n3~0 (+ ~n2~0 1)) (< ~n3~0 ~n1~0)) (or (<= 1 ~n2~0) (< ~n3~0 ~n1~0)) (not (= ~n3~0 0)) (or (< ~n2~0 ~n3~0) (< ~n3~0 ~n1~0))), 842684#(and (or (<= 2 ~n2~0) (< ~n3~0 ~n1~0)) (or (<= ~n3~0 ~n2~0) (< ~n3~0 ~n1~0)) (or (< ~n2~0 (+ ~n3~0 1)) (< ~n3~0 ~n1~0)) (not (= ~n3~0 0))), 842682#(and (or (<= ~n1~0 ~n3~0) (not (= ~n2~0 0))) (or (<= ~n3~0 ~n1~0) (not (= ~n2~0 0))) (< ~n2~0 ~n1~0)), 842677#(and (not (= ~n3~0 0)) (< ~n3~0 ~n2~0)), 842679#(and (or (not (= ~n3~0 0)) (not (= ~n1~0 0))) (or (= ~n2~0 ~n1~0) (< ~n3~0 ~n2~0) (< ~n1~0 ~n2~0)) (or (= ~n2~0 ~n1~0) (not (= ~n3~0 0)) (< ~n1~0 ~n2~0)) (or (not (= ~n1~0 0)) (< ~n3~0 ~n2~0)))] [2022-03-15 18:55:40,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 18:55:40,826 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:55:40,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 18:55:40,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2022-03-15 18:55:40,827 INFO L87 Difference]: Start difference. First operand 958 states and 2281 transitions. Second operand has 20 states, 20 states have (on average 7.35) internal successors, (147), 19 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:41,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:55:41,140 INFO L93 Difference]: Finished difference Result 1098 states and 2614 transitions. [2022-03-15 18:55:41,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 18:55:41,141 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 7.35) internal successors, (147), 19 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-03-15 18:55:41,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:55:41,142 INFO L225 Difference]: With dead ends: 1098 [2022-03-15 18:55:41,142 INFO L226 Difference]: Without dead ends: 870 [2022-03-15 18:55:41,142 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 309 SyntacticMatches, 33 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2022-03-15 18:55:41,142 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 96 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:55:41,143 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 296 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:55:41,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2022-03-15 18:55:41,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 870. [2022-03-15 18:55:41,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 869 states have (on average 2.378596087456847) internal successors, (2067), 869 states have internal predecessors, (2067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:41,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 2067 transitions. [2022-03-15 18:55:41,150 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 2067 transitions. Word has length 49 [2022-03-15 18:55:41,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:55:41,151 INFO L470 AbstractCegarLoop]: Abstraction has 870 states and 2067 transitions. [2022-03-15 18:55:41,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 7.35) internal successors, (147), 19 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:41,151 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 2067 transitions. [2022-03-15 18:55:41,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-15 18:55:41,152 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:55:41,152 INFO L514 BasicCegarLoop]: 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] [2022-03-15 18:55:41,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-03-15 18:55:41,152 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:55:41,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:55:41,152 INFO L85 PathProgramCache]: Analyzing trace with hash -2135545705, now seen corresponding path program 44 times [2022-03-15 18:55:41,153 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:55:41,153 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666556670] [2022-03-15 18:55:41,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:55:41,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:55:41,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:55:41,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:55:41,296 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:55:41,296 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666556670] [2022-03-15 18:55:41,296 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666556670] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:55:41,296 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:55:41,296 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-15 18:55:41,296 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [261505521] [2022-03-15 18:55:41,296 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:55:41,299 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:55:41,337 INFO L252 McrAutomatonBuilder]: Finished intersection with 240 states and 497 transitions. [2022-03-15 18:55:41,338 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:55:43,785 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [845538#(and (< ~n3~0 ~n2~0) (or (= ~n1~0 0) (not (= ~n3~0 0)))), 845536#(and (= ~n2~0 0) (<= (+ 2 ~n3~0) ~n1~0) (<= 0 ~n3~0)), 845539#(and (or (= ~n2~0 ~n1~0) (< ~n3~0 ~n2~0) (< ~n1~0 ~n2~0)) (or (= ~n2~0 ~n1~0) (not (= ~n3~0 0)) (< ~n1~0 ~n2~0)) (or (not (= ~n1~0 0)) (< ~n3~0 ~n2~0))), 845534#(and (not (= ~n3~0 0)) (< ~n3~0 ~n1~0)), 845535#(and (or (< ~n3~0 ~n1~0) (< ~n2~0 ~n1~0)) (or (not (= ~n3~0 0)) (not (= ~n2~0 0))) (or (not (= ~n2~0 0)) (< ~n3~0 ~n1~0)) (or (not (= ~n3~0 0)) (< ~n2~0 ~n1~0))), 845537#(and (<= (+ ~n1~0 1) ~n2~0) (= ~n1~0 0) (or (= ~n1~0 ~n3~0) (< ~n3~0 ~n1~0)))] [2022-03-15 18:55:43,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 18:55:43,785 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:55:43,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 18:55:43,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-03-15 18:55:43,786 INFO L87 Difference]: Start difference. First operand 870 states and 2067 transitions. Second operand has 15 states, 15 states have (on average 7.066666666666666) internal successors, (106), 14 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:44,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:55:44,087 INFO L93 Difference]: Finished difference Result 952 states and 2243 transitions. [2022-03-15 18:55:44,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 18:55:44,088 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.066666666666666) internal successors, (106), 14 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-03-15 18:55:44,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:55:44,089 INFO L225 Difference]: With dead ends: 952 [2022-03-15 18:55:44,089 INFO L226 Difference]: Without dead ends: 842 [2022-03-15 18:55:44,089 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 177 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2022-03-15 18:55:44,089 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 92 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:55:44,090 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 250 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:55:44,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2022-03-15 18:55:44,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 822. [2022-03-15 18:55:44,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 821 states have (on average 2.373934226552984) internal successors, (1949), 821 states have internal predecessors, (1949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:44,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1949 transitions. [2022-03-15 18:55:44,097 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1949 transitions. Word has length 49 [2022-03-15 18:55:44,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:55:44,097 INFO L470 AbstractCegarLoop]: Abstraction has 822 states and 1949 transitions. [2022-03-15 18:55:44,097 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.066666666666666) internal successors, (106), 14 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:44,097 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1949 transitions. [2022-03-15 18:55:44,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-15 18:55:44,098 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:55:44,098 INFO L514 BasicCegarLoop]: 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] [2022-03-15 18:55:44,098 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-03-15 18:55:44,098 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:55:44,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:55:44,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1194317977, now seen corresponding path program 45 times [2022-03-15 18:55:44,099 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:55:44,099 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007832505] [2022-03-15 18:55:44,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:55:44,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:55:44,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:55:44,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:55:44,288 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:55:44,288 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007832505] [2022-03-15 18:55:44,288 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007832505] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:55:44,288 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:55:44,288 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-15 18:55:44,288 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [671074649] [2022-03-15 18:55:44,288 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:55:44,291 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:55:44,334 INFO L252 McrAutomatonBuilder]: Finished intersection with 262 states and 556 transitions. [2022-03-15 18:55:44,334 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:55:47,439 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [848158#(and (or (<= 1 ~n1~0) (< ~n3~0 ~n2~0)) (or (<= 1 ~n1~0) (not (= ~n3~0 0))) (or (<= (+ ~n3~0 1) ~n1~0) (< ~n3~0 ~n2~0))), 848160#(and (or (= ~n2~0 ~n1~0) (< ~n3~0 ~n2~0) (< ~n1~0 ~n2~0)) (or (= ~n2~0 ~n1~0) (not (= ~n3~0 0)) (< ~n1~0 ~n2~0)) (or (not (= ~n1~0 0)) (< ~n3~0 ~n2~0))), 848154#(and (or (<= 2 ~n1~0) (< ~n3~0 ~n1~0)) (<= ~n3~0 ~n1~0) (not (= ~n3~0 0))), 848159#(and (or (<= (+ ~n1~0 1) ~n2~0) (not (= ~n3~0 0))) (< ~n3~0 ~n2~0)), 848153#(and (not (= ~n3~0 0)) (< ~n3~0 ~n1~0)), 848157#(and (<= (+ ~n3~0 1) ~n1~0) (<= 2 ~n1~0) (< ~n1~0 (+ 2 ~n3~0))), 848155#(and (or (< ~n3~0 ~n1~0) (< ~n2~0 ~n1~0)) (or (not (= ~n3~0 0)) (not (= ~n2~0 0))) (or (not (= ~n2~0 0)) (< ~n3~0 ~n1~0)) (or (not (= ~n3~0 0)) (< ~n2~0 ~n1~0))), 848156#(and (or (<= 2 ~n1~0) (< ~n3~0 ~n1~0) (< ~n2~0 ~n1~0)) (or (<= 2 ~n1~0) (not (= ~n2~0 0)) (< ~n3~0 ~n1~0)) (or (not (= ~n3~0 0)) (not (= ~n2~0 0))) (or (<= ~n3~0 ~n1~0) (< ~n2~0 ~n1~0)) (or (<= ~n3~0 ~n1~0) (not (= ~n2~0 0))) (or (not (= ~n3~0 0)) (< ~n2~0 ~n1~0)))] [2022-03-15 18:55:47,439 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 18:55:47,439 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:55:47,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 18:55:47,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2022-03-15 18:55:47,440 INFO L87 Difference]: Start difference. First operand 822 states and 1949 transitions. Second operand has 21 states, 21 states have (on average 6.238095238095238) internal successors, (131), 20 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:47,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:55:47,817 INFO L93 Difference]: Finished difference Result 780 states and 1852 transitions. [2022-03-15 18:55:47,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 18:55:47,818 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.238095238095238) internal successors, (131), 20 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-03-15 18:55:47,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:55:47,818 INFO L225 Difference]: With dead ends: 780 [2022-03-15 18:55:47,818 INFO L226 Difference]: Without dead ends: 582 [2022-03-15 18:55:47,819 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 185 SyntacticMatches, 14 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2022-03-15 18:55:47,819 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 110 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:55:47,819 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 278 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:55:47,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2022-03-15 18:55:47,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 566. [2022-03-15 18:55:47,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 565 states have (on average 2.3964601769911504) internal successors, (1354), 565 states have internal predecessors, (1354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:47,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 1354 transitions. [2022-03-15 18:55:47,824 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 1354 transitions. Word has length 49 [2022-03-15 18:55:47,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:55:47,824 INFO L470 AbstractCegarLoop]: Abstraction has 566 states and 1354 transitions. [2022-03-15 18:55:47,824 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.238095238095238) internal successors, (131), 20 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:47,824 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 1354 transitions. [2022-03-15 18:55:47,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-15 18:55:47,825 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:55:47,825 INFO L514 BasicCegarLoop]: 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] [2022-03-15 18:55:47,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-03-15 18:55:47,825 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:55:47,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:55:47,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1646434295, now seen corresponding path program 46 times [2022-03-15 18:55:47,826 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:55:47,826 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394941114] [2022-03-15 18:55:47,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:55:47,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:55:47,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:55:47,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:55:47,991 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:55:47,991 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394941114] [2022-03-15 18:55:47,991 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394941114] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:55:47,991 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:55:47,991 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-15 18:55:47,991 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [48656876] [2022-03-15 18:55:47,991 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:55:47,994 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:55:48,061 INFO L252 McrAutomatonBuilder]: Finished intersection with 406 states and 927 transitions. [2022-03-15 18:55:48,061 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:55:55,706 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [850098#(and (or (not (= ~n3~0 0)) (not (= ~n1~0 0))) (or (= ~n2~0 ~n1~0) (not (= ~n3~0 0)) (< ~n1~0 ~n2~0)) (or (= ~n2~0 ~n1~0) (<= 1 ~n2~0) (< ~n3~0 ~n2~0) (< ~n1~0 ~n2~0)) (or (not (= ~n2~0 0)) (not (= ~n1~0 0)) (< ~n3~0 ~n2~0))), 850092#(and (or (< ~n1~0 ~n3~0) (< ~n2~0 (+ ~n3~0 1)) (= ~n1~0 ~n3~0)) (or (< ~n1~0 ~n3~0) (<= 1 ~n2~0) (= ~n1~0 ~n3~0)) (or (< ~n2~0 (+ ~n3~0 1)) (not (= ~n1~0 0))) (or (<= 1 ~n2~0) (not (= ~n1~0 0)))), 850096#(and (or (<= 1 ~n2~0) (< ~n3~0 ~n2~0)) (not (= ~n3~0 0))), 850104#(and (or (= ~n2~0 0) (not (= ~n3~0 0))) (< ~n3~0 ~n1~0)), 850100#(and (or (< ~n1~0 (+ ~n3~0 1)) (< ~n2~0 (+ 2 ~n3~0)) (= (+ ~n3~0 1) ~n1~0)) (or (< ~n2~0 (+ 2 ~n3~0)) (not (= ~n1~0 0))) (or (< ~n1~0 (+ ~n3~0 1)) (<= 1 ~n2~0) (= (+ ~n3~0 1) ~n1~0)) (or (<= 1 ~n2~0) (not (= ~n1~0 0)))), 850102#(and (< ~n2~0 (+ 2 ~n3~0)) (<= (+ ~n1~0 1) ~n2~0) (= ~n1~0 0)), 850095#(and (not (= ~n3~0 0)) (< ~n3~0 ~n2~0)), 850099#(and (or (<= (+ ~n1~0 1) ~n2~0) (not (= ~n1~0 0))) (or (< ~n1~0 ~n3~0) (= ~n1~0 ~n3~0)) (or (< ~n2~0 (+ ~n3~0 1)) (not (= ~n1~0 0)))), 850103#(and (<= ~n1~0 ~n3~0) (or (= ~n2~0 ~n3~0) (< ~n2~0 ~n3~0)) (= ~n1~0 0)), 850106#(and (or (not (< ~n3~0 ~n2~0)) (<= ~n1~0 ~n2~0)) (or (<= ~n1~0 ~n3~0) (< ~n3~0 ~n2~0)) (= ~n1~0 0)), 850097#(and (or (not (= ~n3~0 0)) (not (= ~n1~0 0))) (or (= ~n2~0 ~n1~0) (< ~n3~0 ~n2~0) (< ~n1~0 ~n2~0)) (or (= ~n2~0 ~n1~0) (not (= ~n3~0 0)) (< ~n1~0 ~n2~0)) (or (not (= ~n1~0 0)) (< ~n3~0 ~n2~0))), 850093#(and (= ~n2~0 0) (or (<= 1 ~n1~0) (not (< ~n3~0 ~n1~0))) (or (<= 1 ~n3~0) (< ~n3~0 ~n1~0))), 850094#(and (or (<= 1 ~n3~0) (< ~n3~0 ~n1~0)) (or (= ~n2~0 0) (< ~n3~0 ~n1~0)) (or (= ~n2~0 0) (not (= ~n3~0 0)))), 850101#(and (or (< ~n1~0 (+ ~n3~0 1)) (= (+ ~n3~0 1) ~n1~0)) (or (< ~n2~0 (+ 2 ~n3~0)) (not (= ~n1~0 0))) (or (<= 1 ~n2~0) (not (= ~n1~0 0)))), 850105#(and (or (= ~n2~0 0) (< ~n3~0 ~n1~0) (< ~n2~0 ~n1~0)) (or (<= 1 ~n3~0) (< ~n3~0 ~n1~0) (< ~n2~0 ~n1~0)) (or (not (= ~n3~0 0)) (< ~n2~0 ~n1~0)))] [2022-03-15 18:55:55,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 18:55:55,706 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:55:55,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 18:55:55,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=630, Unknown=0, NotChecked=0, Total=756 [2022-03-15 18:55:55,707 INFO L87 Difference]: Start difference. First operand 566 states and 1354 transitions. Second operand has 28 states, 28 states have (on average 6.642857142857143) internal successors, (186), 27 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:56,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:55:56,185 INFO L93 Difference]: Finished difference Result 710 states and 1694 transitions. [2022-03-15 18:55:56,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 18:55:56,185 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 6.642857142857143) internal successors, (186), 27 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-03-15 18:55:56,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:55:56,186 INFO L225 Difference]: With dead ends: 710 [2022-03-15 18:55:56,186 INFO L226 Difference]: Without dead ends: 478 [2022-03-15 18:55:56,186 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 305 SyntacticMatches, 29 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=202, Invalid=988, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 18:55:56,187 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 254 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:55:56,187 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [254 Valid, 268 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 854 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:55:56,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2022-03-15 18:55:56,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 478. [2022-03-15 18:55:56,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 477 states have (on average 2.3647798742138364) internal successors, (1128), 477 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:56,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 1128 transitions. [2022-03-15 18:55:56,191 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 1128 transitions. Word has length 49 [2022-03-15 18:55:56,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:55:56,191 INFO L470 AbstractCegarLoop]: Abstraction has 478 states and 1128 transitions. [2022-03-15 18:55:56,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.642857142857143) internal successors, (186), 27 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:56,191 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 1128 transitions. [2022-03-15 18:55:56,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-15 18:55:56,192 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:55:56,192 INFO L514 BasicCegarLoop]: 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] [2022-03-15 18:55:56,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-03-15 18:55:56,192 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:55:56,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:55:56,192 INFO L85 PathProgramCache]: Analyzing trace with hash -55440809, now seen corresponding path program 47 times [2022-03-15 18:55:56,193 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:55:56,193 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067987196] [2022-03-15 18:55:56,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:55:56,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:55:56,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:55:56,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:55:56,307 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:55:56,307 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067987196] [2022-03-15 18:55:56,307 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067987196] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:55:56,307 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:55:56,307 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-15 18:55:56,307 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [88522756] [2022-03-15 18:55:56,307 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:55:56,310 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:55:56,439 INFO L252 McrAutomatonBuilder]: Finished intersection with 562 states and 1369 transitions. [2022-03-15 18:55:56,439 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:56:06,430 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [851803#(and (or (not (= ~n3~0 0)) (not (= ~n1~0 0))) (or (= ~n2~0 ~n1~0) (< ~n3~0 ~n2~0) (< ~n1~0 ~n2~0)) (or (= ~n2~0 ~n1~0) (not (= ~n3~0 0)) (< ~n1~0 ~n2~0)) (or (not (= ~n1~0 0)) (< ~n3~0 ~n2~0))), 851804#(and (or (not (= ~n3~0 0)) (not (= ~n1~0 0))) (or (= ~n2~0 ~n1~0) (not (= ~n3~0 0)) (< ~n1~0 ~n2~0)) (or (= ~n2~0 ~n1~0) (<= 2 ~n2~0) (< ~n3~0 ~n2~0) (< ~n1~0 ~n2~0)) (or (<= 2 ~n2~0) (not (= ~n1~0 0)) (< ~n3~0 ~n2~0))), 851799#(and (or (not (< ~n3~0 ~n2~0)) (<= 2 ~n2~0) (= (+ ~n2~0 1) ~n1~0) (< ~n1~0 (+ ~n2~0 1))) (or (<= 2 ~n2~0) (not (= ~n1~0 0))) (or (< ~n1~0 (+ ~n3~0 1)) (<= 2 ~n2~0) (= (+ ~n3~0 1) ~n1~0) (< ~n3~0 ~n2~0))), 851798#(and (or (< ~n1~0 (+ ~n3~0 1)) (<= 2 ~n2~0) (= (+ ~n3~0 1) ~n1~0)) (or (< ~n1~0 (+ ~n3~0 1)) (<= ~n2~0 (+ ~n3~0 1)) (= (+ ~n3~0 1) ~n1~0)) (or (<= 2 ~n2~0) (not (= ~n1~0 0))) (or (<= ~n2~0 (+ ~n3~0 1)) (not (= ~n1~0 0)))), 851802#(and (or (<= 2 ~n2~0) (< ~n3~0 ~n2~0)) (not (= ~n3~0 0))), 851809#(and (or (< ~n3~0 ~n1~0) (< ~n2~0 ~n1~0)) (or (not (= ~n2~0 0)) (< ~n3~0 ~n1~0)) (or (not (= ~n3~0 0)) (< ~n2~0 ~n1~0))), 851806#(and (or (<= 2 ~n2~0) (< ~n3~0 ~n1~0)) (or (<= 2 ~n2~0) (not (= ~n3~0 0)))), 851805#(and (or (not (< ~n2~0 ~n3~0)) (<= 1 ~n3~0)) (or (<= 1 ~n2~0) (< ~n2~0 ~n3~0))), 851797#(and (or (< ~n1~0 ~n3~0) (<= 2 ~n2~0) (= ~n1~0 ~n3~0)) (or (<= ~n2~0 ~n3~0) (not (= ~n1~0 0))) (or (<= 2 ~n2~0) (not (= ~n1~0 0))) (or (< ~n1~0 ~n3~0) (<= ~n2~0 ~n3~0) (= ~n1~0 ~n3~0))), 851807#(and (or (= ~n3~0 0) (< ~n3~0 ~n1~0)) (or (<= (+ ~n3~0 1) ~n2~0) (not (= ~n3~0 0)))), 851808#(and (or (not (= ~n3~0 0)) (<= (+ ~n2~0 1) ~n1~0)) (< ~n3~0 ~n1~0)), 851800#(or (<= 2 ~n2~0) (not (= ~n1~0 0))), 851801#(and (not (= ~n3~0 0)) (< ~n3~0 ~n2~0))] [2022-03-15 18:56:06,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 18:56:06,430 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:56:06,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 18:56:06,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2022-03-15 18:56:06,431 INFO L87 Difference]: Start difference. First operand 478 states and 1128 transitions. Second operand has 23 states, 23 states have (on average 8.26086956521739) internal successors, (190), 22 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:06,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:56:06,760 INFO L93 Difference]: Finished difference Result 390 states and 920 transitions. [2022-03-15 18:56:06,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 18:56:06,762 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 8.26086956521739) internal successors, (190), 22 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-03-15 18:56:06,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:56:06,762 INFO L225 Difference]: With dead ends: 390 [2022-03-15 18:56:06,762 INFO L226 Difference]: Without dead ends: 0 [2022-03-15 18:56:06,762 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 469 SyntacticMatches, 23 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2022-03-15 18:56:06,763 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 171 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:56:06,763 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 147 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:56:06,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-03-15 18:56:06,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-03-15 18:56:06,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:06,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-03-15 18:56:06,763 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2022-03-15 18:56:06,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:56:06,763 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-03-15 18:56:06,763 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.26086956521739) internal successors, (190), 22 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:06,764 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-03-15 18:56:06,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-03-15 18:56:06,765 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-03-15 18:56:06,766 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-03-15 18:56:06,766 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-03-15 18:56:06,766 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-03-15 18:56:06,766 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-03-15 18:56:06,767 INFO L732 BasicCegarLoop]: Path program histogram: [47] [2022-03-15 18:56:06,768 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 18:56:06,768 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 18:56:06,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 06:56:06 BasicIcfg [2022-03-15 18:56:06,770 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 18:56:06,770 INFO L158 Benchmark]: Toolchain (without parser) took 325670.56ms. Allocated memory was 202.4MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 151.4MB in the beginning and 442.0MB in the end (delta: -290.6MB). Peak memory consumption was 785.4MB. Max. memory is 8.0GB. [2022-03-15 18:56:06,770 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 202.4MB. Free memory is still 167.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 18:56:06,770 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.96ms. Allocated memory is still 202.4MB. Free memory was 151.2MB in the beginning and 176.4MB in the end (delta: -25.2MB). Peak memory consumption was 10.8MB. Max. memory is 8.0GB. [2022-03-15 18:56:06,770 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.20ms. Allocated memory is still 202.4MB. Free memory was 176.4MB in the beginning and 173.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 18:56:06,770 INFO L158 Benchmark]: Boogie Preprocessor took 16.89ms. Allocated memory is still 202.4MB. Free memory was 173.8MB in the beginning and 172.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 18:56:06,770 INFO L158 Benchmark]: RCFGBuilder took 454.80ms. Allocated memory is still 202.4MB. Free memory was 172.2MB in the beginning and 143.4MB in the end (delta: 28.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-03-15 18:56:06,770 INFO L158 Benchmark]: TraceAbstraction took 324896.95ms. Allocated memory was 202.4MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 142.8MB in the beginning and 442.0MB in the end (delta: -299.1MB). Peak memory consumption was 776.7MB. Max. memory is 8.0GB. [2022-03-15 18:56:06,771 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 202.4MB. Free memory is still 167.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 268.96ms. Allocated memory is still 202.4MB. Free memory was 151.2MB in the beginning and 176.4MB in the end (delta: -25.2MB). Peak memory consumption was 10.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.20ms. Allocated memory is still 202.4MB. Free memory was 176.4MB in the beginning and 173.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 16.89ms. Allocated memory is still 202.4MB. Free memory was 173.8MB in the beginning and 172.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 454.80ms. Allocated memory is still 202.4MB. Free memory was 172.2MB in the beginning and 143.4MB in the end (delta: 28.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * TraceAbstraction took 324896.95ms. Allocated memory was 202.4MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 142.8MB in the beginning and 442.0MB in the end (delta: -299.1MB). Peak memory consumption was 776.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 160 PlacesBefore, 63 PlacesAfterwards, 152 TransitionsBefore, 53 TransitionsAfterwards, 2184 CoEnabledTransitionPairs, 7 FixpointIterations, 81 TrivialSequentialCompositions, 18 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 2 ChoiceCompositions, 104 TotalNumberOfCompositions, 18996 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6178, positive: 5628, positive conditional: 0, positive unconditional: 5628, negative: 550, negative conditional: 0, negative unconditional: 550, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 878, positive: 842, positive conditional: 0, positive unconditional: 842, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6178, positive: 4786, positive conditional: 0, positive unconditional: 4786, negative: 514, negative conditional: 0, negative unconditional: 514, unknown: 878, unknown conditional: 0, unknown unconditional: 878] , Statistics on independence cache: Total cache size (in pairs): 354, Positive cache size: 324, Positive conditional cache size: 0, Positive unconditional cache size: 324, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30 - 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 - PositiveResult [Line: 196]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 199 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 324.8s, OverallIterations: 47, TraceHistogramMax: 1, PathProgramHistogramMax: 47, EmptinessCheckTime: 0.4s, AutomataDifference: 29.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.6s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12303 SdHoareTripleChecker+Valid, 20.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12303 mSDsluCounter, 20034 SdHoareTripleChecker+Invalid, 17.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 43576 mSDsCounter, 3401 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 55890 IncrementalHoareTripleChecker+Invalid, 59291 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3401 mSolverCounterUnsat, 1993 mSDtfsCounter, 55890 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15437 GetRequests, 13399 SyntacticMatches, 956 SemanticMatches, 1082 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11387 ImplicationChecksByTransitivity, 19.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10554occurred in iteration=8, InterpolantAutomatonStates: 712, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.6s AutomataMinimizationTime, 47 MinimizatonAttempts, 60362 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 2303 NumberOfCodeBlocks, 2303 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 2256 ConstructedInterpolants, 0 QuantifiedInterpolants, 14705 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 47 InterpolantComputations, 47 PerfectInterpolantSequences, 0/0 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-03-15 18:56:06,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...