/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/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-4b0ab11 [2022-03-03 17:28:09,451 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-03 17:28:09,453 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-03 17:28:09,494 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-03 17:28:09,495 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-03 17:28:09,497 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-03 17:28:09,499 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-03 17:28:09,504 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-03 17:28:09,505 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-03 17:28:09,509 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-03 17:28:09,510 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-03 17:28:09,511 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-03 17:28:09,511 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-03 17:28:09,513 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-03 17:28:09,514 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-03 17:28:09,515 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-03 17:28:09,515 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-03 17:28:09,516 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-03 17:28:09,518 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-03 17:28:09,522 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-03 17:28:09,524 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-03 17:28:09,525 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-03 17:28:09,526 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-03 17:28:09,526 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-03 17:28:09,531 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-03 17:28:09,531 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-03 17:28:09,531 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-03 17:28:09,533 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-03 17:28:09,533 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-03 17:28:09,533 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-03 17:28:09,534 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-03 17:28:09,534 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-03 17:28:09,536 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-03 17:28:09,536 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-03 17:28:09,537 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-03 17:28:09,537 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-03 17:28:09,538 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-03 17:28:09,538 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-03 17:28:09,538 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-03 17:28:09,538 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-03 17:28:09,539 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-03 17:28:09,540 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-03-03 17:28:09,567 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-03 17:28:09,567 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-03 17:28:09,567 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-03 17:28:09,567 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-03 17:28:09,568 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-03 17:28:09,568 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-03 17:28:09,568 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-03 17:28:09,568 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-03 17:28:09,568 INFO L138 SettingsManager]: * Use SBE=true [2022-03-03 17:28:09,569 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-03 17:28:09,569 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-03 17:28:09,569 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-03 17:28:09,569 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-03 17:28:09,569 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-03 17:28:09,569 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-03 17:28:09,569 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-03 17:28:09,569 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-03 17:28:09,569 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-03 17:28:09,569 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-03 17:28:09,569 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-03 17:28:09,569 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-03 17:28:09,570 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-03 17:28:09,570 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-03 17:28:09,570 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-03 17:28:09,570 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-03 17:28:09,570 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-03 17:28:09,570 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-03 17:28:09,570 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-03 17:28:09,570 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-03 17:28:09,570 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-03 17:28:09,570 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-03 17:28:09,570 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-03 17:28:09,570 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-03 17:28:09,571 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-03 17:28:09,762 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-03 17:28:09,782 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-03 17:28:09,784 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-03 17:28:09,785 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-03 17:28:09,786 INFO L275 PluginConnector]: CDTParser initialized [2022-03-03 17:28:09,787 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2022-03-03 17:28:09,844 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6a6f846d/44bfdfc402014cee884815d2391fd8c1/FLAG8dfdbaf11 [2022-03-03 17:28:10,164 INFO L306 CDTParser]: Found 1 translation units. [2022-03-03 17:28:10,165 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2022-03-03 17:28:10,172 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6a6f846d/44bfdfc402014cee884815d2391fd8c1/FLAG8dfdbaf11 [2022-03-03 17:28:10,586 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6a6f846d/44bfdfc402014cee884815d2391fd8c1 [2022-03-03 17:28:10,587 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-03 17:28:10,589 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-03 17:28:10,590 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-03 17:28:10,590 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-03 17:28:10,598 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-03 17:28:10,599 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:28:10" (1/1) ... [2022-03-03 17:28:10,599 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69949c8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:28:10, skipping insertion in model container [2022-03-03 17:28:10,600 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:28:10" (1/1) ... [2022-03-03 17:28:10,605 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-03 17:28:10,616 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-03 17:28:10,795 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/popl20-more-dec-subseq.wvr.c[2924,2937] [2022-03-03 17:28:10,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-03 17:28:10,816 INFO L203 MainTranslator]: Completed pre-run [2022-03-03 17:28:10,840 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/popl20-more-dec-subseq.wvr.c[2924,2937] [2022-03-03 17:28:10,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-03 17:28:10,851 INFO L208 MainTranslator]: Completed translation [2022-03-03 17:28:10,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:28:10 WrapperNode [2022-03-03 17:28:10,851 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-03 17:28:10,852 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-03 17:28:10,852 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-03 17:28:10,852 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-03 17:28:10,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:28:10" (1/1) ... [2022-03-03 17:28:10,863 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:28:10" (1/1) ... [2022-03-03 17:28:10,880 INFO L137 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 191 [2022-03-03 17:28:10,880 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-03 17:28:10,881 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-03 17:28:10,881 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-03 17:28:10,881 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-03 17:28:10,886 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:28:10" (1/1) ... [2022-03-03 17:28:10,886 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:28:10" (1/1) ... [2022-03-03 17:28:10,888 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:28:10" (1/1) ... [2022-03-03 17:28:10,888 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:28:10" (1/1) ... [2022-03-03 17:28:10,894 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:28:10" (1/1) ... [2022-03-03 17:28:10,897 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:28:10" (1/1) ... [2022-03-03 17:28:10,898 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:28:10" (1/1) ... [2022-03-03 17:28:10,900 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-03 17:28:10,901 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-03 17:28:10,901 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-03 17:28:10,901 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-03 17:28:10,914 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:28:10" (1/1) ... [2022-03-03 17:28:10,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-03 17:28:10,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:28:10,937 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-03 17:28:10,943 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-03 17:28:10,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-03 17:28:10,964 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-03 17:28:10,964 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-03 17:28:10,964 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-03 17:28:10,964 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-03 17:28:10,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-03 17:28:10,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-03 17:28:10,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-03 17:28:10,965 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-03 17:28:10,965 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-03 17:28:10,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-03 17:28:10,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-03 17:28:10,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-03 17:28:10,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-03 17:28:10,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-03 17:28:10,966 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-03 17:28:11,049 INFO L234 CfgBuilder]: Building ICFG [2022-03-03 17:28:11,051 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-03 17:28:11,316 INFO L275 CfgBuilder]: Performing block encoding [2022-03-03 17:28:11,386 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-03 17:28:11,386 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-03-03 17:28:11,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.03 05:28:11 BoogieIcfgContainer [2022-03-03 17:28:11,388 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-03 17:28:11,390 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-03 17:28:11,390 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-03 17:28:11,392 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-03 17:28:11,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:28:10" (1/3) ... [2022-03-03 17:28:11,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f579e4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:28:11, skipping insertion in model container [2022-03-03 17:28:11,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:28:10" (2/3) ... [2022-03-03 17:28:11,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f579e4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:28:11, skipping insertion in model container [2022-03-03 17:28:11,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.03 05:28:11" (3/3) ... [2022-03-03 17:28:11,394 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-dec-subseq.wvr.c [2022-03-03 17:28:11,399 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-03 17:28:11,399 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-03 17:28:11,399 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-03 17:28:11,399 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-03 17:28:11,440 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,440 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,440 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,440 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,440 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,440 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,441 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,442 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,442 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,442 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,442 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,442 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,443 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,443 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,443 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,443 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,443 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,443 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,443 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,444 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,445 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,445 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,445 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,445 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,445 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,446 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,447 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,448 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,448 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,449 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,449 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,449 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,449 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,449 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,450 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,450 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,450 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,450 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,451 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,451 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,451 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,451 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,451 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,451 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,451 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,451 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,452 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,452 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,452 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,452 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,453 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,453 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,457 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,457 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,457 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,457 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,458 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,458 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,458 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,458 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,458 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,458 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,459 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,459 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,459 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,459 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,459 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,460 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,460 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:11,464 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-03-03 17:28:11,507 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-03 17:28:11,513 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, 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=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-03 17:28:11,514 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-03-03 17:28:11,525 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 181 places, 189 transitions, 394 flow [2022-03-03 17:28:11,583 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 704 states, 703 states have (on average 2.52773826458037) internal successors, (1777), 703 states have internal predecessors, (1777), 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-03 17:28:11,585 INFO L276 IsEmpty]: Start isEmpty. Operand has 704 states, 703 states have (on average 2.52773826458037) internal successors, (1777), 703 states have internal predecessors, (1777), 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-03 17:28:11,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-03-03 17:28:11,608 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:28:11,609 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 17:28:11,609 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-03 17:28:11,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:28:11,614 INFO L85 PathProgramCache]: Analyzing trace with hash -7555604, now seen corresponding path program 1 times [2022-03-03 17:28:11,620 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:28:11,620 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291420344] [2022-03-03 17:28:11,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:28:11,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:28:11,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:28:11,817 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-03 17:28:11,818 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:28:11,820 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291420344] [2022-03-03 17:28:11,825 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291420344] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 17:28:11,825 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 17:28:11,825 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-03 17:28:11,826 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887742337] [2022-03-03 17:28:11,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:28:11,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-03 17:28:11,831 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:28:11,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-03 17:28:11,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-03 17:28:11,856 INFO L87 Difference]: Start difference. First operand has 704 states, 703 states have (on average 2.52773826458037) internal successors, (1777), 703 states have internal predecessors, (1777), 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 2 states, 2 states have (on average 66.0) internal successors, (132), 2 states have internal predecessors, (132), 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-03 17:28:11,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:28:11,904 INFO L93 Difference]: Finished difference Result 704 states and 1672 transitions. [2022-03-03 17:28:11,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-03 17:28:11,908 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 66.0) internal successors, (132), 2 states have internal predecessors, (132), 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 132 [2022-03-03 17:28:11,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:28:11,922 INFO L225 Difference]: With dead ends: 704 [2022-03-03 17:28:11,922 INFO L226 Difference]: Without dead ends: 698 [2022-03-03 17:28:11,929 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-03 17:28:11,932 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-03 17:28:11,933 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 161 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-03 17:28:11,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2022-03-03 17:28:11,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 698. [2022-03-03 17:28:11,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 697 states have (on average 2.3902439024390243) internal successors, (1666), 697 states have internal predecessors, (1666), 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-03 17:28:11,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1666 transitions. [2022-03-03 17:28:11,987 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1666 transitions. Word has length 132 [2022-03-03 17:28:11,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:28:11,987 INFO L470 AbstractCegarLoop]: Abstraction has 698 states and 1666 transitions. [2022-03-03 17:28:11,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 66.0) internal successors, (132), 2 states have internal predecessors, (132), 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-03 17:28:11,988 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1666 transitions. [2022-03-03 17:28:11,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-03-03 17:28:11,990 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:28:11,990 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 17:28:11,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-03 17:28:11,991 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-03 17:28:11,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:28:11,991 INFO L85 PathProgramCache]: Analyzing trace with hash 962025419, now seen corresponding path program 1 times [2022-03-03 17:28:11,991 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:28:11,991 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918659495] [2022-03-03 17:28:11,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:28:11,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:28:12,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:28:12,251 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-03 17:28:12,251 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:28:12,251 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918659495] [2022-03-03 17:28:12,251 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918659495] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 17:28:12,251 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 17:28:12,251 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-03 17:28:12,252 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984651159] [2022-03-03 17:28:12,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:28:12,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 17:28:12,253 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:28:12,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 17:28:12,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-03 17:28:12,254 INFO L87 Difference]: Start difference. First operand 698 states and 1666 transitions. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 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-03 17:28:12,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:28:12,371 INFO L93 Difference]: Finished difference Result 1118 states and 2818 transitions. [2022-03-03 17:28:12,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-03 17:28:12,372 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 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 132 [2022-03-03 17:28:12,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:28:12,377 INFO L225 Difference]: With dead ends: 1118 [2022-03-03 17:28:12,377 INFO L226 Difference]: Without dead ends: 1118 [2022-03-03 17:28:12,378 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-03-03 17:28:12,379 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 132 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 17:28:12,379 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 431 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 17:28:12,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2022-03-03 17:28:12,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 740. [2022-03-03 17:28:12,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 739 states have (on average 2.404600811907984) internal successors, (1777), 739 states have internal predecessors, (1777), 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-03 17:28:12,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1777 transitions. [2022-03-03 17:28:12,411 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1777 transitions. Word has length 132 [2022-03-03 17:28:12,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:28:12,412 INFO L470 AbstractCegarLoop]: Abstraction has 740 states and 1777 transitions. [2022-03-03 17:28:12,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 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-03 17:28:12,412 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1777 transitions. [2022-03-03 17:28:12,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-03-03 17:28:12,414 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:28:12,414 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 17:28:12,414 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-03 17:28:12,415 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-03 17:28:12,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:28:12,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1932159763, now seen corresponding path program 1 times [2022-03-03 17:28:12,415 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:28:12,415 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736530441] [2022-03-03 17:28:12,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:28:12,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:28:12,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:28:12,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:28:12,509 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:28:12,509 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736530441] [2022-03-03 17:28:12,509 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736530441] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 17:28:12,509 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 17:28:12,509 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-03 17:28:12,510 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948719840] [2022-03-03 17:28:12,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:28:12,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-03 17:28:12,510 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:28:12,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-03 17:28:12,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-03-03 17:28:12,511 INFO L87 Difference]: Start difference. First operand 740 states and 1777 transitions. Second operand has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 7 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-03 17:28:12,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:28:12,613 INFO L93 Difference]: Finished difference Result 1185 states and 2913 transitions. [2022-03-03 17:28:12,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-03 17:28:12,614 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 7 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 137 [2022-03-03 17:28:12,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:28:12,619 INFO L225 Difference]: With dead ends: 1185 [2022-03-03 17:28:12,619 INFO L226 Difference]: Without dead ends: 1124 [2022-03-03 17:28:12,622 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2022-03-03 17:28:12,624 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 318 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 17:28:12,624 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [318 Valid, 484 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 17:28:12,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2022-03-03 17:28:12,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 741. [2022-03-03 17:28:12,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 740 states have (on average 2.402702702702703) internal successors, (1778), 740 states have internal predecessors, (1778), 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-03 17:28:12,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1778 transitions. [2022-03-03 17:28:12,681 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1778 transitions. Word has length 137 [2022-03-03 17:28:12,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:28:12,681 INFO L470 AbstractCegarLoop]: Abstraction has 741 states and 1778 transitions. [2022-03-03 17:28:12,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 7 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-03 17:28:12,682 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1778 transitions. [2022-03-03 17:28:12,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-03-03 17:28:12,683 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:28:12,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 17:28:12,684 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-03 17:28:12,684 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-03 17:28:12,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:28:12,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1113696768, now seen corresponding path program 1 times [2022-03-03 17:28:12,684 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:28:12,685 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870276407] [2022-03-03 17:28:12,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:28:12,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:28:12,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:28:12,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-03 17:28:12,803 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:28:12,803 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870276407] [2022-03-03 17:28:12,803 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870276407] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 17:28:12,803 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 17:28:12,803 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-03 17:28:12,803 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294613359] [2022-03-03 17:28:12,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:28:12,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-03 17:28:12,804 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:28:12,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-03 17:28:12,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-03 17:28:12,805 INFO L87 Difference]: Start difference. First operand 741 states and 1778 transitions. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 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-03 17:28:12,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:28:12,862 INFO L93 Difference]: Finished difference Result 1101 states and 2768 transitions. [2022-03-03 17:28:12,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-03 17:28:12,862 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 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 144 [2022-03-03 17:28:12,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:28:12,866 INFO L225 Difference]: With dead ends: 1101 [2022-03-03 17:28:12,866 INFO L226 Difference]: Without dead ends: 918 [2022-03-03 17:28:12,866 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-03-03 17:28:12,867 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 19 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-03 17:28:12,867 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 483 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-03 17:28:12,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2022-03-03 17:28:12,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 800. [2022-03-03 17:28:12,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 799 states have (on average 2.430538172715895) internal successors, (1942), 799 states have internal predecessors, (1942), 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-03 17:28:12,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1942 transitions. [2022-03-03 17:28:12,883 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1942 transitions. Word has length 144 [2022-03-03 17:28:12,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:28:12,885 INFO L470 AbstractCegarLoop]: Abstraction has 800 states and 1942 transitions. [2022-03-03 17:28:12,885 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 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-03 17:28:12,885 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1942 transitions. [2022-03-03 17:28:12,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-03-03 17:28:12,887 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:28:12,887 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 17:28:12,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-03 17:28:12,887 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-03 17:28:12,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:28:12,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1975010592, now seen corresponding path program 1 times [2022-03-03 17:28:12,888 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:28:12,888 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787228905] [2022-03-03 17:28:12,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:28:12,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:28:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:28:13,042 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-03 17:28:13,043 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:28:13,043 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787228905] [2022-03-03 17:28:13,043 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787228905] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 17:28:13,043 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 17:28:13,043 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-03 17:28:13,044 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193518437] [2022-03-03 17:28:13,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:28:13,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-03 17:28:13,045 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:28:13,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-03 17:28:13,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-03-03 17:28:13,045 INFO L87 Difference]: Start difference. First operand 800 states and 1942 transitions. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 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-03 17:28:13,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:28:13,092 INFO L93 Difference]: Finished difference Result 976 states and 2324 transitions. [2022-03-03 17:28:13,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-03 17:28:13,092 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 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 149 [2022-03-03 17:28:13,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:28:13,095 INFO L225 Difference]: With dead ends: 976 [2022-03-03 17:28:13,096 INFO L226 Difference]: Without dead ends: 898 [2022-03-03 17:28:13,096 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-03-03 17:28:13,097 INFO L933 BasicCegarLoop]: 170 mSDtfsCounter, 36 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-03 17:28:13,097 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 524 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-03 17:28:13,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2022-03-03 17:28:13,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 880. [2022-03-03 17:28:13,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 879 states have (on average 2.4175199089874857) internal successors, (2125), 879 states have internal predecessors, (2125), 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-03 17:28:13,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 2125 transitions. [2022-03-03 17:28:13,117 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 2125 transitions. Word has length 149 [2022-03-03 17:28:13,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:28:13,118 INFO L470 AbstractCegarLoop]: Abstraction has 880 states and 2125 transitions. [2022-03-03 17:28:13,119 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 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-03 17:28:13,119 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 2125 transitions. [2022-03-03 17:28:13,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-03-03 17:28:13,121 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:28:13,122 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 17:28:13,122 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-03 17:28:13,122 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-03 17:28:13,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:28:13,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1498906467, now seen corresponding path program 1 times [2022-03-03 17:28:13,123 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:28:13,123 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313725349] [2022-03-03 17:28:13,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:28:13,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:28:13,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:28:13,224 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-03 17:28:13,224 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:28:13,225 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313725349] [2022-03-03 17:28:13,225 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313725349] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 17:28:13,225 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 17:28:13,225 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-03 17:28:13,225 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036644102] [2022-03-03 17:28:13,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:28:13,226 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 17:28:13,226 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:28:13,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 17:28:13,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-03-03 17:28:13,227 INFO L87 Difference]: Start difference. First operand 880 states and 2125 transitions. Second operand has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 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-03 17:28:13,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:28:13,305 INFO L93 Difference]: Finished difference Result 1065 states and 2473 transitions. [2022-03-03 17:28:13,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-03 17:28:13,305 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 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 153 [2022-03-03 17:28:13,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:28:13,308 INFO L225 Difference]: With dead ends: 1065 [2022-03-03 17:28:13,308 INFO L226 Difference]: Without dead ends: 886 [2022-03-03 17:28:13,309 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-03-03 17:28:13,311 INFO L933 BasicCegarLoop]: 147 mSDtfsCounter, 107 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-03 17:28:13,312 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 632 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-03 17:28:13,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2022-03-03 17:28:13,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 881. [2022-03-03 17:28:13,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 880 states have (on average 2.415909090909091) internal successors, (2126), 880 states have internal predecessors, (2126), 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-03 17:28:13,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 2126 transitions. [2022-03-03 17:28:13,327 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 2126 transitions. Word has length 153 [2022-03-03 17:28:13,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:28:13,328 INFO L470 AbstractCegarLoop]: Abstraction has 881 states and 2126 transitions. [2022-03-03 17:28:13,328 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 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-03 17:28:13,328 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 2126 transitions. [2022-03-03 17:28:13,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-03-03 17:28:13,330 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:28:13,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 17:28:13,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-03 17:28:13,332 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-03 17:28:13,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:28:13,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1833342822, now seen corresponding path program 1 times [2022-03-03 17:28:13,335 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:28:13,335 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263785971] [2022-03-03 17:28:13,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:28:13,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:28:13,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:28:14,667 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:28:14,667 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:28:14,667 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263785971] [2022-03-03 17:28:14,667 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263785971] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:28:14,667 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422087563] [2022-03-03 17:28:14,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:28:14,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:28:14,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:28:14,669 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:28:14,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-03 17:28:14,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:28:14,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 56 conjunts are in the unsatisfiable core [2022-03-03 17:28:14,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:28:14,832 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-03 17:28:15,165 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-03 17:28:15,166 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-03 17:28:16,935 INFO L353 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-03-03 17:28:16,935 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2022-03-03 17:28:16,959 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-03-03 17:28:17,304 INFO L353 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-03-03 17:28:17,304 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2022-03-03 17:28:17,368 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:28:17,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:28:18,157 INFO L353 Elim1Store]: treesize reduction 23, result has 58.2 percent of original size [2022-03-03 17:28:18,158 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 68 [2022-03-03 17:28:18,163 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2022-03-03 17:28:20,491 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:28:20,491 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422087563] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:28:20,491 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:28:20,492 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 26, 27] total 70 [2022-03-03 17:28:20,492 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065796653] [2022-03-03 17:28:20,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:28:20,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-03-03 17:28:20,492 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:28:20,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-03-03 17:28:20,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=481, Invalid=4346, Unknown=3, NotChecked=0, Total=4830 [2022-03-03 17:28:20,494 INFO L87 Difference]: Start difference. First operand 881 states and 2126 transitions. Second operand has 70 states, 70 states have (on average 5.8428571428571425) internal successors, (409), 70 states have internal predecessors, (409), 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-03 17:28:29,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:28:29,541 INFO L93 Difference]: Finished difference Result 3041 states and 7539 transitions. [2022-03-03 17:28:29,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-03-03 17:28:29,541 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 5.8428571428571425) internal successors, (409), 70 states have internal predecessors, (409), 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 160 [2022-03-03 17:28:29,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:28:29,552 INFO L225 Difference]: With dead ends: 3041 [2022-03-03 17:28:29,552 INFO L226 Difference]: Without dead ends: 3032 [2022-03-03 17:28:29,555 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 294 SyntacticMatches, 11 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 6073 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=3004, Invalid=18454, Unknown=4, NotChecked=0, Total=21462 [2022-03-03 17:28:29,556 INFO L933 BasicCegarLoop]: 202 mSDtfsCounter, 3177 mSDsluCounter, 6227 mSDsCounter, 0 mSdLazyCounter, 2291 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3177 SdHoareTripleChecker+Valid, 6059 SdHoareTripleChecker+Invalid, 3359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 2291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 897 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-03 17:28:29,556 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3177 Valid, 6059 Invalid, 3359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 2291 Invalid, 0 Unknown, 897 Unchecked, 1.1s Time] [2022-03-03 17:28:29,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3032 states. [2022-03-03 17:28:29,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3032 to 1298. [2022-03-03 17:28:29,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1298 states, 1297 states have (on average 2.3554356206630684) internal successors, (3055), 1297 states have internal predecessors, (3055), 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-03 17:28:29,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1298 states and 3055 transitions. [2022-03-03 17:28:29,586 INFO L78 Accepts]: Start accepts. Automaton has 1298 states and 3055 transitions. Word has length 160 [2022-03-03 17:28:29,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:28:29,587 INFO L470 AbstractCegarLoop]: Abstraction has 1298 states and 3055 transitions. [2022-03-03 17:28:29,587 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 5.8428571428571425) internal successors, (409), 70 states have internal predecessors, (409), 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-03 17:28:29,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1298 states and 3055 transitions. [2022-03-03 17:28:29,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-03-03 17:28:29,589 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:28:29,589 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 17:28:29,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-03 17:28:29,805 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:28:29,806 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-03 17:28:29,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:28:29,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1185429200, now seen corresponding path program 2 times [2022-03-03 17:28:29,806 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:28:29,806 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563021294] [2022-03-03 17:28:29,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:28:29,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:28:29,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:28:30,883 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:28:30,884 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:28:30,884 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563021294] [2022-03-03 17:28:30,884 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563021294] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:28:30,884 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702997331] [2022-03-03 17:28:30,884 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 17:28:30,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:28:30,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:28:30,886 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:28:30,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-03 17:28:30,979 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-03 17:28:30,980 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:28:30,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 60 conjunts are in the unsatisfiable core [2022-03-03 17:28:31,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:28:31,028 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-03 17:28:31,341 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-03 17:28:31,341 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-03 17:28:32,740 INFO L353 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-03-03 17:28:32,741 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2022-03-03 17:28:32,753 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-03-03 17:28:33,006 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-03-03 17:28:33,063 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:28:33,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:28:33,702 INFO L353 Elim1Store]: treesize reduction 23, result has 58.2 percent of original size [2022-03-03 17:28:33,703 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 68 [2022-03-03 17:28:33,710 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2022-03-03 17:28:35,791 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:28:35,791 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702997331] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:28:35,791 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:28:35,791 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 27] total 69 [2022-03-03 17:28:35,791 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140596330] [2022-03-03 17:28:35,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:28:35,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-03-03 17:28:35,792 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:28:35,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-03-03 17:28:35,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=4254, Unknown=3, NotChecked=0, Total=4692 [2022-03-03 17:28:35,794 INFO L87 Difference]: Start difference. First operand 1298 states and 3055 transitions. Second operand has 69 states, 69 states have (on average 5.971014492753623) internal successors, (412), 69 states have internal predecessors, (412), 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-03 17:28:41,794 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (< c_~start~0 0)) (.cse0 (not (= (mod c_~ok~0 256) 0))) (.cse2 (<= c_~n~0 c_~start~0))) (and (or (and .cse0 (<= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0)) .cse1 (<= c_~end~0 c_~start~0) .cse2) (or .cse1 (and .cse0 (forall ((v_ArrVal_146 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_146) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0))) .cse2))) is different from false [2022-03-03 17:28:42,478 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (* c_~end~0 4)) (.cse2 (* c_~start~0 4))) (let ((.cse8 (not (< c_~end~0 c_~n~0))) (.cse1 (select |c_#memory_int| c_~queue~0.base)) (.cse9 (not (<= 0 c_~end~0))) (.cse5 (<= c_~n~0 c_~end~0)) (.cse0 (not (= (mod c_~ok~0 256) 0))) (.cse7 (= .cse10 .cse2)) (.cse6 (< c_~end~0 0)) (.cse3 (< c_~start~0 0)) (.cse4 (<= c_~n~0 c_~start~0))) (and (or (and .cse0 (<= (select .cse1 (+ .cse2 c_~queue~0.offset)) c_~v_old~0)) .cse3 (<= c_~end~0 c_~start~0) .cse4) (or .cse5 .cse6 .cse3 .cse4 (and .cse0 .cse7 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (or .cse8 .cse3 .cse9 (and (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t2~0#1.base|)) .cse0 .cse7 (<= c_~last~0 c_~v_old~0)) .cse4) (or .cse5 .cse6 .cse3 (and .cse0 .cse7 (not (= |c_ULTIMATE.start_main_#t~ret12#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|))) .cse4) (= (+ (- 1) c_~ok~0) 0) (<= c_~new~0 c_~v_old~0) (or .cse5 (and .cse0 .cse7 (not (= |c_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|))) .cse6 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse3 .cse4) (or (not (<= |c_thread1Thread1of1ForFork0_#t~mem1#1| c_~last~0)) .cse8 (not (= (select .cse1 (+ .cse10 c_~queue~0.offset)) (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) .cse3 .cse9 (and .cse0 (forall ((v_ArrVal_146 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_146) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0))) .cse4) (or .cse5 (and .cse0 .cse7 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) .cse6 .cse3 .cse4)))) is different from false [2022-03-03 17:28:43,136 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (* c_~end~0 4)) (.cse2 (* c_~start~0 4))) (let ((.cse8 (not (< c_~end~0 c_~n~0))) (.cse1 (select |c_#memory_int| c_~queue~0.base)) (.cse9 (not (<= 0 c_~end~0))) (.cse5 (<= c_~n~0 c_~end~0)) (.cse0 (not (= (mod c_~ok~0 256) 0))) (.cse7 (= .cse10 .cse2)) (.cse6 (< c_~end~0 0)) (.cse3 (< c_~start~0 0)) (.cse4 (<= c_~n~0 c_~start~0))) (and (or (and .cse0 (<= (select .cse1 (+ .cse2 c_~queue~0.offset)) c_~v_old~0)) .cse3 (<= c_~end~0 c_~start~0) .cse4) (or .cse5 .cse6 .cse3 .cse4 (and .cse0 .cse7 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (or .cse8 .cse3 .cse9 (and (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t2~0#1.base|)) .cse0 .cse7 (<= c_~last~0 c_~v_old~0)) .cse4) (or .cse8 (not (= (select .cse1 (+ .cse10 c_~queue~0.offset)) (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) .cse3 .cse9 (and .cse0 (forall ((v_ArrVal_146 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_146) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0))) .cse4) (or .cse5 .cse6 .cse3 (and .cse0 .cse7 (not (= |c_ULTIMATE.start_main_#t~ret12#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|))) .cse4) (= (+ (- 1) c_~ok~0) 0) (<= c_~new~0 c_~v_old~0) (or .cse5 (and .cse0 .cse7 (not (= |c_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|))) .cse6 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse3 .cse4) (or .cse5 (and .cse0 .cse7 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) .cse6 .cse3 .cse4)))) is different from false [2022-03-03 17:28:43,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:28:43,574 INFO L93 Difference]: Finished difference Result 4753 states and 12101 transitions. [2022-03-03 17:28:43,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2022-03-03 17:28:43,574 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 5.971014492753623) internal successors, (412), 69 states have internal predecessors, (412), 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 160 [2022-03-03 17:28:43,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:28:43,591 INFO L225 Difference]: With dead ends: 4753 [2022-03-03 17:28:43,591 INFO L226 Difference]: Without dead ends: 4600 [2022-03-03 17:28:43,596 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 286 SyntacticMatches, 8 SemanticMatches, 168 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 9577 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=3354, Invalid=24338, Unknown=42, NotChecked=996, Total=28730 [2022-03-03 17:28:43,596 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 4085 mSDsluCounter, 6431 mSDsCounter, 0 mSdLazyCounter, 3105 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4085 SdHoareTripleChecker+Valid, 6024 SdHoareTripleChecker+Invalid, 4685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 3105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1333 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-03 17:28:43,597 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4085 Valid, 6024 Invalid, 4685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 3105 Invalid, 0 Unknown, 1333 Unchecked, 1.3s Time] [2022-03-03 17:28:43,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4600 states. [2022-03-03 17:28:43,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4600 to 1847. [2022-03-03 17:28:43,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1847 states, 1846 states have (on average 2.5021668472372696) internal successors, (4619), 1846 states have internal predecessors, (4619), 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-03 17:28:43,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1847 states to 1847 states and 4619 transitions. [2022-03-03 17:28:43,645 INFO L78 Accepts]: Start accepts. Automaton has 1847 states and 4619 transitions. Word has length 160 [2022-03-03 17:28:43,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:28:43,646 INFO L470 AbstractCegarLoop]: Abstraction has 1847 states and 4619 transitions. [2022-03-03 17:28:43,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 5.971014492753623) internal successors, (412), 69 states have internal predecessors, (412), 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-03 17:28:43,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1847 states and 4619 transitions. [2022-03-03 17:28:43,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-03-03 17:28:43,649 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:28:43,650 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 17:28:43,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-03 17:28:43,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-03-03 17:28:43,868 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-03 17:28:43,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:28:43,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1309256054, now seen corresponding path program 3 times [2022-03-03 17:28:43,868 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:28:43,868 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747504568] [2022-03-03 17:28:43,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:28:43,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:28:43,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:28:45,080 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:28:45,081 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:28:45,081 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747504568] [2022-03-03 17:28:45,081 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747504568] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:28:45,081 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619557705] [2022-03-03 17:28:45,081 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-03 17:28:45,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:28:45,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:28:45,083 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:28:45,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-03 17:28:45,195 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-03 17:28:45,195 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:28:45,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 59 conjunts are in the unsatisfiable core [2022-03-03 17:28:45,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:28:45,219 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-03 17:28:45,508 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-03 17:28:45,508 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-03 17:28:46,521 INFO L353 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-03-03 17:28:46,522 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 45 [2022-03-03 17:28:46,532 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-03-03 17:28:46,819 INFO L353 Elim1Store]: treesize reduction 15, result has 16.7 percent of original size [2022-03-03 17:28:46,820 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 10 [2022-03-03 17:28:46,878 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:28:46,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:28:47,186 WARN L838 $PredicateComparison]: unable to prove that (or (< c_~start~0 0) (<= c_~end~0 c_~start~0) (and (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_180 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0))) (<= c_~n~0 c_~start~0)) is different from false [2022-03-03 17:28:47,439 INFO L353 Elim1Store]: treesize reduction 23, result has 58.2 percent of original size [2022-03-03 17:28:47,439 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 68 [2022-03-03 17:28:47,443 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2022-03-03 17:28:49,649 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:28:49,649 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619557705] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:28:49,649 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:28:49,650 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 26, 26] total 74 [2022-03-03 17:28:49,650 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953278463] [2022-03-03 17:28:49,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:28:49,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-03-03 17:28:49,650 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:28:49,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-03-03 17:28:49,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=552, Invalid=4707, Unknown=1, NotChecked=142, Total=5402 [2022-03-03 17:28:49,652 INFO L87 Difference]: Start difference. First operand 1847 states and 4619 transitions. Second operand has 74 states, 74 states have (on average 5.702702702702703) internal successors, (422), 74 states have internal predecessors, (422), 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-03 17:29:23,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:29:23,903 INFO L93 Difference]: Finished difference Result 17367 states and 46456 transitions. [2022-03-03 17:29:23,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 262 states. [2022-03-03 17:29:23,904 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 74 states have (on average 5.702702702702703) internal successors, (422), 74 states have internal predecessors, (422), 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 160 [2022-03-03 17:29:23,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:29:23,955 INFO L225 Difference]: With dead ends: 17367 [2022-03-03 17:29:23,956 INFO L226 Difference]: Without dead ends: 15201 [2022-03-03 17:29:23,962 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 739 GetRequests, 349 SyntacticMatches, 68 SemanticMatches, 322 ConstructedPredicates, 1 IntricatePredicates, 3 DeprecatedPredicates, 47101 ImplicationChecksByTransitivity, 31.9s TimeCoverageRelationStatistics Valid=13159, Invalid=90805, Unknown=46, NotChecked=642, Total=104652 [2022-03-03 17:29:23,964 INFO L933 BasicCegarLoop]: 305 mSDtfsCounter, 9312 mSDsluCounter, 12280 mSDsCounter, 0 mSdLazyCounter, 6192 mSolverCounterSat, 670 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9312 SdHoareTripleChecker+Valid, 11044 SdHoareTripleChecker+Invalid, 11216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 670 IncrementalHoareTripleChecker+Valid, 6192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4354 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-03-03 17:29:23,964 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9312 Valid, 11044 Invalid, 11216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [670 Valid, 6192 Invalid, 0 Unknown, 4354 Unchecked, 3.0s Time] [2022-03-03 17:29:23,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15201 states. [2022-03-03 17:29:24,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15201 to 4612. [2022-03-03 17:29:24,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4612 states, 4611 states have (on average 2.7616569073953587) internal successors, (12734), 4611 states have internal predecessors, (12734), 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-03 17:29:24,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4612 states to 4612 states and 12734 transitions. [2022-03-03 17:29:24,171 INFO L78 Accepts]: Start accepts. Automaton has 4612 states and 12734 transitions. Word has length 160 [2022-03-03 17:29:24,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:29:24,171 INFO L470 AbstractCegarLoop]: Abstraction has 4612 states and 12734 transitions. [2022-03-03 17:29:24,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 74 states have (on average 5.702702702702703) internal successors, (422), 74 states have internal predecessors, (422), 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-03 17:29:24,171 INFO L276 IsEmpty]: Start isEmpty. Operand 4612 states and 12734 transitions. [2022-03-03 17:29:24,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-03-03 17:29:24,180 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:29:24,180 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 17:29:24,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-03 17:29:24,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:29:24,398 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-03 17:29:24,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:29:24,398 INFO L85 PathProgramCache]: Analyzing trace with hash 2036896368, now seen corresponding path program 4 times [2022-03-03 17:29:24,399 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:29:24,399 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589358138] [2022-03-03 17:29:24,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:29:24,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:29:24,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:29:25,217 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:29:25,217 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:29:25,217 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589358138] [2022-03-03 17:29:25,217 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589358138] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:29:25,217 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314128100] [2022-03-03 17:29:25,217 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-03 17:29:25,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:29:25,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:29:25,228 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:29:25,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-03 17:29:25,331 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-03 17:29:25,331 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:29:25,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 55 conjunts are in the unsatisfiable core [2022-03-03 17:29:25,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:29:25,360 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-03 17:29:25,673 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-03 17:29:25,673 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-03 17:29:26,682 INFO L353 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-03-03 17:29:26,682 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2022-03-03 17:29:26,693 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-03-03 17:29:27,021 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-03-03 17:29:27,077 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:29:27,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:29:27,680 INFO L353 Elim1Store]: treesize reduction 23, result has 58.2 percent of original size [2022-03-03 17:29:27,680 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 68 [2022-03-03 17:29:27,685 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2022-03-03 17:29:30,047 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:29:30,048 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314128100] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:29:30,048 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:29:30,048 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26, 27] total 72 [2022-03-03 17:29:30,048 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947773355] [2022-03-03 17:29:30,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:29:30,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-03-03 17:29:30,050 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:29:30,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-03-03 17:29:30,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=489, Invalid=4620, Unknown=3, NotChecked=0, Total=5112 [2022-03-03 17:29:30,062 INFO L87 Difference]: Start difference. First operand 4612 states and 12734 transitions. Second operand has 72 states, 72 states have (on average 5.861111111111111) internal successors, (422), 72 states have internal predecessors, (422), 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-03 17:29:40,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:29:40,909 INFO L93 Difference]: Finished difference Result 12396 states and 33917 transitions. [2022-03-03 17:29:40,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2022-03-03 17:29:40,909 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 5.861111111111111) internal successors, (422), 72 states have internal predecessors, (422), 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 160 [2022-03-03 17:29:40,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:29:40,933 INFO L225 Difference]: With dead ends: 12396 [2022-03-03 17:29:40,933 INFO L226 Difference]: Without dead ends: 10790 [2022-03-03 17:29:40,935 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 284 SyntacticMatches, 22 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10361 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=4349, Invalid=27154, Unknown=3, NotChecked=0, Total=31506 [2022-03-03 17:29:40,935 INFO L933 BasicCegarLoop]: 190 mSDtfsCounter, 5885 mSDsluCounter, 7600 mSDsCounter, 0 mSdLazyCounter, 3600 mSolverCounterSat, 513 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5885 SdHoareTripleChecker+Valid, 6923 SdHoareTripleChecker+Invalid, 5384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 513 IncrementalHoareTripleChecker+Valid, 3600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1271 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-03 17:29:40,935 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5885 Valid, 6923 Invalid, 5384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [513 Valid, 3600 Invalid, 0 Unknown, 1271 Unchecked, 1.5s Time] [2022-03-03 17:29:40,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10790 states. [2022-03-03 17:29:41,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10790 to 3941. [2022-03-03 17:29:41,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3941 states, 3940 states have (on average 2.7068527918781724) internal successors, (10665), 3940 states have internal predecessors, (10665), 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-03 17:29:41,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3941 states to 3941 states and 10665 transitions. [2022-03-03 17:29:41,047 INFO L78 Accepts]: Start accepts. Automaton has 3941 states and 10665 transitions. Word has length 160 [2022-03-03 17:29:41,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:29:41,048 INFO L470 AbstractCegarLoop]: Abstraction has 3941 states and 10665 transitions. [2022-03-03 17:29:41,048 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 5.861111111111111) internal successors, (422), 72 states have internal predecessors, (422), 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-03 17:29:41,048 INFO L276 IsEmpty]: Start isEmpty. Operand 3941 states and 10665 transitions. [2022-03-03 17:29:41,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-03-03 17:29:41,055 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:29:41,055 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 17:29:41,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-03 17:29:41,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:29:41,271 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-03 17:29:41,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:29:41,272 INFO L85 PathProgramCache]: Analyzing trace with hash -2000453552, now seen corresponding path program 5 times [2022-03-03 17:29:41,272 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:29:41,272 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420791774] [2022-03-03 17:29:41,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:29:41,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:29:41,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:29:42,276 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:29:42,276 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:29:42,276 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420791774] [2022-03-03 17:29:42,277 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420791774] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:29:42,277 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404266322] [2022-03-03 17:29:42,277 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-03 17:29:42,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:29:42,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:29:42,278 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:29:42,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-03 17:29:42,398 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-03 17:29:42,398 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:29:42,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 87 conjunts are in the unsatisfiable core [2022-03-03 17:29:42,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:29:42,480 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-03 17:29:42,917 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-03-03 17:29:42,918 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-03-03 17:29:43,799 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-03 17:29:43,799 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-03 17:29:44,033 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-03 17:29:44,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:29:44,713 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-03-03 17:29:44,981 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-03-03 17:29:45,438 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 17:29:45,440 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-03-03 17:29:45,440 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 10 [2022-03-03 17:29:45,495 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:29:45,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:29:47,203 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:29:47,203 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 79 [2022-03-03 17:29:47,212 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:29:47,213 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1957 treesize of output 1895 [2022-03-03 17:29:47,258 INFO L353 Elim1Store]: treesize reduction 44, result has 54.6 percent of original size [2022-03-03 17:29:47,258 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 2627 treesize of output 2560 [2022-03-03 17:29:47,291 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:29:47,292 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2644 treesize of output 2212 [2022-03-03 17:29:47,322 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:29:47,323 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2164 treesize of output 1972 [2022-03-03 17:29:57,341 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2022-03-03 17:29:57,389 INFO L353 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2022-03-03 17:29:57,390 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 43 [2022-03-03 17:29:57,423 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2022-03-03 17:29:57,514 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:29:57,515 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 93 [2022-03-03 17:30:01,066 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-03-03 17:30:01,141 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:30:01,141 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404266322] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:30:01,141 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:30:01,142 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 35, 30] total 85 [2022-03-03 17:30:01,144 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352146767] [2022-03-03 17:30:01,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:30:01,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-03-03 17:30:01,144 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:30:01,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-03-03 17:30:01,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=717, Invalid=6382, Unknown=41, NotChecked=0, Total=7140 [2022-03-03 17:30:01,150 INFO L87 Difference]: Start difference. First operand 3941 states and 10665 transitions. Second operand has 85 states, 85 states have (on average 5.141176470588236) internal successors, (437), 85 states have internal predecessors, (437), 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-03 17:30:18,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:30:18,159 INFO L93 Difference]: Finished difference Result 14782 states and 39922 transitions. [2022-03-03 17:30:18,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2022-03-03 17:30:18,160 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 85 states have (on average 5.141176470588236) internal successors, (437), 85 states have internal predecessors, (437), 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 160 [2022-03-03 17:30:18,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:30:18,185 INFO L225 Difference]: With dead ends: 14782 [2022-03-03 17:30:18,185 INFO L226 Difference]: Without dead ends: 13648 [2022-03-03 17:30:18,188 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 561 GetRequests, 283 SyntacticMatches, 28 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24936 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=7753, Invalid=55386, Unknown=113, NotChecked=0, Total=63252 [2022-03-03 17:30:18,188 INFO L933 BasicCegarLoop]: 184 mSDtfsCounter, 5244 mSDsluCounter, 9020 mSDsCounter, 0 mSdLazyCounter, 3793 mSolverCounterSat, 494 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5244 SdHoareTripleChecker+Valid, 8209 SdHoareTripleChecker+Invalid, 10004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 494 IncrementalHoareTripleChecker+Valid, 3793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5717 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-03 17:30:18,189 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5244 Valid, 8209 Invalid, 10004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [494 Valid, 3793 Invalid, 0 Unknown, 5717 Unchecked, 1.9s Time] [2022-03-03 17:30:18,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13648 states. [2022-03-03 17:30:18,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13648 to 4175. [2022-03-03 17:30:18,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4175 states, 4174 states have (on average 2.693818878773359) internal successors, (11244), 4174 states have internal predecessors, (11244), 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-03 17:30:18,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4175 states to 4175 states and 11244 transitions. [2022-03-03 17:30:18,307 INFO L78 Accepts]: Start accepts. Automaton has 4175 states and 11244 transitions. Word has length 160 [2022-03-03 17:30:18,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:30:18,307 INFO L470 AbstractCegarLoop]: Abstraction has 4175 states and 11244 transitions. [2022-03-03 17:30:18,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 85 states have (on average 5.141176470588236) internal successors, (437), 85 states have internal predecessors, (437), 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-03 17:30:18,307 INFO L276 IsEmpty]: Start isEmpty. Operand 4175 states and 11244 transitions. [2022-03-03 17:30:18,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-03-03 17:30:18,315 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:30:18,315 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 17:30:18,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-03 17:30:18,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-03-03 17:30:18,532 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-03 17:30:18,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:30:18,532 INFO L85 PathProgramCache]: Analyzing trace with hash -400624774, now seen corresponding path program 6 times [2022-03-03 17:30:18,532 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:30:18,532 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381106302] [2022-03-03 17:30:18,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:30:18,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:30:18,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:30:18,629 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-03 17:30:18,629 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:30:18,629 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381106302] [2022-03-03 17:30:18,629 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381106302] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:30:18,629 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8064792] [2022-03-03 17:30:18,629 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-03 17:30:18,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:30:18,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:30:18,644 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:30:18,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-03 17:30:18,735 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-03 17:30:18,735 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:30:18,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-03 17:30:18,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:30:19,047 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-03 17:30:19,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:30:19,256 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-03 17:30:19,256 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8064792] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:30:19,257 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:30:19,257 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 20 [2022-03-03 17:30:19,257 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060118887] [2022-03-03 17:30:19,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:30:19,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-03 17:30:19,258 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:30:19,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-03 17:30:19,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2022-03-03 17:30:19,262 INFO L87 Difference]: Start difference. First operand 4175 states and 11244 transitions. Second operand has 20 states, 20 states have (on average 15.7) internal successors, (314), 20 states have internal predecessors, (314), 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-03 17:30:19,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:30:19,506 INFO L93 Difference]: Finished difference Result 5396 states and 13820 transitions. [2022-03-03 17:30:19,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-03 17:30:19,506 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 15.7) internal successors, (314), 20 states have internal predecessors, (314), 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 165 [2022-03-03 17:30:19,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:30:19,510 INFO L225 Difference]: With dead ends: 5396 [2022-03-03 17:30:19,510 INFO L226 Difference]: Without dead ends: 2906 [2022-03-03 17:30:19,510 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=341, Invalid=1065, Unknown=0, NotChecked=0, Total=1406 [2022-03-03 17:30:19,511 INFO L933 BasicCegarLoop]: 186 mSDtfsCounter, 1436 mSDsluCounter, 1845 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1436 SdHoareTripleChecker+Valid, 1936 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 17:30:19,511 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1436 Valid, 1936 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 17:30:19,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2906 states. [2022-03-03 17:30:19,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2906 to 2428. [2022-03-03 17:30:19,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2428 states, 2427 states have (on average 2.6489493201483314) internal successors, (6429), 2427 states have internal predecessors, (6429), 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-03 17:30:19,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2428 states to 2428 states and 6429 transitions. [2022-03-03 17:30:19,579 INFO L78 Accepts]: Start accepts. Automaton has 2428 states and 6429 transitions. Word has length 165 [2022-03-03 17:30:19,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:30:19,579 INFO L470 AbstractCegarLoop]: Abstraction has 2428 states and 6429 transitions. [2022-03-03 17:30:19,579 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 15.7) internal successors, (314), 20 states have internal predecessors, (314), 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-03 17:30:19,580 INFO L276 IsEmpty]: Start isEmpty. Operand 2428 states and 6429 transitions. [2022-03-03 17:30:19,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-03-03 17:30:19,584 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:30:19,584 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 17:30:19,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-03 17:30:19,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:30:19,791 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-03 17:30:19,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:30:19,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1626521301, now seen corresponding path program 1 times [2022-03-03 17:30:19,792 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:30:19,792 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140210541] [2022-03-03 17:30:19,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:30:19,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:30:19,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:30:19,906 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-03 17:30:19,906 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:30:19,906 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140210541] [2022-03-03 17:30:19,906 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140210541] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:30:19,906 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906997749] [2022-03-03 17:30:19,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:30:19,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:30:19,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:30:19,907 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:30:19,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-03 17:30:19,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:30:19,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-03 17:30:19,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:30:20,296 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-03 17:30:20,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:30:20,493 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-03 17:30:20,493 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906997749] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:30:20,493 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:30:20,493 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2022-03-03 17:30:20,494 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747908588] [2022-03-03 17:30:20,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:30:20,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-03 17:30:20,494 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:30:20,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-03 17:30:20,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2022-03-03 17:30:20,495 INFO L87 Difference]: Start difference. First operand 2428 states and 6429 transitions. Second operand has 24 states, 24 states have (on average 13.791666666666666) internal successors, (331), 24 states have internal predecessors, (331), 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-03 17:30:20,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:30:20,714 INFO L93 Difference]: Finished difference Result 2957 states and 7651 transitions. [2022-03-03 17:30:20,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-03 17:30:20,715 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 13.791666666666666) internal successors, (331), 24 states have internal predecessors, (331), 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 172 [2022-03-03 17:30:20,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:30:20,719 INFO L225 Difference]: With dead ends: 2957 [2022-03-03 17:30:20,719 INFO L226 Difference]: Without dead ends: 2620 [2022-03-03 17:30:20,719 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 329 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=321, Invalid=939, Unknown=0, NotChecked=0, Total=1260 [2022-03-03 17:30:20,720 INFO L933 BasicCegarLoop]: 151 mSDtfsCounter, 724 mSDsluCounter, 1536 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 1611 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 17:30:20,720 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [724 Valid, 1611 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 17:30:20,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2620 states. [2022-03-03 17:30:20,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2620 to 2435. [2022-03-03 17:30:20,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2435 states, 2434 states have (on average 2.6442070665571076) internal successors, (6436), 2434 states have internal predecessors, (6436), 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-03 17:30:20,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2435 states to 2435 states and 6436 transitions. [2022-03-03 17:30:20,752 INFO L78 Accepts]: Start accepts. Automaton has 2435 states and 6436 transitions. Word has length 172 [2022-03-03 17:30:20,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:30:20,753 INFO L470 AbstractCegarLoop]: Abstraction has 2435 states and 6436 transitions. [2022-03-03 17:30:20,753 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 13.791666666666666) internal successors, (331), 24 states have internal predecessors, (331), 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-03 17:30:20,753 INFO L276 IsEmpty]: Start isEmpty. Operand 2435 states and 6436 transitions. [2022-03-03 17:30:20,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-03-03 17:30:20,758 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:30:20,759 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 17:30:20,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-03-03 17:30:20,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:30:20,973 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-03 17:30:20,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:30:20,975 INFO L85 PathProgramCache]: Analyzing trace with hash -627412766, now seen corresponding path program 2 times [2022-03-03 17:30:20,975 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:30:20,975 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045975080] [2022-03-03 17:30:20,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:30:20,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:30:21,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:30:21,212 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-03-03 17:30:21,212 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:30:21,212 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045975080] [2022-03-03 17:30:21,212 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045975080] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 17:30:21,212 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 17:30:21,212 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-03 17:30:21,212 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390474484] [2022-03-03 17:30:21,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:30:21,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-03 17:30:21,213 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:30:21,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-03 17:30:21,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-03-03 17:30:21,213 INFO L87 Difference]: Start difference. First operand 2435 states and 6436 transitions. Second operand has 13 states, 13 states have (on average 12.615384615384615) internal successors, (164), 13 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-03 17:30:21,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:30:21,518 INFO L93 Difference]: Finished difference Result 2494 states and 6579 transitions. [2022-03-03 17:30:21,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-03 17:30:21,519 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 12.615384615384615) internal successors, (164), 13 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 179 [2022-03-03 17:30:21,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:30:21,521 INFO L225 Difference]: With dead ends: 2494 [2022-03-03 17:30:21,522 INFO L226 Difference]: Without dead ends: 2494 [2022-03-03 17:30:21,522 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2022-03-03 17:30:21,522 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 319 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 17:30:21,522 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [319 Valid, 957 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 17:30:21,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2494 states. [2022-03-03 17:30:21,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2494 to 2413. [2022-03-03 17:30:21,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2413 states, 2412 states have (on average 2.648009950248756) internal successors, (6387), 2412 states have internal predecessors, (6387), 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-03 17:30:21,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2413 states to 2413 states and 6387 transitions. [2022-03-03 17:30:21,552 INFO L78 Accepts]: Start accepts. Automaton has 2413 states and 6387 transitions. Word has length 179 [2022-03-03 17:30:21,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:30:21,552 INFO L470 AbstractCegarLoop]: Abstraction has 2413 states and 6387 transitions. [2022-03-03 17:30:21,552 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.615384615384615) internal successors, (164), 13 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-03 17:30:21,552 INFO L276 IsEmpty]: Start isEmpty. Operand 2413 states and 6387 transitions. [2022-03-03 17:30:21,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-03-03 17:30:21,556 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:30:21,556 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 17:30:21,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-03 17:30:21,556 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-03 17:30:21,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:30:21,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1465175280, now seen corresponding path program 3 times [2022-03-03 17:30:21,556 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:30:21,556 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706561823] [2022-03-03 17:30:21,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:30:21,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:30:21,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:30:21,790 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-03-03 17:30:21,790 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:30:21,790 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706561823] [2022-03-03 17:30:21,790 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706561823] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 17:30:21,790 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 17:30:21,790 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-03-03 17:30:21,790 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371518359] [2022-03-03 17:30:21,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:30:21,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-03 17:30:21,791 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:30:21,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-03 17:30:21,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-03-03 17:30:21,791 INFO L87 Difference]: Start difference. First operand 2413 states and 6387 transitions. Second operand has 15 states, 15 states have (on average 10.933333333333334) internal successors, (164), 15 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-03 17:30:22,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:30:22,098 INFO L93 Difference]: Finished difference Result 2292 states and 6035 transitions. [2022-03-03 17:30:22,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-03 17:30:22,099 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 10.933333333333334) internal successors, (164), 15 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 179 [2022-03-03 17:30:22,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:30:22,101 INFO L225 Difference]: With dead ends: 2292 [2022-03-03 17:30:22,101 INFO L226 Difference]: Without dead ends: 2292 [2022-03-03 17:30:22,103 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=524, Unknown=0, NotChecked=0, Total=702 [2022-03-03 17:30:22,103 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 406 mSDsluCounter, 1121 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 17:30:22,104 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [406 Valid, 1221 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 17:30:22,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2292 states. [2022-03-03 17:30:22,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2292 to 2229. [2022-03-03 17:30:22,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2229 states, 2228 states have (on average 2.6422800718132855) internal successors, (5887), 2228 states have internal predecessors, (5887), 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-03 17:30:22,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2229 states to 2229 states and 5887 transitions. [2022-03-03 17:30:22,140 INFO L78 Accepts]: Start accepts. Automaton has 2229 states and 5887 transitions. Word has length 179 [2022-03-03 17:30:22,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:30:22,141 INFO L470 AbstractCegarLoop]: Abstraction has 2229 states and 5887 transitions. [2022-03-03 17:30:22,141 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.933333333333334) internal successors, (164), 15 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-03 17:30:22,141 INFO L276 IsEmpty]: Start isEmpty. Operand 2229 states and 5887 transitions. [2022-03-03 17:30:22,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-03-03 17:30:22,144 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:30:22,145 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 17:30:22,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-03 17:30:22,145 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-03 17:30:22,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:30:22,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1641267285, now seen corresponding path program 7 times [2022-03-03 17:30:22,145 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:30:22,145 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295888405] [2022-03-03 17:30:22,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:30:22,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:30:22,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:30:23,787 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-03 17:30:23,788 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:30:23,788 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295888405] [2022-03-03 17:30:23,788 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295888405] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:30:23,788 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764849966] [2022-03-03 17:30:23,788 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-03 17:30:23,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:30:23,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:30:23,789 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:30:23,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-03 17:30:23,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:30:23,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 75 conjunts are in the unsatisfiable core [2022-03-03 17:30:23,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:30:23,936 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-03 17:30:24,268 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-03 17:30:24,269 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-03 17:30:26,547 INFO L353 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-03-03 17:30:26,548 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 74 [2022-03-03 17:30:26,562 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:30:26,562 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 45 [2022-03-03 17:30:27,088 INFO L353 Elim1Store]: treesize reduction 48, result has 5.9 percent of original size [2022-03-03 17:30:27,088 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 13 [2022-03-03 17:30:27,198 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-03 17:30:27,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:30:28,257 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~start~0 1))) (or (not (<= |c_thread1Thread1of1ForFork0_#t~mem1#1| c_~last~0)) (not (< c_~end~0 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (< .cse0 0) (and (forall ((v_ArrVal_402 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_402) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0)) (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_402 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_402) c_~queue~0.base)) (.cse2 (* c_~start~0 4))) (<= (select .cse1 (+ .cse2 c_~queue~0.offset 4)) (select .cse1 (+ .cse2 c_~queue~0.offset)))))) (<= c_~n~0 .cse0) (not (<= 0 c_~end~0)))) is different from false [2022-03-03 17:30:28,280 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~start~0 1))) (or (forall ((~i~0 Int)) (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* ~i~0 4))))) (or (< c_~last~0 .cse0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) .cse0))))) (not (< c_~end~0 c_~n~0)) (< .cse1 0) (and (forall ((v_ArrVal_402 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_402) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0)) (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_402 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_402) c_~queue~0.base)) (.cse3 (* c_~start~0 4))) (<= (select .cse2 (+ .cse3 c_~queue~0.offset 4)) (select .cse2 (+ .cse3 c_~queue~0.offset)))))) (<= c_~n~0 .cse1) (not (<= 0 c_~end~0)))) is different from false [2022-03-03 17:30:28,733 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~start~0 1))) (or (not (< c_~end~0 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (forall ((v_~end~0_83 Int) (v_~i~0_41 Int)) (let ((.cse1 (select |c_#memory_int| c_~A~0.base))) (let ((.cse0 (select .cse1 (+ c_~A~0.offset (* v_~i~0_41 4))))) (or (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* v_~end~0_83 4))) .cse0)) (< (select .cse1 (+ c_~A~0.offset (* c_~i~0 4))) .cse0) (not (< v_~end~0_83 c_~n~0)) (not (<= (+ c_~end~0 1) v_~end~0_83)))))) (< .cse2 0) (and (forall ((v_ArrVal_402 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_402) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0)) (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_402 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_402) c_~queue~0.base)) (.cse4 (* c_~start~0 4))) (<= (select .cse3 (+ .cse4 c_~queue~0.offset 4)) (select .cse3 (+ .cse4 c_~queue~0.offset)))))) (<= c_~n~0 .cse2) (not (<= 0 c_~end~0)))) is different from false [2022-03-03 17:30:28,827 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~start~0 1))) (or (not (<= |c_thread1Thread1of1ForFork0_#t~mem1#1| c_~last~0)) (not (< c_~end~0 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (forall ((v_~end~0_83 Int) (v_~i~0_41 Int)) (let ((.cse1 (select |c_#memory_int| c_~A~0.base))) (let ((.cse0 (select .cse1 (+ c_~A~0.offset (* v_~i~0_41 4))))) (or (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* v_~end~0_83 4))) .cse0)) (< (select .cse1 (+ c_~A~0.offset (* c_~i~0 4))) .cse0) (not (< v_~end~0_83 c_~n~0)) (not (<= (+ c_~end~0 1) v_~end~0_83)))))) (< .cse2 0) (and (forall ((v_ArrVal_402 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_402) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0)) (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_402 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_402) c_~queue~0.base)) (.cse4 (* c_~start~0 4))) (<= (select .cse3 (+ .cse4 c_~queue~0.offset 4)) (select .cse3 (+ .cse4 c_~queue~0.offset)))))) (<= c_~n~0 .cse2) (not (<= 0 c_~end~0)))) is different from false [2022-03-03 17:30:28,949 INFO L353 Elim1Store]: treesize reduction 89, result has 67.0 percent of original size [2022-03-03 17:30:28,949 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 154 treesize of output 253 [2022-03-03 17:30:28,968 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 17:30:28,968 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 45 [2022-03-03 17:30:28,975 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2022-03-03 17:30:35,637 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 9 trivial. 8 not checked. [2022-03-03 17:30:35,637 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764849966] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:30:35,638 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:30:35,638 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 36, 37] total 105 [2022-03-03 17:30:35,639 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428400675] [2022-03-03 17:30:35,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:30:35,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 105 states [2022-03-03 17:30:35,640 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:30:35,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2022-03-03 17:30:35,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=908, Invalid=9186, Unknown=22, NotChecked=804, Total=10920 [2022-03-03 17:30:35,641 INFO L87 Difference]: Start difference. First operand 2229 states and 5887 transitions. Second operand has 105 states, 105 states have (on average 4.6761904761904765) internal successors, (491), 105 states have internal predecessors, (491), 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-03 17:30:43,583 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_~start~0 1))) (let ((.cse1 (< .cse4 0)) (.cse2 (and (forall ((v_ArrVal_402 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_402) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0)) (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_402 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_402) c_~queue~0.base)) (.cse6 (* c_~start~0 4))) (<= (select .cse5 (+ .cse6 c_~queue~0.offset 4)) (select .cse5 (+ .cse6 c_~queue~0.offset))))))) (.cse3 (<= c_~n~0 .cse4))) (and (or (forall ((~i~0 Int)) (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* ~i~0 4))))) (or (< c_~last~0 .cse0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) .cse0))))) (not (< c_~end~0 c_~n~0)) .cse1 .cse2 .cse3 (not (<= 0 c_~end~0))) (or .cse1 .cse2 .cse3)))) is different from false [2022-03-03 17:30:44,724 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (* c_~end~0 4))) (let ((.cse15 (+ c_~start~0 1)) (.cse3 (select |c_#memory_int| c_~queue~0.base)) (.cse0 (+ .cse6 c_~queue~0.offset))) (let ((.cse7 (not (<= |c_thread1Thread1of1ForFork0_#t~mem1#1| c_~last~0))) (.cse8 (not (< c_~end~0 c_~n~0))) (.cse1 (not (= (select .cse3 .cse0) (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4)))))) (.cse9 (< .cse15 0)) (.cse10 (and (forall ((v_ArrVal_402 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_402) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0)) (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_402 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_402) c_~queue~0.base)) (.cse17 (* c_~start~0 4))) (<= (select .cse16 (+ .cse17 c_~queue~0.offset 4)) (select .cse16 (+ .cse17 c_~queue~0.offset))))))) (.cse11 (<= c_~n~0 .cse15)) (.cse12 (not (<= 0 c_~end~0)))) (and (or (not (= .cse0 4)) (and (or (let ((.cse4 (* c_~start~0 4))) (let ((.cse5 (+ .cse4 c_~queue~0.offset))) (and (or .cse1 (let ((.cse2 (select .cse3 .cse5))) (and (<= .cse2 c_~v_old~0) (<= (+ (select .cse3 (+ .cse4 4)) c_~last~0) (+ .cse2 |c_thread1Thread1of1ForFork0_#t~mem1#1|))))) (= (+ (- 1) c_~ok~0) 0) (= .cse5 0)))) (<= (* c_~n~0 4) (+ .cse6 c_~queue~0.offset 3))) (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t2~0#1.base|)))) (<= 1 c_~end~0) (or .cse7 .cse8 .cse1 .cse9 .cse10 .cse11 .cse12) (= c_~queue~0.offset 0) (or .cse7 .cse8 .cse1 (forall ((v_~end~0_83 Int) (v_~i~0_41 Int)) (let ((.cse14 (select |c_#memory_int| c_~A~0.base))) (let ((.cse13 (select .cse14 (+ c_~A~0.offset (* v_~i~0_41 4))))) (or (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* v_~end~0_83 4))) .cse13)) (< (select .cse14 (+ c_~A~0.offset (* c_~i~0 4))) .cse13) (not (< v_~end~0_83 c_~n~0)) (not (<= (+ c_~end~0 1) v_~end~0_83)))))) .cse9 .cse10 .cse11 .cse12) (<= c_~n~0 2))))) is different from false [2022-03-03 17:30:44,954 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse11 (* c_~end~0 4))) (let ((.cse8 (select |c_#memory_int| c_~queue~0.base)) (.cse6 (+ .cse11 c_~queue~0.offset))) (let ((.cse0 (not (= (select .cse8 .cse6) (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))))) (and (<= 1 c_~end~0) (let ((.cse3 (+ c_~start~0 1))) (or (not (< c_~end~0 c_~n~0)) .cse0 (forall ((v_~end~0_83 Int) (v_~i~0_41 Int)) (let ((.cse2 (select |c_#memory_int| c_~A~0.base))) (let ((.cse1 (select .cse2 (+ c_~A~0.offset (* v_~i~0_41 4))))) (or (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* v_~end~0_83 4))) .cse1)) (< (select .cse2 (+ c_~A~0.offset (* c_~i~0 4))) .cse1) (not (< v_~end~0_83 c_~n~0)) (not (<= (+ c_~end~0 1) v_~end~0_83)))))) (< .cse3 0) (and (forall ((v_ArrVal_402 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_402) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0)) (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_402 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_402) c_~queue~0.base)) (.cse5 (* c_~start~0 4))) (<= (select .cse4 (+ .cse5 c_~queue~0.offset 4)) (select .cse4 (+ .cse5 c_~queue~0.offset)))))) (<= c_~n~0 .cse3) (not (<= 0 c_~end~0)))) (or (not (= .cse6 4)) (and (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t2~0#1.base|)) (or (let ((.cse9 (* c_~start~0 4))) (let ((.cse10 (+ .cse9 c_~queue~0.offset))) (and (or .cse0 (let ((.cse7 (select .cse8 .cse10))) (and (<= .cse7 c_~v_old~0) (<= (select .cse8 (+ .cse9 4)) .cse7)))) (= (+ (- 1) c_~ok~0) 0) (= .cse10 0)))) (<= (* c_~n~0 4) (+ .cse11 c_~queue~0.offset 3))))) (= c_~queue~0.offset 0) (<= c_~n~0 2))))) is different from false [2022-03-03 17:30:48,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:30:48,803 INFO L93 Difference]: Finished difference Result 6925 states and 18443 transitions. [2022-03-03 17:30:48,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-03-03 17:30:48,803 INFO L78 Accepts]: Start accepts. Automaton has has 105 states, 105 states have (on average 4.6761904761904765) internal successors, (491), 105 states have internal predecessors, (491), 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 188 [2022-03-03 17:30:48,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:30:48,815 INFO L225 Difference]: With dead ends: 6925 [2022-03-03 17:30:48,815 INFO L226 Difference]: Without dead ends: 6907 [2022-03-03 17:30:48,817 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 328 SyntacticMatches, 28 SemanticMatches, 184 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 10125 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=3417, Invalid=28439, Unknown=34, NotChecked=2520, Total=34410 [2022-03-03 17:30:48,819 INFO L933 BasicCegarLoop]: 255 mSDtfsCounter, 3593 mSDsluCounter, 11013 mSDsCounter, 0 mSdLazyCounter, 3329 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3593 SdHoareTripleChecker+Valid, 10518 SdHoareTripleChecker+Invalid, 11522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 3329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7916 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-03 17:30:48,819 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3593 Valid, 10518 Invalid, 11522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 3329 Invalid, 0 Unknown, 7916 Unchecked, 1.5s Time] [2022-03-03 17:30:48,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6907 states. [2022-03-03 17:30:48,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6907 to 3184. [2022-03-03 17:30:48,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3184 states, 3183 states have (on average 2.583411875589067) internal successors, (8223), 3183 states have internal predecessors, (8223), 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-03 17:30:48,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3184 states to 3184 states and 8223 transitions. [2022-03-03 17:30:48,886 INFO L78 Accepts]: Start accepts. Automaton has 3184 states and 8223 transitions. Word has length 188 [2022-03-03 17:30:48,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:30:48,886 INFO L470 AbstractCegarLoop]: Abstraction has 3184 states and 8223 transitions. [2022-03-03 17:30:48,887 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 105 states, 105 states have (on average 4.6761904761904765) internal successors, (491), 105 states have internal predecessors, (491), 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-03 17:30:48,887 INFO L276 IsEmpty]: Start isEmpty. Operand 3184 states and 8223 transitions. [2022-03-03 17:30:48,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-03-03 17:30:48,891 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:30:48,891 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 17:30:48,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-03-03 17:30:49,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-03 17:30:49,108 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-03 17:30:49,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:30:49,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1624005731, now seen corresponding path program 8 times [2022-03-03 17:30:49,108 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:30:49,108 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561356626] [2022-03-03 17:30:49,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:30:49,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:30:49,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:30:50,522 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-03 17:30:50,523 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:30:50,523 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561356626] [2022-03-03 17:30:50,523 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561356626] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:30:50,523 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996263661] [2022-03-03 17:30:50,523 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 17:30:50,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:30:50,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:30:50,524 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:30:50,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-03 17:30:50,635 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-03 17:30:50,635 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:30:50,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 94 conjunts are in the unsatisfiable core [2022-03-03 17:30:50,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:30:50,692 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-03 17:30:51,076 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-03-03 17:30:51,077 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-03-03 17:30:51,538 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-03 17:30:52,077 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-03-03 17:30:52,078 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-03-03 17:30:52,190 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-03 17:30:52,257 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-03 17:30:52,566 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-03 17:30:53,619 INFO L353 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-03-03 17:30:53,619 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 76 [2022-03-03 17:30:53,631 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:30:53,631 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 47 [2022-03-03 17:30:54,088 INFO L353 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-03-03 17:30:54,089 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 10 [2022-03-03 17:30:54,166 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-03 17:30:54,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:30:54,630 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~start~0 1))) (or (< .cse0 0) (and (forall ((v_ArrVal_450 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_450) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0)) (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_450 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_450) c_~queue~0.base)) (.cse2 (* c_~start~0 4))) (<= (select .cse1 (+ .cse2 c_~queue~0.offset 4)) (select .cse1 (+ .cse2 c_~queue~0.offset)))))) (<= c_~n~0 .cse0) (<= c_~end~0 .cse0))) is different from false [2022-03-03 17:30:54,804 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~end~0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (< (+ c_~start~0 1) 0) (and (forall ((v_ArrVal_450 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_450) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0)) (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_450 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_450) c_~queue~0.base)) (.cse1 (* c_~start~0 4))) (<= (select .cse0 (+ .cse1 c_~queue~0.offset 4)) (select .cse0 (+ .cse1 c_~queue~0.offset)))))) (<= c_~end~0 c_~start~0)) is different from false [2022-03-03 17:30:54,847 WARN L838 $PredicateComparison]: unable to prove that (or (not (<= |c_thread1Thread1of1ForFork0_#t~mem1#1| c_~last~0)) (<= c_~n~0 c_~end~0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (< (+ c_~start~0 1) 0) (and (forall ((v_ArrVal_450 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_450) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0)) (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_450 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_450) c_~queue~0.base)) (.cse1 (* c_~start~0 4))) (<= (select .cse0 (+ .cse1 c_~queue~0.offset 4)) (select .cse0 (+ .cse1 c_~queue~0.offset)))))) (<= c_~end~0 c_~start~0)) is different from false [2022-03-03 17:30:54,869 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((~i~0 Int)) (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* ~i~0 4))))) (or (< c_~last~0 .cse0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) .cse0))))) (<= c_~n~0 c_~end~0) (< (+ c_~start~0 1) 0) (and (forall ((v_ArrVal_450 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_450) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0)) (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_450 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_450) c_~queue~0.base)) (.cse2 (* c_~start~0 4))) (<= (select .cse1 (+ .cse2 c_~queue~0.offset 4)) (select .cse1 (+ .cse2 c_~queue~0.offset)))))) (<= c_~end~0 c_~start~0)) is different from false [2022-03-03 17:30:54,942 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((~i~0 Int)) (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* ~i~0 4))))) (or (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) .cse0)) (< |c_thread1Thread1of1ForFork0_#t~mem5#1| .cse0)))) (<= c_~n~0 c_~end~0) (< (+ c_~start~0 1) 0) (and (forall ((v_ArrVal_450 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_450) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0)) (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_450 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_450) c_~queue~0.base)) (.cse2 (* c_~start~0 4))) (<= (select .cse1 (+ .cse2 c_~queue~0.offset 4)) (select .cse1 (+ .cse2 c_~queue~0.offset)))))) (<= c_~end~0 c_~start~0)) is different from false [2022-03-03 17:30:54,995 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~end~0) (< (+ c_~start~0 1) 0) (and (forall ((v_ArrVal_450 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_450) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0)) (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_450 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_450) c_~queue~0.base)) (.cse1 (* c_~start~0 4))) (<= (select .cse0 (+ .cse1 c_~queue~0.offset 4)) (select .cse0 (+ .cse1 c_~queue~0.offset)))))) (forall ((v_~i~0_45 Int)) (let ((.cse3 (select |c_#memory_int| c_~A~0.base))) (let ((.cse2 (select .cse3 (+ c_~A~0.offset (* v_~i~0_45 4))))) (or (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) .cse2)) (< (select .cse3 (+ c_~A~0.offset (* c_~i~0 4))) .cse2))))) (<= c_~end~0 c_~start~0)) is different from false [2022-03-03 17:31:24,718 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:31:24,718 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 296 treesize of output 188 [2022-03-03 17:31:24,928 INFO L353 Elim1Store]: treesize reduction 82, result has 78.4 percent of original size [2022-03-03 17:31:24,929 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 1989 treesize of output 2016 [2022-03-03 17:31:25,057 INFO L353 Elim1Store]: treesize reduction 68, result has 72.9 percent of original size [2022-03-03 17:31:25,058 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 2016 treesize of output 1804 [2022-03-03 17:31:25,257 INFO L353 Elim1Store]: treesize reduction 68, result has 72.9 percent of original size [2022-03-03 17:31:25,257 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 1804 treesize of output 1789 [2022-03-03 17:31:25,334 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 655 treesize of output 559 [2022-03-03 17:31:25,370 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 17:31:25,371 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 559 treesize of output 507 Received shutdown request... [2022-03-03 17:42:16,473 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-03 17:42:16,473 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-03 17:42:16,500 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-03-03 17:42:16,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-03-03 17:42:16,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-03-03 17:42:16,701 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was analyzing trace of length 189 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-2-5-5-3-11-3-9-4-10-3-5-2-9-2-5-3-4-2-3-1 context. [2022-03-03 17:42:16,703 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2022-03-03 17:42:16,703 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2022-03-03 17:42:16,705 INFO L732 BasicCegarLoop]: Path program histogram: [8, 3, 1, 1, 1, 1, 1, 1] [2022-03-03 17:42:16,708 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-03 17:42:16,708 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-03 17:42:16,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 05:42:16 BasicIcfg [2022-03-03 17:42:16,710 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-03 17:42:16,711 INFO L158 Benchmark]: Toolchain (without parser) took 846121.74ms. Allocated memory was 209.7MB in the beginning and 766.5MB in the end (delta: 556.8MB). Free memory was 154.4MB in the beginning and 639.6MB in the end (delta: -485.2MB). Peak memory consumption was 542.3MB. Max. memory is 8.0GB. [2022-03-03 17:42:16,711 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 209.7MB. Free memory is still 170.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-03 17:42:16,714 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.41ms. Allocated memory was 209.7MB in the beginning and 268.4MB in the end (delta: 58.7MB). Free memory was 154.2MB in the beginning and 239.8MB in the end (delta: -85.6MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. [2022-03-03 17:42:16,715 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.13ms. Allocated memory is still 268.4MB. Free memory was 239.8MB in the beginning and 237.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-03 17:42:16,715 INFO L158 Benchmark]: Boogie Preprocessor took 19.94ms. Allocated memory is still 268.4MB. Free memory was 237.3MB in the beginning and 235.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-03 17:42:16,715 INFO L158 Benchmark]: RCFGBuilder took 487.29ms. Allocated memory is still 268.4MB. Free memory was 235.7MB in the beginning and 213.7MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2022-03-03 17:42:16,715 INFO L158 Benchmark]: TraceAbstraction took 845320.93ms. Allocated memory was 268.4MB in the beginning and 766.5MB in the end (delta: 498.1MB). Free memory was 213.2MB in the beginning and 639.6MB in the end (delta: -426.4MB). Peak memory consumption was 543.0MB. Max. memory is 8.0GB. [2022-03-03 17:42:16,718 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 209.7MB. Free memory is still 170.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 261.41ms. Allocated memory was 209.7MB in the beginning and 268.4MB in the end (delta: 58.7MB). Free memory was 154.2MB in the beginning and 239.8MB in the end (delta: -85.6MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.13ms. Allocated memory is still 268.4MB. Free memory was 239.8MB in the beginning and 237.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.94ms. Allocated memory is still 268.4MB. Free memory was 237.3MB in the beginning and 235.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 487.29ms. Allocated memory is still 268.4MB. Free memory was 235.7MB in the beginning and 213.7MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 845320.93ms. Allocated memory was 268.4MB in the beginning and 766.5MB in the end (delta: 498.1MB). Free memory was 213.2MB in the beginning and 639.6MB in the end (delta: -426.4MB). Peak memory consumption was 543.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 107]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 189 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-2-5-5-3-11-3-9-4-10-3-5-2-9-2-5-3-4-2-3-1 context. - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 189 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-2-5-5-3-11-3-9-4-10-3-5-2-9-2-5-3-4-2-3-1 context. - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 189 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-2-5-5-3-11-3-9-4-10-3-5-2-9-2-5-3-4-2-3-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 199 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 845.2s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.1s, AutomataDifference: 93.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 34793 SdHoareTripleChecker+Valid, 11.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 34793 mSDsluCounter, 57217 SdHoareTripleChecker+Invalid, 9.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 21488 IncrementalHoareTripleChecker+Unchecked, 59803 mSDsCounter, 2480 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24274 IncrementalHoareTripleChecker+Invalid, 48242 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2480 mSolverCounterUnsat, 2871 mSDtfsCounter, 24274 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4056 GetRequests, 2494 SyntacticMatches, 168 SemanticMatches, 1394 ConstructedPredicates, 11 IntricatePredicates, 5 DeprecatedPredicates, 108995 ImplicationChecksByTransitivity, 95.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4612occurred in iteration=9, InterpolantAutomatonStates: 981, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 16 MinimizatonAttempts, 36830 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 59.1s InterpolantComputationTime, 3855 NumberOfCodeBlocks, 3855 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 5148 ConstructedInterpolants, 408 QuantifiedInterpolants, 87273 SizeOfPredicates, 291 NumberOfNonLiveVariables, 2946 ConjunctsInSsa, 418 ConjunctsInUnsatCore, 32 InterpolantComputations, 8 PerfectInterpolantSequences, 166/308 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown