/usr/bin/java -Xmx16000000000 -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-Separate.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bc79526 [2022-01-18 13:05:09,279 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-18 13:05:09,280 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-18 13:05:09,334 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-18 13:05:09,334 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-18 13:05:09,335 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-18 13:05:09,336 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-18 13:05:09,337 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-18 13:05:09,338 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-18 13:05:09,339 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-18 13:05:09,340 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-18 13:05:09,340 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-18 13:05:09,341 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-18 13:05:09,341 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-18 13:05:09,342 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-18 13:05:09,343 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-18 13:05:09,343 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-18 13:05:09,344 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-18 13:05:09,345 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-18 13:05:09,346 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-18 13:05:09,347 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-18 13:05:09,348 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-18 13:05:09,349 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-18 13:05:09,350 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-18 13:05:09,352 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-18 13:05:09,352 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-18 13:05:09,352 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-18 13:05:09,353 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-18 13:05:09,353 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-18 13:05:09,354 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-18 13:05:09,354 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-18 13:05:09,354 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-18 13:05:09,356 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-18 13:05:09,357 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-18 13:05:09,358 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-18 13:05:09,358 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-18 13:05:09,359 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-18 13:05:09,359 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-18 13:05:09,359 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-18 13:05:09,359 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-18 13:05:09,360 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-18 13:05:09,361 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-Separate.epf [2022-01-18 13:05:09,378 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-18 13:05:09,378 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-18 13:05:09,378 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-18 13:05:09,378 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-18 13:05:09,379 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-18 13:05:09,379 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-18 13:05:09,379 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-18 13:05:09,379 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-18 13:05:09,379 INFO L138 SettingsManager]: * Use SBE=true [2022-01-18 13:05:09,380 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-18 13:05:09,380 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-18 13:05:09,380 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-18 13:05:09,380 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-18 13:05:09,380 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-18 13:05:09,380 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-18 13:05:09,380 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-18 13:05:09,380 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-18 13:05:09,380 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-18 13:05:09,380 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-18 13:05:09,381 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-18 13:05:09,381 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-18 13:05:09,381 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-18 13:05:09,381 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-18 13:05:09,381 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-18 13:05:09,381 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-18 13:05:09,381 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 13:05:09,381 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-18 13:05:09,382 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-18 13:05:09,382 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-18 13:05:09,382 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-18 13:05:09,382 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-18 13:05:09,382 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-18 13:05:09,382 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-18 13:05:09,382 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2022-01-18 13:05:09,382 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-01-18 13:05:09,571 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-18 13:05:09,591 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-18 13:05:09,593 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-18 13:05:09,594 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-18 13:05:09,596 INFO L275 PluginConnector]: CDTParser initialized [2022-01-18 13:05:09,597 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c [2022-01-18 13:05:09,651 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8e43e15e/e28ce5a885064fad94bd12604a8677d0/FLAGba7517b7f [2022-01-18 13:05:10,002 INFO L306 CDTParser]: Found 1 translation units. [2022-01-18 13:05:10,003 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c [2022-01-18 13:05:10,008 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8e43e15e/e28ce5a885064fad94bd12604a8677d0/FLAGba7517b7f [2022-01-18 13:05:10,018 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8e43e15e/e28ce5a885064fad94bd12604a8677d0 [2022-01-18 13:05:10,020 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-18 13:05:10,021 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-18 13:05:10,027 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-18 13:05:10,028 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-18 13:05:10,030 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-18 13:05:10,030 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 01:05:10" (1/1) ... [2022-01-18 13:05:10,031 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9a0cfce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 01:05:10, skipping insertion in model container [2022-01-18 13:05:10,031 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 01:05:10" (1/1) ... [2022-01-18 13:05:10,036 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-18 13:05:10,053 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-18 13:05:10,188 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-send-receive.wvr.c[3107,3120] [2022-01-18 13:05:10,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 13:05:10,200 INFO L203 MainTranslator]: Completed pre-run [2022-01-18 13:05:10,217 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-send-receive.wvr.c[3107,3120] [2022-01-18 13:05:10,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 13:05:10,230 INFO L208 MainTranslator]: Completed translation [2022-01-18 13:05:10,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 01:05:10 WrapperNode [2022-01-18 13:05:10,230 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-18 13:05:10,231 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-18 13:05:10,231 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-18 13:05:10,232 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-18 13:05:10,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 01:05:10" (1/1) ... [2022-01-18 13:05:10,243 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 01:05:10" (1/1) ... [2022-01-18 13:05:10,266 INFO L137 Inliner]: procedures = 25, calls = 52, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 161 [2022-01-18 13:05:10,266 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-18 13:05:10,267 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-18 13:05:10,267 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-18 13:05:10,268 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-18 13:05:10,274 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 01:05:10" (1/1) ... [2022-01-18 13:05:10,274 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 01:05:10" (1/1) ... [2022-01-18 13:05:10,287 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 01:05:10" (1/1) ... [2022-01-18 13:05:10,288 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 01:05:10" (1/1) ... [2022-01-18 13:05:10,295 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 01:05:10" (1/1) ... [2022-01-18 13:05:10,298 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 01:05:10" (1/1) ... [2022-01-18 13:05:10,299 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 01:05:10" (1/1) ... [2022-01-18 13:05:10,301 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-18 13:05:10,302 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-18 13:05:10,302 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-18 13:05:10,302 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-18 13:05:10,310 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 01:05:10" (1/1) ... [2022-01-18 13:05:10,316 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 13:05:10,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 13:05:10,352 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-01-18 13:05:10,374 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-01-18 13:05:10,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-18 13:05:10,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-18 13:05:10,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-18 13:05:10,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-18 13:05:10,389 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-18 13:05:10,389 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-18 13:05:10,390 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-18 13:05:10,390 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-18 13:05:10,390 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-01-18 13:05:10,390 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-01-18 13:05:10,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-18 13:05:10,390 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-18 13:05:10,390 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-18 13:05:10,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-18 13:05:10,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-18 13:05:10,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-18 13:05:10,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-18 13:05:10,392 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-18 13:05:10,456 INFO L234 CfgBuilder]: Building ICFG [2022-01-18 13:05:10,457 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-18 13:05:10,702 INFO L275 CfgBuilder]: Performing block encoding [2022-01-18 13:05:10,749 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-18 13:05:10,750 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-18 13:05:10,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 01:05:10 BoogieIcfgContainer [2022-01-18 13:05:10,751 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-18 13:05:10,752 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-18 13:05:10,752 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-18 13:05:10,754 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-18 13:05:10,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.01 01:05:10" (1/3) ... [2022-01-18 13:05:10,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28c3248b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 01:05:10, skipping insertion in model container [2022-01-18 13:05:10,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 01:05:10" (2/3) ... [2022-01-18 13:05:10,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28c3248b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 01:05:10, skipping insertion in model container [2022-01-18 13:05:10,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 01:05:10" (3/3) ... [2022-01-18 13:05:10,758 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-send-receive.wvr.c [2022-01-18 13:05:10,761 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-01-18 13:05:10,762 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-18 13:05:10,762 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-18 13:05:10,762 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-18 13:05:10,800 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,801 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,801 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,801 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,801 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,801 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,802 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,802 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,802 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,802 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,802 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,802 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,802 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,802 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,803 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,803 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,803 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,803 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,803 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,803 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,804 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,804 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,804 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,804 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,804 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,804 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,804 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,805 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,805 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,805 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,805 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,805 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,805 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,805 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,806 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,806 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,806 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,806 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,806 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,806 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,806 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,806 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,806 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,806 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,807 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,807 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,807 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,807 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,807 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,807 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,807 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,807 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,808 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,808 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,808 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,808 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,808 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,808 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,808 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,808 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,809 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,809 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,809 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,809 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,809 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,809 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,809 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,809 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,810 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,810 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,810 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,810 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,810 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,810 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,812 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,812 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,813 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,813 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,813 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,813 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,813 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,813 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,813 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,814 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,814 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,814 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,814 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,814 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,814 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,814 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,814 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,814 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,814 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 13:05:10,825 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-01-18 13:05:10,863 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-18 13:05:10,870 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, 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 [2022-01-18 13:05:10,870 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-18 13:05:10,881 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 142 places, 142 transitions, 308 flow [2022-01-18 13:05:11,015 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3113 states, 3112 states have (on average 3.5340616966580978) internal successors, (10998), 3112 states have internal predecessors, (10998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 13:05:11,025 INFO L276 IsEmpty]: Start isEmpty. Operand has 3113 states, 3112 states have (on average 3.5340616966580978) internal successors, (10998), 3112 states have internal predecessors, (10998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 13:05:11,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-01-18 13:05:11,052 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 13:05:11,053 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] [2022-01-18 13:05:11,054 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 13:05:11,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 13:05:11,058 INFO L85 PathProgramCache]: Analyzing trace with hash 518546796, now seen corresponding path program 1 times [2022-01-18 13:05:11,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 13:05:11,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176328827] [2022-01-18 13:05:11,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 13:05:11,067 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 13:05:11,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 13:05:11,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 13:05:11,229 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 13:05:11,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176328827] [2022-01-18 13:05:11,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176328827] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 13:05:11,230 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 13:05:11,230 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-18 13:05:11,231 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939790292] [2022-01-18 13:05:11,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 13:05:11,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-18 13:05:11,234 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 13:05:11,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-18 13:05:11,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-18 13:05:11,261 INFO L87 Difference]: Start difference. First operand has 3113 states, 3112 states have (on average 3.5340616966580978) internal successors, (10998), 3112 states have internal predecessors, (10998), 0 states have call successors, (0), 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 48.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 13:05:11,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 13:05:11,344 INFO L93 Difference]: Finished difference Result 3113 states and 10261 transitions. [2022-01-18 13:05:11,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-18 13:05:11,346 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 48.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2022-01-18 13:05:11,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 13:05:11,381 INFO L225 Difference]: With dead ends: 3113 [2022-01-18 13:05:11,381 INFO L226 Difference]: Without dead ends: 2945 [2022-01-18 13:05:11,383 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-01-18 13:05:11,385 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 13:05:11,386 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 13:05:11,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2945 states. [2022-01-18 13:05:11,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2945 to 2945. [2022-01-18 13:05:11,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2945 states, 2944 states have (on average 3.297554347826087) internal successors, (9708), 2944 states have internal predecessors, (9708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 13:05:11,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2945 states to 2945 states and 9708 transitions. [2022-01-18 13:05:11,517 INFO L78 Accepts]: Start accepts. Automaton has 2945 states and 9708 transitions. Word has length 96 [2022-01-18 13:05:11,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 13:05:11,518 INFO L470 AbstractCegarLoop]: Abstraction has 2945 states and 9708 transitions. [2022-01-18 13:05:11,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 48.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 13:05:11,519 INFO L276 IsEmpty]: Start isEmpty. Operand 2945 states and 9708 transitions. [2022-01-18 13:05:11,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-01-18 13:05:11,528 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 13:05:11,528 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] [2022-01-18 13:05:11,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-18 13:05:11,529 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 13:05:11,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 13:05:11,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1430139861, now seen corresponding path program 1 times [2022-01-18 13:05:11,530 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 13:05:11,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796763319] [2022-01-18 13:05:11,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 13:05:11,530 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 13:05:11,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 13:05:11,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 13:05:11,667 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 13:05:11,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796763319] [2022-01-18 13:05:11,667 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796763319] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 13:05:11,667 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 13:05:11,667 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-18 13:05:11,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817734293] [2022-01-18 13:05:11,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 13:05:11,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-18 13:05:11,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 13:05:11,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-18 13:05:11,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-18 13:05:11,670 INFO L87 Difference]: Start difference. First operand 2945 states and 9708 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 13:05:11,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 13:05:11,764 INFO L93 Difference]: Finished difference Result 2975 states and 9924 transitions. [2022-01-18 13:05:11,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-18 13:05:11,764 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2022-01-18 13:05:11,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 13:05:11,779 INFO L225 Difference]: With dead ends: 2975 [2022-01-18 13:05:11,779 INFO L226 Difference]: Without dead ends: 2975 [2022-01-18 13:05:11,782 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-18 13:05:11,783 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 101 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 13:05:11,784 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 313 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 13:05:11,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2975 states. [2022-01-18 13:05:11,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2975 to 2567. [2022-01-18 13:05:11,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2567 states, 2566 states have (on average 3.314886983632112) internal successors, (8506), 2566 states have internal predecessors, (8506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 13:05:11,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2567 states to 2567 states and 8506 transitions. [2022-01-18 13:05:11,919 INFO L78 Accepts]: Start accepts. Automaton has 2567 states and 8506 transitions. Word has length 96 [2022-01-18 13:05:11,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 13:05:11,921 INFO L470 AbstractCegarLoop]: Abstraction has 2567 states and 8506 transitions. [2022-01-18 13:05:11,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 13:05:11,921 INFO L276 IsEmpty]: Start isEmpty. Operand 2567 states and 8506 transitions. [2022-01-18 13:05:11,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-01-18 13:05:11,929 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 13:05:11,929 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-18 13:05:11,929 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-18 13:05:11,929 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 13:05:11,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 13:05:11,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1635672389, now seen corresponding path program 2 times [2022-01-18 13:05:11,930 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 13:05:11,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236742543] [2022-01-18 13:05:11,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 13:05:11,931 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 13:05:11,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 13:05:12,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 13:05:12,011 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 13:05:12,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236742543] [2022-01-18 13:05:12,011 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236742543] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 13:05:12,011 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 13:05:12,011 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-18 13:05:12,011 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920239130] [2022-01-18 13:05:12,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 13:05:12,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-18 13:05:12,012 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 13:05:12,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-18 13:05:12,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-18 13:05:12,013 INFO L87 Difference]: Start difference. First operand 2567 states and 8506 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 13:05:12,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 13:05:12,157 INFO L93 Difference]: Finished difference Result 3707 states and 12439 transitions. [2022-01-18 13:05:12,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-18 13:05:12,159 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2022-01-18 13:05:12,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 13:05:12,181 INFO L225 Difference]: With dead ends: 3707 [2022-01-18 13:05:12,181 INFO L226 Difference]: Without dead ends: 3707 [2022-01-18 13:05:12,181 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-18 13:05:12,186 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 85 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 13:05:12,187 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 292 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 13:05:12,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3707 states. [2022-01-18 13:05:12,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3707 to 2552. [2022-01-18 13:05:12,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2552 states, 2551 states have (on average 3.3171305370442963) internal successors, (8462), 2551 states have internal predecessors, (8462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 13:05:12,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2552 states to 2552 states and 8462 transitions. [2022-01-18 13:05:12,252 INFO L78 Accepts]: Start accepts. Automaton has 2552 states and 8462 transitions. Word has length 96 [2022-01-18 13:05:12,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 13:05:12,253 INFO L470 AbstractCegarLoop]: Abstraction has 2552 states and 8462 transitions. [2022-01-18 13:05:12,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 13:05:12,253 INFO L276 IsEmpty]: Start isEmpty. Operand 2552 states and 8462 transitions. [2022-01-18 13:05:12,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-01-18 13:05:12,262 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 13:05:12,262 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] [2022-01-18 13:05:12,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-18 13:05:12,262 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 13:05:12,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 13:05:12,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1043909749, now seen corresponding path program 3 times [2022-01-18 13:05:12,263 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 13:05:12,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752447867] [2022-01-18 13:05:12,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 13:05:12,263 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 13:05:12,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 13:05:12,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 13:05:12,409 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 13:05:12,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752447867] [2022-01-18 13:05:12,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752447867] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 13:05:12,410 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 13:05:12,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-18 13:05:12,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567336050] [2022-01-18 13:05:12,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 13:05:12,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-18 13:05:12,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 13:05:12,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-18 13:05:12,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-18 13:05:12,412 INFO L87 Difference]: Start difference. First operand 2552 states and 8462 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 13:05:12,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 13:05:12,557 INFO L93 Difference]: Finished difference Result 6261 states and 21083 transitions. [2022-01-18 13:05:12,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-18 13:05:12,557 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2022-01-18 13:05:12,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 13:05:12,573 INFO L225 Difference]: With dead ends: 6261 [2022-01-18 13:05:12,574 INFO L226 Difference]: Without dead ends: 3651 [2022-01-18 13:05:12,574 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-18 13:05:12,578 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 237 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 13:05:12,579 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [237 Valid, 354 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 13:05:12,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3651 states. [2022-01-18 13:05:12,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3651 to 2628. [2022-01-18 13:05:12,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2628 states, 2627 states have (on average 3.2401979444232967) internal successors, (8512), 2627 states have internal predecessors, (8512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 13:05:12,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2628 states to 2628 states and 8512 transitions. [2022-01-18 13:05:12,635 INFO L78 Accepts]: Start accepts. Automaton has 2628 states and 8512 transitions. Word has length 96 [2022-01-18 13:05:12,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 13:05:12,636 INFO L470 AbstractCegarLoop]: Abstraction has 2628 states and 8512 transitions. [2022-01-18 13:05:12,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 13:05:12,636 INFO L276 IsEmpty]: Start isEmpty. Operand 2628 states and 8512 transitions. [2022-01-18 13:05:12,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-18 13:05:12,644 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 13:05:12,644 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] [2022-01-18 13:05:12,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-18 13:05:12,644 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 13:05:12,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 13:05:12,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1775513332, now seen corresponding path program 1 times [2022-01-18 13:05:12,645 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 13:05:12,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219263099] [2022-01-18 13:05:12,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 13:05:12,645 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 13:05:12,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 13:05:12,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 13:05:12,746 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 13:05:12,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219263099] [2022-01-18 13:05:12,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219263099] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 13:05:12,746 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 13:05:12,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-18 13:05:12,747 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108363363] [2022-01-18 13:05:12,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 13:05:12,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-18 13:05:12,747 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 13:05:12,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-18 13:05:12,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-18 13:05:12,748 INFO L87 Difference]: Start difference. First operand 2628 states and 8512 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 13:05:12,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 13:05:12,774 INFO L93 Difference]: Finished difference Result 2664 states and 8430 transitions. [2022-01-18 13:05:12,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-18 13:05:12,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-01-18 13:05:12,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 13:05:12,794 INFO L225 Difference]: With dead ends: 2664 [2022-01-18 13:05:12,795 INFO L226 Difference]: Without dead ends: 2664 [2022-01-18 13:05:12,795 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-01-18 13:05:12,795 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 27 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 13:05:12,796 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 156 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 13:05:12,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2664 states. [2022-01-18 13:05:12,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2664 to 2664. [2022-01-18 13:05:12,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2664 states, 2663 states have (on average 3.1656027037176115) internal successors, (8430), 2663 states have internal predecessors, (8430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 13:05:12,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2664 states to 2664 states and 8430 transitions. [2022-01-18 13:05:12,855 INFO L78 Accepts]: Start accepts. Automaton has 2664 states and 8430 transitions. Word has length 99 [2022-01-18 13:05:12,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 13:05:12,856 INFO L470 AbstractCegarLoop]: Abstraction has 2664 states and 8430 transitions. [2022-01-18 13:05:12,856 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 13:05:12,856 INFO L276 IsEmpty]: Start isEmpty. Operand 2664 states and 8430 transitions. [2022-01-18 13:05:12,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-18 13:05:12,861 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 13:05:12,861 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] [2022-01-18 13:05:12,861 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-18 13:05:12,861 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 13:05:12,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 13:05:12,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1192942030, now seen corresponding path program 1 times [2022-01-18 13:05:12,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 13:05:12,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434436127] [2022-01-18 13:05:12,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 13:05:12,862 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 13:05:12,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 13:05:13,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 13:05:13,030 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 13:05:13,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434436127] [2022-01-18 13:05:13,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434436127] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 13:05:13,030 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 13:05:13,030 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-18 13:05:13,031 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324373256] [2022-01-18 13:05:13,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 13:05:13,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-18 13:05:13,032 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 13:05:13,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-18 13:05:13,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-01-18 13:05:13,036 INFO L87 Difference]: Start difference. First operand 2664 states and 8430 transitions. Second operand has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 13:05:13,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 13:05:13,251 INFO L93 Difference]: Finished difference Result 3417 states and 10384 transitions. [2022-01-18 13:05:13,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-18 13:05:13,252 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2022-01-18 13:05:13,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 13:05:13,258 INFO L225 Difference]: With dead ends: 3417 [2022-01-18 13:05:13,258 INFO L226 Difference]: Without dead ends: 2670 [2022-01-18 13:05:13,259 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2022-01-18 13:05:13,259 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 421 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 13:05:13,259 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [421 Valid, 666 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 13:05:13,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2670 states. [2022-01-18 13:05:13,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2670 to 2665. [2022-01-18 13:05:13,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2665 states, 2664 states have (on average 3.16478978978979) internal successors, (8431), 2664 states have internal predecessors, (8431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 13:05:13,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2665 states to 2665 states and 8431 transitions. [2022-01-18 13:05:13,303 INFO L78 Accepts]: Start accepts. Automaton has 2665 states and 8431 transitions. Word has length 110 [2022-01-18 13:05:13,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 13:05:13,303 INFO L470 AbstractCegarLoop]: Abstraction has 2665 states and 8431 transitions. [2022-01-18 13:05:13,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 13:05:13,303 INFO L276 IsEmpty]: Start isEmpty. Operand 2665 states and 8431 transitions. [2022-01-18 13:05:13,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-01-18 13:05:13,308 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 13:05:13,308 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] [2022-01-18 13:05:13,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-18 13:05:13,308 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 13:05:13,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 13:05:13,309 INFO L85 PathProgramCache]: Analyzing trace with hash 623162093, now seen corresponding path program 1 times [2022-01-18 13:05:13,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 13:05:13,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442292249] [2022-01-18 13:05:13,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 13:05:13,309 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 13:05:13,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 13:05:13,550 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 13:05:13,550 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 13:05:13,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442292249] [2022-01-18 13:05:13,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442292249] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 13:05:13,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736074130] [2022-01-18 13:05:13,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 13:05:13,551 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 13:05:13,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 13:05:13,568 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-01-18 13:05:13,570 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-01-18 13:05:13,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 13:05:13,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 60 conjunts are in the unsatisfiable core [2022-01-18 13:05:13,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 13:05:13,767 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-01-18 13:05:13,804 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-18 13:05:13,804 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-01-18 13:05:13,839 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-18 13:05:13,840 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-01-18 13:05:14,329 INFO L353 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-01-18 13:05:14,330 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 30 [2022-01-18 13:05:14,472 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-18 13:05:14,820 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 13:05:14,910 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 13:05:15,146 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-01-18 13:05:15,210 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-01-18 13:05:15,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 13:05:15,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 13:05:15,418 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_124 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_124) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_124 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_124) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))) (< c_~front~0 0)) is different from false [2022-01-18 13:05:15,521 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_124 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_124) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_124 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_124) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) (< c_~front~0 0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1))) is different from false [2022-01-18 13:05:16,712 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 13:05:16,713 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 76 [2022-01-18 13:05:16,726 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 13:05:16,726 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 1496 treesize of output 1432 [2022-01-18 13:05:16,742 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 13:05:16,742 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 1416 treesize of output 1372 [2022-01-18 13:05:16,754 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 1229 treesize of output 1133 [2022-01-18 13:05:16,771 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 13:05:16,771 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 1260 treesize of output 1156 [2022-01-18 13:05:16,782 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 1037 treesize of output 941 [2022-01-18 13:05:23,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-18 13:05:23,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736074130] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 13:05:23,785 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 13:05:23,785 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 26, 27] total 61 [2022-01-18 13:05:23,785 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383822068] [2022-01-18 13:05:23,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 13:05:23,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-01-18 13:05:23,786 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 13:05:23,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-01-18 13:05:23,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=405, Invalid=3005, Unknown=20, NotChecked=230, Total=3660 [2022-01-18 13:05:23,787 INFO L87 Difference]: Start difference. First operand 2665 states and 8431 transitions. Second operand has 61 states, 61 states have (on average 4.737704918032787) internal successors, (289), 61 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 13:05:26,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 13:05:26,317 INFO L93 Difference]: Finished difference Result 17245 states and 57586 transitions. [2022-01-18 13:05:26,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-01-18 13:05:26,323 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 4.737704918032787) internal successors, (289), 61 states have internal predecessors, (289), 0 states have call successors, (0), 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 117 [2022-01-18 13:05:26,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 13:05:26,348 INFO L225 Difference]: With dead ends: 17245 [2022-01-18 13:05:26,348 INFO L226 Difference]: Without dead ends: 9094 [2022-01-18 13:05:26,350 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 195 SyntacticMatches, 5 SemanticMatches, 99 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3073 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1472, Invalid=8218, Unknown=20, NotChecked=390, Total=10100 [2022-01-18 13:05:26,351 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 3041 mSDsluCounter, 2536 mSDsCounter, 0 mSdLazyCounter, 827 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3041 SdHoareTripleChecker+Valid, 2335 SdHoareTripleChecker+Invalid, 2740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1731 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-18 13:05:26,351 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3041 Valid, 2335 Invalid, 2740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 827 Invalid, 0 Unknown, 1731 Unchecked, 0.6s Time] [2022-01-18 13:05:26,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9094 states. [2022-01-18 13:05:26,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9094 to 4109. [2022-01-18 13:05:26,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4109 states, 4108 states have (on average 3.057205452775073) internal successors, (12559), 4108 states have internal predecessors, (12559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 13:05:26,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4109 states to 4109 states and 12559 transitions. [2022-01-18 13:05:26,459 INFO L78 Accepts]: Start accepts. Automaton has 4109 states and 12559 transitions. Word has length 117 [2022-01-18 13:05:26,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 13:05:26,459 INFO L470 AbstractCegarLoop]: Abstraction has 4109 states and 12559 transitions. [2022-01-18 13:05:26,459 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 4.737704918032787) internal successors, (289), 61 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 13:05:26,459 INFO L276 IsEmpty]: Start isEmpty. Operand 4109 states and 12559 transitions. [2022-01-18 13:05:26,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-01-18 13:05:26,467 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 13:05:26,467 INFO L514 BasicCegarLoop]: trace histogram [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-01-18 13:05:26,485 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-01-18 13:05:26,684 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 13:05:26,685 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 13:05:26,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 13:05:26,685 INFO L85 PathProgramCache]: Analyzing trace with hash 869306436, now seen corresponding path program 2 times [2022-01-18 13:05:26,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 13:05:26,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223707461] [2022-01-18 13:05:26,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 13:05:26,686 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 13:05:26,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 13:05:26,741 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 13:05:26,741 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 13:05:26,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223707461] [2022-01-18 13:05:26,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223707461] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 13:05:26,741 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 13:05:26,741 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-18 13:05:26,741 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006793769] [2022-01-18 13:05:26,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 13:05:26,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-18 13:05:26,742 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 13:05:26,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-18 13:05:26,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-18 13:05:26,742 INFO L87 Difference]: Start difference. First operand 4109 states and 12559 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-01-18 13:05:26,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 13:05:26,799 INFO L93 Difference]: Finished difference Result 9989 states and 31073 transitions. [2022-01-18 13:05:26,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-18 13:05:26,799 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-01-18 13:05:26,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 13:05:26,824 INFO L225 Difference]: With dead ends: 9989 [2022-01-18 13:05:26,824 INFO L226 Difference]: Without dead ends: 9917 [2022-01-18 13:05:26,825 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-01-18 13:05:26,825 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 147 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 13:05:26,825 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 207 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 13:05:26,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9917 states. [2022-01-18 13:05:26,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9917 to 8399. [2022-01-18 13:05:27,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8399 states, 8398 states have (on average 3.1245534651107407) internal successors, (26240), 8398 states have internal predecessors, (26240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 13:05:27,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8399 states to 8399 states and 26240 transitions. [2022-01-18 13:05:27,047 INFO L78 Accepts]: Start accepts. Automaton has 8399 states and 26240 transitions. Word has length 120 [2022-01-18 13:05:27,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 13:05:27,047 INFO L470 AbstractCegarLoop]: Abstraction has 8399 states and 26240 transitions. [2022-01-18 13:05:27,047 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-01-18 13:05:27,048 INFO L276 IsEmpty]: Start isEmpty. Operand 8399 states and 26240 transitions. [2022-01-18 13:05:27,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 13:05:27,064 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 13:05:27,065 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] [2022-01-18 13:05:27,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-18 13:05:27,065 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 13:05:27,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 13:05:27,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1680628146, now seen corresponding path program 1 times [2022-01-18 13:05:27,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 13:05:27,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066536953] [2022-01-18 13:05:27,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 13:05:27,066 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 13:05:27,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 13:05:27,105 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-18 13:05:27,106 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 13:05:27,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066536953] [2022-01-18 13:05:27,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066536953] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 13:05:27,106 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 13:05:27,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-18 13:05:27,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195153532] [2022-01-18 13:05:27,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 13:05:27,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-18 13:05:27,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 13:05:27,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-18 13:05:27,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-18 13:05:27,107 INFO L87 Difference]: Start difference. First operand 8399 states and 26240 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 13:05:27,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 13:05:27,151 INFO L93 Difference]: Finished difference Result 8199 states and 25593 transitions. [2022-01-18 13:05:27,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-18 13:05:27,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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 124 [2022-01-18 13:05:27,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 13:05:27,173 INFO L225 Difference]: With dead ends: 8199 [2022-01-18 13:05:27,173 INFO L226 Difference]: Without dead ends: 8199 [2022-01-18 13:05:27,173 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-01-18 13:05:27,175 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 12 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 13:05:27,175 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 223 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 13:05:27,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8199 states. [2022-01-18 13:05:27,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8199 to 8149. [2022-01-18 13:05:27,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8149 states, 8148 states have (on average 3.125306823760432) internal successors, (25465), 8148 states have internal predecessors, (25465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 13:05:27,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8149 states to 8149 states and 25465 transitions. [2022-01-18 13:05:27,323 INFO L78 Accepts]: Start accepts. Automaton has 8149 states and 25465 transitions. Word has length 124 [2022-01-18 13:05:27,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 13:05:27,324 INFO L470 AbstractCegarLoop]: Abstraction has 8149 states and 25465 transitions. [2022-01-18 13:05:27,324 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 13:05:27,324 INFO L276 IsEmpty]: Start isEmpty. Operand 8149 states and 25465 transitions. [2022-01-18 13:05:27,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-01-18 13:05:27,339 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 13:05:27,339 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 13:05:27,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-18 13:05:27,340 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 13:05:27,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 13:05:27,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1813426250, now seen corresponding path program 3 times [2022-01-18 13:05:27,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 13:05:27,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919077048] [2022-01-18 13:05:27,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 13:05:27,340 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 13:05:27,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 13:05:27,420 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-18 13:05:27,420 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 13:05:27,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919077048] [2022-01-18 13:05:27,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919077048] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 13:05:27,420 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 13:05:27,420 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-18 13:05:27,420 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611792452] [2022-01-18 13:05:27,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 13:05:27,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-18 13:05:27,421 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 13:05:27,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-18 13:05:27,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-18 13:05:27,421 INFO L87 Difference]: Start difference. First operand 8149 states and 25465 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 13:05:27,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 13:05:27,495 INFO L93 Difference]: Finished difference Result 13321 states and 41453 transitions. [2022-01-18 13:05:27,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-18 13:05:27,496 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 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 131 [2022-01-18 13:05:27,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 13:05:27,526 INFO L225 Difference]: With dead ends: 13321 [2022-01-18 13:05:27,526 INFO L226 Difference]: Without dead ends: 13321 [2022-01-18 13:05:27,526 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-18 13:05:27,526 INFO L933 BasicCegarLoop]: 151 mSDtfsCounter, 73 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 13:05:27,527 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 382 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 13:05:27,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13321 states. [2022-01-18 13:05:27,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13321 to 12814. [2022-01-18 13:05:27,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12814 states, 12813 states have (on average 3.1134784984000623) internal successors, (39893), 12813 states have internal predecessors, (39893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 13:05:27,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12814 states to 12814 states and 39893 transitions. [2022-01-18 13:05:27,760 INFO L78 Accepts]: Start accepts. Automaton has 12814 states and 39893 transitions. Word has length 131 [2022-01-18 13:05:27,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 13:05:27,761 INFO L470 AbstractCegarLoop]: Abstraction has 12814 states and 39893 transitions. [2022-01-18 13:05:27,761 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 13:05:27,761 INFO L276 IsEmpty]: Start isEmpty. Operand 12814 states and 39893 transitions. [2022-01-18 13:05:27,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-01-18 13:05:27,779 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 13:05:27,779 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 13:05:27,780 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-18 13:05:27,780 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 13:05:27,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 13:05:27,780 INFO L85 PathProgramCache]: Analyzing trace with hash 154122346, now seen corresponding path program 1 times [2022-01-18 13:05:27,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 13:05:27,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735337898] [2022-01-18 13:05:27,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 13:05:27,780 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 13:05:27,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 13:05:28,115 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-18 13:05:28,115 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 13:05:28,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735337898] [2022-01-18 13:05:28,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735337898] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 13:05:28,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161259772] [2022-01-18 13:05:28,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 13:05:28,116 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 13:05:28,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 13:05:28,117 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-01-18 13:05:28,117 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-01-18 13:05:28,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 13:05:28,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 21 conjunts are in the unsatisfiable core [2022-01-18 13:05:28,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 13:05:28,749 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 13:05:28,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 13:05:29,274 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-18 13:05:29,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161259772] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 13:05:29,274 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 13:05:29,274 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 9] total 31 [2022-01-18 13:05:29,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496825121] [2022-01-18 13:05:29,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 13:05:29,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-01-18 13:05:29,275 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 13:05:29,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-01-18 13:05:29,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=761, Unknown=0, NotChecked=0, Total=930 [2022-01-18 13:05:29,276 INFO L87 Difference]: Start difference. First operand 12814 states and 39893 transitions. Second operand has 31 states, 31 states have (on average 9.290322580645162) internal successors, (288), 31 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 13:05:29,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 13:05:29,987 INFO L93 Difference]: Finished difference Result 14512 states and 46254 transitions. [2022-01-18 13:05:29,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-18 13:05:29,997 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 9.290322580645162) internal successors, (288), 31 states have internal predecessors, (288), 0 states have call successors, (0), 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 131 [2022-01-18 13:05:29,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 13:05:30,029 INFO L225 Difference]: With dead ends: 14512 [2022-01-18 13:05:30,029 INFO L226 Difference]: Without dead ends: 13555 [2022-01-18 13:05:30,030 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=549, Invalid=1803, Unknown=0, NotChecked=0, Total=2352 [2022-01-18 13:05:30,030 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 1377 mSDsluCounter, 1785 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1377 SdHoareTripleChecker+Valid, 1854 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-18 13:05:30,030 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1377 Valid, 1854 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-18 13:05:30,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13555 states. [2022-01-18 13:05:30,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13555 to 9707. [2022-01-18 13:05:30,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9707 states, 9706 states have (on average 3.217494333402019) internal successors, (31229), 9706 states have internal predecessors, (31229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 13:05:30,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9707 states to 9707 states and 31229 transitions. [2022-01-18 13:05:30,211 INFO L78 Accepts]: Start accepts. Automaton has 9707 states and 31229 transitions. Word has length 131 [2022-01-18 13:05:30,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 13:05:30,211 INFO L470 AbstractCegarLoop]: Abstraction has 9707 states and 31229 transitions. [2022-01-18 13:05:30,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 9.290322580645162) internal successors, (288), 31 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 13:05:30,211 INFO L276 IsEmpty]: Start isEmpty. Operand 9707 states and 31229 transitions. [2022-01-18 13:05:30,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-01-18 13:05:30,225 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 13:05:30,225 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-18 13:05:30,249 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-01-18 13:05:30,443 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,SelfDestructingSolverStorable10 [2022-01-18 13:05:30,443 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 13:05:30,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 13:05:30,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1700635271, now seen corresponding path program 2 times [2022-01-18 13:05:30,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 13:05:30,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280712048] [2022-01-18 13:05:30,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 13:05:30,444 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 13:05:30,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 13:05:30,696 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-18 13:05:30,697 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 13:05:30,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280712048] [2022-01-18 13:05:30,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280712048] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 13:05:30,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157846762] [2022-01-18 13:05:30,697 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 13:05:30,697 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 13:05:30,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 13:05:30,698 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-01-18 13:05:30,699 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-01-18 13:05:30,780 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 13:05:30,780 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 13:05:30,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 63 conjunts are in the unsatisfiable core [2022-01-18 13:05:30,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 13:05:31,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 13:05:31,935 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 32 treesize of output 32 [2022-01-18 13:05:32,125 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-18 13:05:32,125 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 48 treesize of output 14 [2022-01-18 13:05:32,250 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 13:05:32,250 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 13:05:32,781 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-01-18 13:05:32,782 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 133 treesize of output 134 [2022-01-18 13:05:32,787 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-18 13:05:32,787 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 71 treesize of output 58 [2022-01-18 13:05:32,801 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-18 13:05:32,802 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 58 treesize of output 45 [2022-01-18 13:05:34,486 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 13:05:34,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157846762] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 13:05:34,486 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 13:05:34,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 26, 25] total 61 [2022-01-18 13:05:34,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083001137] [2022-01-18 13:05:34,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 13:05:34,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-01-18 13:05:34,487 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 13:05:34,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-01-18 13:05:34,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=3297, Unknown=1, NotChecked=0, Total=3660 [2022-01-18 13:05:34,488 INFO L87 Difference]: Start difference. First operand 9707 states and 31229 transitions. Second operand has 61 states, 61 states have (on average 5.786885245901639) internal successors, (353), 61 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 13:05:49,069 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_~queue~0.base)) (.cse3 (< c_~front~0 0)) (.cse4 (<= c_~n~0 (+ c_~front~0 1)))) (and (or (let ((.cse0 (let ((.cse2 (* c_~front~0 4))) (+ c_~sum~0 (select .cse1 (+ c_~queue~0.offset .cse2)) (select .cse1 (+ c_~queue~0.offset .cse2 4)))))) (and (<= .cse0 1) (<= 0 .cse0))) .cse3 .cse4) (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (or (and (forall ((v_ArrVal_243 (Array Int Int))) (<= (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_243) c_~queue~0.base)) (.cse6 (* c_~front~0 4))) (+ c_~sum~0 (select .cse5 (+ c_~queue~0.offset .cse6 4)) (select .cse5 (+ c_~queue~0.offset .cse6)))) 1)) (forall ((v_ArrVal_243 (Array Int Int))) (<= 0 (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_243) c_~queue~0.base)) (.cse8 (* c_~front~0 4))) (+ c_~sum~0 (select .cse7 (+ c_~queue~0.offset .cse8 4)) (select .cse7 (+ c_~queue~0.offset .cse8))))))) (not (= (+ (select .cse1 (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) .cse3 .cse4) (<= 0 c_~sum~0) (<= c_~sum~0 1))) is different from false [2022-01-18 13:05:49,873 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (or (and (forall ((v_ArrVal_243 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_243) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select .cse0 (+ c_~queue~0.offset .cse1 4)) (select .cse0 (+ c_~queue~0.offset .cse1)))) 1)) (forall ((v_ArrVal_243 (Array Int Int))) (<= 0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_243) c_~queue~0.base)) (.cse3 (* c_~front~0 4))) (+ c_~sum~0 (select .cse2 (+ c_~queue~0.offset .cse3 4)) (select .cse2 (+ c_~queue~0.offset .cse3))))))) (< c_~front~0 0) (<= c_~n~0 (+ c_~front~0 1))) (<= 1 c_~v_assert~0)) is different from false [2022-01-18 13:05:50,740 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (or (and (forall ((v_ArrVal_243 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_243) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select .cse0 (+ c_~queue~0.offset .cse1 4)) (select .cse0 (+ c_~queue~0.offset .cse1)))) 1)) (forall ((v_ArrVal_243 (Array Int Int))) (<= 0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_243) c_~queue~0.base)) (.cse3 (* c_~front~0 4))) (+ c_~sum~0 (select .cse2 (+ c_~queue~0.offset .cse3 4)) (select .cse2 (+ c_~queue~0.offset .cse3))))))) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0) (<= c_~n~0 (+ c_~front~0 1)))) is different from false [2022-01-18 13:05:51,229 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (or (and (forall ((v_ArrVal_243 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_243) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select .cse0 (+ c_~queue~0.offset .cse1 4)) (select .cse0 (+ c_~queue~0.offset .cse1)))) 1)) (forall ((v_ArrVal_243 (Array Int Int))) (<= 0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_243) c_~queue~0.base)) (.cse3 (* c_~front~0 4))) (+ c_~sum~0 (select .cse2 (+ c_~queue~0.offset .cse3 4)) (select .cse2 (+ c_~queue~0.offset .cse3))))))) (< c_~front~0 0) (<= c_~n~0 (+ c_~front~0 1)))) is different from false [2022-01-18 13:06:00,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 13:06:00,630 INFO L93 Difference]: Finished difference Result 163223 states and 544699 transitions. [2022-01-18 13:06:00,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 327 states. [2022-01-18 13:06:00,631 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 5.786885245901639) internal successors, (353), 61 states have internal predecessors, (353), 0 states have call successors, (0), 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 138 [2022-01-18 13:06:00,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 13:06:01,104 INFO L225 Difference]: With dead ends: 163223 [2022-01-18 13:06:01,104 INFO L226 Difference]: Without dead ends: 119591 [2022-01-18 13:06:01,116 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 667 GetRequests, 251 SyntacticMatches, 44 SemanticMatches, 372 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 65511 ImplicationChecksByTransitivity, 21.9s TimeCoverageRelationStatistics Valid=13634, Invalid=122762, Unknown=150, NotChecked=2956, Total=139502 [2022-01-18 13:06:01,116 INFO L933 BasicCegarLoop]: 256 mSDtfsCounter, 7219 mSDsluCounter, 12657 mSDsCounter, 0 mSdLazyCounter, 5472 mSolverCounterSat, 958 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7219 SdHoareTripleChecker+Valid, 11440 SdHoareTripleChecker+Invalid, 9766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 958 IncrementalHoareTripleChecker+Valid, 5472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3336 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-01-18 13:06:01,116 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7219 Valid, 11440 Invalid, 9766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [958 Valid, 5472 Invalid, 0 Unknown, 3336 Unchecked, 3.2s Time] [2022-01-18 13:06:01,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119591 states. [2022-01-18 13:06:02,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119591 to 23240. [2022-01-18 13:06:02,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23240 states, 23239 states have (on average 3.1237144455441284) internal successors, (72592), 23239 states have internal predecessors, (72592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 13:06:02,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23240 states to 23240 states and 72592 transitions. [2022-01-18 13:06:02,778 INFO L78 Accepts]: Start accepts. Automaton has 23240 states and 72592 transitions. Word has length 138 [2022-01-18 13:06:02,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 13:06:02,778 INFO L470 AbstractCegarLoop]: Abstraction has 23240 states and 72592 transitions. [2022-01-18 13:06:02,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 5.786885245901639) internal successors, (353), 61 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 13:06:02,778 INFO L276 IsEmpty]: Start isEmpty. Operand 23240 states and 72592 transitions. [2022-01-18 13:06:02,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-01-18 13:06:02,810 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 13:06:02,810 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-18 13:06:02,827 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-01-18 13:06:03,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 13:06:03,027 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 13:06:03,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 13:06:03,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1880030863, now seen corresponding path program 3 times [2022-01-18 13:06:03,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 13:06:03,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147106615] [2022-01-18 13:06:03,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 13:06:03,028 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 13:06:03,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 13:06:03,379 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-18 13:06:03,380 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 13:06:03,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147106615] [2022-01-18 13:06:03,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147106615] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 13:06:03,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525367976] [2022-01-18 13:06:03,380 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-18 13:06:03,380 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 13:06:03,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 13:06:03,381 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-01-18 13:06:03,382 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-01-18 13:06:03,472 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-01-18 13:06:03,472 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 13:06:03,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 65 conjunts are in the unsatisfiable core [2022-01-18 13:06:03,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 13:06:04,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 13:06:04,756 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 44 treesize of output 42 [2022-01-18 13:06:04,825 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-18 13:06:04,825 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 50 treesize of output 16 [2022-01-18 13:06:04,904 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 13:06:04,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 13:06:05,090 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_280 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))) is different from false [2022-01-18 13:06:05,110 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_280 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1))))))) (< c_~front~0 0)) is different from false [2022-01-18 13:06:05,134 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_280 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1))))))) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) is different from false [2022-01-18 13:06:05,182 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_280 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1))))))) (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) is different from false [2022-01-18 13:06:05,216 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_280 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1))))))) (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) is different from false [2022-01-18 13:06:05,252 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (<= c_~n~0 c_~back~0) (and (forall ((v_ArrVal_280 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1))))))) (< c_~back~0 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) is different from false [2022-01-18 13:06:05,361 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-01-18 13:06:05,361 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 137 treesize of output 122 [2022-01-18 13:06:05,366 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 59 treesize of output 52 [2022-01-18 13:06:05,369 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 52 treesize of output 45 [2022-01-18 13:06:07,414 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2022-01-18 13:06:07,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525367976] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 13:06:07,414 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 13:06:07,414 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 29, 28] total 65 [2022-01-18 13:06:07,414 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115342916] [2022-01-18 13:06:07,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 13:06:07,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-01-18 13:06:07,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 13:06:07,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-01-18 13:06:07,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=389, Invalid=3051, Unknown=6, NotChecked=714, Total=4160 [2022-01-18 13:06:07,416 INFO L87 Difference]: Start difference. First operand 23240 states and 72592 transitions. Second operand has 65 states, 65 states have (on average 5.276923076923077) internal successors, (343), 65 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 13:06:18,411 WARN L838 $PredicateComparison]: unable to prove that (and (or (<= c_~n~0 c_~front~0) (<= c_~n~0 c_~back~0) (and (forall ((v_ArrVal_280 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1))))))) (< c_~back~0 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 c_~v_assert~0)) is different from false [2022-01-18 13:06:18,849 WARN L838 $PredicateComparison]: unable to prove that (and (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_280 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1))))))) (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-01-18 13:06:20,055 WARN L838 $PredicateComparison]: unable to prove that (and (or (<= c_~n~0 c_~front~0) (<= c_~n~0 c_~back~0) (and (forall ((v_ArrVal_280 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1))))))) (< c_~back~0 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 c_~v_assert~0) (= c_~sum~0 0)) is different from false [2022-01-18 13:06:21,213 WARN L838 $PredicateComparison]: unable to prove that (and (or (<= c_~n~0 c_~front~0) (<= c_~n~0 c_~back~0) (and (forall ((v_ArrVal_280 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1))))))) (< c_~back~0 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1)) is different from false [2022-01-18 13:06:21,224 WARN L838 $PredicateComparison]: unable to prove that (and (or (<= c_~n~0 c_~front~0) (<= c_~n~0 c_~back~0) (and (forall ((v_ArrVal_280 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1))))))) (< c_~back~0 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1)) is different from false [2022-01-18 13:06:21,702 WARN L838 $PredicateComparison]: unable to prove that (and (or (<= c_~n~0 c_~front~0) (<= c_~n~0 c_~back~0) (and (forall ((v_ArrVal_280 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1))))))) (< c_~back~0 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) is different from false [2022-01-18 13:06:22,185 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (or (<= c_~n~0 c_~front~0) (<= c_~n~0 c_~back~0) (and (forall ((v_ArrVal_280 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1))))))) (< c_~back~0 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) is different from false [2022-01-18 13:06:22,231 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (or (<= c_~n~0 c_~front~0) (<= c_~n~0 c_~back~0) (and (forall ((v_ArrVal_280 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1))))))) (< c_~back~0 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0))) is different from false [2022-01-18 13:06:23,874 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_280 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (or (< (+ c_~back~0 1) 0) (and (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 c_~sum~0) (<= c_~sum~0 1) (= (* c_~front~0 4) (* c_~back~0 4))) (<= 2 c_~front~0) (<= 1 c_~back~0) (< c_~front~0 0))) is different from false [2022-01-18 13:06:24,660 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (forall ((v_ArrVal_280 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))) is different from false [2022-01-18 13:06:36,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 13:06:36,013 INFO L93 Difference]: Finished difference Result 192136 states and 614845 transitions. [2022-01-18 13:06:36,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 340 states. [2022-01-18 13:06:36,014 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 5.276923076923077) internal successors, (343), 65 states have internal predecessors, (343), 0 states have call successors, (0), 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 138 [2022-01-18 13:06:36,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 13:06:36,616 INFO L225 Difference]: With dead ends: 192136 [2022-01-18 13:06:36,616 INFO L226 Difference]: Without dead ends: 142148 [2022-01-18 13:06:36,622 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 659 GetRequests, 239 SyntacticMatches, 38 SemanticMatches, 382 ConstructedPredicates, 16 IntricatePredicates, 4 DeprecatedPredicates, 62980 ImplicationChecksByTransitivity, 24.4s TimeCoverageRelationStatistics Valid=13427, Invalid=121658, Unknown=35, NotChecked=11952, Total=147072 [2022-01-18 13:06:36,623 INFO L933 BasicCegarLoop]: 317 mSDtfsCounter, 7243 mSDsluCounter, 12556 mSDsCounter, 0 mSdLazyCounter, 5538 mSolverCounterSat, 843 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7243 SdHoareTripleChecker+Valid, 11724 SdHoareTripleChecker+Invalid, 19411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 843 IncrementalHoareTripleChecker+Valid, 5538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13030 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-01-18 13:06:36,623 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7243 Valid, 11724 Invalid, 19411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [843 Valid, 5538 Invalid, 0 Unknown, 13030 Unchecked, 2.9s Time] [2022-01-18 13:06:36,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142148 states. [2022-01-18 13:06:37,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142148 to 35121. [2022-01-18 13:06:38,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35121 states, 35120 states have (on average 3.1020501138952166) internal successors, (108944), 35120 states have internal predecessors, (108944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 13:06:38,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35121 states to 35121 states and 108944 transitions. [2022-01-18 13:06:38,241 INFO L78 Accepts]: Start accepts. Automaton has 35121 states and 108944 transitions. Word has length 138 [2022-01-18 13:06:38,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 13:06:38,241 INFO L470 AbstractCegarLoop]: Abstraction has 35121 states and 108944 transitions. [2022-01-18 13:06:38,241 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 5.276923076923077) internal successors, (343), 65 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 13:06:38,241 INFO L276 IsEmpty]: Start isEmpty. Operand 35121 states and 108944 transitions. [2022-01-18 13:06:38,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-01-18 13:06:38,282 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 13:06:38,282 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-18 13:06:38,298 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-01-18 13:06:38,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 13:06:38,497 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 13:06:38,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 13:06:38,497 INFO L85 PathProgramCache]: Analyzing trace with hash 167751433, now seen corresponding path program 4 times [2022-01-18 13:06:38,497 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 13:06:38,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815851861] [2022-01-18 13:06:38,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 13:06:38,498 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 13:06:38,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 13:06:39,041 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 13:06:39,041 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 13:06:39,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815851861] [2022-01-18 13:06:39,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815851861] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 13:06:39,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846661682] [2022-01-18 13:06:39,042 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-18 13:06:39,042 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 13:06:39,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 13:06:39,043 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-01-18 13:06:39,047 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-01-18 13:06:39,133 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-18 13:06:39,133 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 13:06:39,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 66 conjunts are in the unsatisfiable core [2022-01-18 13:06:39,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 13:06:39,164 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-01-18 13:06:39,385 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 13:06:39,385 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-01-18 13:06:40,651 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 43 treesize of output 41 [2022-01-18 13:06:40,904 INFO L353 Elim1Store]: treesize reduction 93, result has 7.0 percent of original size [2022-01-18 13:06:40,905 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 22 [2022-01-18 13:06:40,966 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 13:06:40,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 13:06:41,107 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_318 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_318) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_318 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_318) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))) is different from false [2022-01-18 13:06:41,120 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_318 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_318) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))))) (forall ((v_ArrVal_318 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_318) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)))) 1))) (< c_~front~0 0)) is different from false [2022-01-18 13:06:41,146 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_318 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_318) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))))) (forall ((v_ArrVal_318 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_318) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)))) 1))) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) is different from false [2022-01-18 13:06:41,220 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (and (forall ((v_ArrVal_318 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_318) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))))) (forall ((v_ArrVal_318 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_318) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)))) 1))) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) is different from false [2022-01-18 13:06:41,234 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_318 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_318) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))))) (forall ((v_ArrVal_318 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_318) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)))) 1))) (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) is different from false [2022-01-18 13:06:41,264 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (<= c_~n~0 c_~back~0) (and (forall ((v_ArrVal_318 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_318) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))))) (forall ((v_ArrVal_318 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_318) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)))) 1))) (< c_~back~0 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) is different from false [2022-01-18 13:06:41,362 INFO L353 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-01-18 13:06:41,362 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 136 treesize of output 122 [2022-01-18 13:06:41,378 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 59 treesize of output 52 [2022-01-18 13:06:41,382 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 52 treesize of output 45 [2022-01-18 13:06:45,031 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-01-18 13:06:45,067 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2022-01-18 13:06:45,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846661682] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 13:06:45,067 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 13:06:45,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 28, 28] total 73 [2022-01-18 13:06:45,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410894314] [2022-01-18 13:06:45,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 13:06:45,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-01-18 13:06:45,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 13:06:45,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-01-18 13:06:45,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=389, Invalid=4051, Unknown=6, NotChecked=810, Total=5256 [2022-01-18 13:06:45,069 INFO L87 Difference]: Start difference. First operand 35121 states and 108944 transitions. Second operand has 73 states, 73 states have (on average 4.780821917808219) internal successors, (349), 73 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 13:06:48,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 13:06:48,680 INFO L93 Difference]: Finished difference Result 57066 states and 177723 transitions. [2022-01-18 13:06:48,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-01-18 13:06:48,682 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 4.780821917808219) internal successors, (349), 73 states have internal predecessors, (349), 0 states have call successors, (0), 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 138 [2022-01-18 13:06:48,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 13:06:48,911 INFO L225 Difference]: With dead ends: 57066 [2022-01-18 13:06:48,912 INFO L226 Difference]: Without dead ends: 57066 [2022-01-18 13:06:48,912 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 247 SyntacticMatches, 12 SemanticMatches, 119 ConstructedPredicates, 6 IntricatePredicates, 1 DeprecatedPredicates, 4157 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1864, Invalid=11264, Unknown=6, NotChecked=1386, Total=14520 [2022-01-18 13:06:48,913 INFO L933 BasicCegarLoop]: 198 mSDtfsCounter, 2128 mSDsluCounter, 7749 mSDsCounter, 0 mSdLazyCounter, 1942 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2128 SdHoareTripleChecker+Valid, 7057 SdHoareTripleChecker+Invalid, 5471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3430 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-18 13:06:48,913 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2128 Valid, 7057 Invalid, 5471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1942 Invalid, 0 Unknown, 3430 Unchecked, 0.8s Time] [2022-01-18 13:06:48,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57066 states. [2022-01-18 13:06:49,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57066 to 35570. [2022-01-18 13:06:49,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35570 states, 35569 states have (on average 3.1037982512862325) internal successors, (110399), 35569 states have internal predecessors, (110399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 13:06:49,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35570 states to 35570 states and 110399 transitions. [2022-01-18 13:06:49,800 INFO L78 Accepts]: Start accepts. Automaton has 35570 states and 110399 transitions. Word has length 138 [2022-01-18 13:06:49,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 13:06:49,801 INFO L470 AbstractCegarLoop]: Abstraction has 35570 states and 110399 transitions. [2022-01-18 13:06:49,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 4.780821917808219) internal successors, (349), 73 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 13:06:49,801 INFO L276 IsEmpty]: Start isEmpty. Operand 35570 states and 110399 transitions. [2022-01-18 13:06:49,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-01-18 13:06:49,887 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 13:06:49,887 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-18 13:06:49,910 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-01-18 13:06:50,088 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-01-18 13:06:50,088 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 13:06:50,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 13:06:50,089 INFO L85 PathProgramCache]: Analyzing trace with hash 412402409, now seen corresponding path program 5 times [2022-01-18 13:06:50,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 13:06:50,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507369428] [2022-01-18 13:06:50,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 13:06:50,089 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 13:06:50,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 13:06:50,338 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-18 13:06:50,339 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 13:06:50,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507369428] [2022-01-18 13:06:50,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507369428] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 13:06:50,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617340509] [2022-01-18 13:06:50,339 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-18 13:06:50,339 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 13:06:50,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 13:06:50,341 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-01-18 13:06:50,341 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-01-18 13:06:50,428 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-01-18 13:06:50,428 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 13:06:50,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 86 conjunts are in the unsatisfiable core [2022-01-18 13:06:50,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 13:06:50,457 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-01-18 13:06:50,477 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-18 13:06:50,478 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-01-18 13:06:50,511 INFO L353 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-01-18 13:06:50,511 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 30 [2022-01-18 13:06:51,015 INFO L353 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-01-18 13:06:51,016 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 34 [2022-01-18 13:06:51,366 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-18 13:06:51,694 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 13:06:51,801 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 13:06:52,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 13:06:52,561 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-01-18 13:06:52,884 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-18 13:06:52,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 13:06:52,886 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 13:06:52,886 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 22 [2022-01-18 13:06:52,978 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 13:06:52,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 13:06:53,241 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_362 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_362) c_~queue~0.base))) (or (let ((.cse0 (let ((.cse2 (* c_~front~0 4))) (+ c_~sum~0 (select .cse1 (+ c_~queue~0.offset .cse2)) (select .cse1 (+ c_~queue~0.offset .cse2 4)))))) (and (<= 0 .cse0) (<= .cse0 1))) (not (= 0 (+ (select .cse1 (+ c_~queue~0.offset (* c_~back~0 4))) 1)))))) is different from false [2022-01-18 13:06:53,288 WARN L838 $PredicateComparison]: unable to prove that (or (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (forall ((v_ArrVal_362 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_362) c_~queue~0.base))) (or (let ((.cse0 (let ((.cse2 (* c_~front~0 4))) (+ c_~sum~0 (select .cse1 (+ c_~queue~0.offset .cse2)) (select .cse1 (+ c_~queue~0.offset .cse2 4)))))) (and (<= 0 .cse0) (<= .cse0 1))) (not (= 0 (+ (select .cse1 (+ c_~queue~0.offset (* c_~back~0 4))) 1))))))) is different from false [2022-01-18 13:06:53,307 WARN L838 $PredicateComparison]: unable to prove that (or (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (forall ((v_ArrVal_362 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_362) c_~queue~0.base))) (or (let ((.cse0 (let ((.cse2 (* c_~front~0 4))) (+ c_~sum~0 (select .cse1 (+ c_~queue~0.offset .cse2)) (select .cse1 (+ c_~queue~0.offset .cse2 4)))))) (and (<= 0 .cse0) (<= .cse0 1))) (not (= 0 (+ (select .cse1 (+ c_~queue~0.offset (* c_~back~0 4))) 1))))))) is different from false [2022-01-18 13:07:00,517 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 13:07:00,517 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 197 treesize of output 137 [2022-01-18 13:07:00,550 INFO L353 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-01-18 13:07:00,550 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 694 treesize of output 696 [2022-01-18 13:07:00,561 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-18 13:07:00,571 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 13:07:00,572 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 580 treesize of output 485 [2022-01-18 13:07:00,581 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-18 13:07:00,581 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-18 13:07:00,597 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 13:07:00,598 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 516 treesize of output 506 [2022-01-18 13:07:00,611 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-18 13:07:00,612 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-18 13:07:00,628 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 13:07:00,629 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 440 treesize of output 468 [2022-01-18 13:07:21,563 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-01-18 13:07:21,564 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617340509] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 13:07:21,564 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 13:07:21,564 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 37, 37] total 84 [2022-01-18 13:07:21,564 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402448396] [2022-01-18 13:07:21,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 13:07:21,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-01-18 13:07:21,564 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 13:07:21,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-01-18 13:07:21,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=555, Invalid=5919, Unknown=18, NotChecked=480, Total=6972 [2022-01-18 13:07:21,565 INFO L87 Difference]: Start difference. First operand 35570 states and 110399 transitions. Second operand has 84 states, 84 states have (on average 4.226190476190476) internal successors, (355), 84 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 13:07:30,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 13:07:30,402 INFO L93 Difference]: Finished difference Result 76978 states and 244074 transitions. [2022-01-18 13:07:30,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-01-18 13:07:30,402 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 84 states have (on average 4.226190476190476) internal successors, (355), 84 states have internal predecessors, (355), 0 states have call successors, (0), 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 138 [2022-01-18 13:07:30,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 13:07:30,569 INFO L225 Difference]: With dead ends: 76978 [2022-01-18 13:07:30,570 INFO L226 Difference]: Without dead ends: 72322 [2022-01-18 13:07:30,572 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 228 SyntacticMatches, 29 SemanticMatches, 168 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 11888 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=3123, Invalid=24593, Unknown=18, NotChecked=996, Total=28730 [2022-01-18 13:07:30,572 INFO L933 BasicCegarLoop]: 259 mSDtfsCounter, 3550 mSDsluCounter, 9473 mSDsCounter, 0 mSdLazyCounter, 4120 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3550 SdHoareTripleChecker+Valid, 8359 SdHoareTripleChecker+Invalid, 9630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 4120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5178 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-01-18 13:07:30,572 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3550 Valid, 8359 Invalid, 9630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 4120 Invalid, 0 Unknown, 5178 Unchecked, 1.8s Time] [2022-01-18 13:07:30,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72322 states. [2022-01-18 13:07:31,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72322 to 36310. [2022-01-18 13:07:31,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36310 states, 36309 states have (on average 3.0963948332369386) internal successors, (112427), 36309 states have internal predecessors, (112427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 13:07:31,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36310 states to 36310 states and 112427 transitions. [2022-01-18 13:07:31,461 INFO L78 Accepts]: Start accepts. Automaton has 36310 states and 112427 transitions. Word has length 138 [2022-01-18 13:07:31,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 13:07:31,461 INFO L470 AbstractCegarLoop]: Abstraction has 36310 states and 112427 transitions. [2022-01-18 13:07:31,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 84 states have (on average 4.226190476190476) internal successors, (355), 84 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 13:07:31,462 INFO L276 IsEmpty]: Start isEmpty. Operand 36310 states and 112427 transitions. [2022-01-18 13:07:31,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-01-18 13:07:31,501 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 13:07:31,501 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-18 13:07:31,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-01-18 13:07:31,701 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-01-18 13:07:31,702 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 13:07:31,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 13:07:31,702 INFO L85 PathProgramCache]: Analyzing trace with hash 873258863, now seen corresponding path program 6 times [2022-01-18 13:07:31,702 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 13:07:31,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739352411] [2022-01-18 13:07:31,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 13:07:31,702 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 13:07:31,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 13:07:33,053 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 13:07:33,053 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 13:07:33,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739352411] [2022-01-18 13:07:33,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739352411] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 13:07:33,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289344224] [2022-01-18 13:07:33,054 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-18 13:07:33,054 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 13:07:33,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 13:07:33,055 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-01-18 13:07:33,055 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-01-18 13:07:33,247 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-01-18 13:07:33,248 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 13:07:33,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 60 conjunts are in the unsatisfiable core [2022-01-18 13:07:33,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 13:07:34,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 13:07:34,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 19 treesize of output 21 [2022-01-18 13:07:34,987 INFO L353 Elim1Store]: treesize reduction 48, result has 5.9 percent of original size [2022-01-18 13:07:34,988 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 17 [2022-01-18 13:07:35,061 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 13:07:35,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 13:07:36,773 INFO L353 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-01-18 13:07:36,774 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 152 treesize of output 155 [2022-01-18 13:07:36,792 INFO L353 Elim1Store]: treesize reduction 22, result has 56.9 percent of original size [2022-01-18 13:07:36,792 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 96 [2022-01-18 13:07:40,885 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 13:07:40,885 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289344224] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 13:07:40,885 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 13:07:40,885 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 29, 29] total 84 [2022-01-18 13:07:40,886 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141065156] [2022-01-18 13:07:40,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 13:07:40,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-01-18 13:07:40,886 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 13:07:40,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-01-18 13:07:40,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=427, Invalid=6541, Unknown=4, NotChecked=0, Total=6972 [2022-01-18 13:07:40,887 INFO L87 Difference]: Start difference. First operand 36310 states and 112427 transitions. Second operand has 84 states, 84 states have (on average 4.178571428571429) internal successors, (351), 84 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 13:08:42,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 13:08:42,337 INFO L93 Difference]: Finished difference Result 289190 states and 923239 transitions. [2022-01-18 13:08:42,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 357 states. [2022-01-18 13:08:42,337 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 84 states have (on average 4.178571428571429) internal successors, (351), 84 states have internal predecessors, (351), 0 states have call successors, (0), 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 138 [2022-01-18 13:08:42,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 13:08:43,649 INFO L225 Difference]: With dead ends: 289190 [2022-01-18 13:08:43,650 INFO L226 Difference]: Without dead ends: 275114 [2022-01-18 13:08:43,655 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 696 GetRequests, 245 SyntacticMatches, 24 SemanticMatches, 427 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78672 ImplicationChecksByTransitivity, 54.2s TimeCoverageRelationStatistics Valid=15160, Invalid=168201, Unknown=251, NotChecked=0, Total=183612 [2022-01-18 13:08:43,655 INFO L933 BasicCegarLoop]: 596 mSDtfsCounter, 10942 mSDsluCounter, 27179 mSDsCounter, 0 mSdLazyCounter, 10944 mSolverCounterSat, 1146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10942 SdHoareTripleChecker+Valid, 24053 SdHoareTripleChecker+Invalid, 18653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1146 IncrementalHoareTripleChecker+Valid, 10944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6563 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-01-18 13:08:43,656 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10942 Valid, 24053 Invalid, 18653 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1146 Valid, 10944 Invalid, 0 Unknown, 6563 Unchecked, 6.3s Time] [2022-01-18 13:08:44,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275114 states. [2022-01-18 13:08:47,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275114 to 82720. [2022-01-18 13:08:47,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82720 states, 82719 states have (on average 3.1466531268511466) internal successors, (260288), 82719 states have internal predecessors, (260288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 13:08:48,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82720 states to 82720 states and 260288 transitions. [2022-01-18 13:08:48,072 INFO L78 Accepts]: Start accepts. Automaton has 82720 states and 260288 transitions. Word has length 138 [2022-01-18 13:08:48,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 13:08:48,073 INFO L470 AbstractCegarLoop]: Abstraction has 82720 states and 260288 transitions. [2022-01-18 13:08:48,073 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 84 states have (on average 4.178571428571429) internal successors, (351), 84 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 13:08:48,073 INFO L276 IsEmpty]: Start isEmpty. Operand 82720 states and 260288 transitions. [2022-01-18 13:08:48,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-01-18 13:08:48,173 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 13:08:48,173 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-18 13:08:48,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-01-18 13:08:48,382 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 13:08:48,382 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 13:08:48,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 13:08:48,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1644048529, now seen corresponding path program 7 times [2022-01-18 13:08:48,383 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 13:08:48,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073139056] [2022-01-18 13:08:48,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 13:08:48,383 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 13:08:48,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 13:08:51,072 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 13:08:51,073 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 13:08:51,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073139056] [2022-01-18 13:08:51,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073139056] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 13:08:51,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504498684] [2022-01-18 13:08:51,073 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-18 13:08:51,073 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 13:08:51,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 13:08:51,074 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-01-18 13:08:51,074 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-01-18 13:08:51,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 13:08:51,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 75 conjunts are in the unsatisfiable core [2022-01-18 13:08:51,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 13:08:51,977 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-18 13:08:52,392 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 13:08:52,516 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 13:08:52,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 13:08:52,875 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-01-18 13:08:53,132 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-18 13:08:53,132 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 48 treesize of output 14 [2022-01-18 13:08:53,263 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 13:08:53,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 13:08:56,441 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 13:08:56,442 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 198 treesize of output 138 [2022-01-18 13:08:56,472 INFO L353 Elim1Store]: treesize reduction 64, result has 37.9 percent of original size [2022-01-18 13:08:56,472 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 5390 treesize of output 5068 [2022-01-18 13:08:56,514 INFO L353 Elim1Store]: treesize reduction 64, result has 37.9 percent of original size [2022-01-18 13:08:56,514 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 5030 treesize of output 4792 [2022-01-18 13:08:56,556 INFO L353 Elim1Store]: treesize reduction 64, result has 37.9 percent of original size [2022-01-18 13:08:56,557 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4754 treesize of output 4240 [2022-01-18 13:08:56,590 INFO L353 Elim1Store]: treesize reduction 41, result has 22.6 percent of original size [2022-01-18 13:08:56,590 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 4100 treesize of output 3056 [2022-01-18 13:08:56,607 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2022-01-18 13:08:56,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-01-18 13:08:56,811 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,SelfDestructingSolverStorable16 [2022-01-18 13:08:56,812 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:685) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:668) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-01-18 13:08:56,820 INFO L158 Benchmark]: Toolchain (without parser) took 226798.73ms. Allocated memory was 364.9MB in the beginning and 4.3GB in the end (delta: 3.9GB). Free memory was 310.4MB in the beginning and 2.4GB in the end (delta: -2.1GB). Peak memory consumption was 2.1GB. Max. memory is 16.0GB. [2022-01-18 13:08:56,822 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 364.9MB. Free memory was 326.9MB in the beginning and 326.7MB in the end (delta: 153.8kB). There was no memory consumed. Max. memory is 16.0GB. [2022-01-18 13:08:56,822 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.20ms. Allocated memory is still 364.9MB. Free memory was 310.3MB in the beginning and 335.7MB in the end (delta: -25.4MB). Peak memory consumption was 13.0MB. Max. memory is 16.0GB. [2022-01-18 13:08:56,822 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.24ms. Allocated memory is still 364.9MB. Free memory was 335.7MB in the beginning and 333.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-18 13:08:56,822 INFO L158 Benchmark]: Boogie Preprocessor took 34.10ms. Allocated memory is still 364.9MB. Free memory was 333.6MB in the beginning and 331.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-18 13:08:56,823 INFO L158 Benchmark]: RCFGBuilder took 449.29ms. Allocated memory is still 364.9MB. Free memory was 331.5MB in the beginning and 312.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2022-01-18 13:08:56,826 INFO L158 Benchmark]: TraceAbstraction took 226067.44ms. Allocated memory was 364.9MB in the beginning and 4.3GB in the end (delta: 3.9GB). Free memory was 311.6MB in the beginning and 2.4GB in the end (delta: -2.1GB). Peak memory consumption was 2.1GB. Max. memory is 16.0GB. [2022-01-18 13:08:56,829 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.14ms. Allocated memory is still 364.9MB. Free memory was 326.9MB in the beginning and 326.7MB in the end (delta: 153.8kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 203.20ms. Allocated memory is still 364.9MB. Free memory was 310.3MB in the beginning and 335.7MB in the end (delta: -25.4MB). Peak memory consumption was 13.0MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 35.24ms. Allocated memory is still 364.9MB. Free memory was 335.7MB in the beginning and 333.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 34.10ms. Allocated memory is still 364.9MB. Free memory was 333.6MB in the beginning and 331.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 449.29ms. Allocated memory is still 364.9MB. Free memory was 331.5MB in the beginning and 312.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * TraceAbstraction took 226067.44ms. Allocated memory was 364.9MB in the beginning and 4.3GB in the end (delta: 3.9GB). Free memory was 311.6MB in the beginning and 2.4GB in the end (delta: -2.1GB). Peak memory consumption was 2.1GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-01-18 13:08:56,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...