/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-queue-add-2-nl.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 14:19:14,501 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 14:19:14,502 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 14:19:14,535 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 14:19:14,542 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 14:19:14,545 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 14:19:14,548 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 14:19:14,553 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 14:19:14,554 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 14:19:14,559 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 14:19:14,559 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 14:19:14,560 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 14:19:14,560 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 14:19:14,561 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 14:19:14,561 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 14:19:14,562 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 14:19:14,562 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 14:19:14,563 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 14:19:14,564 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 14:19:14,565 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 14:19:14,565 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 14:19:14,568 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 14:19:14,571 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 14:19:14,572 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 14:19:14,573 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 14:19:14,574 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 14:19:14,574 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 14:19:14,574 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 14:19:14,574 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 14:19:14,575 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 14:19:14,575 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 14:19:14,576 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 14:19:14,576 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 14:19:14,577 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 14:19:14,577 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 14:19:14,577 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 14:19:14,578 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 14:19:14,578 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 14:19:14,578 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 14:19:14,579 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 14:19:14,579 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 14:19:14,580 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-15 14:19:14,607 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 14:19:14,607 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 14:19:14,608 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-15 14:19:14,608 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-15 14:19:14,609 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 14:19:14,609 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 14:19:14,609 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 14:19:14,609 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 14:19:14,609 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 14:19:14,609 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 14:19:14,610 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 14:19:14,610 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 14:19:14,610 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 14:19:14,610 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 14:19:14,610 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 14:19:14,610 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 14:19:14,610 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 14:19:14,611 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 14:19:14,611 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 14:19:14,611 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 14:19:14,611 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 14:19:14,611 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 14:19:14,611 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 14:19:14,611 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 14:19:14,612 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 14:19:14,612 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 14:19:14,612 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 14:19:14,612 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-15 14:19:14,612 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 14:19:14,613 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 14:19:14,613 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 14:19:14,613 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-15 14:19:14,613 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 14:19:14,613 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-15 14:19:14,787 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 14:19:14,800 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 14:19:14,802 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 14:19:14,802 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 14:19:14,803 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 14:19:14,804 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-queue-add-2-nl.wvr.c [2022-03-15 14:19:14,847 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b448b97c2/adcc542580f34aa08f9ca956f3c20608/FLAG8b483924d [2022-03-15 14:19:15,168 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 14:19:15,169 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-queue-add-2-nl.wvr.c [2022-03-15 14:19:15,176 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b448b97c2/adcc542580f34aa08f9ca956f3c20608/FLAG8b483924d [2022-03-15 14:19:15,607 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b448b97c2/adcc542580f34aa08f9ca956f3c20608 [2022-03-15 14:19:15,610 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 14:19:15,611 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 14:19:15,621 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 14:19:15,621 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 14:19:15,624 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 14:19:15,624 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 02:19:15" (1/1) ... [2022-03-15 14:19:15,625 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f813a01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:19:15, skipping insertion in model container [2022-03-15 14:19:15,625 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 02:19:15" (1/1) ... [2022-03-15 14:19:15,640 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 14:19:15,656 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 14:19:15,808 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-queue-add-2-nl.wvr.c[2870,2883] [2022-03-15 14:19:15,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 14:19:15,825 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 14:19:15,849 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-queue-add-2-nl.wvr.c[2870,2883] [2022-03-15 14:19:15,852 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 14:19:15,862 INFO L208 MainTranslator]: Completed translation [2022-03-15 14:19:15,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:19:15 WrapperNode [2022-03-15 14:19:15,862 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 14:19:15,863 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 14:19:15,863 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 14:19:15,863 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 14:19:15,868 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:19:15" (1/1) ... [2022-03-15 14:19:15,873 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:19:15" (1/1) ... [2022-03-15 14:19:15,889 INFO L137 Inliner]: procedures = 25, calls = 39, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 163 [2022-03-15 14:19:15,889 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 14:19:15,889 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 14:19:15,890 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 14:19:15,890 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 14:19:15,904 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:19:15" (1/1) ... [2022-03-15 14:19:15,905 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:19:15" (1/1) ... [2022-03-15 14:19:15,907 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:19:15" (1/1) ... [2022-03-15 14:19:15,907 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:19:15" (1/1) ... [2022-03-15 14:19:15,917 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:19:15" (1/1) ... [2022-03-15 14:19:15,929 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:19:15" (1/1) ... [2022-03-15 14:19:15,930 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:19:15" (1/1) ... [2022-03-15 14:19:15,931 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 14:19:15,932 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 14:19:15,932 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 14:19:15,932 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 14:19:15,933 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:19:15" (1/1) ... [2022-03-15 14:19:15,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 14:19:15,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:19:15,972 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-15 14:19:15,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-15 14:19:16,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 14:19:16,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 14:19:16,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 14:19:16,000 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 14:19:16,000 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 14:19:16,000 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 14:19:16,000 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 14:19:16,000 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 14:19:16,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 14:19:16,002 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-15 14:19:16,002 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-15 14:19:16,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-15 14:19:16,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 14:19:16,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 14:19:16,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 14:19:16,003 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 14:19:16,055 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 14:19:16,056 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 14:19:16,239 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 14:19:16,318 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 14:19:16,318 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-03-15 14:19:16,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 02:19:16 BoogieIcfgContainer [2022-03-15 14:19:16,320 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 14:19:16,321 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 14:19:16,321 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 14:19:16,336 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 14:19:16,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 02:19:15" (1/3) ... [2022-03-15 14:19:16,336 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46a08741 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 02:19:16, skipping insertion in model container [2022-03-15 14:19:16,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:19:15" (2/3) ... [2022-03-15 14:19:16,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46a08741 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 02:19:16, skipping insertion in model container [2022-03-15 14:19:16,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 02:19:16" (3/3) ... [2022-03-15 14:19:16,338 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-queue-add-2-nl.wvr.c [2022-03-15 14:19:16,341 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 14:19:16,341 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-15 14:19:16,341 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 14:19:16,341 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 14:19:16,382 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,383 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,383 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,383 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,383 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,384 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,384 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-15 14:19:16,384 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,384 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,384 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,384 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-15 14:19:16,385 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,385 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,385 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,385 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-15 14:19:16,385 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,385 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,385 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,386 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-15 14:19:16,386 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,386 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,386 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,386 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,386 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,387 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,387 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,387 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,387 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,387 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,387 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,387 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,387 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,387 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,388 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,388 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,388 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,388 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,388 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,388 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,388 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,389 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,389 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,389 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,389 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,389 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-15 14:19:16,389 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,389 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,390 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,390 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,390 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-15 14:19:16,390 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,390 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,390 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,390 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,391 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,391 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,391 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,391 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,394 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-15 14:19:16,394 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,394 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,394 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,394 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,394 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,394 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,395 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,395 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,395 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,395 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,396 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,396 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,396 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,396 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-15 14:19:16,396 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,396 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:16,398 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-03-15 14:19:16,427 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 14:19:16,431 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-15 14:19:16,432 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-03-15 14:19:16,441 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 141 places, 145 transitions, 306 flow [2022-03-15 14:19:16,500 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 673 states, 672 states have (on average 2.6324404761904763) internal successors, (1769), 672 states have internal predecessors, (1769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:16,504 INFO L276 IsEmpty]: Start isEmpty. Operand has 673 states, 672 states have (on average 2.6324404761904763) internal successors, (1769), 672 states have internal predecessors, (1769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:16,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-03-15 14:19:16,520 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:19:16,521 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] [2022-03-15 14:19:16,521 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 14:19:16,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:19:16,525 INFO L85 PathProgramCache]: Analyzing trace with hash 753294411, now seen corresponding path program 1 times [2022-03-15 14:19:16,530 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:19:16,531 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329353130] [2022-03-15 14:19:16,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:19:16,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:19:16,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:19:16,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:19:16,686 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:19:16,686 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329353130] [2022-03-15 14:19:16,687 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329353130] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 14:19:16,687 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 14:19:16,687 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 14:19:16,688 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912555169] [2022-03-15 14:19:16,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 14:19:16,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-15 14:19:16,691 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:19:16,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-15 14:19:16,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-15 14:19:16,713 INFO L87 Difference]: Start difference. First operand has 673 states, 672 states have (on average 2.6324404761904763) internal successors, (1769), 672 states have internal predecessors, (1769), 0 states have call successors, (0), 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 52.0) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:16,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:19:16,760 INFO L93 Difference]: Finished difference Result 673 states and 1616 transitions. [2022-03-15 14:19:16,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 14:19:16,764 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 52.0) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2022-03-15 14:19:16,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:19:16,778 INFO L225 Difference]: With dead ends: 673 [2022-03-15 14:19:16,778 INFO L226 Difference]: Without dead ends: 669 [2022-03-15 14:19:16,779 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-15 14:19:16,781 INFO L933 BasicCegarLoop]: 119 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, 119 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-15 14:19:16,782 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 14:19:16,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2022-03-15 14:19:16,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 669. [2022-03-15 14:19:16,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 668 states have (on average 2.413173652694611) internal successors, (1612), 668 states have internal predecessors, (1612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:16,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 1612 transitions. [2022-03-15 14:19:16,841 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 1612 transitions. Word has length 104 [2022-03-15 14:19:16,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:19:16,841 INFO L470 AbstractCegarLoop]: Abstraction has 669 states and 1612 transitions. [2022-03-15 14:19:16,842 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 52.0) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:16,842 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 1612 transitions. [2022-03-15 14:19:16,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-03-15 14:19:16,845 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:19:16,845 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] [2022-03-15 14:19:16,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 14:19:16,845 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 14:19:16,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:19:16,846 INFO L85 PathProgramCache]: Analyzing trace with hash -745282047, now seen corresponding path program 1 times [2022-03-15 14:19:16,846 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:19:16,846 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783461099] [2022-03-15 14:19:16,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:19:16,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:19:16,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:19:16,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:19:16,967 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:19:16,967 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783461099] [2022-03-15 14:19:16,967 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783461099] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 14:19:16,967 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 14:19:16,967 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-15 14:19:16,967 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642396763] [2022-03-15 14:19:16,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 14:19:16,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 14:19:16,969 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:19:16,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 14:19:16,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-03-15 14:19:16,970 INFO L87 Difference]: Start difference. First operand 669 states and 1612 transitions. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:17,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:19:17,049 INFO L93 Difference]: Finished difference Result 778 states and 1820 transitions. [2022-03-15 14:19:17,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 14:19:17,050 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2022-03-15 14:19:17,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:19:17,053 INFO L225 Difference]: With dead ends: 778 [2022-03-15 14:19:17,053 INFO L226 Difference]: Without dead ends: 675 [2022-03-15 14:19:17,054 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-03-15 14:19:17,057 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 278 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 14:19:17,057 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [278 Valid, 329 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 14:19:17,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2022-03-15 14:19:17,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 670. [2022-03-15 14:19:17,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 669 states have (on average 2.411061285500747) internal successors, (1613), 669 states have internal predecessors, (1613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:17,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1613 transitions. [2022-03-15 14:19:17,081 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1613 transitions. Word has length 108 [2022-03-15 14:19:17,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:19:17,082 INFO L470 AbstractCegarLoop]: Abstraction has 670 states and 1613 transitions. [2022-03-15 14:19:17,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:17,082 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1613 transitions. [2022-03-15 14:19:17,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-03-15 14:19:17,085 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:19:17,085 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] [2022-03-15 14:19:17,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 14:19:17,085 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 14:19:17,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:19:17,086 INFO L85 PathProgramCache]: Analyzing trace with hash -38797508, now seen corresponding path program 1 times [2022-03-15 14:19:17,086 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:19:17,086 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596220105] [2022-03-15 14:19:17,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:19:17,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:19:17,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:19:17,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:19:17,175 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:19:17,175 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596220105] [2022-03-15 14:19:17,175 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596220105] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 14:19:17,175 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 14:19:17,175 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 14:19:17,175 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58469561] [2022-03-15 14:19:17,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 14:19:17,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 14:19:17,176 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:19:17,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 14:19:17,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 14:19:17,177 INFO L87 Difference]: Start difference. First operand 670 states and 1613 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:17,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:19:17,191 INFO L93 Difference]: Finished difference Result 712 states and 1721 transitions. [2022-03-15 14:19:17,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 14:19:17,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2022-03-15 14:19:17,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:19:17,194 INFO L225 Difference]: With dead ends: 712 [2022-03-15 14:19:17,194 INFO L226 Difference]: Without dead ends: 712 [2022-03-15 14:19:17,194 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 14:19:17,195 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 2 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 14:19:17,195 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 182 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 14:19:17,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2022-03-15 14:19:17,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 712. [2022-03-15 14:19:17,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 711 states have (on average 2.420534458509142) internal successors, (1721), 711 states have internal predecessors, (1721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:17,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1721 transitions. [2022-03-15 14:19:17,217 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1721 transitions. Word has length 115 [2022-03-15 14:19:17,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:19:17,218 INFO L470 AbstractCegarLoop]: Abstraction has 712 states and 1721 transitions. [2022-03-15 14:19:17,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:17,218 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1721 transitions. [2022-03-15 14:19:17,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-03-15 14:19:17,221 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:19:17,221 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] [2022-03-15 14:19:17,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 14:19:17,224 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 14:19:17,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:19:17,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1372661662, now seen corresponding path program 2 times [2022-03-15 14:19:17,229 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:19:17,230 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612445522] [2022-03-15 14:19:17,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:19:17,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:19:17,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:19:17,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:19:17,854 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:19:17,855 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612445522] [2022-03-15 14:19:17,855 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612445522] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 14:19:17,855 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 14:19:17,855 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-03-15 14:19:17,855 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034915188] [2022-03-15 14:19:17,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 14:19:17,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 14:19:17,857 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:19:17,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 14:19:17,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2022-03-15 14:19:17,858 INFO L87 Difference]: Start difference. First operand 712 states and 1721 transitions. Second operand has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:18,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:19:18,168 INFO L93 Difference]: Finished difference Result 1064 states and 2599 transitions. [2022-03-15 14:19:18,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 14:19:18,169 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2022-03-15 14:19:18,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:19:18,173 INFO L225 Difference]: With dead ends: 1064 [2022-03-15 14:19:18,173 INFO L226 Difference]: Without dead ends: 1013 [2022-03-15 14:19:18,174 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2022-03-15 14:19:18,181 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 203 mSDsluCounter, 1211 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 1237 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 14:19:18,182 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 1237 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 14:19:18,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2022-03-15 14:19:18,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 774. [2022-03-15 14:19:18,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 773 states have (on average 2.4307891332470892) internal successors, (1879), 773 states have internal predecessors, (1879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:18,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1879 transitions. [2022-03-15 14:19:18,200 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1879 transitions. Word has length 115 [2022-03-15 14:19:18,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:19:18,200 INFO L470 AbstractCegarLoop]: Abstraction has 774 states and 1879 transitions. [2022-03-15 14:19:18,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:18,200 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1879 transitions. [2022-03-15 14:19:18,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-03-15 14:19:18,202 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:19:18,202 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] [2022-03-15 14:19:18,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 14:19:18,203 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 14:19:18,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:19:18,206 INFO L85 PathProgramCache]: Analyzing trace with hash -480697922, now seen corresponding path program 3 times [2022-03-15 14:19:18,206 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:19:18,206 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40567739] [2022-03-15 14:19:18,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:19:18,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:19:18,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:19:18,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:19:18,611 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:19:18,611 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40567739] [2022-03-15 14:19:18,611 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40567739] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 14:19:18,611 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 14:19:18,612 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-03-15 14:19:18,612 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418372061] [2022-03-15 14:19:18,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 14:19:18,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 14:19:18,612 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:19:18,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 14:19:18,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2022-03-15 14:19:18,613 INFO L87 Difference]: Start difference. First operand 774 states and 1879 transitions. Second operand has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:18,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:19:18,865 INFO L93 Difference]: Finished difference Result 1112 states and 2694 transitions. [2022-03-15 14:19:18,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 14:19:18,866 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2022-03-15 14:19:18,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:19:18,870 INFO L225 Difference]: With dead ends: 1112 [2022-03-15 14:19:18,870 INFO L226 Difference]: Without dead ends: 1061 [2022-03-15 14:19:18,870 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2022-03-15 14:19:18,871 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 199 mSDsluCounter, 1505 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 1514 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 14:19:18,871 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 1514 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 14:19:18,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2022-03-15 14:19:18,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 778. [2022-03-15 14:19:18,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 777 states have (on average 2.4375804375804377) internal successors, (1894), 777 states have internal predecessors, (1894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:18,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1894 transitions. [2022-03-15 14:19:18,893 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1894 transitions. Word has length 115 [2022-03-15 14:19:18,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:19:18,893 INFO L470 AbstractCegarLoop]: Abstraction has 778 states and 1894 transitions. [2022-03-15 14:19:18,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:18,893 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1894 transitions. [2022-03-15 14:19:18,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-03-15 14:19:18,895 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:19:18,895 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] [2022-03-15 14:19:18,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 14:19:18,895 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 14:19:18,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:19:18,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1782487108, now seen corresponding path program 4 times [2022-03-15 14:19:18,896 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:19:18,897 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584640177] [2022-03-15 14:19:18,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:19:18,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:19:18,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:19:19,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:19:19,249 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:19:19,249 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584640177] [2022-03-15 14:19:19,249 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584640177] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 14:19:19,249 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 14:19:19,249 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-03-15 14:19:19,249 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865017235] [2022-03-15 14:19:19,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 14:19:19,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 14:19:19,250 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:19:19,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 14:19:19,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-03-15 14:19:19,250 INFO L87 Difference]: Start difference. First operand 778 states and 1894 transitions. Second operand has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:19,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:19:19,427 INFO L93 Difference]: Finished difference Result 1013 states and 2475 transitions. [2022-03-15 14:19:19,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 14:19:19,427 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2022-03-15 14:19:19,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:19:19,431 INFO L225 Difference]: With dead ends: 1013 [2022-03-15 14:19:19,431 INFO L226 Difference]: Without dead ends: 950 [2022-03-15 14:19:19,431 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2022-03-15 14:19:19,432 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 184 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 14:19:19,432 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 1123 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 14:19:19,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2022-03-15 14:19:19,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 778. [2022-03-15 14:19:19,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 777 states have (on average 2.4324324324324325) internal successors, (1890), 777 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:19,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1890 transitions. [2022-03-15 14:19:19,447 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1890 transitions. Word has length 115 [2022-03-15 14:19:19,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:19:19,447 INFO L470 AbstractCegarLoop]: Abstraction has 778 states and 1890 transitions. [2022-03-15 14:19:19,448 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:19,448 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1890 transitions. [2022-03-15 14:19:19,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-03-15 14:19:19,449 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:19:19,450 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] [2022-03-15 14:19:19,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-15 14:19:19,450 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 14:19:19,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:19:19,450 INFO L85 PathProgramCache]: Analyzing trace with hash -867085732, now seen corresponding path program 5 times [2022-03-15 14:19:19,450 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:19:19,450 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796333099] [2022-03-15 14:19:19,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:19:19,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:19:19,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:19:19,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:19:19,771 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:19:19,771 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796333099] [2022-03-15 14:19:19,771 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796333099] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 14:19:19,771 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 14:19:19,771 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-03-15 14:19:19,771 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653779688] [2022-03-15 14:19:19,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 14:19:19,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 14:19:19,772 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:19:19,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 14:19:19,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-03-15 14:19:19,772 INFO L87 Difference]: Start difference. First operand 778 states and 1890 transitions. Second operand has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:20,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:19:20,040 INFO L93 Difference]: Finished difference Result 1113 states and 2715 transitions. [2022-03-15 14:19:20,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 14:19:20,040 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2022-03-15 14:19:20,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:19:20,044 INFO L225 Difference]: With dead ends: 1113 [2022-03-15 14:19:20,044 INFO L226 Difference]: Without dead ends: 1062 [2022-03-15 14:19:20,044 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2022-03-15 14:19:20,045 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 200 mSDsluCounter, 1351 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1364 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 14:19:20,045 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 1364 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 14:19:20,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2022-03-15 14:19:20,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 823. [2022-03-15 14:19:20,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 823 states, 822 states have (on average 2.427007299270073) internal successors, (1995), 822 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:20,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1995 transitions. [2022-03-15 14:19:20,061 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1995 transitions. Word has length 115 [2022-03-15 14:19:20,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:19:20,061 INFO L470 AbstractCegarLoop]: Abstraction has 823 states and 1995 transitions. [2022-03-15 14:19:20,061 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:20,061 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1995 transitions. [2022-03-15 14:19:20,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-03-15 14:19:20,063 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:19:20,063 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:19:20,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-15 14:19:20,063 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 14:19:20,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:19:20,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1012764612, now seen corresponding path program 6 times [2022-03-15 14:19:20,065 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:19:20,065 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559939657] [2022-03-15 14:19:20,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:19:20,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:19:20,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:19:20,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:19:20,453 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:19:20,453 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559939657] [2022-03-15 14:19:20,453 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559939657] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 14:19:20,453 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 14:19:20,453 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-03-15 14:19:20,453 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30390835] [2022-03-15 14:19:20,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 14:19:20,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 14:19:20,454 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:19:20,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 14:19:20,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-03-15 14:19:20,454 INFO L87 Difference]: Start difference. First operand 823 states and 1995 transitions. Second operand has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:20,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:19:20,774 INFO L93 Difference]: Finished difference Result 1235 states and 2985 transitions. [2022-03-15 14:19:20,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 14:19:20,774 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2022-03-15 14:19:20,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:19:20,778 INFO L225 Difference]: With dead ends: 1235 [2022-03-15 14:19:20,778 INFO L226 Difference]: Without dead ends: 1184 [2022-03-15 14:19:20,778 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2022-03-15 14:19:20,779 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 231 mSDsluCounter, 1423 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 1467 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 14:19:20,779 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [231 Valid, 1467 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 14:19:20,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2022-03-15 14:19:20,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 909. [2022-03-15 14:19:20,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 909 states, 908 states have (on average 2.4129955947136565) internal successors, (2191), 908 states have internal predecessors, (2191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:20,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 2191 transitions. [2022-03-15 14:19:20,800 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 2191 transitions. Word has length 115 [2022-03-15 14:19:20,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:19:20,801 INFO L470 AbstractCegarLoop]: Abstraction has 909 states and 2191 transitions. [2022-03-15 14:19:20,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:20,801 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 2191 transitions. [2022-03-15 14:19:20,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-03-15 14:19:20,802 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:19:20,803 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:19:20,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-15 14:19:20,803 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 14:19:20,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:19:20,803 INFO L85 PathProgramCache]: Analyzing trace with hash 874442110, now seen corresponding path program 7 times [2022-03-15 14:19:20,803 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:19:20,803 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546882586] [2022-03-15 14:19:20,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:19:20,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:19:20,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:19:21,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:19:21,083 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:19:21,083 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546882586] [2022-03-15 14:19:21,083 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546882586] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 14:19:21,083 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 14:19:21,084 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-03-15 14:19:21,084 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689225344] [2022-03-15 14:19:21,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 14:19:21,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 14:19:21,084 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:19:21,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 14:19:21,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-03-15 14:19:21,085 INFO L87 Difference]: Start difference. First operand 909 states and 2191 transitions. Second operand has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:21,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:19:21,317 INFO L93 Difference]: Finished difference Result 1193 states and 2870 transitions. [2022-03-15 14:19:21,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 14:19:21,317 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2022-03-15 14:19:21,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:19:21,321 INFO L225 Difference]: With dead ends: 1193 [2022-03-15 14:19:21,321 INFO L226 Difference]: Without dead ends: 1142 [2022-03-15 14:19:21,321 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2022-03-15 14:19:21,323 INFO L933 BasicCegarLoop]: 149 mSDtfsCounter, 238 mSDsluCounter, 1068 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 14:19:21,323 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [238 Valid, 1139 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 14:19:21,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2022-03-15 14:19:21,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 913. [2022-03-15 14:19:21,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 912 states have (on average 2.418859649122807) internal successors, (2206), 912 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:21,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 2206 transitions. [2022-03-15 14:19:21,363 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 2206 transitions. Word has length 115 [2022-03-15 14:19:21,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:19:21,364 INFO L470 AbstractCegarLoop]: Abstraction has 913 states and 2206 transitions. [2022-03-15 14:19:21,364 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:21,364 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 2206 transitions. [2022-03-15 14:19:21,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-03-15 14:19:21,366 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:19:21,366 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] [2022-03-15 14:19:21,366 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-15 14:19:21,366 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 14:19:21,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:19:21,367 INFO L85 PathProgramCache]: Analyzing trace with hash -427347076, now seen corresponding path program 8 times [2022-03-15 14:19:21,367 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:19:21,367 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799568826] [2022-03-15 14:19:21,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:19:21,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:19:21,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:19:21,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:19:21,655 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:19:21,655 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799568826] [2022-03-15 14:19:21,655 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799568826] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 14:19:21,655 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 14:19:21,655 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-03-15 14:19:21,655 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176343520] [2022-03-15 14:19:21,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 14:19:21,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 14:19:21,656 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:19:21,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 14:19:21,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-03-15 14:19:21,656 INFO L87 Difference]: Start difference. First operand 913 states and 2206 transitions. Second operand has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:21,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:19:21,842 INFO L93 Difference]: Finished difference Result 1094 states and 2651 transitions. [2022-03-15 14:19:21,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 14:19:21,842 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2022-03-15 14:19:21,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:19:21,846 INFO L225 Difference]: With dead ends: 1094 [2022-03-15 14:19:21,846 INFO L226 Difference]: Without dead ends: 1031 [2022-03-15 14:19:21,846 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2022-03-15 14:19:21,847 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 205 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 1020 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 14:19:21,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [205 Valid, 1020 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 14:19:21,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2022-03-15 14:19:21,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 885. [2022-03-15 14:19:21,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 884 states have (on average 2.408371040723982) internal successors, (2129), 884 states have internal predecessors, (2129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:21,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 2129 transitions. [2022-03-15 14:19:21,872 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 2129 transitions. Word has length 115 [2022-03-15 14:19:21,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:19:21,887 INFO L470 AbstractCegarLoop]: Abstraction has 885 states and 2129 transitions. [2022-03-15 14:19:21,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:21,888 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 2129 transitions. [2022-03-15 14:19:21,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-03-15 14:19:21,890 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:19:21,890 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] [2022-03-15 14:19:21,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-15 14:19:21,890 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 14:19:21,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:19:21,891 INFO L85 PathProgramCache]: Analyzing trace with hash -2058803320, now seen corresponding path program 9 times [2022-03-15 14:19:21,891 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:19:21,891 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069692246] [2022-03-15 14:19:21,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:19:21,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:19:21,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:19:22,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:19:22,177 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:19:22,177 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069692246] [2022-03-15 14:19:22,178 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069692246] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 14:19:22,178 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 14:19:22,178 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-03-15 14:19:22,178 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564392747] [2022-03-15 14:19:22,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 14:19:22,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 14:19:22,179 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:19:22,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 14:19:22,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-03-15 14:19:22,180 INFO L87 Difference]: Start difference. First operand 885 states and 2129 transitions. Second operand has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:22,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:19:22,450 INFO L93 Difference]: Finished difference Result 1171 states and 2834 transitions. [2022-03-15 14:19:22,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 14:19:22,450 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2022-03-15 14:19:22,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:19:22,454 INFO L225 Difference]: With dead ends: 1171 [2022-03-15 14:19:22,454 INFO L226 Difference]: Without dead ends: 1120 [2022-03-15 14:19:22,455 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2022-03-15 14:19:22,455 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 186 mSDsluCounter, 1115 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 14:19:22,455 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 1139 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 14:19:22,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2022-03-15 14:19:22,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 901. [2022-03-15 14:19:22,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 900 states have (on average 2.4144444444444444) internal successors, (2173), 900 states have internal predecessors, (2173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:22,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 2173 transitions. [2022-03-15 14:19:22,495 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 2173 transitions. Word has length 115 [2022-03-15 14:19:22,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:19:22,495 INFO L470 AbstractCegarLoop]: Abstraction has 901 states and 2173 transitions. [2022-03-15 14:19:22,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:22,495 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 2173 transitions. [2022-03-15 14:19:22,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-03-15 14:19:22,497 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:19:22,497 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] [2022-03-15 14:19:22,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-15 14:19:22,498 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 14:19:22,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:19:22,498 INFO L85 PathProgramCache]: Analyzing trace with hash 382804392, now seen corresponding path program 10 times [2022-03-15 14:19:22,498 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:19:22,498 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547677782] [2022-03-15 14:19:22,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:19:22,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:19:22,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:19:22,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:19:22,784 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:19:22,784 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547677782] [2022-03-15 14:19:22,784 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547677782] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 14:19:22,784 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 14:19:22,784 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-03-15 14:19:22,784 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740147628] [2022-03-15 14:19:22,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 14:19:22,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 14:19:22,785 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:19:22,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 14:19:22,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-03-15 14:19:22,785 INFO L87 Difference]: Start difference. First operand 901 states and 2173 transitions. Second operand has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:23,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:19:23,051 INFO L93 Difference]: Finished difference Result 1189 states and 2859 transitions. [2022-03-15 14:19:23,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 14:19:23,051 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2022-03-15 14:19:23,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:19:23,055 INFO L225 Difference]: With dead ends: 1189 [2022-03-15 14:19:23,055 INFO L226 Difference]: Without dead ends: 1138 [2022-03-15 14:19:23,056 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2022-03-15 14:19:23,056 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 188 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 1286 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 14:19:23,056 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 1286 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 14:19:23,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2022-03-15 14:19:23,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 905. [2022-03-15 14:19:23,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 904 states have (on average 2.420353982300885) internal successors, (2188), 904 states have internal predecessors, (2188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:23,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 2188 transitions. [2022-03-15 14:19:23,071 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 2188 transitions. Word has length 115 [2022-03-15 14:19:23,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:19:23,072 INFO L470 AbstractCegarLoop]: Abstraction has 905 states and 2188 transitions. [2022-03-15 14:19:23,072 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:23,072 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 2188 transitions. [2022-03-15 14:19:23,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-03-15 14:19:23,073 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:19:23,074 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] [2022-03-15 14:19:23,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-15 14:19:23,074 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 14:19:23,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:19:23,074 INFO L85 PathProgramCache]: Analyzing trace with hash -918984794, now seen corresponding path program 11 times [2022-03-15 14:19:23,074 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:19:23,074 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120067419] [2022-03-15 14:19:23,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:19:23,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:19:23,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:19:23,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:19:23,316 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:19:23,316 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120067419] [2022-03-15 14:19:23,316 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120067419] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 14:19:23,316 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 14:19:23,316 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-03-15 14:19:23,316 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443532463] [2022-03-15 14:19:23,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 14:19:23,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 14:19:23,316 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:19:23,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 14:19:23,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-03-15 14:19:23,317 INFO L87 Difference]: Start difference. First operand 905 states and 2188 transitions. Second operand has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:23,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:19:23,518 INFO L93 Difference]: Finished difference Result 1090 states and 2640 transitions. [2022-03-15 14:19:23,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 14:19:23,519 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2022-03-15 14:19:23,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:19:23,522 INFO L225 Difference]: With dead ends: 1090 [2022-03-15 14:19:23,522 INFO L226 Difference]: Without dead ends: 1027 [2022-03-15 14:19:23,523 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2022-03-15 14:19:23,523 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 194 mSDsluCounter, 1058 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 14:19:23,523 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 1097 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 14:19:23,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2022-03-15 14:19:23,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 897. [2022-03-15 14:19:23,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 897 states, 896 states have (on average 2.4129464285714284) internal successors, (2162), 896 states have internal predecessors, (2162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:23,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 2162 transitions. [2022-03-15 14:19:23,570 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 2162 transitions. Word has length 115 [2022-03-15 14:19:23,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:19:23,570 INFO L470 AbstractCegarLoop]: Abstraction has 897 states and 2162 transitions. [2022-03-15 14:19:23,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:23,570 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 2162 transitions. [2022-03-15 14:19:23,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-03-15 14:19:23,573 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:19:23,573 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] [2022-03-15 14:19:23,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-15 14:19:23,573 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 14:19:23,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:19:23,574 INFO L85 PathProgramCache]: Analyzing trace with hash -3583418, now seen corresponding path program 12 times [2022-03-15 14:19:23,574 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:19:23,574 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209036740] [2022-03-15 14:19:23,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:19:23,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:19:23,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:19:23,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:19:23,916 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:19:23,916 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209036740] [2022-03-15 14:19:23,916 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209036740] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 14:19:23,916 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 14:19:23,916 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-03-15 14:19:23,916 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368942634] [2022-03-15 14:19:23,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 14:19:23,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 14:19:23,917 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:19:23,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 14:19:23,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2022-03-15 14:19:23,917 INFO L87 Difference]: Start difference. First operand 897 states and 2162 transitions. Second operand has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:24,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:19:24,154 INFO L93 Difference]: Finished difference Result 1201 states and 2904 transitions. [2022-03-15 14:19:24,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 14:19:24,154 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2022-03-15 14:19:24,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:19:24,158 INFO L225 Difference]: With dead ends: 1201 [2022-03-15 14:19:24,158 INFO L226 Difference]: Without dead ends: 1150 [2022-03-15 14:19:24,158 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2022-03-15 14:19:24,159 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 202 mSDsluCounter, 1002 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 14:19:24,159 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [202 Valid, 1037 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 14:19:24,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2022-03-15 14:19:24,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 869. [2022-03-15 14:19:24,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 868 states have (on average 2.402073732718894) internal successors, (2085), 868 states have internal predecessors, (2085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:24,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 2085 transitions. [2022-03-15 14:19:24,173 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 2085 transitions. Word has length 115 [2022-03-15 14:19:24,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:19:24,173 INFO L470 AbstractCegarLoop]: Abstraction has 869 states and 2085 transitions. [2022-03-15 14:19:24,173 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:24,173 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 2085 transitions. [2022-03-15 14:19:24,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-03-15 14:19:24,175 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:19:24,175 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 14:19:24,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-15 14:19:24,175 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 14:19:24,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:19:24,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1414840224, now seen corresponding path program 1 times [2022-03-15 14:19:24,176 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:19:24,176 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480444879] [2022-03-15 14:19:24,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:19:24,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:19:24,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:19:24,207 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 14:19:24,208 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:19:24,208 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480444879] [2022-03-15 14:19:24,208 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480444879] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 14:19:24,208 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 14:19:24,208 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 14:19:24,208 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414950402] [2022-03-15 14:19:24,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 14:19:24,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 14:19:24,208 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:19:24,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 14:19:24,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 14:19:24,209 INFO L87 Difference]: Start difference. First operand 869 states and 2085 transitions. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:24,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:19:24,229 INFO L93 Difference]: Finished difference Result 1737 states and 4340 transitions. [2022-03-15 14:19:24,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 14:19:24,229 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 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 120 [2022-03-15 14:19:24,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:19:24,234 INFO L225 Difference]: With dead ends: 1737 [2022-03-15 14:19:24,234 INFO L226 Difference]: Without dead ends: 1520 [2022-03-15 14:19:24,234 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 14:19:24,235 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 117 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 14:19:24,235 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 272 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 14:19:24,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2022-03-15 14:19:24,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1212. [2022-03-15 14:19:24,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1212 states, 1211 states have (on average 2.564822460776218) internal successors, (3106), 1211 states have internal predecessors, (3106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:24,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 3106 transitions. [2022-03-15 14:19:24,254 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 3106 transitions. Word has length 120 [2022-03-15 14:19:24,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:19:24,255 INFO L470 AbstractCegarLoop]: Abstraction has 1212 states and 3106 transitions. [2022-03-15 14:19:24,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:24,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 3106 transitions. [2022-03-15 14:19:24,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-03-15 14:19:24,257 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:19:24,257 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] [2022-03-15 14:19:24,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-15 14:19:24,257 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 14:19:24,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:19:24,258 INFO L85 PathProgramCache]: Analyzing trace with hash 2096069143, now seen corresponding path program 1 times [2022-03-15 14:19:24,258 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:19:24,258 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834108823] [2022-03-15 14:19:24,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:19:24,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:19:24,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:19:24,315 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:19:24,316 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:19:24,316 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834108823] [2022-03-15 14:19:24,317 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834108823] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:19:24,317 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413659614] [2022-03-15 14:19:24,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:19:24,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:19:24,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:19:24,319 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-15 14:19:24,320 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-15 14:19:24,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:19:24,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 14:19:24,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:19:24,816 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:19:24,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:19:25,151 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:19:25,151 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413659614] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:19:25,151 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:19:25,151 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-03-15 14:19:25,151 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548502725] [2022-03-15 14:19:25,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:19:25,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 14:19:25,152 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:19:25,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 14:19:25,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-03-15 14:19:25,153 INFO L87 Difference]: Start difference. First operand 1212 states and 3106 transitions. Second operand has 19 states, 19 states have (on average 10.526315789473685) internal successors, (200), 19 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:25,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:19:25,310 INFO L93 Difference]: Finished difference Result 1683 states and 4216 transitions. [2022-03-15 14:19:25,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 14:19:25,311 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 10.526315789473685) internal successors, (200), 19 states have internal predecessors, (200), 0 states have call successors, (0), 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 121 [2022-03-15 14:19:25,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:19:25,315 INFO L225 Difference]: With dead ends: 1683 [2022-03-15 14:19:25,315 INFO L226 Difference]: Without dead ends: 1224 [2022-03-15 14:19:25,315 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756 [2022-03-15 14:19:25,316 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 739 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 14:19:25,316 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [739 Valid, 741 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 14:19:25,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2022-03-15 14:19:25,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1219. [2022-03-15 14:19:25,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1219 states, 1218 states have (on average 2.5558292282430215) internal successors, (3113), 1218 states have internal predecessors, (3113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:25,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 3113 transitions. [2022-03-15 14:19:25,336 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 3113 transitions. Word has length 121 [2022-03-15 14:19:25,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:19:25,336 INFO L470 AbstractCegarLoop]: Abstraction has 1219 states and 3113 transitions. [2022-03-15 14:19:25,336 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 10.526315789473685) internal successors, (200), 19 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:25,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 3113 transitions. [2022-03-15 14:19:25,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-03-15 14:19:25,338 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:19:25,339 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 14:19:25,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-15 14:19:25,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-15 14:19:25,556 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 14:19:25,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:19:25,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1461811388, now seen corresponding path program 2 times [2022-03-15 14:19:25,557 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:19:25,557 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412163850] [2022-03-15 14:19:25,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:19:25,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:19:25,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:19:26,296 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:19:26,297 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:19:26,297 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412163850] [2022-03-15 14:19:26,297 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412163850] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:19:26,297 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788642778] [2022-03-15 14:19:26,297 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 14:19:26,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:19:26,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:19:26,298 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-15 14:19:26,307 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-15 14:19:26,385 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 14:19:26,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:19:26,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 39 conjunts are in the unsatisfiable core [2022-03-15 14:19:26,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:19:27,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:19:27,454 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 18 treesize of output 20 [2022-03-15 14:19:27,647 INFO L353 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-03-15 14:19:27,648 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-15 14:19:27,716 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:19:27,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:19:28,010 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:19:28,010 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 45 treesize of output 45 [2022-03-15 14:19:28,015 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 24 treesize of output 18 [2022-03-15 14:19:29,430 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:19:29,430 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788642778] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:19:29,431 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:19:29,431 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 20, 21] total 62 [2022-03-15 14:19:29,431 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878094524] [2022-03-15 14:19:29,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:19:29,431 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-03-15 14:19:29,431 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:19:29,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-03-15 14:19:29,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=3434, Unknown=2, NotChecked=0, Total=3782 [2022-03-15 14:19:29,433 INFO L87 Difference]: Start difference. First operand 1219 states and 3113 transitions. Second operand has 62 states, 62 states have (on average 4.838709677419355) internal successors, (300), 62 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:32,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:19:32,625 INFO L93 Difference]: Finished difference Result 5266 states and 13499 transitions. [2022-03-15 14:19:32,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-03-15 14:19:32,627 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 4.838709677419355) internal successors, (300), 62 states have internal predecessors, (300), 0 states have call successors, (0), 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 128 [2022-03-15 14:19:32,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:19:32,651 INFO L225 Difference]: With dead ends: 5266 [2022-03-15 14:19:32,651 INFO L226 Difference]: Without dead ends: 5254 [2022-03-15 14:19:32,653 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 230 SyntacticMatches, 10 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2911 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1470, Invalid=9845, Unknown=27, NotChecked=0, Total=11342 [2022-03-15 14:19:32,653 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 2111 mSDsluCounter, 6489 mSDsCounter, 0 mSdLazyCounter, 1730 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2111 SdHoareTripleChecker+Valid, 6401 SdHoareTripleChecker+Invalid, 2155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 346 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 14:19:32,654 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2111 Valid, 6401 Invalid, 2155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1730 Invalid, 0 Unknown, 346 Unchecked, 0.8s Time] [2022-03-15 14:19:32,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5254 states. [2022-03-15 14:19:32,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5254 to 3004. [2022-03-15 14:19:32,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3004 states, 3003 states have (on average 2.668997668997669) internal successors, (8015), 3003 states have internal predecessors, (8015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:32,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3004 states to 3004 states and 8015 transitions. [2022-03-15 14:19:32,730 INFO L78 Accepts]: Start accepts. Automaton has 3004 states and 8015 transitions. Word has length 128 [2022-03-15 14:19:32,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:19:32,730 INFO L470 AbstractCegarLoop]: Abstraction has 3004 states and 8015 transitions. [2022-03-15 14:19:32,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 4.838709677419355) internal successors, (300), 62 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:32,731 INFO L276 IsEmpty]: Start isEmpty. Operand 3004 states and 8015 transitions. [2022-03-15 14:19:32,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-03-15 14:19:32,736 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:19:32,736 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 14:19:32,761 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-15 14:19:32,952 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,SelfDestructingSolverStorable16 [2022-03-15 14:19:32,952 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 14:19:32,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:19:32,953 INFO L85 PathProgramCache]: Analyzing trace with hash -803066400, now seen corresponding path program 3 times [2022-03-15 14:19:32,953 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:19:32,953 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802696635] [2022-03-15 14:19:32,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:19:32,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:19:33,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:19:33,550 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:19:33,550 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:19:33,550 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802696635] [2022-03-15 14:19:33,550 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802696635] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:19:33,550 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315794052] [2022-03-15 14:19:33,550 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 14:19:33,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:19:33,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:19:33,552 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-15 14:19:33,553 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-15 14:19:33,633 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 14:19:33,634 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:19:33,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-15 14:19:33,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:19:34,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:19:34,054 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 18 treesize of output 20 [2022-03-15 14:19:34,093 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-15 14:19:34,132 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 14:19:34,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:19:34,198 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_258 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_258) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) 0))) is different from false [2022-03-15 14:19:34,250 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:19:34,250 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 45 treesize of output 45 [2022-03-15 14:19:34,253 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 24 treesize of output 18 [2022-03-15 14:19:34,713 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 14:19:34,713 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315794052] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:19:34,713 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:19:34,713 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12, 12] total 39 [2022-03-15 14:19:34,713 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069776687] [2022-03-15 14:19:34,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:19:34,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-15 14:19:34,714 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:19:34,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-15 14:19:34,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1312, Unknown=1, NotChecked=72, Total=1482 [2022-03-15 14:19:34,715 INFO L87 Difference]: Start difference. First operand 3004 states and 8015 transitions. Second operand has 39 states, 39 states have (on average 7.128205128205129) internal successors, (278), 39 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:37,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:19:37,446 INFO L93 Difference]: Finished difference Result 5956 states and 15868 transitions. [2022-03-15 14:19:37,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-15 14:19:37,446 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 7.128205128205129) internal successors, (278), 39 states have internal predecessors, (278), 0 states have call successors, (0), 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 128 [2022-03-15 14:19:37,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:19:37,458 INFO L225 Difference]: With dead ends: 5956 [2022-03-15 14:19:37,458 INFO L226 Difference]: Without dead ends: 5956 [2022-03-15 14:19:37,459 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 238 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 809 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=702, Invalid=4557, Unknown=1, NotChecked=142, Total=5402 [2022-03-15 14:19:37,461 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 1871 mSDsluCounter, 3283 mSDsCounter, 0 mSdLazyCounter, 1293 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1871 SdHoareTripleChecker+Valid, 3258 SdHoareTripleChecker+Invalid, 1678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 275 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 14:19:37,461 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1871 Valid, 3258 Invalid, 1678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1293 Invalid, 0 Unknown, 275 Unchecked, 0.6s Time] [2022-03-15 14:19:37,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5956 states. [2022-03-15 14:19:37,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5956 to 2795. [2022-03-15 14:19:37,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2795 states, 2794 states have (on average 2.6385110952040085) internal successors, (7372), 2794 states have internal predecessors, (7372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:37,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2795 states to 2795 states and 7372 transitions. [2022-03-15 14:19:37,518 INFO L78 Accepts]: Start accepts. Automaton has 2795 states and 7372 transitions. Word has length 128 [2022-03-15 14:19:37,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:19:37,518 INFO L470 AbstractCegarLoop]: Abstraction has 2795 states and 7372 transitions. [2022-03-15 14:19:37,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 7.128205128205129) internal successors, (278), 39 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:19:37,519 INFO L276 IsEmpty]: Start isEmpty. Operand 2795 states and 7372 transitions. [2022-03-15 14:19:37,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-03-15 14:19:37,523 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:19:37,524 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 14:19:37,540 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-15 14:19:37,740 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-03-15 14:19:37,740 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 14:19:37,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:19:37,741 INFO L85 PathProgramCache]: Analyzing trace with hash -2037793132, now seen corresponding path program 1 times [2022-03-15 14:19:37,741 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:19:37,741 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98341421] [2022-03-15 14:19:37,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:19:37,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:19:37,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:19:39,305 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:19:39,305 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:19:39,305 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98341421] [2022-03-15 14:19:39,305 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98341421] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:19:39,305 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872370435] [2022-03-15 14:19:39,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:19:39,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:19:39,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:19:39,336 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-15 14:19:39,337 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-15 14:19:39,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:19:39,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 68 conjunts are in the unsatisfiable core [2022-03-15 14:19:39,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:19:41,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:19:41,412 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 18 treesize of output 20 [2022-03-15 14:19:41,741 INFO L353 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-03-15 14:19:41,741 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-15 14:19:42,511 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:19:42,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:19:43,720 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:19:43,720 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 87 treesize of output 87 [2022-03-15 14:19:43,728 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 66 treesize of output 60 [2022-03-15 14:20:00,737 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:20:00,737 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872370435] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:20:00,737 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:20:00,737 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 36] total 101 [2022-03-15 14:20:00,737 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605004129] [2022-03-15 14:20:00,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:20:00,738 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 101 states [2022-03-15 14:20:00,738 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:20:00,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2022-03-15 14:20:00,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=9297, Unknown=20, NotChecked=0, Total=10100 [2022-03-15 14:20:00,740 INFO L87 Difference]: Start difference. First operand 2795 states and 7372 transitions. Second operand has 101 states, 101 states have (on average 3.3564356435643563) internal successors, (339), 101 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:20:31,126 WARN L228 SmtUtils]: Spent 22.27s on a formula simplification. DAG size of input: 89 DAG size of output: 85 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 14:20:52,247 WARN L228 SmtUtils]: Spent 16.30s on a formula simplification. DAG size of input: 108 DAG size of output: 87 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 14:21:45,887 WARN L228 SmtUtils]: Spent 52.98s on a formula simplification. DAG size of input: 137 DAG size of output: 113 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 14:21:53,726 WARN L228 SmtUtils]: Spent 6.15s on a formula simplification. DAG size of input: 89 DAG size of output: 81 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 14:22:01,692 WARN L228 SmtUtils]: Spent 6.19s on a formula simplification. DAG size of input: 103 DAG size of output: 86 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 14:22:09,604 WARN L228 SmtUtils]: Spent 6.14s on a formula simplification. DAG size of input: 90 DAG size of output: 74 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 14:22:16,969 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-15 14:22:21,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:22:21,959 INFO L93 Difference]: Finished difference Result 7408 states and 19195 transitions. [2022-03-15 14:22:21,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2022-03-15 14:22:21,960 INFO L78 Accepts]: Start accepts. Automaton has has 101 states, 101 states have (on average 3.3564356435643563) internal successors, (339), 101 states have internal predecessors, (339), 0 states have call successors, (0), 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 133 [2022-03-15 14:22:21,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:22:21,972 INFO L225 Difference]: With dead ends: 7408 [2022-03-15 14:22:21,973 INFO L226 Difference]: Without dead ends: 7021 [2022-03-15 14:22:21,977 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 226 SyntacticMatches, 29 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19091 ImplicationChecksByTransitivity, 155.6s TimeCoverageRelationStatistics Valid=3781, Invalid=44238, Unknown=161, NotChecked=0, Total=48180 [2022-03-15 14:22:21,978 INFO L933 BasicCegarLoop]: 277 mSDtfsCounter, 2370 mSDsluCounter, 11475 mSDsCounter, 0 mSdLazyCounter, 2473 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2370 SdHoareTripleChecker+Valid, 10788 SdHoareTripleChecker+Invalid, 7639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 2473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5022 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-03-15 14:22:21,978 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2370 Valid, 10788 Invalid, 7639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 2473 Invalid, 0 Unknown, 5022 Unchecked, 2.7s Time] [2022-03-15 14:22:21,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7021 states. [2022-03-15 14:22:22,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7021 to 3284. [2022-03-15 14:22:22,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3284 states, 3283 states have (on average 2.6618946085897046) internal successors, (8739), 3283 states have internal predecessors, (8739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:22:22,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3284 states to 3284 states and 8739 transitions. [2022-03-15 14:22:22,044 INFO L78 Accepts]: Start accepts. Automaton has 3284 states and 8739 transitions. Word has length 133 [2022-03-15 14:22:22,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:22:22,045 INFO L470 AbstractCegarLoop]: Abstraction has 3284 states and 8739 transitions. [2022-03-15 14:22:22,045 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 101 states, 101 states have (on average 3.3564356435643563) internal successors, (339), 101 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:22:22,045 INFO L276 IsEmpty]: Start isEmpty. Operand 3284 states and 8739 transitions. [2022-03-15 14:22:22,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-03-15 14:22:22,051 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:22:22,051 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 14:22:22,087 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-15 14:22:22,264 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:22:22,264 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 14:22:22,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:22:22,265 INFO L85 PathProgramCache]: Analyzing trace with hash 403814580, now seen corresponding path program 2 times [2022-03-15 14:22:22,265 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:22:22,265 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511137559] [2022-03-15 14:22:22,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:22:22,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:22:22,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:22:23,744 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:22:23,745 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:22:23,745 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511137559] [2022-03-15 14:22:23,745 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511137559] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:22:23,745 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516817167] [2022-03-15 14:22:23,745 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 14:22:23,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:22:23,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:22:23,747 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-15 14:22:23,748 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-15 14:22:23,966 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 14:22:23,966 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:22:23,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 77 conjunts are in the unsatisfiable core [2022-03-15 14:22:23,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:22:25,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:22:25,987 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 18 treesize of output 20 [2022-03-15 14:22:26,270 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 14:22:26,271 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:22:26,271 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 21 treesize of output 10 [2022-03-15 14:22:26,817 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:22:26,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:22:27,858 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:22:27,860 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 87 treesize of output 87 [2022-03-15 14:22:27,863 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 66 treesize of output 60 [2022-03-15 14:22:39,024 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:22:39,024 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516817167] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:22:39,024 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:22:39,024 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 36] total 101 [2022-03-15 14:22:39,024 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067309396] [2022-03-15 14:22:39,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:22:39,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 101 states [2022-03-15 14:22:39,025 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:22:39,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2022-03-15 14:22:39,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=814, Invalid=9270, Unknown=16, NotChecked=0, Total=10100 [2022-03-15 14:22:39,026 INFO L87 Difference]: Start difference. First operand 3284 states and 8739 transitions. Second operand has 101 states, 101 states have (on average 3.3564356435643563) internal successors, (339), 101 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:22:43,454 WARN L838 $PredicateComparison]: unable to prove that (and (= c_~y~0 0) (or (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) (< c_~q_back~0 0) (and (forall ((v_ArrVal_316 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_316) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)))) (forall ((aux_mod_aux_mod_~C~0_30_61 Int) (aux_div_aux_mod_~C~0_30_61 Int)) (let ((.cse2 (* aux_div_aux_mod_~C~0_30_61 4294967296))) (let ((.cse1 (+ .cse2 aux_mod_aux_mod_~C~0_30_61)) (.cse0 (* 4294967295 c_~x~0))) (or (<= (+ .cse0 c_~y~0 4294967296) .cse1) (= (+ (* (- 1) c_~y~0) .cse2 (* c_~x~0 (- 4294967295)) aux_mod_aux_mod_~C~0_30_61) aux_mod_aux_mod_~C~0_30_61) (>= aux_mod_aux_mod_~C~0_30_61 4294967296) (< .cse1 (+ .cse0 c_~y~0)) (> 0 aux_mod_aux_mod_~C~0_30_61)))))) (<= c_~n~0 c_~q_back~0)) (= c_~x~0 0)) is different from false [2022-03-15 14:22:56,425 WARN L228 SmtUtils]: Spent 12.25s on a formula simplification. DAG size of input: 102 DAG size of output: 90 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 14:23:12,534 WARN L228 SmtUtils]: Spent 5.24s on a formula simplification. DAG size of input: 79 DAG size of output: 72 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 14:23:22,959 WARN L228 SmtUtils]: Spent 10.34s on a formula simplification. DAG size of input: 117 DAG size of output: 98 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 14:23:29,253 WARN L228 SmtUtils]: Spent 6.20s on a formula simplification. DAG size of input: 99 DAG size of output: 88 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 14:23:42,342 WARN L228 SmtUtils]: Spent 6.33s on a formula simplification. DAG size of input: 123 DAG size of output: 100 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 14:24:00,539 WARN L228 SmtUtils]: Spent 18.12s on a formula simplification. DAG size of input: 114 DAG size of output: 106 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 14:24:23,213 WARN L228 SmtUtils]: Spent 8.39s on a formula simplification. DAG size of input: 100 DAG size of output: 96 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 14:24:49,251 WARN L228 SmtUtils]: Spent 17.09s on a formula simplification. DAG size of input: 128 DAG size of output: 104 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 14:25:12,444 WARN L228 SmtUtils]: Spent 17.57s on a formula simplification. DAG size of input: 104 DAG size of output: 99 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 14:25:17,391 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_thread2Thread1of1ForFork1_~j~0#1| 0))) (.cse1 (= c_~s~0 c_~N~0)) (.cse3 (mod c_~x~0 4294967296)) (.cse2 (mod c_~y~0 4294967296))) (and (or .cse0 (and .cse1 (= .cse2 (mod (+ c_~C~0 c_~x~0) 4294967296)))) (or (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) (and (= (mod (+ c_~C~0 c_~y~0) 4294967296) .cse3) (forall ((v_ArrVal_316 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_316) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))))) (< c_~q_back~0 0) (<= c_~n~0 c_~q_back~0)) (or .cse0 (and .cse1 (= .cse3 .cse2))))) is different from false [2022-03-15 14:25:35,687 WARN L228 SmtUtils]: Spent 15.98s on a formula simplification. DAG size of input: 123 DAG size of output: 101 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 14:25:47,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:25:47,692 INFO L93 Difference]: Finished difference Result 7314 states and 19210 transitions. [2022-03-15 14:25:47,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2022-03-15 14:25:47,693 INFO L78 Accepts]: Start accepts. Automaton has has 101 states, 101 states have (on average 3.3564356435643563) internal successors, (339), 101 states have internal predecessors, (339), 0 states have call successors, (0), 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 133 [2022-03-15 14:25:47,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:25:47,706 INFO L225 Difference]: With dead ends: 7314 [2022-03-15 14:25:47,706 INFO L226 Difference]: Without dead ends: 7116 [2022-03-15 14:25:47,709 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 222 SyntacticMatches, 49 SemanticMatches, 233 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 24326 ImplicationChecksByTransitivity, 197.6s TimeCoverageRelationStatistics Valid=4392, Invalid=49583, Unknown=89, NotChecked=926, Total=54990 [2022-03-15 14:25:47,710 INFO L933 BasicCegarLoop]: 296 mSDtfsCounter, 3130 mSDsluCounter, 11000 mSDsCounter, 0 mSdLazyCounter, 2740 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3130 SdHoareTripleChecker+Valid, 10498 SdHoareTripleChecker+Invalid, 7017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 2740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4084 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-15 14:25:47,710 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3130 Valid, 10498 Invalid, 7017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 2740 Invalid, 0 Unknown, 4084 Unchecked, 1.9s Time] [2022-03-15 14:25:47,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7116 states. [2022-03-15 14:25:47,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7116 to 3589. [2022-03-15 14:25:47,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3589 states, 3588 states have (on average 2.668338907469342) internal successors, (9574), 3588 states have internal predecessors, (9574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:25:47,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3589 states to 3589 states and 9574 transitions. [2022-03-15 14:25:47,775 INFO L78 Accepts]: Start accepts. Automaton has 3589 states and 9574 transitions. Word has length 133 [2022-03-15 14:25:47,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:25:47,776 INFO L470 AbstractCegarLoop]: Abstraction has 3589 states and 9574 transitions. [2022-03-15 14:25:47,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 101 states, 101 states have (on average 3.3564356435643563) internal successors, (339), 101 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:25:47,776 INFO L276 IsEmpty]: Start isEmpty. Operand 3589 states and 9574 transitions. [2022-03-15 14:25:47,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-03-15 14:25:47,782 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:25:47,782 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 14:25:47,802 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-15 14:25:47,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:25:47,995 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 14:25:47,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:25:47,996 INFO L85 PathProgramCache]: Analyzing trace with hash -897974606, now seen corresponding path program 3 times [2022-03-15 14:25:47,996 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:25:47,996 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569990753] [2022-03-15 14:25:47,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:25:47,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:25:48,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:25:49,527 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:25:49,527 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:25:49,527 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569990753] [2022-03-15 14:25:49,527 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569990753] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:25:49,527 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613905722] [2022-03-15 14:25:49,527 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 14:25:49,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:25:49,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:25:49,529 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-15 14:25:49,543 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-15 14:25:49,640 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 14:25:49,641 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:25:49,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 64 conjunts are in the unsatisfiable core [2022-03-15 14:25:49,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:25:51,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:25:51,666 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 18 treesize of output 20 [2022-03-15 14:25:52,006 INFO L353 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-03-15 14:25:52,006 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-15 14:25:52,669 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:25:52,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:25:54,036 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:25:54,036 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 87 treesize of output 87 [2022-03-15 14:25:54,040 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 66 treesize of output 60 [2022-03-15 14:26:01,354 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:26:01,355 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613905722] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:26:01,355 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:26:01,355 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 38, 37] total 103 [2022-03-15 14:26:01,355 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243601038] [2022-03-15 14:26:01,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:26:01,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2022-03-15 14:26:01,358 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:26:01,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2022-03-15 14:26:01,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=771, Invalid=9717, Unknown=18, NotChecked=0, Total=10506 [2022-03-15 14:26:01,360 INFO L87 Difference]: Start difference. First operand 3589 states and 9574 transitions. Second operand has 103 states, 103 states have (on average 3.29126213592233) internal successors, (339), 103 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:26:16,255 WARN L228 SmtUtils]: Spent 6.26s on a formula simplification. DAG size of input: 89 DAG size of output: 85 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 14:26:30,462 WARN L228 SmtUtils]: Spent 5.32s on a formula simplification. DAG size of input: 73 DAG size of output: 69 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 14:26:56,033 WARN L228 SmtUtils]: Spent 18.19s on a formula simplification. DAG size of input: 95 DAG size of output: 75 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 14:27:01,998 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse11 (mod (+ c_~C~0 c_~y~0) 4294967296))) (let ((.cse5 (<= c_~y~0 c_~x~0)) (.cse6 (<= c_~s~0 c_~N~0)) (.cse7 (<= c_~x~0 c_~y~0)) (.cse2 (= c_~s~0 c_~N~0)) (.cse10 (mod (+ c_~C~0 c_~x~0) 4294967296)) (.cse9 (not (= |c_thread2Thread1of1ForFork1_~j~0#1| 0))) (.cse8 (<= (* c_~n~0 4) (+ c_~q~0.offset 3 (* 4 c_~q_back~0)))) (.cse1 (= .cse11 (mod c_~x~0 4294967296))) (.cse4 (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0)) (.cse0 (not (<= 0 c_~q_back~0))) (.cse3 (not (< c_~q_back~0 c_~n~0)))) (and (= c_~y~0 0) (or .cse0 (and .cse1 .cse2) .cse3 .cse4) (or (and (<= |c_thread1Thread1of1ForFork0_~i~0#1| 1) (<= 1 c_~N~0) (<= c_~x~0 c_~C~0) (<= c_~C~0 c_~x~0)) (not (= (+ (- 1) |c_thread2Thread1of1ForFork1_~j~0#1|) 0))) (or (and (<= c_~N~0 c_~s~0) .cse5 .cse6 .cse7) .cse8) (or .cse8 (and .cse5 .cse6 (<= |c_thread1Thread1of1ForFork0_~i~0#1| c_~s~0) .cse7)) (or .cse9 (and .cse2 (= (mod c_~y~0 4294967296) .cse10))) (= c_~s~0 0) (or (and .cse2 (= .cse11 .cse10)) .cse9) (or (= |c_thread2Thread1of1ForFork1_~j~0#1| 1) .cse8) (or .cse0 .cse3 (and .cse1 (= (+ c_~s~0 (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))) c_~N~0)) .cse4) (= c_~q~0.offset 0) (or .cse0 (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) .cse3 (and (forall ((aux_mod_aux_mod_~C~0_30_61 Int) (aux_div_aux_mod_~C~0_30_61 Int)) (let ((.cse14 (* aux_div_aux_mod_~C~0_30_61 4294967296))) (let ((.cse13 (+ .cse14 aux_mod_aux_mod_~C~0_30_61)) (.cse12 (* 4294967295 c_~x~0))) (or (<= (+ .cse12 c_~y~0 4294967296) .cse13) (= (+ (* (- 1) c_~y~0) .cse14 (* c_~x~0 (- 4294967295)) aux_mod_aux_mod_~C~0_30_61) aux_mod_aux_mod_~C~0_30_61) (>= aux_mod_aux_mod_~C~0_30_61 4294967296) (< .cse13 (+ .cse12 c_~y~0)) (> 0 aux_mod_aux_mod_~C~0_30_61))))) (forall ((v_ArrVal_345 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_345) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))))))))) is different from false [2022-03-15 14:27:03,367 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (<= c_~x~0 c_~C~0)) (.cse0 (<= c_~y~0 c_~x~0)) (.cse1 (<= c_~s~0 c_~N~0)) (.cse2 (<= c_~x~0 c_~y~0)) (.cse6 (<= c_~C~0 c_~x~0)) (.cse8 (= c_~s~0 c_~N~0)) (.cse9 (mod (+ c_~C~0 c_~x~0) 4294967296)) (.cse7 (not (= |c_thread2Thread1of1ForFork1_~j~0#1| 0))) (.cse3 (<= (* c_~n~0 4) (+ c_~q~0.offset 3 (* 4 c_~q_back~0)))) (.cse10 (mod (+ c_~C~0 c_~y~0) 4294967296)) (.cse12 (not (<= 0 c_~q_back~0))) (.cse13 (not (< c_~q_back~0 c_~n~0)))) (and (= c_~y~0 0) (<= |c_thread1Thread1of1ForFork0_~i~0#1| 1) (or (and (<= c_~N~0 c_~s~0) .cse0 .cse1 .cse2) .cse3) (or (let ((.cse4 (+ c_~s~0 1))) (and (<= .cse4 (+ c_~N~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) (<= (+ |c_thread2Thread1of1ForFork1_~j~0#1| |c_thread1Thread1of1ForFork0_~i~0#1|) .cse4) .cse5 .cse6)) (not (= (+ (- 1) |c_thread2Thread1of1ForFork1_~j~0#1|) 0))) (<= 1 c_~N~0) .cse5 (or .cse3 (and .cse0 .cse1 (<= |c_thread1Thread1of1ForFork0_~i~0#1| c_~s~0) .cse2)) .cse6 (or .cse7 (and .cse8 (= (mod c_~y~0 4294967296) .cse9))) (or (and .cse8 (= .cse10 .cse9)) .cse7) (or (= |c_thread2Thread1of1ForFork1_~j~0#1| 1) .cse3) (or .cse3 (let ((.cse11 (+ (* c_~q_front~0 4) c_~q~0.offset))) (and (<= .cse11 0) (<= 0 c_~q_front~0) (= (select (select |c_#memory_int| c_~q~0.base) .cse11) 1)))) (= c_~q~0.offset 0) (or .cse12 .cse13 (and (= c_~N~0 (+ c_~s~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) (= .cse10 (mod c_~x~0 4294967296))) (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0)) (or .cse12 (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) .cse13 (and (forall ((aux_mod_aux_mod_~C~0_30_61 Int) (aux_div_aux_mod_~C~0_30_61 Int)) (let ((.cse16 (* aux_div_aux_mod_~C~0_30_61 4294967296))) (let ((.cse15 (+ .cse16 aux_mod_aux_mod_~C~0_30_61)) (.cse14 (* 4294967295 c_~x~0))) (or (<= (+ .cse14 c_~y~0 4294967296) .cse15) (= (+ (* (- 1) c_~y~0) .cse16 (* c_~x~0 (- 4294967295)) aux_mod_aux_mod_~C~0_30_61) aux_mod_aux_mod_~C~0_30_61) (>= aux_mod_aux_mod_~C~0_30_61 4294967296) (< .cse15 (+ .cse14 c_~y~0)) (> 0 aux_mod_aux_mod_~C~0_30_61))))) (forall ((v_ArrVal_345 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_345) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)))))))) is different from false [2022-03-15 14:27:03,869 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (mod (+ c_~C~0 c_~y~0) 4294967296)) (.cse11 (+ (* c_~q_front~0 4) c_~q~0.offset))) (let ((.cse5 (<= c_~x~0 c_~C~0)) (.cse0 (<= c_~y~0 c_~x~0)) (.cse1 (<= c_~s~0 c_~N~0)) (.cse2 (<= c_~x~0 c_~y~0)) (.cse6 (<= c_~C~0 c_~x~0)) (.cse8 (= c_~s~0 c_~N~0)) (.cse9 (mod (+ c_~C~0 c_~x~0) 4294967296)) (.cse7 (not (= |c_thread2Thread1of1ForFork1_~j~0#1| 0))) (.cse3 (<= (* c_~n~0 4) (+ c_~q~0.offset 3 (* 4 c_~q_back~0)))) (.cse12 (select (select |c_#memory_int| c_~q~0.base) .cse11)) (.cse15 (= .cse10 (mod c_~x~0 4294967296))) (.cse16 (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0)) (.cse13 (not (<= 0 c_~q_back~0))) (.cse14 (not (< c_~q_back~0 c_~n~0)))) (and (= c_~y~0 0) (<= |c_thread1Thread1of1ForFork0_~i~0#1| 1) (or (and (<= c_~N~0 c_~s~0) .cse0 .cse1 .cse2) .cse3) (or (let ((.cse4 (+ c_~s~0 1))) (and (<= .cse4 (+ c_~N~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) (<= (+ |c_thread2Thread1of1ForFork1_~j~0#1| |c_thread1Thread1of1ForFork0_~i~0#1|) .cse4) .cse5 .cse6)) (not (= (+ (- 1) |c_thread2Thread1of1ForFork1_~j~0#1|) 0))) (<= 1 c_~N~0) .cse5 (or .cse3 (and .cse0 .cse1 (<= |c_thread1Thread1of1ForFork0_~i~0#1| c_~s~0) .cse2)) .cse6 (or .cse7 (and .cse8 (= (mod c_~y~0 4294967296) .cse9))) (or (and .cse8 (= .cse10 .cse9)) .cse7) (or (= |c_thread2Thread1of1ForFork1_~j~0#1| 1) .cse3) (or .cse3 (and (<= .cse11 0) (<= 0 c_~q_front~0) (= .cse12 1))) (or .cse13 .cse14 (and .cse15 (= (+ c_~s~0 .cse12) c_~N~0)) .cse16) (= c_~q~0.offset 0) (or .cse13 .cse14 (and (= c_~N~0 (+ c_~s~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) .cse15) .cse16) (or .cse13 (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) .cse14 (and (forall ((aux_mod_aux_mod_~C~0_30_61 Int) (aux_div_aux_mod_~C~0_30_61 Int)) (let ((.cse19 (* aux_div_aux_mod_~C~0_30_61 4294967296))) (let ((.cse18 (+ .cse19 aux_mod_aux_mod_~C~0_30_61)) (.cse17 (* 4294967295 c_~x~0))) (or (<= (+ .cse17 c_~y~0 4294967296) .cse18) (= (+ (* (- 1) c_~y~0) .cse19 (* c_~x~0 (- 4294967295)) aux_mod_aux_mod_~C~0_30_61) aux_mod_aux_mod_~C~0_30_61) (>= aux_mod_aux_mod_~C~0_30_61 4294967296) (< .cse18 (+ .cse17 c_~y~0)) (> 0 aux_mod_aux_mod_~C~0_30_61))))) (forall ((v_ArrVal_345 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_345) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))))))))) is different from false [2022-03-15 14:27:05,766 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (mod (+ c_~C~0 c_~y~0) 4294967296))) (let ((.cse8 (= c_~s~0 c_~N~0)) (.cse9 (mod (+ c_~C~0 c_~x~0) 4294967296)) (.cse7 (not (= |c_thread2Thread1of1ForFork1_~j~0#1| 0))) (.cse2 (<= (* c_~n~0 4) (+ c_~q~0.offset 3 (* 4 c_~q_back~0)))) (.cse0 (<= c_~y~0 c_~x~0)) (.cse1 (<= c_~x~0 c_~y~0)) (.cse4 (= .cse10 (mod c_~x~0 4294967296))) (.cse6 (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0)) (.cse3 (not (<= 0 c_~q_back~0))) (.cse5 (not (< c_~q_back~0 c_~n~0)))) (and (or (and (<= c_~N~0 c_~s~0) .cse0 (<= c_~s~0 c_~N~0) .cse1) .cse2) (or .cse3 (and .cse4 (= c_~N~0 (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)))) .cse5 .cse6) (or .cse7 (and .cse8 (= (mod c_~y~0 4294967296) .cse9))) (or (and .cse8 (= .cse10 .cse9)) .cse7) (or (= |c_thread2Thread1of1ForFork1_~j~0#1| 1) .cse2) (or (let ((.cse11 (+ c_~s~0 1))) (and (<= .cse11 (+ c_~N~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) .cse0 (<= (+ |c_thread2Thread1of1ForFork1_~j~0#1| |c_thread1Thread1of1ForFork0_~i~0#1|) .cse11) .cse1)) (not (= (+ (- 1) |c_thread2Thread1of1ForFork1_~j~0#1|) 0))) (= c_~q~0.offset 0) (or .cse3 .cse5 (and (= c_~N~0 (+ c_~s~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) .cse4) .cse6) (or .cse3 (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) .cse5 (and (forall ((aux_mod_aux_mod_~C~0_30_61 Int) (aux_div_aux_mod_~C~0_30_61 Int)) (let ((.cse14 (* aux_div_aux_mod_~C~0_30_61 4294967296))) (let ((.cse13 (+ .cse14 aux_mod_aux_mod_~C~0_30_61)) (.cse12 (* 4294967295 c_~x~0))) (or (<= (+ .cse12 c_~y~0 4294967296) .cse13) (= (+ (* (- 1) c_~y~0) .cse14 (* c_~x~0 (- 4294967295)) aux_mod_aux_mod_~C~0_30_61) aux_mod_aux_mod_~C~0_30_61) (>= aux_mod_aux_mod_~C~0_30_61 4294967296) (< .cse13 (+ .cse12 c_~y~0)) (> 0 aux_mod_aux_mod_~C~0_30_61))))) (forall ((v_ArrVal_345 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_345) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))))))))) is different from false [2022-03-15 14:27:08,301 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (<= c_~y~0 c_~x~0)) (.cse6 (<= c_~s~0 c_~N~0)) (.cse5 (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))) (.cse1 (not (<= 0 c_~q_back~0))) (.cse2 (= (mod (+ c_~C~0 c_~y~0) 4294967296) (mod c_~x~0 4294967296))) (.cse3 (not (< c_~q_back~0 c_~n~0))) (.cse4 (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0)) (.cse7 (<= c_~x~0 c_~y~0))) (and (<= c_~N~0 c_~s~0) .cse0 (or .cse1 (and .cse2 (= c_~s~0 c_~N~0)) .cse3 .cse4) (or .cse1 (and .cse2 (= c_~N~0 .cse5)) .cse3 .cse4) (= c_~s~0 1) .cse6 (= c_~C~0 c_~x~0) (<= c_~N~0 1) (or (<= (* c_~n~0 4) (+ c_~q~0.offset 3 (* 4 c_~q_back~0))) (and .cse0 .cse6 (<= |c_thread1Thread1of1ForFork0_~i~0#1| c_~s~0) .cse7)) (< 0 c_~N~0) (or .cse1 .cse3 (and .cse2 (= (+ c_~s~0 .cse5) c_~N~0)) .cse4) (= c_~q~0.offset 0) (or .cse1 .cse3 (and (= c_~N~0 (+ c_~s~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) .cse2) .cse4) (= c_~C~0 c_~y~0) (or .cse1 (and .cse2 (forall ((v_ArrVal_345 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_345) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))))) .cse3 .cse4) .cse7)) is different from false [2022-03-15 14:27:09,823 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= c_~s~0 c_~N~0)) (.cse2 (mod (+ c_~C~0 c_~x~0) 4294967296)) (.cse0 (not (= |c_thread2Thread1of1ForFork1_~j~0#1| 0))) (.cse3 (mod (+ c_~C~0 c_~y~0) 4294967296))) (and (or .cse0 (and .cse1 (= (mod c_~y~0 4294967296) .cse2))) (or (and .cse1 (= .cse3 .cse2)) .cse0) (or (not (<= 0 c_~q_back~0)) (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) (and (= .cse3 (mod c_~x~0 4294967296)) (forall ((v_ArrVal_345 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_345) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))))) (not (< c_~q_back~0 c_~n~0))))) is different from false [2022-03-15 14:27:10,760 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= c_~s~0 c_~N~0)) (.cse2 (mod (+ c_~C~0 c_~x~0) 4294967296)) (.cse0 (not (= |c_thread2Thread1of1ForFork1_~j~0#1| 0))) (.cse3 (mod (+ c_~C~0 c_~y~0) 4294967296))) (and (or .cse0 (and .cse1 (= (mod c_~y~0 4294967296) .cse2))) (or (and .cse1 (= .cse3 .cse2)) .cse0) (or (not (<= 0 c_~q_back~0)) (and (= .cse3 (mod c_~x~0 4294967296)) (forall ((v_ArrVal_345 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_345) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))))) (not (< c_~q_back~0 c_~n~0)) (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0)))) is different from false [2022-03-15 14:27:25,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:27:25,049 INFO L93 Difference]: Finished difference Result 7636 states and 20144 transitions. [2022-03-15 14:27:25,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2022-03-15 14:27:25,049 INFO L78 Accepts]: Start accepts. Automaton has has 103 states, 103 states have (on average 3.29126213592233) internal successors, (339), 103 states have internal predecessors, (339), 0 states have call successors, (0), 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 133 [2022-03-15 14:27:25,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:27:25,061 INFO L225 Difference]: With dead ends: 7636 [2022-03-15 14:27:25,062 INFO L226 Difference]: Without dead ends: 7383 [2022-03-15 14:27:25,064 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 511 GetRequests, 230 SyntacticMatches, 43 SemanticMatches, 238 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 22684 ImplicationChecksByTransitivity, 87.3s TimeCoverageRelationStatistics Valid=4163, Invalid=49802, Unknown=119, NotChecked=3276, Total=57360 [2022-03-15 14:27:25,065 INFO L933 BasicCegarLoop]: 271 mSDtfsCounter, 2474 mSDsluCounter, 11881 mSDsCounter, 0 mSdLazyCounter, 2885 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2474 SdHoareTripleChecker+Valid, 11499 SdHoareTripleChecker+Invalid, 9266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 2885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6149 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-03-15 14:27:25,065 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2474 Valid, 11499 Invalid, 9266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 2885 Invalid, 0 Unknown, 6149 Unchecked, 4.1s Time] [2022-03-15 14:27:25,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7383 states. [2022-03-15 14:27:25,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7383 to 3563. [2022-03-15 14:27:25,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3563 states, 3562 states have (on average 2.671813587871982) internal successors, (9517), 3562 states have internal predecessors, (9517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:27:25,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3563 states to 3563 states and 9517 transitions. [2022-03-15 14:27:25,129 INFO L78 Accepts]: Start accepts. Automaton has 3563 states and 9517 transitions. Word has length 133 [2022-03-15 14:27:25,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:27:25,130 INFO L470 AbstractCegarLoop]: Abstraction has 3563 states and 9517 transitions. [2022-03-15 14:27:25,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 3.29126213592233) internal successors, (339), 103 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:27:25,130 INFO L276 IsEmpty]: Start isEmpty. Operand 3563 states and 9517 transitions. [2022-03-15 14:27:25,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-03-15 14:27:25,136 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:27:25,136 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 14:27:25,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-03-15 14:27:25,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:27:25,352 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 14:27:25,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:27:25,352 INFO L85 PathProgramCache]: Analyzing trace with hash 545084568, now seen corresponding path program 4 times [2022-03-15 14:27:25,353 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:27:25,353 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382785784] [2022-03-15 14:27:25,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:27:25,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:27:25,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:27:26,738 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:27:26,739 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:27:26,739 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382785784] [2022-03-15 14:27:26,739 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382785784] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:27:26,740 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455595929] [2022-03-15 14:27:26,740 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 14:27:26,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:27:26,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:27:26,741 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-15 14:27:26,742 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-15 14:27:26,842 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 14:27:26,842 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:27:26,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 64 conjunts are in the unsatisfiable core [2022-03-15 14:27:26,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:27:28,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:27:28,710 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 18 treesize of output 20 [2022-03-15 14:27:29,058 INFO L353 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-03-15 14:27:29,059 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-15 14:27:29,868 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:27:29,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:27:31,144 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:27:31,144 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 87 treesize of output 87 [2022-03-15 14:27:31,148 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 66 treesize of output 60 [2022-03-15 14:27:37,426 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:27:37,426 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455595929] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:27:37,426 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:27:37,426 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 38, 37] total 103 [2022-03-15 14:27:37,426 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099179070] [2022-03-15 14:27:37,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:27:37,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2022-03-15 14:27:37,428 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:27:37,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2022-03-15 14:27:37,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=772, Invalid=9720, Unknown=14, NotChecked=0, Total=10506 [2022-03-15 14:27:37,429 INFO L87 Difference]: Start difference. First operand 3563 states and 9517 transitions. Second operand has 103 states, 103 states have (on average 3.29126213592233) internal successors, (339), 103 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:28:02,670 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (= c_~s~0 c_~N~0)) (.cse9 (mod c_~x~0 4294967296))) (let ((.cse3 (and .cse8 (= .cse9 (mod c_~y~0 4294967296)))) (.cse6 (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))) (.cse7 (not (= |c_thread2Thread1of1ForFork1_~j~0#1| 0))) (.cse0 (not (<= 0 c_~q_back~0))) (.cse1 (not (< c_~q_back~0 c_~n~0))) (.cse2 (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0)) (.cse5 (= (mod (+ c_~C~0 c_~y~0) 4294967296) .cse9))) (and (or .cse0 .cse1 .cse2 .cse3) (= c_~y~0 0) (<= |c_thread1Thread1of1ForFork0_~i~0#1| 1) (or (let ((.cse4 (+ c_~s~0 1))) (and (<= .cse4 (+ c_~N~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) (<= (+ |c_thread2Thread1of1ForFork1_~j~0#1| |c_thread1Thread1of1ForFork0_~i~0#1|) .cse4))) (not (= (+ (- 1) |c_thread2Thread1of1ForFork1_~j~0#1|) 0))) (or .cse0 (and .cse5 (= c_~N~0 .cse6)) .cse1 .cse2) (= c_~s~0 1) (= c_~C~0 c_~x~0) (<= c_~x~0 c_~C~0) (<= c_~C~0 c_~x~0) (or (= |c_thread2Thread1of1ForFork1_~j~0#1| 1) (<= (* c_~n~0 4) (+ c_~q~0.offset 3 (* 4 c_~q_back~0)))) (or .cse7 .cse3) (< 0 c_~N~0) (< 0 c_~n~0) (or .cse0 .cse1 (and .cse5 (= (+ c_~s~0 .cse6) c_~N~0)) .cse2) (= c_~q~0.offset 0) (or .cse0 .cse1 (and (= c_~N~0 (+ c_~s~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) .cse5) .cse2) (<= 1 c_~q_back~0) (or (and .cse5 .cse8) .cse7) (<= c_~n~0 2) (or .cse0 .cse1 .cse2 (and .cse5 (forall ((v_ArrVal_374 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_374) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))))))))) is different from false [2022-03-15 14:28:08,655 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (mod c_~x~0 4294967296))) (let ((.cse5 (= (mod (+ c_~C~0 c_~y~0) 4294967296) .cse10)) (.cse9 (= c_~s~0 c_~N~0))) (let ((.cse7 (and .cse9 (= .cse10 (mod c_~y~0 4294967296)))) (.cse6 (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))) (.cse1 (and .cse5 .cse9)) (.cse8 (not (= |c_thread2Thread1of1ForFork1_~j~0#1| 0))) (.cse0 (not (<= 0 c_~q_back~0))) (.cse2 (not (< c_~q_back~0 c_~n~0))) (.cse3 (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0))) (and (<= c_~y~0 c_~x~0) (or .cse0 .cse1 .cse2 .cse3) (or (let ((.cse4 (+ c_~s~0 1))) (and (<= .cse4 (+ c_~N~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) (<= (+ |c_thread2Thread1of1ForFork1_~j~0#1| |c_thread1Thread1of1ForFork0_~i~0#1|) .cse4))) (not (= (+ (- 1) |c_thread2Thread1of1ForFork1_~j~0#1|) 0))) (or .cse0 (and .cse5 (= c_~N~0 .cse6)) .cse2 .cse3) (or (= |c_thread2Thread1of1ForFork1_~j~0#1| 1) (<= (* c_~n~0 4) (+ c_~q~0.offset 3 (* 4 c_~q_back~0)))) (or .cse0 .cse2 .cse7) (or .cse8 .cse7) (or .cse0 .cse2 (and .cse5 (= (+ c_~s~0 .cse6) c_~N~0)) .cse3) (= c_~q~0.offset 0) (or .cse0 .cse2 (and (= c_~N~0 (+ c_~s~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) .cse5) .cse3) (or .cse1 .cse8) (or .cse0 .cse2 .cse3 (and .cse5 (forall ((v_ArrVal_374 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_374) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)))))) (<= c_~x~0 c_~y~0))))) is different from false [2022-03-15 14:28:08,684 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse14 (mod c_~x~0 4294967296))) (let ((.cse5 (= (mod (+ c_~C~0 c_~y~0) 4294967296) .cse14)) (.cse13 (= c_~s~0 c_~N~0))) (let ((.cse11 (<= (* c_~n~0 4) (+ c_~q~0.offset 3 (* 4 c_~q_back~0)))) (.cse6 (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))) (.cse1 (and .cse5 .cse13)) (.cse12 (not (= |c_thread2Thread1of1ForFork1_~j~0#1| 0))) (.cse0 (not (<= 0 c_~q_back~0))) (.cse2 (not (< c_~q_back~0 c_~n~0))) (.cse3 (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0)) (.cse7 (forall ((v_ArrVal_374 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_374) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)))))) (and (<= c_~y~0 c_~x~0) (or .cse0 .cse1 .cse2 .cse3) (or (let ((.cse4 (+ c_~s~0 1))) (and (<= .cse4 (+ c_~N~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) (<= (+ |c_thread2Thread1of1ForFork1_~j~0#1| |c_thread1Thread1of1ForFork0_~i~0#1|) .cse4))) (not (= (+ (- 1) |c_thread2Thread1of1ForFork1_~j~0#1|) 0))) (or .cse0 (and .cse5 (= c_~N~0 .cse6)) .cse2 .cse3) (or (and .cse7 (forall ((aux_mod_aux_mod_~C~0_30_61 Int) (aux_div_aux_mod_~C~0_30_61 Int)) (let ((.cse10 (* aux_div_aux_mod_~C~0_30_61 4294967296))) (let ((.cse9 (+ .cse10 aux_mod_aux_mod_~C~0_30_61)) (.cse8 (* 4294967295 c_~x~0))) (or (<= (+ .cse8 c_~y~0 4294967296) .cse9) (= (+ (* (- 1) c_~y~0) .cse10 (* c_~x~0 (- 4294967295)) aux_mod_aux_mod_~C~0_30_61) aux_mod_aux_mod_~C~0_30_61) (>= aux_mod_aux_mod_~C~0_30_61 4294967296) (< .cse9 (+ .cse8 c_~y~0)) (> 0 aux_mod_aux_mod_~C~0_30_61)))))) .cse0 (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) .cse2) (or .cse11 (and (<= c_~N~0 c_~s~0) (<= c_~s~0 c_~N~0))) (or (= |c_thread2Thread1of1ForFork1_~j~0#1| 1) .cse11) (or .cse12 (and .cse13 (= .cse14 (mod c_~y~0 4294967296)))) (or .cse0 .cse2 (and .cse5 (= (+ c_~s~0 .cse6) c_~N~0)) .cse3) (= c_~q~0.offset 0) (or .cse0 .cse2 (and (= c_~N~0 (+ c_~s~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) .cse5) .cse3) (or .cse1 .cse12) (or .cse0 .cse2 .cse3 (and .cse5 .cse7)) (<= c_~x~0 c_~y~0))))) is different from false [2022-03-15 14:28:09,209 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (<= c_~s~0 c_~N~0)) (.cse4 (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))) (.cse0 (not (<= 0 c_~q_back~0))) (.cse2 (not (< c_~q_back~0 c_~n~0))) (.cse3 (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0)) (.cse1 (= (mod (+ c_~C~0 c_~y~0) 4294967296) (mod c_~x~0 4294967296)))) (and (<= c_~N~0 c_~s~0) (<= c_~y~0 c_~x~0) (or .cse0 (and .cse1 (= c_~s~0 c_~N~0)) .cse2 .cse3) (or .cse0 (and .cse1 (= c_~N~0 .cse4)) .cse2 .cse3) (= c_~s~0 1) .cse5 (= c_~C~0 c_~x~0) (<= c_~N~0 1) (or (and .cse5 (<= |c_thread1Thread1of1ForFork0_~i~0#1| c_~s~0)) (<= (* c_~n~0 4) (+ c_~q~0.offset 3 (* 4 c_~q_back~0)))) (< 0 c_~N~0) (or .cse0 .cse2 (and .cse1 (= (+ c_~s~0 .cse4) c_~N~0)) .cse3) (= c_~q~0.offset 0) (or .cse0 .cse2 (and (= c_~N~0 (+ c_~s~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) .cse1) .cse3) (= c_~C~0 c_~y~0) (or .cse0 .cse2 .cse3 (and .cse1 (forall ((v_ArrVal_374 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_374) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)))))) (<= c_~x~0 c_~y~0))) is different from false [2022-03-15 14:28:10,708 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse9 (mod c_~x~0 4294967296))) (let ((.cse5 (= (mod (+ c_~C~0 c_~y~0) 4294967296) .cse9)) (.cse8 (= c_~s~0 c_~N~0))) (let ((.cse6 (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))) (.cse1 (and .cse5 .cse8)) (.cse7 (not (= |c_thread2Thread1of1ForFork1_~j~0#1| 0))) (.cse0 (not (<= 0 c_~q_back~0))) (.cse2 (not (< c_~q_back~0 c_~n~0))) (.cse3 (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0))) (and (<= c_~y~0 c_~x~0) (or .cse0 .cse1 .cse2 .cse3) (or (let ((.cse4 (+ c_~s~0 1))) (and (<= .cse4 (+ c_~N~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) (<= (+ |c_thread2Thread1of1ForFork1_~j~0#1| |c_thread1Thread1of1ForFork0_~i~0#1|) .cse4))) (not (= (+ (- 1) |c_thread2Thread1of1ForFork1_~j~0#1|) 0))) (or .cse0 (and .cse5 (= c_~N~0 .cse6)) .cse2 .cse3) (or (= |c_thread2Thread1of1ForFork1_~j~0#1| 1) (<= (* c_~n~0 4) (+ c_~q~0.offset 3 (* 4 c_~q_back~0)))) (or .cse7 (and .cse8 (= .cse9 (mod c_~y~0 4294967296)))) (or .cse0 .cse2 (and .cse5 (= (+ c_~s~0 .cse6) c_~N~0)) .cse3) (= c_~q~0.offset 0) (or .cse0 .cse2 (and (= c_~N~0 (+ c_~s~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) .cse5) .cse3) (or .cse1 .cse7) (or .cse0 .cse2 .cse3 (and .cse5 (forall ((v_ArrVal_374 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_374) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)))))) (<= c_~x~0 c_~y~0))))) is different from false [2022-03-15 14:28:11,823 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (mod c_~x~0 4294967296))) (let ((.cse5 (= (mod (+ c_~C~0 c_~y~0) 4294967296) .cse10)) (.cse9 (= c_~s~0 c_~N~0))) (let ((.cse7 (<= (* c_~n~0 4) (+ c_~q~0.offset 3 (* 4 c_~q_back~0)))) (.cse6 (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))) (.cse1 (and .cse5 .cse9)) (.cse8 (not (= |c_thread2Thread1of1ForFork1_~j~0#1| 0))) (.cse0 (not (<= 0 c_~q_back~0))) (.cse2 (not (< c_~q_back~0 c_~n~0))) (.cse3 (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0))) (and (<= c_~y~0 c_~x~0) (or .cse0 .cse1 .cse2 .cse3) (or (let ((.cse4 (+ c_~s~0 1))) (and (<= .cse4 (+ c_~N~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) (<= (+ |c_thread2Thread1of1ForFork1_~j~0#1| |c_thread1Thread1of1ForFork0_~i~0#1|) .cse4))) (not (= (+ (- 1) |c_thread2Thread1of1ForFork1_~j~0#1|) 0))) (or .cse0 (and .cse5 (= c_~N~0 .cse6)) .cse2 .cse3) (or .cse7 (and (<= c_~N~0 c_~s~0) (<= c_~s~0 c_~N~0))) (or (= |c_thread2Thread1of1ForFork1_~j~0#1| 1) .cse7) (or .cse8 (and .cse9 (= .cse10 (mod c_~y~0 4294967296)))) (or .cse0 .cse2 (and .cse5 (= (+ c_~s~0 .cse6) c_~N~0)) .cse3) (= c_~q~0.offset 0) (or .cse0 .cse2 (and (= c_~N~0 (+ c_~s~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) .cse5) .cse3) (or .cse1 .cse8) (or .cse0 .cse2 .cse3 (and .cse5 (forall ((v_ArrVal_374 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_374) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)))))) (<= c_~x~0 c_~y~0))))) is different from false [2022-03-15 14:28:43,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:28:43,242 INFO L93 Difference]: Finished difference Result 8448 states and 21706 transitions. [2022-03-15 14:28:43,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 205 states. [2022-03-15 14:28:43,242 INFO L78 Accepts]: Start accepts. Automaton has has 103 states, 103 states have (on average 3.29126213592233) internal successors, (339), 103 states have internal predecessors, (339), 0 states have call successors, (0), 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 133 [2022-03-15 14:28:43,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:28:43,252 INFO L225 Difference]: With dead ends: 8448 [2022-03-15 14:28:43,252 INFO L226 Difference]: Without dead ends: 7650 [2022-03-15 14:28:43,256 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 232 SyntacticMatches, 36 SemanticMatches, 269 ConstructedPredicates, 6 IntricatePredicates, 2 DeprecatedPredicates, 28632 ImplicationChecksByTransitivity, 70.1s TimeCoverageRelationStatistics Valid=4997, Invalid=64866, Unknown=121, NotChecked=3186, Total=73170 [2022-03-15 14:28:43,261 INFO L933 BasicCegarLoop]: 278 mSDtfsCounter, 2678 mSDsluCounter, 12698 mSDsCounter, 0 mSdLazyCounter, 3202 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2678 SdHoareTripleChecker+Valid, 12204 SdHoareTripleChecker+Invalid, 8410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 3202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4954 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-15 14:28:43,261 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2678 Valid, 12204 Invalid, 8410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 3202 Invalid, 0 Unknown, 4954 Unchecked, 2.3s Time] [2022-03-15 14:28:43,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7650 states. [2022-03-15 14:28:43,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7650 to 3695. [2022-03-15 14:28:43,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3695 states, 3694 states have (on average 2.652950730914997) internal successors, (9800), 3694 states have internal predecessors, (9800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:28:43,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3695 states to 3695 states and 9800 transitions. [2022-03-15 14:28:43,353 INFO L78 Accepts]: Start accepts. Automaton has 3695 states and 9800 transitions. Word has length 133 [2022-03-15 14:28:43,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:28:43,354 INFO L470 AbstractCegarLoop]: Abstraction has 3695 states and 9800 transitions. [2022-03-15 14:28:43,354 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 3.29126213592233) internal successors, (339), 103 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:28:43,354 INFO L276 IsEmpty]: Start isEmpty. Operand 3695 states and 9800 transitions. [2022-03-15 14:28:43,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-03-15 14:28:43,360 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:28:43,360 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 14:28:43,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-15 14:28:43,564 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:28:43,564 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 14:28:43,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:28:43,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1945316896, now seen corresponding path program 5 times [2022-03-15 14:28:43,565 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:28:43,565 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375976353] [2022-03-15 14:28:43,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:28:43,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:28:43,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:28:45,346 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:28:45,346 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:28:45,346 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375976353] [2022-03-15 14:28:45,347 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375976353] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:28:45,347 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864292099] [2022-03-15 14:28:45,347 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 14:28:45,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:28:45,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:28:45,348 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-15 14:28:45,350 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-15 14:28:45,511 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 14:28:45,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:28:45,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 62 conjunts are in the unsatisfiable core [2022-03-15 14:28:45,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:28:45,592 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-15 14:28:45,856 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-15 14:28:45,857 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-15 14:28:46,716 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 18 treesize of output 20 [2022-03-15 14:28:46,959 INFO L353 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-03-15 14:28:46,959 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 24 treesize of output 10 [2022-03-15 14:28:47,653 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 14:28:47,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:28:49,044 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:28:49,045 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 116 treesize of output 108 [2022-03-15 14:28:49,048 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 80 treesize of output 68 [2022-03-15 14:28:51,043 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-15 14:28:51,207 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 14:28:51,208 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864292099] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:28:51,208 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:28:51,208 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 30, 29] total 91 [2022-03-15 14:28:51,208 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794006710] [2022-03-15 14:28:51,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:28:51,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2022-03-15 14:28:51,208 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:28:51,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2022-03-15 14:28:51,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=641, Invalid=7542, Unknown=7, NotChecked=0, Total=8190 [2022-03-15 14:28:51,209 INFO L87 Difference]: Start difference. First operand 3695 states and 9800 transitions. Second operand has 91 states, 91 states have (on average 3.7362637362637363) internal successors, (340), 91 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:29:07,378 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 14:29:08,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:29:08,908 INFO L93 Difference]: Finished difference Result 6983 states and 18355 transitions. [2022-03-15 14:29:08,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2022-03-15 14:29:08,909 INFO L78 Accepts]: Start accepts. Automaton has has 91 states, 91 states have (on average 3.7362637362637363) internal successors, (340), 91 states have internal predecessors, (340), 0 states have call successors, (0), 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 133 [2022-03-15 14:29:08,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:29:08,917 INFO L225 Difference]: With dead ends: 6983 [2022-03-15 14:29:08,917 INFO L226 Difference]: Without dead ends: 6440 [2022-03-15 14:29:08,918 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 224 SyntacticMatches, 11 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13813 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=2689, Invalid=34728, Unknown=25, NotChecked=0, Total=37442 [2022-03-15 14:29:08,919 INFO L933 BasicCegarLoop]: 240 mSDtfsCounter, 2260 mSDsluCounter, 8479 mSDsCounter, 0 mSdLazyCounter, 3576 mSolverCounterSat, 131 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2260 SdHoareTripleChecker+Valid, 8087 SdHoareTripleChecker+Invalid, 5862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 3576 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 2154 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-03-15 14:29:08,919 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2260 Valid, 8087 Invalid, 5862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 3576 Invalid, 1 Unknown, 2154 Unchecked, 4.2s Time] [2022-03-15 14:29:08,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6440 states. [2022-03-15 14:29:09,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6440 to 3918. [2022-03-15 14:29:09,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3918 states, 3917 states have (on average 2.6650497829971918) internal successors, (10439), 3917 states have internal predecessors, (10439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:29:09,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3918 states to 3918 states and 10439 transitions. [2022-03-15 14:29:09,033 INFO L78 Accepts]: Start accepts. Automaton has 3918 states and 10439 transitions. Word has length 133 [2022-03-15 14:29:09,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:29:09,034 INFO L470 AbstractCegarLoop]: Abstraction has 3918 states and 10439 transitions. [2022-03-15 14:29:09,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 91 states, 91 states have (on average 3.7362637362637363) internal successors, (340), 91 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:29:09,034 INFO L276 IsEmpty]: Start isEmpty. Operand 3918 states and 10439 transitions. [2022-03-15 14:29:09,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-03-15 14:29:09,042 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:29:09,043 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 14:29:09,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-15 14:29:09,263 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,SelfDestructingSolverStorable22 [2022-03-15 14:29:09,264 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 14:29:09,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:29:09,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1067014600, now seen corresponding path program 6 times [2022-03-15 14:29:09,264 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:29:09,264 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177905200] [2022-03-15 14:29:09,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:29:09,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:29:09,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:29:10,835 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:29:10,835 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:29:10,836 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177905200] [2022-03-15 14:29:10,836 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177905200] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:29:10,840 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175403903] [2022-03-15 14:29:10,840 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 14:29:10,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:29:10,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:29:10,842 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-15 14:29:10,842 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-15 14:29:11,039 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 14:29:11,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:29:11,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 77 conjunts are in the unsatisfiable core [2022-03-15 14:29:11,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:29:13,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:29:13,143 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 18 treesize of output 20 [2022-03-15 14:29:13,492 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 14:29:13,494 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:29:13,494 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 21 treesize of output 10 [2022-03-15 14:29:14,214 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:29:14,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:29:15,516 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:29:15,516 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 61 treesize of output 61 [2022-03-15 14:29:15,519 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 40 treesize of output 34 [2022-03-15 14:29:18,160 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:29:18,161 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175403903] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:29:18,161 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:29:18,161 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 38, 36] total 101 [2022-03-15 14:29:18,161 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729890968] [2022-03-15 14:29:18,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:29:18,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 101 states [2022-03-15 14:29:18,161 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:29:18,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2022-03-15 14:29:18,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=793, Invalid=9294, Unknown=13, NotChecked=0, Total=10100 [2022-03-15 14:29:18,162 INFO L87 Difference]: Start difference. First operand 3918 states and 10439 transitions. Second operand has 101 states, 101 states have (on average 3.2475247524752477) internal successors, (328), 101 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:29:33,637 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~s~0 c_~N~0)) (.cse1 (+ c_~y~0 (* (div c_~y~0 4294967296) (- 4294967296)))) (.cse2 (not (= |c_thread2Thread1of1ForFork1_~j~0#1| 0))) (.cse3 (+ (* (div c_~x~0 4294967296) (- 4294967296)) c_~x~0))) (and (or (and .cse0 (= (+ c_~C~0 c_~x~0 (* (div (+ c_~C~0 c_~x~0) 4294967296) (- 4294967296))) .cse1)) .cse2) (or (and .cse0 (= .cse1 .cse3)) .cse2) (or (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) (< c_~q_back~0 0) (<= c_~n~0 c_~q_back~0) (and (= (+ c_~C~0 c_~y~0 (* (- 4294967296) (div (+ c_~C~0 c_~y~0) 4294967296))) .cse3) (forall ((v_ArrVal_433 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_433) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) c_~N~0)))))) is different from false [2022-03-15 14:29:39,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:29:39,739 INFO L93 Difference]: Finished difference Result 7421 states and 19591 transitions. [2022-03-15 14:29:39,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2022-03-15 14:29:39,739 INFO L78 Accepts]: Start accepts. Automaton has has 101 states, 101 states have (on average 3.2475247524752477) internal successors, (328), 101 states have internal predecessors, (328), 0 states have call successors, (0), 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 133 [2022-03-15 14:29:39,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:29:39,748 INFO L225 Difference]: With dead ends: 7421 [2022-03-15 14:29:39,748 INFO L226 Difference]: Without dead ends: 7289 [2022-03-15 14:29:39,750 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 205 SyntacticMatches, 20 SemanticMatches, 203 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 15524 ImplicationChecksByTransitivity, 22.1s TimeCoverageRelationStatistics Valid=3761, Invalid=37531, Unknown=124, NotChecked=404, Total=41820 [2022-03-15 14:29:39,751 INFO L933 BasicCegarLoop]: 248 mSDtfsCounter, 2936 mSDsluCounter, 10006 mSDsCounter, 0 mSdLazyCounter, 4035 mSolverCounterSat, 379 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2936 SdHoareTripleChecker+Valid, 9421 SdHoareTripleChecker+Invalid, 6942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 379 IncrementalHoareTripleChecker+Valid, 4035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2528 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-03-15 14:29:39,751 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2936 Valid, 9421 Invalid, 6942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [379 Valid, 4035 Invalid, 0 Unknown, 2528 Unchecked, 4.1s Time] [2022-03-15 14:29:39,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7289 states. [2022-03-15 14:29:39,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7289 to 4054. [2022-03-15 14:29:39,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4054 states, 4053 states have (on average 2.6602516654330124) internal successors, (10782), 4053 states have internal predecessors, (10782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:29:39,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4054 states to 4054 states and 10782 transitions. [2022-03-15 14:29:39,834 INFO L78 Accepts]: Start accepts. Automaton has 4054 states and 10782 transitions. Word has length 133 [2022-03-15 14:29:39,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:29:39,834 INFO L470 AbstractCegarLoop]: Abstraction has 4054 states and 10782 transitions. [2022-03-15 14:29:39,834 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 101 states, 101 states have (on average 3.2475247524752477) internal successors, (328), 101 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:29:39,835 INFO L276 IsEmpty]: Start isEmpty. Operand 4054 states and 10782 transitions. [2022-03-15 14:29:39,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-03-15 14:29:39,841 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:29:39,841 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 14:29:39,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-15 14:29:40,058 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,SelfDestructingSolverStorable23 [2022-03-15 14:29:40,059 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 14:29:40,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:29:40,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1926163510, now seen corresponding path program 7 times [2022-03-15 14:29:40,059 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:29:40,059 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34461846] [2022-03-15 14:29:40,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:29:40,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:29:40,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:29:41,516 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:29:41,517 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:29:41,517 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34461846] [2022-03-15 14:29:41,517 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34461846] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:29:41,517 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177170456] [2022-03-15 14:29:41,517 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 14:29:41,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:29:41,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:29:41,518 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:29:41,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-15 14:29:41,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:29:41,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 68 conjunts are in the unsatisfiable core [2022-03-15 14:29:41,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:29:43,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:29:43,459 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 18 treesize of output 20 [2022-03-15 14:29:43,810 INFO L353 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-03-15 14:29:43,811 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-15 14:29:44,396 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:29:44,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:29:45,762 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:29:45,762 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 87 treesize of output 87 [2022-03-15 14:29:45,765 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 66 treesize of output 60 [2022-03-15 14:29:54,001 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:29:54,002 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177170456] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:29:54,002 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:29:54,002 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 38, 37] total 103 [2022-03-15 14:29:54,002 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428010553] [2022-03-15 14:29:54,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:29:54,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2022-03-15 14:29:54,002 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:29:54,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2022-03-15 14:29:54,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=763, Invalid=9732, Unknown=11, NotChecked=0, Total=10506 [2022-03-15 14:29:54,004 INFO L87 Difference]: Start difference. First operand 4054 states and 10782 transitions. Second operand has 103 states, 103 states have (on average 3.29126213592233) internal successors, (339), 103 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:30:09,125 WARN L228 SmtUtils]: Spent 9.65s on a formula simplification that was a NOOP. DAG size: 76 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 14:30:17,745 WARN L228 SmtUtils]: Spent 6.19s on a formula simplification. DAG size of input: 98 DAG size of output: 82 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 14:30:28,001 WARN L228 SmtUtils]: Spent 6.18s on a formula simplification. DAG size of input: 103 DAG size of output: 84 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 14:30:29,882 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse11 (+ (* c_~q_front~0 4) c_~q~0.offset))) (let ((.cse4 (<= (* c_~n~0 4) (+ c_~q~0.offset 3 (* 4 c_~q_back~0)))) (.cse5 (<= .cse11 0)) (.cse6 (<= 0 c_~q_front~0)) (.cse7 (= (select (select |c_#memory_int| c_~q~0.base) .cse11) 1)) (.cse0 (not (<= 0 c_~q_back~0))) (.cse2 (not (< c_~q_back~0 c_~n~0))) (.cse1 (= (mod (+ c_~C~0 c_~y~0) 4294967296) (mod c_~x~0 4294967296))) (.cse3 (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0))) (and (= c_~y~0 0) (or .cse0 (and .cse1 (= c_~s~0 c_~N~0)) .cse2 .cse3) (<= |c_thread1Thread1of1ForFork0_~i~0#1| 1) (or .cse4 (and .cse5 .cse6 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~q~0.base)) .cse7)) (or .cse0 (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) .cse2 (and (forall ((aux_mod_aux_mod_~C~0_30_61 Int) (aux_div_aux_mod_~C~0_30_61 Int)) (let ((.cse10 (* aux_div_aux_mod_~C~0_30_61 4294967296))) (let ((.cse9 (+ .cse10 aux_mod_aux_mod_~C~0_30_61)) (.cse8 (* 4294967295 c_~x~0))) (or (<= (+ .cse8 c_~y~0 4294967296) .cse9) (= (+ (* (- 1) c_~y~0) .cse10 (* c_~x~0 (- 4294967295)) aux_mod_aux_mod_~C~0_30_61) aux_mod_aux_mod_~C~0_30_61) (>= aux_mod_aux_mod_~C~0_30_61 4294967296) (< .cse9 (+ .cse8 c_~y~0)) (> 0 aux_mod_aux_mod_~C~0_30_61))))) (forall ((v_ArrVal_462 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_462) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) c_~N~0)))) (<= 1 c_~N~0) (<= c_~x~0 c_~C~0) (<= c_~C~0 c_~x~0) (= c_~s~0 0) (or .cse4 (and .cse5 .cse6 .cse7)) (= c_~q~0.offset 0) (or .cse0 .cse2 (and (= c_~N~0 (+ c_~s~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) .cse1) .cse3)))) is different from false [2022-03-15 14:30:32,752 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (+ (* c_~q_front~0 4) c_~q~0.offset)) (.cse13 (mod (+ c_~C~0 c_~y~0) 4294967296))) (let ((.cse5 (<= c_~x~0 c_~C~0)) (.cse6 (<= c_~C~0 c_~x~0)) (.cse2 (= c_~s~0 c_~N~0)) (.cse7 (<= (* c_~n~0 4) (+ c_~q~0.offset 3 (* 4 c_~q_back~0)))) (.cse0 (not (<= 0 c_~q_back~0))) (.cse3 (not (< c_~q_back~0 c_~n~0))) (.cse1 (= .cse13 (mod c_~x~0 4294967296))) (.cse9 (select (select |c_#memory_int| c_~q~0.base) .cse8))) (and (= c_~y~0 0) (or .cse0 (and .cse1 .cse2) .cse3) (<= |c_thread1Thread1of1ForFork0_~i~0#1| 1) (or (let ((.cse4 (+ c_~s~0 1))) (and (<= .cse4 (+ c_~N~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) (<= (+ |c_thread2Thread1of1ForFork1_~j~0#1| |c_thread1Thread1of1ForFork0_~i~0#1|) .cse4) .cse5 .cse6)) (not (= (+ (- 1) |c_thread2Thread1of1ForFork1_~j~0#1|) 0))) (= c_~s~0 1) (or .cse7 (and (<= .cse8 0) (<= 0 c_~q_front~0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~q~0.base)) (= .cse9 1))) (or .cse0 (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) .cse3 (and (forall ((aux_mod_aux_mod_~C~0_30_61 Int) (aux_div_aux_mod_~C~0_30_61 Int)) (let ((.cse12 (* aux_div_aux_mod_~C~0_30_61 4294967296))) (let ((.cse11 (+ .cse12 aux_mod_aux_mod_~C~0_30_61)) (.cse10 (* 4294967295 c_~x~0))) (or (<= (+ .cse10 c_~y~0 4294967296) .cse11) (= (+ (* (- 1) c_~y~0) .cse12 (* c_~x~0 (- 4294967295)) aux_mod_aux_mod_~C~0_30_61) aux_mod_aux_mod_~C~0_30_61) (>= aux_mod_aux_mod_~C~0_30_61 4294967296) (< .cse11 (+ .cse10 c_~y~0)) (> 0 aux_mod_aux_mod_~C~0_30_61))))) (forall ((v_ArrVal_462 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_462) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) c_~N~0)))) (<= 1 c_~N~0) .cse5 (= (+ c_~x~0 (* (- 1) c_~C~0)) 0) .cse6 (or (and .cse2 (= .cse13 (mod (+ c_~C~0 c_~x~0) 4294967296))) (not (= |c_thread2Thread1of1ForFork1_~j~0#1| 0))) (or (= |c_thread2Thread1of1ForFork1_~j~0#1| 1) .cse7) (< 0 c_~N~0) (< 0 c_~n~0) (or .cse0 .cse3 (and .cse1 (= (+ c_~s~0 .cse9) c_~N~0)) (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0)) (= c_~q~0.offset 0) (<= 1 c_~q_back~0) (<= c_~n~0 2)))) is different from false [2022-03-15 14:30:33,825 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse18 (mod (+ c_~C~0 c_~y~0) 4294967296))) (let ((.cse10 (+ (* c_~q_front~0 4) c_~q~0.offset)) (.cse1 (= .cse18 (mod c_~x~0 4294967296))) (.cse15 (forall ((v_ArrVal_462 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_462) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) c_~N~0)))) (let ((.cse7 (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0)) (.cse8 (and .cse1 .cse15)) (.cse5 (<= c_~x~0 c_~C~0)) (.cse6 (<= c_~C~0 c_~x~0)) (.cse2 (= c_~s~0 c_~N~0)) (.cse17 (mod (+ c_~C~0 c_~x~0) 4294967296)) (.cse16 (not (= |c_thread2Thread1of1ForFork1_~j~0#1| 0))) (.cse9 (<= (* c_~n~0 4) (+ c_~q~0.offset 3 (* 4 c_~q_back~0)))) (.cse11 (select (select |c_#memory_int| c_~q~0.base) .cse10)) (.cse0 (not (<= 0 c_~q_back~0))) (.cse3 (not (< c_~q_back~0 c_~n~0))) (.cse19 (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0))) (and (= c_~y~0 0) (or .cse0 (and .cse1 .cse2) .cse3) (<= |c_thread1Thread1of1ForFork0_~i~0#1| 1) (or (let ((.cse4 (+ c_~s~0 1))) (and (<= .cse4 (+ c_~N~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) (<= (+ |c_thread2Thread1of1ForFork1_~j~0#1| |c_thread1Thread1of1ForFork0_~i~0#1|) .cse4) .cse5 .cse6)) (not (= (+ (- 1) |c_thread2Thread1of1ForFork1_~j~0#1|) 0))) (or .cse0 .cse7 .cse3 .cse8) (= c_~s~0 1) (or .cse9 (and (<= .cse10 0) (<= 0 c_~q_front~0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~q~0.base)) (= .cse11 1))) (or .cse0 .cse7 .cse3 (and (forall ((aux_mod_aux_mod_~C~0_30_61 Int) (aux_div_aux_mod_~C~0_30_61 Int)) (let ((.cse14 (* aux_div_aux_mod_~C~0_30_61 4294967296))) (let ((.cse13 (+ .cse14 aux_mod_aux_mod_~C~0_30_61)) (.cse12 (* 4294967295 c_~x~0))) (or (<= (+ .cse12 c_~y~0 4294967296) .cse13) (= (+ (* (- 1) c_~y~0) .cse14 (* c_~x~0 (- 4294967295)) aux_mod_aux_mod_~C~0_30_61) aux_mod_aux_mod_~C~0_30_61) (>= aux_mod_aux_mod_~C~0_30_61 4294967296) (< .cse13 (+ .cse12 c_~y~0)) (> 0 aux_mod_aux_mod_~C~0_30_61))))) .cse15)) (or .cse0 (< (+ |c_thread1Thread1of1ForFork0_#t~post1#1| 1) c_~N~0) .cse3 .cse8) (<= 1 c_~N~0) .cse5 (= (+ c_~x~0 (* (- 1) c_~C~0)) 0) .cse6 (or .cse16 (and .cse2 (= (mod c_~y~0 4294967296) .cse17))) (or (and .cse2 (= .cse18 .cse17)) .cse16) (or (= |c_thread2Thread1of1ForFork1_~j~0#1| 1) .cse9) (< 0 c_~N~0) (< 0 c_~n~0) (or .cse0 .cse3 (and .cse1 (= (+ c_~s~0 .cse11) c_~N~0)) .cse19) (= c_~q~0.offset 0) (or .cse0 .cse3 (and (= c_~N~0 (+ c_~s~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) .cse1) .cse19) (<= 1 c_~q_back~0) (<= c_~n~0 2))))) is different from false [2022-03-15 14:30:43,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:30:43,654 INFO L93 Difference]: Finished difference Result 7376 states and 19384 transitions. [2022-03-15 14:30:43,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2022-03-15 14:30:43,654 INFO L78 Accepts]: Start accepts. Automaton has has 103 states, 103 states have (on average 3.29126213592233) internal successors, (339), 103 states have internal predecessors, (339), 0 states have call successors, (0), 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 133 [2022-03-15 14:30:43,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:30:43,664 INFO L225 Difference]: With dead ends: 7376 [2022-03-15 14:30:43,664 INFO L226 Difference]: Without dead ends: 7000 [2022-03-15 14:30:43,666 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 233 SyntacticMatches, 31 SemanticMatches, 219 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 18047 ImplicationChecksByTransitivity, 55.6s TimeCoverageRelationStatistics Valid=3748, Invalid=43516, Unknown=54, NotChecked=1302, Total=48620 [2022-03-15 14:30:43,667 INFO L933 BasicCegarLoop]: 243 mSDtfsCounter, 2128 mSDsluCounter, 10277 mSDsCounter, 0 mSdLazyCounter, 3017 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2128 SdHoareTripleChecker+Valid, 9985 SdHoareTripleChecker+Invalid, 6793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 3017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3578 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-03-15 14:30:43,667 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2128 Valid, 9985 Invalid, 6793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 3017 Invalid, 0 Unknown, 3578 Unchecked, 3.0s Time] [2022-03-15 14:30:43,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7000 states. [2022-03-15 14:30:43,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7000 to 4111. [2022-03-15 14:30:43,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4111 states, 4110 states have (on average 2.6608272506082726) internal successors, (10936), 4110 states have internal predecessors, (10936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:30:43,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4111 states to 4111 states and 10936 transitions. [2022-03-15 14:30:43,779 INFO L78 Accepts]: Start accepts. Automaton has 4111 states and 10936 transitions. Word has length 133 [2022-03-15 14:30:43,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:30:43,780 INFO L470 AbstractCegarLoop]: Abstraction has 4111 states and 10936 transitions. [2022-03-15 14:30:43,780 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 3.29126213592233) internal successors, (339), 103 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:30:43,780 INFO L276 IsEmpty]: Start isEmpty. Operand 4111 states and 10936 transitions. [2022-03-15 14:30:43,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-03-15 14:30:43,785 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:30:43,786 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 14:30:43,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-15 14:30:43,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-03-15 14:30:43,996 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 14:30:43,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:30:43,996 INFO L85 PathProgramCache]: Analyzing trace with hash -36261092, now seen corresponding path program 8 times [2022-03-15 14:30:43,997 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:30:43,997 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206046798] [2022-03-15 14:30:43,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:30:43,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:30:44,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:30:45,734 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:30:45,734 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:30:45,734 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206046798] [2022-03-15 14:30:45,734 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206046798] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:30:45,735 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032223219] [2022-03-15 14:30:45,735 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 14:30:45,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:30:45,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:30:45,736 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:30:45,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-15 14:30:45,903 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 14:30:45,903 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:30:45,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 70 conjunts are in the unsatisfiable core [2022-03-15 14:30:45,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:30:47,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:30:47,840 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 18 treesize of output 20 [2022-03-15 14:30:48,079 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-15 14:30:48,794 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:30:48,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:30:50,039 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:30:50,039 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 55 treesize of output 55 [2022-03-15 14:30:50,054 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 34 treesize of output 28 [2022-03-15 14:30:55,487 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:30:55,488 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032223219] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:30:55,488 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:30:55,488 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 38, 38] total 109 [2022-03-15 14:30:55,488 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108407648] [2022-03-15 14:30:55,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:30:55,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 109 states [2022-03-15 14:30:55,488 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:30:55,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2022-03-15 14:30:55,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=776, Invalid=10987, Unknown=9, NotChecked=0, Total=11772 [2022-03-15 14:30:55,490 INFO L87 Difference]: Start difference. First operand 4111 states and 10936 transitions. Second operand has 109 states, 109 states have (on average 3.2477064220183487) internal successors, (354), 109 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:31:22,486 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-15 14:31:34,792 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 14:31:37,257 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~C~0 c_~y~0)) (.cse6 (mod c_~x~0 4294967296))) (let ((.cse5 (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))) (.cse1 (not (<= 0 c_~q_back~0))) (.cse2 (not (< c_~q_back~0 c_~n~0))) (.cse3 (= (mod .cse0 4294967296) .cse6)) (.cse4 (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0))) (and (<= c_~N~0 c_~s~0) (<= .cse0 c_~x~0) (<= c_~x~0 .cse0) (= c_~C~0 (+ c_~x~0 (* (- 1) c_~C~0))) (or .cse1 .cse2 (and .cse3 (forall ((v_ArrVal_491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_491) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) c_~N~0))) .cse4) (or .cse1 (and .cse3 (= c_~N~0 .cse5)) .cse2 .cse4) (= c_~s~0 1) (<= c_~s~0 c_~N~0) (<= c_~N~0 1) (or (not (= |c_thread2Thread1of1ForFork1_~j~0#1| 0)) (and (= c_~s~0 c_~N~0) (= .cse6 (mod c_~y~0 4294967296)))) (< 0 c_~N~0) (or .cse1 .cse2 (and .cse3 (= (+ c_~s~0 .cse5) c_~N~0)) .cse4) (= c_~q~0.offset 0) (or .cse1 .cse2 (and (= c_~N~0 (+ c_~s~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) .cse3) .cse4) (= c_~C~0 c_~y~0)))) is different from false [2022-03-15 14:31:49,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:31:49,518 INFO L93 Difference]: Finished difference Result 9023 states and 23900 transitions. [2022-03-15 14:31:49,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2022-03-15 14:31:49,519 INFO L78 Accepts]: Start accepts. Automaton has has 109 states, 109 states have (on average 3.2477064220183487) internal successors, (354), 109 states have internal predecessors, (354), 0 states have call successors, (0), 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 133 [2022-03-15 14:31:49,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:31:49,530 INFO L225 Difference]: With dead ends: 9023 [2022-03-15 14:31:49,530 INFO L226 Difference]: Without dead ends: 8503 [2022-03-15 14:31:49,533 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 213 SyntacticMatches, 10 SemanticMatches, 270 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 26562 ImplicationChecksByTransitivity, 46.1s TimeCoverageRelationStatistics Valid=6232, Invalid=66871, Unknown=71, NotChecked=538, Total=73712 [2022-03-15 14:31:49,533 INFO L933 BasicCegarLoop]: 240 mSDtfsCounter, 4730 mSDsluCounter, 12665 mSDsCounter, 0 mSdLazyCounter, 7894 mSolverCounterSat, 983 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4730 SdHoareTripleChecker+Valid, 11679 SdHoareTripleChecker+Invalid, 13037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 983 IncrementalHoareTripleChecker+Valid, 7894 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 4158 IncrementalHoareTripleChecker+Unchecked, 15.5s IncrementalHoareTripleChecker+Time [2022-03-15 14:31:49,534 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4730 Valid, 11679 Invalid, 13037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [983 Valid, 7894 Invalid, 2 Unknown, 4158 Unchecked, 15.5s Time] [2022-03-15 14:31:49,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8503 states. [2022-03-15 14:31:49,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8503 to 4279. [2022-03-15 14:31:49,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4279 states, 4278 states have (on average 2.6617578307620384) internal successors, (11387), 4278 states have internal predecessors, (11387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:31:49,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4279 states to 4279 states and 11387 transitions. [2022-03-15 14:31:49,619 INFO L78 Accepts]: Start accepts. Automaton has 4279 states and 11387 transitions. Word has length 133 [2022-03-15 14:31:49,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:31:49,619 INFO L470 AbstractCegarLoop]: Abstraction has 4279 states and 11387 transitions. [2022-03-15 14:31:49,619 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 109 states, 109 states have (on average 3.2477064220183487) internal successors, (354), 109 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:31:49,619 INFO L276 IsEmpty]: Start isEmpty. Operand 4279 states and 11387 transitions. [2022-03-15 14:31:49,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-03-15 14:31:49,625 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:31:49,625 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 14:31:49,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-15 14:31:49,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-03-15 14:31:49,829 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 14:31:49,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:31:49,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1246374708, now seen corresponding path program 9 times [2022-03-15 14:31:49,830 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:31:49,830 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563683785] [2022-03-15 14:31:49,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:31:49,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:31:49,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:31:51,417 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:31:51,417 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:31:51,417 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563683785] [2022-03-15 14:31:51,418 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563683785] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:31:51,418 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398661090] [2022-03-15 14:31:51,418 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 14:31:51,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:31:51,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:31:51,419 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:31:51,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-15 14:31:51,565 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 14:31:51,565 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:31:51,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 51 conjunts are in the unsatisfiable core [2022-03-15 14:31:51,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:31:52,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:31:52,730 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 18 treesize of output 20 [2022-03-15 14:31:52,986 INFO L353 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-03-15 14:31:52,986 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-15 14:31:53,653 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 14:31:53,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:31:54,705 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:31:54,705 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 87 treesize of output 87 [2022-03-15 14:31:54,709 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 66 treesize of output 60 [2022-03-15 14:31:59,104 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 14:31:59,104 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398661090] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:31:59,104 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:31:59,104 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 29, 27] total 84 [2022-03-15 14:31:59,104 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755281928] [2022-03-15 14:31:59,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:31:59,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-03-15 14:31:59,105 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:31:59,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-03-15 14:31:59,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=430, Invalid=6532, Unknown=10, NotChecked=0, Total=6972 [2022-03-15 14:31:59,106 INFO L87 Difference]: Start difference. First operand 4279 states and 11387 transitions. Second operand has 84 states, 84 states have (on average 3.869047619047619) internal successors, (325), 84 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:32:04,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:32:04,306 INFO L93 Difference]: Finished difference Result 6182 states and 16360 transitions. [2022-03-15 14:32:04,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-03-15 14:32:04,307 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 84 states have (on average 3.869047619047619) internal successors, (325), 84 states have internal predecessors, (325), 0 states have call successors, (0), 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 133 [2022-03-15 14:32:04,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:32:04,314 INFO L225 Difference]: With dead ends: 6182 [2022-03-15 14:32:04,314 INFO L226 Difference]: Without dead ends: 6116 [2022-03-15 14:32:04,315 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 226 SyntacticMatches, 4 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5062 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=1346, Invalid=16465, Unknown=11, NotChecked=0, Total=17822 [2022-03-15 14:32:04,317 INFO L933 BasicCegarLoop]: 202 mSDtfsCounter, 1420 mSDsluCounter, 9215 mSDsCounter, 0 mSdLazyCounter, 2885 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1420 SdHoareTripleChecker+Valid, 8781 SdHoareTripleChecker+Invalid, 4955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 2885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2021 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 14:32:04,317 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1420 Valid, 8781 Invalid, 4955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 2885 Invalid, 0 Unknown, 2021 Unchecked, 1.4s Time] [2022-03-15 14:32:04,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6116 states. [2022-03-15 14:32:04,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6116 to 4307. [2022-03-15 14:32:04,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4307 states, 4306 states have (on average 2.6614026939154667) internal successors, (11460), 4306 states have internal predecessors, (11460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:32:04,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4307 states to 4307 states and 11460 transitions. [2022-03-15 14:32:04,371 INFO L78 Accepts]: Start accepts. Automaton has 4307 states and 11460 transitions. Word has length 133 [2022-03-15 14:32:04,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:32:04,372 INFO L470 AbstractCegarLoop]: Abstraction has 4307 states and 11460 transitions. [2022-03-15 14:32:04,372 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 84 states have (on average 3.869047619047619) internal successors, (325), 84 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:32:04,372 INFO L276 IsEmpty]: Start isEmpty. Operand 4307 states and 11460 transitions. [2022-03-15 14:32:04,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-03-15 14:32:04,378 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:32:04,378 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 14:32:04,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-03-15 14:32:04,581 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-03-15 14:32:04,581 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 14:32:04,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:32:04,581 INFO L85 PathProgramCache]: Analyzing trace with hash -55414478, now seen corresponding path program 10 times [2022-03-15 14:32:04,582 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:32:04,582 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245873209] [2022-03-15 14:32:04,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:32:04,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:32:04,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:32:06,002 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:32:06,003 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:32:06,003 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245873209] [2022-03-15 14:32:06,003 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245873209] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:32:06,003 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821229052] [2022-03-15 14:32:06,003 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 14:32:06,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:32:06,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:32:06,004 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:32:06,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-15 14:32:06,088 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 14:32:06,088 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:32:06,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 64 conjunts are in the unsatisfiable core [2022-03-15 14:32:06,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:32:08,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:32:08,024 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 18 treesize of output 20 [2022-03-15 14:32:08,327 INFO L353 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-03-15 14:32:08,328 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-15 14:32:09,093 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:32:09,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:32:10,525 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:32:10,526 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 87 treesize of output 87 [2022-03-15 14:32:10,528 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 66 treesize of output 60 [2022-03-15 14:32:17,746 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:32:17,746 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821229052] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:32:17,746 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:32:17,746 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 38, 37] total 103 [2022-03-15 14:32:17,746 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919505068] [2022-03-15 14:32:17,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:32:17,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2022-03-15 14:32:17,747 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:32:17,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2022-03-15 14:32:17,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=729, Invalid=9768, Unknown=9, NotChecked=0, Total=10506 [2022-03-15 14:32:17,748 INFO L87 Difference]: Start difference. First operand 4307 states and 11460 transitions. Second operand has 103 states, 103 states have (on average 3.29126213592233) internal successors, (339), 103 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:32:50,422 WARN L228 SmtUtils]: Spent 10.90s on a formula simplification. DAG size of input: 85 DAG size of output: 76 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 14:32:52,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:32:52,570 INFO L93 Difference]: Finished difference Result 6707 states and 17616 transitions. [2022-03-15 14:32:52,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2022-03-15 14:32:52,570 INFO L78 Accepts]: Start accepts. Automaton has has 103 states, 103 states have (on average 3.29126213592233) internal successors, (339), 103 states have internal predecessors, (339), 0 states have call successors, (0), 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 133 [2022-03-15 14:32:52,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:32:52,579 INFO L225 Difference]: With dead ends: 6707 [2022-03-15 14:32:52,579 INFO L226 Difference]: Without dead ends: 6478 [2022-03-15 14:32:52,580 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 214 SyntacticMatches, 10 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10100 ImplicationChecksByTransitivity, 41.9s TimeCoverageRelationStatistics Valid=2099, Invalid=28315, Unknown=36, NotChecked=0, Total=30450 [2022-03-15 14:32:52,581 INFO L933 BasicCegarLoop]: 226 mSDtfsCounter, 1026 mSDsluCounter, 9104 mSDsCounter, 0 mSdLazyCounter, 2101 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1026 SdHoareTripleChecker+Valid, 8971 SdHoareTripleChecker+Invalid, 4122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 2101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1943 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 14:32:52,581 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1026 Valid, 8971 Invalid, 4122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 2101 Invalid, 0 Unknown, 1943 Unchecked, 1.4s Time] [2022-03-15 14:32:52,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6478 states. [2022-03-15 14:32:52,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6478 to 4331. [2022-03-15 14:32:52,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4331 states, 4330 states have (on average 2.6586605080831407) internal successors, (11512), 4330 states have internal predecessors, (11512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:32:52,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4331 states to 4331 states and 11512 transitions. [2022-03-15 14:32:52,637 INFO L78 Accepts]: Start accepts. Automaton has 4331 states and 11512 transitions. Word has length 133 [2022-03-15 14:32:52,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:32:52,637 INFO L470 AbstractCegarLoop]: Abstraction has 4331 states and 11512 transitions. [2022-03-15 14:32:52,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 3.29126213592233) internal successors, (339), 103 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:32:52,637 INFO L276 IsEmpty]: Start isEmpty. Operand 4331 states and 11512 transitions. [2022-03-15 14:32:52,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-03-15 14:32:52,643 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:32:52,643 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 14:32:52,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-15 14:32:52,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-03-15 14:32:52,845 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 14:32:52,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:32:52,846 INFO L85 PathProgramCache]: Analyzing trace with hash 52006686, now seen corresponding path program 11 times [2022-03-15 14:32:52,846 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:32:52,846 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839366026] [2022-03-15 14:32:52,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:32:52,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:32:52,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:32:54,985 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:32:54,986 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:32:54,986 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839366026] [2022-03-15 14:32:54,986 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839366026] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:32:54,986 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310240133] [2022-03-15 14:32:54,986 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 14:32:54,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:32:54,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:32:54,987 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:32:54,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-15 14:32:55,127 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 14:32:55,127 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:32:55,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 72 conjunts are in the unsatisfiable core [2022-03-15 14:32:55,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:32:56,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:32:56,951 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 18 treesize of output 20 [2022-03-15 14:32:57,234 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-15 14:32:58,023 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:32:58,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:32:59,194 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_578 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_578) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) c_~N~0)) (= (mod (+ c_~y~0 (* c_~C~0 2)) 4294967296) (mod (+ c_~C~0 c_~x~0) 4294967296))) (<= c_~n~0 (+ c_~q_front~0 1)) (<= c_~n~0 0) (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0)) is different from false [2022-03-15 14:32:59,340 WARN L838 $PredicateComparison]: unable to prove that (or (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) (and (forall ((v_ArrVal_578 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_578) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) c_~N~0)) (= (mod (+ c_~y~0 (* c_~C~0 2)) 4294967296) (mod (+ c_~C~0 c_~x~0) 4294967296))) (<= c_~n~0 (+ c_~q_front~0 1)) (<= c_~n~0 0)) is different from false [2022-03-15 14:32:59,352 WARN L838 $PredicateComparison]: unable to prove that (or (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) (<= c_~n~0 (+ c_~q_front~0 1)) (<= c_~n~0 0) (and (forall ((v_ArrVal_578 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_578) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) c_~N~0)) (forall ((~C~0 Int)) (let ((.cse0 (* 2 ~C~0))) (= (mod (+ c_~x~0 .cse0) 4294967296) (mod (+ c_~y~0 .cse0) 4294967296)))))) is different from false [2022-03-15 14:32:59,380 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:32:59,380 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 59 treesize of output 59 [2022-03-15 14:32:59,384 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 32 [2022-03-15 14:33:02,024 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:33:02,025 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310240133] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:33:02,025 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:33:02,025 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 38, 38] total 109 [2022-03-15 14:33:02,025 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535338429] [2022-03-15 14:33:02,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:33:02,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 109 states [2022-03-15 14:33:02,026 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:33:02,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2022-03-15 14:33:02,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=699, Invalid=10437, Unknown=6, NotChecked=630, Total=11772 [2022-03-15 14:33:02,027 INFO L87 Difference]: Start difference. First operand 4331 states and 11512 transitions. Second operand has 109 states, 109 states have (on average 3.2477064220183487) internal successors, (354), 109 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:33:10,722 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (and (forall ((v_ArrVal_578 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_578) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) c_~N~0)) (= (mod (+ c_~y~0 (* c_~C~0 2)) 4294967296) (mod (+ c_~C~0 c_~x~0) 4294967296)))) (.cse1 (<= c_~n~0 (+ c_~q_front~0 1))) (.cse2 (<= c_~n~0 0))) (and (or .cse0 .cse1 .cse2 (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0)) (or .cse0 (< (+ |c_thread1Thread1of1ForFork0_#t~post1#1| 1) c_~N~0) .cse1 .cse2))) is different from false [2022-03-15 14:33:29,313 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_~x~0 4294967296)) (.cse1 (= c_~s~0 c_~N~0)) (.cse0 (not (= |c_thread2Thread1of1ForFork1_~j~0#1| 0)))) (and (or (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) (and (forall ((v_ArrVal_578 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_578) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) c_~N~0)) (= (mod (+ c_~y~0 (* c_~C~0 2)) 4294967296) (mod (+ c_~C~0 c_~x~0) 4294967296))) (<= c_~n~0 (+ c_~q_front~0 1)) (<= c_~n~0 0)) (or .cse0 (and .cse1 (= .cse2 (mod c_~y~0 4294967296)))) (or (and (= (mod (+ c_~C~0 c_~y~0) 4294967296) .cse2) .cse1) .cse0))) is different from false [2022-03-15 14:33:40,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:33:40,539 INFO L93 Difference]: Finished difference Result 7428 states and 19625 transitions. [2022-03-15 14:33:40,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2022-03-15 14:33:40,540 INFO L78 Accepts]: Start accepts. Automaton has has 109 states, 109 states have (on average 3.2477064220183487) internal successors, (354), 109 states have internal predecessors, (354), 0 states have call successors, (0), 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 133 [2022-03-15 14:33:40,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:33:40,549 INFO L225 Difference]: With dead ends: 7428 [2022-03-15 14:33:40,549 INFO L226 Difference]: Without dead ends: 7022 [2022-03-15 14:33:40,551 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 211 SyntacticMatches, 6 SemanticMatches, 212 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 14095 ImplicationChecksByTransitivity, 39.9s TimeCoverageRelationStatistics Valid=3474, Invalid=39996, Unknown=22, NotChecked=2090, Total=45582 [2022-03-15 14:33:40,552 INFO L933 BasicCegarLoop]: 226 mSDtfsCounter, 3310 mSDsluCounter, 10601 mSDsCounter, 0 mSdLazyCounter, 4816 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3310 SdHoareTripleChecker+Valid, 9951 SdHoareTripleChecker+Invalid, 11254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 4816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6164 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-03-15 14:33:40,552 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3310 Valid, 9951 Invalid, 11254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 4816 Invalid, 0 Unknown, 6164 Unchecked, 4.0s Time] [2022-03-15 14:33:40,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7022 states. [2022-03-15 14:33:40,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7022 to 4356. [2022-03-15 14:33:40,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4356 states, 4355 states have (on average 2.660849598163031) internal successors, (11588), 4355 states have internal predecessors, (11588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:33:40,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4356 states to 4356 states and 11588 transitions. [2022-03-15 14:33:40,611 INFO L78 Accepts]: Start accepts. Automaton has 4356 states and 11588 transitions. Word has length 133 [2022-03-15 14:33:40,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:33:40,612 INFO L470 AbstractCegarLoop]: Abstraction has 4356 states and 11588 transitions. [2022-03-15 14:33:40,612 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 109 states, 109 states have (on average 3.2477064220183487) internal successors, (354), 109 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:33:40,612 INFO L276 IsEmpty]: Start isEmpty. Operand 4356 states and 11588 transitions. [2022-03-15 14:33:40,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-03-15 14:33:40,620 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:33:40,620 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 14:33:40,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-15 14:33:40,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:33:40,836 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 14:33:40,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:33:40,836 INFO L85 PathProgramCache]: Analyzing trace with hash -833138018, now seen corresponding path program 12 times [2022-03-15 14:33:40,837 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:33:40,837 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235595501] [2022-03-15 14:33:40,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:33:40,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:33:40,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:33:42,347 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:33:42,347 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:33:42,347 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235595501] [2022-03-15 14:33:42,347 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235595501] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:33:42,347 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109698332] [2022-03-15 14:33:42,347 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 14:33:42,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:33:42,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:33:42,348 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:33:42,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-15 14:33:42,474 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 14:33:42,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:33:42,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 75 conjunts are in the unsatisfiable core [2022-03-15 14:33:42,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:33:44,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:33:44,416 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 18 treesize of output 20 [2022-03-15 14:33:44,830 INFO L353 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-03-15 14:33:44,831 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 24 treesize of output 10 Received shutdown request... [2022-03-15 14:33:45,339 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-03-15 14:33:45,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-15 14:33:45,367 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-15 14:33:45,367 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 14:33:45,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:33:45,543 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was analyzing trace of length 134 with TraceHistMax 2,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 6 xjuncts wrt. a ATOM-1 context. [2022-03-15 14:33:45,545 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2022-03-15 14:33:45,545 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2022-03-15 14:33:45,547 INFO L732 BasicCegarLoop]: Path program histogram: [12, 12, 3, 1, 1, 1] [2022-03-15 14:33:45,548 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 14:33:45,548 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 14:33:45,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 02:33:45 BasicIcfg [2022-03-15 14:33:45,550 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 14:33:45,550 INFO L158 Benchmark]: Toolchain (without parser) took 869939.45ms. Allocated memory was 192.9MB in the beginning and 449.8MB in the end (delta: 256.9MB). Free memory was 138.2MB in the beginning and 313.3MB in the end (delta: -175.1MB). Peak memory consumption was 82.6MB. Max. memory is 8.0GB. [2022-03-15 14:33:45,550 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 192.9MB. Free memory is still 154.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 14:33:45,550 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.25ms. Allocated memory is still 192.9MB. Free memory was 138.0MB in the beginning and 163.3MB in the end (delta: -25.4MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-03-15 14:33:45,550 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.99ms. Allocated memory is still 192.9MB. Free memory was 163.3MB in the beginning and 161.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 14:33:45,550 INFO L158 Benchmark]: Boogie Preprocessor took 42.11ms. Allocated memory is still 192.9MB. Free memory was 161.3MB in the beginning and 159.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 14:33:45,550 INFO L158 Benchmark]: RCFGBuilder took 388.04ms. Allocated memory is still 192.9MB. Free memory was 159.8MB in the beginning and 139.2MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-03-15 14:33:45,551 INFO L158 Benchmark]: TraceAbstraction took 869228.68ms. Allocated memory was 192.9MB in the beginning and 449.8MB in the end (delta: 256.9MB). Free memory was 138.8MB in the beginning and 313.3MB in the end (delta: -174.5MB). Peak memory consumption was 83.8MB. Max. memory is 8.0GB. [2022-03-15 14:33:45,551 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.10ms. Allocated memory is still 192.9MB. Free memory is still 154.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 241.25ms. Allocated memory is still 192.9MB. Free memory was 138.0MB in the beginning and 163.3MB in the end (delta: -25.4MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.99ms. Allocated memory is still 192.9MB. Free memory was 163.3MB in the beginning and 161.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.11ms. Allocated memory is still 192.9MB. Free memory was 161.3MB in the beginning and 159.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 388.04ms. Allocated memory is still 192.9MB. Free memory was 159.8MB in the beginning and 139.2MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 869228.68ms. Allocated memory was 192.9MB in the beginning and 449.8MB in the end (delta: 256.9MB). Free memory was 138.8MB in the beginning and 313.3MB in the end (delta: -174.5MB). Peak memory consumption was 83.8MB. 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: 105]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 134 with TraceHistMax 2,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 6 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 100]: 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 134 with TraceHistMax 2,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 6 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 99]: 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 134 with TraceHistMax 2,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 6 xjuncts wrt. a ATOM-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 159 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 869.1s, OverallIterations: 30, TraceHistogramMax: 2, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.1s, AutomataDifference: 710.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 35810 SdHoareTripleChecker+Valid, 48.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 35810 mSDsluCounter, 136589 SdHoareTripleChecker+Invalid, 44.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 43376 IncrementalHoareTripleChecker+Unchecked, 141294 mSDsCounter, 3188 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 47174 IncrementalHoareTripleChecker+Invalid, 93741 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3188 mSolverCounterUnsat, 5235 mSDtfsCounter, 47174 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6212 GetRequests, 3168 SyntacticMatches, 261 SemanticMatches, 2783 ConstructedPredicates, 26 IntricatePredicates, 4 DeprecatedPredicates, 202776 ImplicationChecksByTransitivity, 751.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4356occurred in iteration=29, InterpolantAutomatonStates: 1932, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 29 MinimizatonAttempts, 42706 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 146.6s InterpolantComputationTime, 5392 NumberOfCodeBlocks, 5378 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 7175 ConstructedInterpolants, 838 QuantifiedInterpolants, 151497 SizeOfPredicates, 464 NumberOfNonLiveVariables, 4242 ConjunctsInSsa, 807 ConjunctsInUnsatCore, 57 InterpolantComputations, 15 PerfectInterpolantSequences, 75/579 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