/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/parallel-min-max-1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bc79526 [2022-01-18 11:40:32,433 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-18 11:40:32,435 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-18 11:40:32,469 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-18 11:40:32,469 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-18 11:40:32,470 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-18 11:40:32,483 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-18 11:40:32,484 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-18 11:40:32,485 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-18 11:40:32,486 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-18 11:40:32,486 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-18 11:40:32,487 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-18 11:40:32,487 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-18 11:40:32,507 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-18 11:40:32,508 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-18 11:40:32,509 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-18 11:40:32,509 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-18 11:40:32,510 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-18 11:40:32,511 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-18 11:40:32,512 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-18 11:40:32,513 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-18 11:40:32,514 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-18 11:40:32,515 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-18 11:40:32,515 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-18 11:40:32,518 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-18 11:40:32,518 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-18 11:40:32,518 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-18 11:40:32,519 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-18 11:40:32,519 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-18 11:40:32,520 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-18 11:40:32,520 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-18 11:40:32,521 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-18 11:40:32,521 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-18 11:40:32,522 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-18 11:40:32,523 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-18 11:40:32,523 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-18 11:40:32,523 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-18 11:40:32,524 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-18 11:40:32,524 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-18 11:40:32,525 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-18 11:40:32,525 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-18 11:40:32,540 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Separate.epf [2022-01-18 11:40:32,561 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-18 11:40:32,561 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-18 11:40:32,561 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-18 11:40:32,562 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-18 11:40:32,562 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-18 11:40:32,562 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-18 11:40:32,563 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-18 11:40:32,563 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-18 11:40:32,563 INFO L138 SettingsManager]: * Use SBE=true [2022-01-18 11:40:32,563 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-18 11:40:32,563 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-18 11:40:32,563 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-18 11:40:32,563 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-18 11:40:32,563 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-18 11:40:32,564 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-18 11:40:32,564 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-18 11:40:32,564 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-18 11:40:32,564 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-18 11:40:32,564 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-18 11:40:32,564 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-18 11:40:32,564 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-18 11:40:32,564 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-18 11:40:32,565 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-18 11:40:32,565 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-18 11:40:32,565 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-18 11:40:32,565 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 11:40:32,565 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-18 11:40:32,565 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-18 11:40:32,565 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-18 11:40:32,565 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-18 11:40:32,565 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-18 11:40:32,566 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-18 11:40:32,566 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-18 11:40:32,566 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2022-01-18 11:40:32,566 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 11:40:32,727 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-18 11:40:32,744 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-18 11:40:32,746 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-18 11:40:32,746 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-18 11:40:32,750 INFO L275 PluginConnector]: CDTParser initialized [2022-01-18 11:40:32,751 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-min-max-1.wvr.c [2022-01-18 11:40:32,797 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70ac8d22e/5afc99444e35421abc0704712eb21c68/FLAG33172dd9a [2022-01-18 11:40:33,152 INFO L306 CDTParser]: Found 1 translation units. [2022-01-18 11:40:33,153 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-min-max-1.wvr.c [2022-01-18 11:40:33,161 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70ac8d22e/5afc99444e35421abc0704712eb21c68/FLAG33172dd9a [2022-01-18 11:40:33,171 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70ac8d22e/5afc99444e35421abc0704712eb21c68 [2022-01-18 11:40:33,173 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-18 11:40:33,174 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-18 11:40:33,175 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-18 11:40:33,175 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-18 11:40:33,177 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-18 11:40:33,178 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 11:40:33" (1/1) ... [2022-01-18 11:40:33,179 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f05a7c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 11:40:33, skipping insertion in model container [2022-01-18 11:40:33,179 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 11:40:33" (1/1) ... [2022-01-18 11:40:33,183 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-18 11:40:33,201 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-18 11:40:33,355 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-min-max-1.wvr.c[3057,3070] [2022-01-18 11:40:33,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 11:40:33,367 INFO L203 MainTranslator]: Completed pre-run [2022-01-18 11:40:33,381 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-min-max-1.wvr.c[3057,3070] [2022-01-18 11:40:33,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 11:40:33,392 INFO L208 MainTranslator]: Completed translation [2022-01-18 11:40:33,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 11:40:33 WrapperNode [2022-01-18 11:40:33,393 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-18 11:40:33,393 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-18 11:40:33,394 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-18 11:40:33,394 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-18 11:40:33,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 11:40:33" (1/1) ... [2022-01-18 11:40:33,403 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 11:40:33" (1/1) ... [2022-01-18 11:40:33,417 INFO L137 Inliner]: procedures = 25, calls = 53, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2022-01-18 11:40:33,417 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-18 11:40:33,418 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-18 11:40:33,418 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-18 11:40:33,418 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-18 11:40:33,424 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 11:40:33" (1/1) ... [2022-01-18 11:40:33,425 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 11:40:33" (1/1) ... [2022-01-18 11:40:33,427 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 11:40:33" (1/1) ... [2022-01-18 11:40:33,427 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 11:40:33" (1/1) ... [2022-01-18 11:40:33,432 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 11:40:33" (1/1) ... [2022-01-18 11:40:33,435 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 11:40:33" (1/1) ... [2022-01-18 11:40:33,436 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 11:40:33" (1/1) ... [2022-01-18 11:40:33,438 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-18 11:40:33,439 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-18 11:40:33,439 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-18 11:40:33,439 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-18 11:40:33,440 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 11:40:33" (1/1) ... [2022-01-18 11:40:33,451 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 11:40:33,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 11:40:33,466 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 11:40:33,483 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 11:40:33,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-18 11:40:33,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-18 11:40:33,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-18 11:40:33,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-18 11:40:33,498 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-18 11:40:33,499 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-18 11:40:33,499 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-18 11:40:33,499 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-18 11:40:33,499 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-01-18 11:40:33,499 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-01-18 11:40:33,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-18 11:40:33,499 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-18 11:40:33,499 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-18 11:40:33,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-18 11:40:33,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-18 11:40:33,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-18 11:40:33,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-18 11:40:33,500 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 11:40:33,586 INFO L234 CfgBuilder]: Building ICFG [2022-01-18 11:40:33,587 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-18 11:40:33,812 INFO L275 CfgBuilder]: Performing block encoding [2022-01-18 11:40:33,865 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-18 11:40:33,865 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-18 11:40:33,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 11:40:33 BoogieIcfgContainer [2022-01-18 11:40:33,867 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-18 11:40:33,868 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-18 11:40:33,868 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-18 11:40:33,870 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-18 11:40:33,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.01 11:40:33" (1/3) ... [2022-01-18 11:40:33,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c392f7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 11:40:33, skipping insertion in model container [2022-01-18 11:40:33,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 11:40:33" (2/3) ... [2022-01-18 11:40:33,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c392f7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 11:40:33, skipping insertion in model container [2022-01-18 11:40:33,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 11:40:33" (3/3) ... [2022-01-18 11:40:33,872 INFO L111 eAbstractionObserver]: Analyzing ICFG parallel-min-max-1.wvr.c [2022-01-18 11:40:33,876 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-01-18 11:40:33,876 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-18 11:40:33,876 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-18 11:40:33,876 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-18 11:40:33,925 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,925 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,925 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,926 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,926 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,926 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,926 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,927 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,928 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,928 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,928 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,928 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,928 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,928 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,929 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,929 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,929 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,930 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,930 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,930 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,930 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,930 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,932 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,932 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,932 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,933 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,933 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,933 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,933 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,933 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,933 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,933 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,934 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,934 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,934 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,934 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,934 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,934 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,934 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,936 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,936 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,937 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,937 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,937 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,937 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,937 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,937 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,937 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,937 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,938 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,938 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,938 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,939 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,939 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,939 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,940 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,940 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,940 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,940 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,940 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,941 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,941 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,941 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,941 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,944 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,944 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,945 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,945 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,948 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,948 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,948 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,949 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,949 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,949 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,949 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,949 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,950 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,950 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,951 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,951 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,951 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,951 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,951 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,951 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,952 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,953 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:40:33,963 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-01-18 11:40:34,009 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-18 11:40:34,014 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 11:40:34,014 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-18 11:40:34,027 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 174 places, 176 transitions, 376 flow [2022-01-18 11:40:34,146 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2978 states, 2977 states have (on average 3.3879744709439032) internal successors, (10086), 2977 states have internal predecessors, (10086), 0 states have call successors, (0), 0 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 11:40:34,154 INFO L276 IsEmpty]: Start isEmpty. Operand has 2978 states, 2977 states have (on average 3.3879744709439032) internal successors, (10086), 2977 states have internal predecessors, (10086), 0 states have call successors, (0), 0 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 11:40:34,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-01-18 11:40:34,195 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 11:40:34,196 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 11:40:34,197 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 11:40:34,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 11:40:34,203 INFO L85 PathProgramCache]: Analyzing trace with hash -320260898, now seen corresponding path program 1 times [2022-01-18 11:40:34,209 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 11:40:34,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923438693] [2022-01-18 11:40:34,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 11:40:34,211 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 11:40:34,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 11:40:34,434 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 11:40:34,435 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 11:40:34,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923438693] [2022-01-18 11:40:34,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923438693] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 11:40:34,435 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 11:40:34,435 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-18 11:40:34,436 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895214050] [2022-01-18 11:40:34,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 11:40:34,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-18 11:40:34,440 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 11:40:34,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-18 11:40:34,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-18 11:40:34,470 INFO L87 Difference]: Start difference. First operand has 2978 states, 2977 states have (on average 3.3879744709439032) internal successors, (10086), 2977 states have internal predecessors, (10086), 0 states have call successors, (0), 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 64.5) internal successors, (129), 2 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 11:40:34,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 11:40:34,524 INFO L93 Difference]: Finished difference Result 2978 states and 9578 transitions. [2022-01-18 11:40:34,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-18 11:40:34,529 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 64.5) internal successors, (129), 2 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 129 [2022-01-18 11:40:34,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 11:40:34,575 INFO L225 Difference]: With dead ends: 2978 [2022-01-18 11:40:34,575 INFO L226 Difference]: Without dead ends: 2973 [2022-01-18 11:40:34,576 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 11:40:34,583 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 11:40:34,584 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 11:40:34,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2973 states. [2022-01-18 11:40:34,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2973 to 2973. [2022-01-18 11:40:34,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2973 states, 2972 states have (on average 3.221063257065949) internal successors, (9573), 2972 states have internal predecessors, (9573), 0 states have call successors, (0), 0 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 11:40:34,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2973 states to 2973 states and 9573 transitions. [2022-01-18 11:40:34,716 INFO L78 Accepts]: Start accepts. Automaton has 2973 states and 9573 transitions. Word has length 129 [2022-01-18 11:40:34,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 11:40:34,717 INFO L470 AbstractCegarLoop]: Abstraction has 2973 states and 9573 transitions. [2022-01-18 11:40:34,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 64.5) internal successors, (129), 2 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 11:40:34,717 INFO L276 IsEmpty]: Start isEmpty. Operand 2973 states and 9573 transitions. [2022-01-18 11:40:34,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-01-18 11:40:34,726 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 11:40:34,727 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 11:40:34,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-18 11:40:34,728 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 11:40:34,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 11:40:34,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1837938339, now seen corresponding path program 1 times [2022-01-18 11:40:34,729 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 11:40:34,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766584948] [2022-01-18 11:40:34,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 11:40:34,730 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 11:40:34,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 11:40:34,982 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 11:40:34,982 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 11:40:34,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766584948] [2022-01-18 11:40:34,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766584948] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 11:40:34,984 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 11:40:34,984 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-18 11:40:34,985 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444107333] [2022-01-18 11:40:34,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 11:40:34,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-18 11:40:34,986 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 11:40:34,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-18 11:40:34,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-18 11:40:34,987 INFO L87 Difference]: Start difference. First operand 2973 states and 9573 transitions. Second operand has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 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 11:40:35,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 11:40:35,089 INFO L93 Difference]: Finished difference Result 3965 states and 12877 transitions. [2022-01-18 11:40:35,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-18 11:40:35,089 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 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 129 [2022-01-18 11:40:35,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 11:40:35,109 INFO L225 Difference]: With dead ends: 3965 [2022-01-18 11:40:35,109 INFO L226 Difference]: Without dead ends: 3965 [2022-01-18 11:40:35,112 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-01-18 11:40:35,113 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 200 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 11:40:35,113 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 340 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 11:40:35,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3965 states. [2022-01-18 11:40:35,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3965 to 3221. [2022-01-18 11:40:35,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3221 states, 3220 states have (on average 3.2295031055900623) internal successors, (10399), 3220 states have internal predecessors, (10399), 0 states have call successors, (0), 0 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 11:40:35,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3221 states to 3221 states and 10399 transitions. [2022-01-18 11:40:35,208 INFO L78 Accepts]: Start accepts. Automaton has 3221 states and 10399 transitions. Word has length 129 [2022-01-18 11:40:35,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 11:40:35,209 INFO L470 AbstractCegarLoop]: Abstraction has 3221 states and 10399 transitions. [2022-01-18 11:40:35,210 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 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 11:40:35,210 INFO L276 IsEmpty]: Start isEmpty. Operand 3221 states and 10399 transitions. [2022-01-18 11:40:35,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-01-18 11:40:35,218 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 11:40:35,218 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 11:40:35,218 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-18 11:40:35,218 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 11:40:35,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 11:40:35,219 INFO L85 PathProgramCache]: Analyzing trace with hash 977343973, now seen corresponding path program 1 times [2022-01-18 11:40:35,219 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 11:40:35,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895393661] [2022-01-18 11:40:35,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 11:40:35,219 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 11:40:35,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 11:40:35,348 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 11:40:35,349 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 11:40:35,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895393661] [2022-01-18 11:40:35,349 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895393661] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 11:40:35,349 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 11:40:35,349 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-18 11:40:35,349 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601358731] [2022-01-18 11:40:35,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 11:40:35,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 11:40:35,350 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 11:40:35,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 11:40:35,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-18 11:40:35,351 INFO L87 Difference]: Start difference. First operand 3221 states and 10399 transitions. Second operand has 7 states, 7 states have (on average 19.142857142857142) internal successors, (134), 7 states have internal predecessors, (134), 0 states have call successors, (0), 0 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 11:40:35,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 11:40:35,478 INFO L93 Difference]: Finished difference Result 4240 states and 13484 transitions. [2022-01-18 11:40:35,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-18 11:40:35,479 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.142857142857142) internal successors, (134), 7 states have internal predecessors, (134), 0 states have call successors, (0), 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 134 [2022-01-18 11:40:35,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 11:40:35,495 INFO L225 Difference]: With dead ends: 4240 [2022-01-18 11:40:35,495 INFO L226 Difference]: Without dead ends: 3227 [2022-01-18 11:40:35,496 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-01-18 11:40:35,499 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 447 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 11:40:35,500 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [447 Valid, 537 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 11:40:35,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3227 states. [2022-01-18 11:40:35,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3227 to 3222. [2022-01-18 11:40:35,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3222 states, 3221 states have (on average 3.228810928283142) internal successors, (10400), 3221 states have internal predecessors, (10400), 0 states have call successors, (0), 0 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 11:40:35,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3222 states to 3222 states and 10400 transitions. [2022-01-18 11:40:35,665 INFO L78 Accepts]: Start accepts. Automaton has 3222 states and 10400 transitions. Word has length 134 [2022-01-18 11:40:35,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 11:40:35,665 INFO L470 AbstractCegarLoop]: Abstraction has 3222 states and 10400 transitions. [2022-01-18 11:40:35,666 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.142857142857142) internal successors, (134), 7 states have internal predecessors, (134), 0 states have call successors, (0), 0 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 11:40:35,666 INFO L276 IsEmpty]: Start isEmpty. Operand 3222 states and 10400 transitions. [2022-01-18 11:40:35,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-01-18 11:40:35,677 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 11:40:35,677 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 11:40:35,678 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-18 11:40:35,678 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 11:40:35,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 11:40:35,679 INFO L85 PathProgramCache]: Analyzing trace with hash -311093360, now seen corresponding path program 1 times [2022-01-18 11:40:35,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 11:40:35,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382569987] [2022-01-18 11:40:35,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 11:40:35,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 11:40:35,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 11:40:35,809 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 11:40:35,809 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 11:40:35,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382569987] [2022-01-18 11:40:35,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382569987] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 11:40:35,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111968527] [2022-01-18 11:40:35,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 11:40:35,810 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 11:40:35,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 11:40:35,824 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 11:40:35,829 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 11:40:35,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 11:40:35,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-18 11:40:35,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 11:40:36,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 11:40:36,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 11:40:36,479 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 11:40:36,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111968527] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-18 11:40:36,480 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-18 11:40:36,480 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-01-18 11:40:36,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181239588] [2022-01-18 11:40:36,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 11:40:36,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 11:40:36,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 11:40:36,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 11:40:36,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-01-18 11:40:36,481 INFO L87 Difference]: Start difference. First operand 3222 states and 10400 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 7 states have internal predecessors, (141), 0 states have call successors, (0), 0 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 11:40:36,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 11:40:36,566 INFO L93 Difference]: Finished difference Result 3498 states and 11321 transitions. [2022-01-18 11:40:36,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-18 11:40:36,566 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 7 states have internal predecessors, (141), 0 states have call successors, (0), 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 141 [2022-01-18 11:40:36,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 11:40:36,581 INFO L225 Difference]: With dead ends: 3498 [2022-01-18 11:40:36,582 INFO L226 Difference]: Without dead ends: 3498 [2022-01-18 11:40:36,582 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 274 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-01-18 11:40:36,582 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 305 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 11:40:36,583 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [305 Valid, 412 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 11:40:36,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3498 states. [2022-01-18 11:40:36,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3498 to 3498. [2022-01-18 11:40:36,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3498 states, 3497 states have (on average 3.2373462968258506) internal successors, (11321), 3497 states have internal predecessors, (11321), 0 states have call successors, (0), 0 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 11:40:36,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3498 states to 3498 states and 11321 transitions. [2022-01-18 11:40:36,665 INFO L78 Accepts]: Start accepts. Automaton has 3498 states and 11321 transitions. Word has length 141 [2022-01-18 11:40:36,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 11:40:36,666 INFO L470 AbstractCegarLoop]: Abstraction has 3498 states and 11321 transitions. [2022-01-18 11:40:36,666 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 7 states have internal predecessors, (141), 0 states have call successors, (0), 0 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 11:40:36,666 INFO L276 IsEmpty]: Start isEmpty. Operand 3498 states and 11321 transitions. [2022-01-18 11:40:36,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-01-18 11:40:36,674 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 11:40:36,674 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 11:40:36,694 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 11:40:36,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 11:40:36,888 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 11:40:36,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 11:40:36,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1001198200, now seen corresponding path program 1 times [2022-01-18 11:40:36,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 11:40:36,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420547514] [2022-01-18 11:40:36,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 11:40:36,888 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 11:40:36,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 11:40:36,982 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-18 11:40:36,983 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 11:40:36,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420547514] [2022-01-18 11:40:36,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420547514] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 11:40:36,984 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 11:40:36,984 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-18 11:40:36,984 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590923667] [2022-01-18 11:40:36,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 11:40:36,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-18 11:40:36,984 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 11:40:36,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-18 11:40:36,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-18 11:40:36,985 INFO L87 Difference]: Start difference. First operand 3498 states and 11321 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 0 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 11:40:37,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 11:40:37,082 INFO L93 Difference]: Finished difference Result 3503 states and 11325 transitions. [2022-01-18 11:40:37,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-18 11:40:37,083 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 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 146 [2022-01-18 11:40:37,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 11:40:37,107 INFO L225 Difference]: With dead ends: 3503 [2022-01-18 11:40:37,108 INFO L226 Difference]: Without dead ends: 3498 [2022-01-18 11:40:37,108 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-18 11:40:37,109 INFO L933 BasicCegarLoop]: 151 mSDtfsCounter, 56 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 11:40:37,109 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 525 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 11:40:37,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3498 states. [2022-01-18 11:40:37,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3498 to 3498. [2022-01-18 11:40:37,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3498 states, 3497 states have (on average 3.2370603374320845) internal successors, (11320), 3497 states have internal predecessors, (11320), 0 states have call successors, (0), 0 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 11:40:37,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3498 states to 3498 states and 11320 transitions. [2022-01-18 11:40:37,235 INFO L78 Accepts]: Start accepts. Automaton has 3498 states and 11320 transitions. Word has length 146 [2022-01-18 11:40:37,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 11:40:37,236 INFO L470 AbstractCegarLoop]: Abstraction has 3498 states and 11320 transitions. [2022-01-18 11:40:37,236 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 0 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 11:40:37,236 INFO L276 IsEmpty]: Start isEmpty. Operand 3498 states and 11320 transitions. [2022-01-18 11:40:37,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-01-18 11:40:37,244 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 11:40:37,244 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 11:40:37,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-18 11:40:37,244 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 11:40:37,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 11:40:37,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1800374473, now seen corresponding path program 1 times [2022-01-18 11:40:37,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 11:40:37,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506954104] [2022-01-18 11:40:37,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 11:40:37,245 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 11:40:37,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 11:40:37,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 11:40:37,440 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 11:40:37,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506954104] [2022-01-18 11:40:37,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506954104] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 11:40:37,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276078016] [2022-01-18 11:40:37,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 11:40:37,441 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 11:40:37,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 11:40:37,442 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 11:40:37,443 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 11:40:37,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 11:40:37,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 44 conjunts are in the unsatisfiable core [2022-01-18 11:40:37,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 11:40:37,893 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 11 treesize of output 7 [2022-01-18 11:40:38,092 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 11:40:38,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 11:40:38,227 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 11:40:38,310 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 15 treesize of output 7 [2022-01-18 11:40:38,385 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 11:40:38,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 11:40:38,590 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_126 (Array Int Int))) (<= c_~min~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_126) c_~A~0.base) c_~A~0.offset))) is different from false [2022-01-18 11:40:38,818 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_126 (Array Int Int))) (<= (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_126) c_~A~0.base) c_~A~0.offset))) is different from false [2022-01-18 11:40:38,828 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_126 (Array Int Int)) (v_ArrVal_125 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_125))) (<= (select (select .cse0 c_~A~0.base) c_~A~0.offset) (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_126) c_~A~0.base) c_~A~0.offset)))) is different from false [2022-01-18 11:40:38,910 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_126 (Array Int Int)) (v_ArrVal_125 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_125))) (<= (select (select .cse0 |c_ULTIMATE.start_main_#t~ret17#1.base|) |c_ULTIMATE.start_main_#t~ret17#1.offset|) (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_126) |c_ULTIMATE.start_main_#t~ret17#1.base|) |c_ULTIMATE.start_main_#t~ret17#1.offset|)))) is different from false [2022-01-18 11:40:38,919 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_126 (Array Int Int)) (v_ArrVal_125 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_125))) (<= (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_126) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) is different from false [2022-01-18 11:40:38,925 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_126 (Array Int Int)) (v_ArrVal_125 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_125))) (<= (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_126) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) is different from false [2022-01-18 11:40:38,954 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 11:40:38,955 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 44 treesize of output 33 [2022-01-18 11:40:38,959 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 246 treesize of output 214 [2022-01-18 11:40:38,964 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 73 treesize of output 63 [2022-01-18 11:40:38,969 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 46 treesize of output 42 [2022-01-18 11:40:39,085 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 11:40:39,085 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276078016] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 11:40:39,085 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 11:40:39,085 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20, 20] total 43 [2022-01-18 11:40:39,085 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128639998] [2022-01-18 11:40:39,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 11:40:39,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-01-18 11:40:39,086 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 11:40:39,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-01-18 11:40:39,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1189, Unknown=14, NotChecked=450, Total=1806 [2022-01-18 11:40:39,087 INFO L87 Difference]: Start difference. First operand 3498 states and 11320 transitions. Second operand has 43 states, 43 states have (on average 8.767441860465116) internal successors, (377), 43 states have internal predecessors, (377), 0 states have call successors, (0), 0 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 11:40:41,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 11:40:41,323 INFO L93 Difference]: Finished difference Result 16504 states and 54027 transitions. [2022-01-18 11:40:41,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-01-18 11:40:41,323 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 8.767441860465116) internal successors, (377), 43 states have internal predecessors, (377), 0 states have call successors, (0), 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 148 [2022-01-18 11:40:41,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 11:40:41,350 INFO L225 Difference]: With dead ends: 16504 [2022-01-18 11:40:41,350 INFO L226 Difference]: Without dead ends: 8839 [2022-01-18 11:40:41,351 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 276 SyntacticMatches, 19 SemanticMatches, 78 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1748 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1041, Invalid=4371, Unknown=14, NotChecked=894, Total=6320 [2022-01-18 11:40:41,352 INFO L933 BasicCegarLoop]: 242 mSDtfsCounter, 1758 mSDsluCounter, 4310 mSDsCounter, 0 mSdLazyCounter, 1302 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1758 SdHoareTripleChecker+Valid, 4256 SdHoareTripleChecker+Invalid, 4064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2656 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-18 11:40:41,352 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1758 Valid, 4256 Invalid, 4064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1302 Invalid, 0 Unknown, 2656 Unchecked, 0.6s Time] [2022-01-18 11:40:41,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8839 states. [2022-01-18 11:40:41,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8839 to 3840. [2022-01-18 11:40:41,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3840 states, 3839 states have (on average 3.206564209429539) internal successors, (12310), 3839 states have internal predecessors, (12310), 0 states have call successors, (0), 0 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 11:40:41,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3840 states to 3840 states and 12310 transitions. [2022-01-18 11:40:41,521 INFO L78 Accepts]: Start accepts. Automaton has 3840 states and 12310 transitions. Word has length 148 [2022-01-18 11:40:41,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 11:40:41,522 INFO L470 AbstractCegarLoop]: Abstraction has 3840 states and 12310 transitions. [2022-01-18 11:40:41,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 8.767441860465116) internal successors, (377), 43 states have internal predecessors, (377), 0 states have call successors, (0), 0 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 11:40:41,522 INFO L276 IsEmpty]: Start isEmpty. Operand 3840 states and 12310 transitions. [2022-01-18 11:40:41,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-01-18 11:40:41,531 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 11:40:41,531 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 11:40:41,550 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 11:40:41,735 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,SelfDestructingSolverStorable5 [2022-01-18 11:40:41,736 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 11:40:41,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 11:40:41,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1980197353, now seen corresponding path program 2 times [2022-01-18 11:40:41,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 11:40:41,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864659499] [2022-01-18 11:40:41,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 11:40:41,737 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 11:40:41,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 11:40:41,969 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 11:40:41,970 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 11:40:41,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864659499] [2022-01-18 11:40:41,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864659499] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 11:40:41,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178803698] [2022-01-18 11:40:41,970 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 11:40:41,970 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 11:40:41,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 11:40:41,980 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 11:40:41,981 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 11:40:42,065 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 11:40:42,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 11:40:42,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 39 conjunts are in the unsatisfiable core [2022-01-18 11:40:42,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 11:40:42,467 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 11 treesize of output 7 [2022-01-18 11:40:42,671 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 11:40:42,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 11:40:42,855 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 11:40:42,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 11:40:42,907 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 11:40:42,977 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 15 treesize of output 7 [2022-01-18 11:40:43,047 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 11:40:43,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 11:40:43,264 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_163 (Array Int Int))) (<= c_~min~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_163) c_~A~0.base) c_~A~0.offset))) is different from false [2022-01-18 11:40:43,282 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_162 (Array Int Int)) (v_ArrVal_163 (Array Int Int))) (<= c_~min~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_162) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_163) c_~A~0.base) c_~A~0.offset))) is different from false [2022-01-18 11:40:43,334 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((thread1Thread1of1ForFork0_~i~0 Int) (v_ArrVal_162 (Array Int Int)) (v_ArrVal_163 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (or (< c_~min~0 .cse0) (<= .cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_162) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_163) c_~A~0.base) c_~A~0.offset))))) (or (forall ((v_ArrVal_162 (Array Int Int)) (v_ArrVal_163 (Array Int Int))) (<= c_~min~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_162) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_163) c_~A~0.base) c_~A~0.offset))) (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (not (< c_~min~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))))))) is different from false [2022-01-18 11:40:43,436 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((thread1Thread1of1ForFork0_~i~0 Int) (v_ArrVal_162 (Array Int Int)) (v_ArrVal_163 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| c_~A~0.base))) (let ((.cse0 (select .cse1 (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (or (<= .cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_162) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_163) c_~A~0.base) c_~A~0.offset)) (< (select .cse1 c_~A~0.offset) .cse0))))) (forall ((thread1Thread1of1ForFork0_~i~0 Int) (v_ArrVal_162 (Array Int Int)) (v_ArrVal_163 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| c_~A~0.base)) (.cse3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_162) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_163) c_~A~0.base) c_~A~0.offset))) (or (<= (select .cse2 c_~A~0.offset) .cse3) (<= (select .cse2 (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ 1 .cse3)))))) is different from false [2022-01-18 11:40:43,477 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((thread1Thread1of1ForFork0_~i~0 Int) (v_ArrVal_162 (Array Int Int)) (v_ArrVal_161 (Array Int Int)) (v_ArrVal_163 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_161))) (let ((.cse0 (select .cse2 c_~A~0.base)) (.cse1 (select (select (store (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_162) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_163) c_~A~0.base) c_~A~0.offset))) (or (<= (select .cse0 c_~A~0.offset) .cse1) (<= (select .cse0 (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ .cse1 1)))))) (forall ((thread1Thread1of1ForFork0_~i~0 Int) (v_ArrVal_162 (Array Int Int)) (v_ArrVal_161 (Array Int Int)) (v_ArrVal_163 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_161))) (let ((.cse3 (select .cse5 c_~A~0.base))) (let ((.cse4 (select .cse3 (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (or (< (select .cse3 c_~A~0.offset) .cse4) (<= .cse4 (select (select (store (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_162) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_163) c_~A~0.base) c_~A~0.offset)))))))) is different from false [2022-01-18 11:40:43,763 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((thread1Thread1of1ForFork0_~i~0 Int) (v_ArrVal_162 (Array Int Int)) (v_ArrVal_161 (Array Int Int)) (v_ArrVal_163 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_161))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_#t~ret17#1.base|))) (let ((.cse0 (select .cse2 (+ |c_ULTIMATE.start_main_#t~ret17#1.offset| (* thread1Thread1of1ForFork0_~i~0 4))))) (or (<= .cse0 (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_162) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_#t~ret17#1.base|) |c_ULTIMATE.start_main_#t~ret17#1.offset|)) (< (select .cse2 |c_ULTIMATE.start_main_#t~ret17#1.offset|) .cse0)))))) (forall ((thread1Thread1of1ForFork0_~i~0 Int) (v_ArrVal_162 (Array Int Int)) (v_ArrVal_161 (Array Int Int)) (v_ArrVal_163 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_161))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_#t~ret17#1.base|)) (.cse4 (select (select (store (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_162) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_#t~ret17#1.base|) |c_ULTIMATE.start_main_#t~ret17#1.offset|))) (or (<= (select .cse3 |c_ULTIMATE.start_main_#t~ret17#1.offset|) .cse4) (<= (select .cse3 (+ |c_ULTIMATE.start_main_#t~ret17#1.offset| (* thread1Thread1of1ForFork0_~i~0 4))) (+ .cse4 1))))))) is different from false [2022-01-18 11:40:43,799 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((thread1Thread1of1ForFork0_~i~0 Int) (v_ArrVal_162 (Array Int Int)) (v_ArrVal_161 (Array Int Int)) (v_ArrVal_163 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_161))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (.cse1 (select (select (store (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_162) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (<= (select .cse0 (+ (* thread1Thread1of1ForFork0_~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (+ .cse1 1)) (<= (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) .cse1))))) (forall ((thread1Thread1of1ForFork0_~i~0 Int) (v_ArrVal_162 (Array Int Int)) (v_ArrVal_161 (Array Int Int)) (v_ArrVal_163 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_161))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse4 (select .cse3 (+ (* thread1Thread1of1ForFork0_~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (< (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) .cse4) (<= .cse4 (select (select (store (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_162) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))))))) is different from false [2022-01-18 11:40:43,819 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((thread1Thread1of1ForFork0_~i~0 Int) (v_ArrVal_162 (Array Int Int)) (v_ArrVal_161 (Array Int Int)) (v_ArrVal_163 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_161))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse0 (select .cse2 (+ (* thread1Thread1of1ForFork0_~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (<= .cse0 (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_162) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) .cse0)))))) (forall ((thread1Thread1of1ForFork0_~i~0 Int) (v_ArrVal_162 (Array Int Int)) (v_ArrVal_161 (Array Int Int)) (v_ArrVal_163 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_161))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse4 (select (select (store (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_162) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (<= (select .cse3 (+ (* thread1Thread1of1ForFork0_~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (+ .cse4 1)) (<= (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) .cse4)))))) is different from false [2022-01-18 11:40:43,932 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 11:40:43,932 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 97 treesize of output 61 [2022-01-18 11:40:43,946 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 11:40:43,946 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 737 treesize of output 593 [2022-01-18 11:40:43,956 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 11:40:43,956 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 573 treesize of output 473 [2022-01-18 11:40:43,969 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 454 treesize of output 422 [2022-01-18 11:40:43,977 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 422 treesize of output 406 [2022-01-18 11:40:44,360 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-01-18 11:40:44,361 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 1 [2022-01-18 11:40:44,574 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-01-18 11:40:44,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178803698] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 11:40:44,575 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 11:40:44,575 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 21, 21] total 44 [2022-01-18 11:40:44,575 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216306854] [2022-01-18 11:40:44,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 11:40:44,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-01-18 11:40:44,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 11:40:44,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-01-18 11:40:44,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1146, Unknown=8, NotChecked=600, Total=1892 [2022-01-18 11:40:44,577 INFO L87 Difference]: Start difference. First operand 3840 states and 12310 transitions. Second operand has 44 states, 44 states have (on average 8.590909090909092) internal successors, (378), 44 states have internal predecessors, (378), 0 states have call successors, (0), 0 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 11:40:46,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 11:40:46,323 INFO L93 Difference]: Finished difference Result 12029 states and 40026 transitions. [2022-01-18 11:40:46,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-01-18 11:40:46,324 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 8.590909090909092) internal successors, (378), 44 states have internal predecessors, (378), 0 states have call successors, (0), 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 148 [2022-01-18 11:40:46,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 11:40:46,345 INFO L225 Difference]: With dead ends: 12029 [2022-01-18 11:40:46,345 INFO L226 Difference]: Without dead ends: 7673 [2022-01-18 11:40:46,346 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 272 SyntacticMatches, 6 SemanticMatches, 70 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 801 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=939, Invalid=3117, Unknown=8, NotChecked=1048, Total=5112 [2022-01-18 11:40:46,347 INFO L933 BasicCegarLoop]: 220 mSDtfsCounter, 1427 mSDsluCounter, 3100 mSDsCounter, 0 mSdLazyCounter, 984 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1427 SdHoareTripleChecker+Valid, 3149 SdHoareTripleChecker+Invalid, 2988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1926 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-18 11:40:46,347 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1427 Valid, 3149 Invalid, 2988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 984 Invalid, 0 Unknown, 1926 Unchecked, 0.5s Time] [2022-01-18 11:40:46,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7673 states. [2022-01-18 11:40:46,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7673 to 3724. [2022-01-18 11:40:46,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3724 states, 3723 states have (on average 3.1796937953263495) internal successors, (11838), 3723 states have internal predecessors, (11838), 0 states have call successors, (0), 0 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 11:40:46,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3724 states to 3724 states and 11838 transitions. [2022-01-18 11:40:46,479 INFO L78 Accepts]: Start accepts. Automaton has 3724 states and 11838 transitions. Word has length 148 [2022-01-18 11:40:46,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 11:40:46,480 INFO L470 AbstractCegarLoop]: Abstraction has 3724 states and 11838 transitions. [2022-01-18 11:40:46,480 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 8.590909090909092) internal successors, (378), 44 states have internal predecessors, (378), 0 states have call successors, (0), 0 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 11:40:46,480 INFO L276 IsEmpty]: Start isEmpty. Operand 3724 states and 11838 transitions. [2022-01-18 11:40:46,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-01-18 11:40:46,487 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 11:40:46,487 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 11:40:46,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-01-18 11:40:46,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 11:40:46,706 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 11:40:46,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 11:40:46,707 INFO L85 PathProgramCache]: Analyzing trace with hash -341123613, now seen corresponding path program 3 times [2022-01-18 11:40:46,707 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 11:40:46,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057325917] [2022-01-18 11:40:46,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 11:40:46,707 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 11:40:46,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 11:40:46,894 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 11:40:46,895 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 11:40:46,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057325917] [2022-01-18 11:40:46,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057325917] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 11:40:46,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359518965] [2022-01-18 11:40:46,895 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-18 11:40:46,895 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 11:40:46,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 11:40:46,898 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 11:40:46,900 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 11:40:47,014 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-18 11:40:47,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 11:40:47,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-18 11:40:47,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 11:40:47,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 11:40:47,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 11:40:47,424 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 11:40:47,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359518965] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 11:40:47,425 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 11:40:47,425 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2022-01-18 11:40:47,425 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312091221] [2022-01-18 11:40:47,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 11:40:47,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-18 11:40:47,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 11:40:47,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-18 11:40:47,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-01-18 11:40:47,426 INFO L87 Difference]: Start difference. First operand 3724 states and 11838 transitions. Second operand has 13 states, 13 states have (on average 17.46153846153846) internal successors, (227), 13 states have internal predecessors, (227), 0 states have call successors, (0), 0 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 11:40:47,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 11:40:47,607 INFO L93 Difference]: Finished difference Result 5269 states and 17019 transitions. [2022-01-18 11:40:47,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-18 11:40:47,607 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 17.46153846153846) internal successors, (227), 13 states have internal predecessors, (227), 0 states have call successors, (0), 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 148 [2022-01-18 11:40:47,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 11:40:47,615 INFO L225 Difference]: With dead ends: 5269 [2022-01-18 11:40:47,616 INFO L226 Difference]: Without dead ends: 3239 [2022-01-18 11:40:47,616 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 291 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2022-01-18 11:40:47,616 INFO L933 BasicCegarLoop]: 156 mSDtfsCounter, 262 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 11:40:47,616 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [262 Valid, 1121 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 11:40:47,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3239 states. [2022-01-18 11:40:47,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3239 to 3239. [2022-01-18 11:40:47,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3239 states, 3238 states have (on average 3.194564546016059) internal successors, (10344), 3238 states have internal predecessors, (10344), 0 states have call successors, (0), 0 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 11:40:47,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3239 states to 3239 states and 10344 transitions. [2022-01-18 11:40:47,671 INFO L78 Accepts]: Start accepts. Automaton has 3239 states and 10344 transitions. Word has length 148 [2022-01-18 11:40:47,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 11:40:47,671 INFO L470 AbstractCegarLoop]: Abstraction has 3239 states and 10344 transitions. [2022-01-18 11:40:47,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 17.46153846153846) internal successors, (227), 13 states have internal predecessors, (227), 0 states have call successors, (0), 0 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 11:40:47,671 INFO L276 IsEmpty]: Start isEmpty. Operand 3239 states and 10344 transitions. [2022-01-18 11:40:47,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-01-18 11:40:47,677 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 11:40:47,677 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 11:40:47,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-01-18 11:40:47,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 11:40:47,893 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 11:40:47,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 11:40:47,894 INFO L85 PathProgramCache]: Analyzing trace with hash 292214987, now seen corresponding path program 4 times [2022-01-18 11:40:47,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 11:40:47,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557916642] [2022-01-18 11:40:47,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 11:40:47,894 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 11:40:47,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 11:40:47,976 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 11:40:47,976 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 11:40:47,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557916642] [2022-01-18 11:40:47,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557916642] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 11:40:47,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924750128] [2022-01-18 11:40:47,976 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-18 11:40:47,976 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 11:40:47,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 11:40:47,988 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 11:40:47,989 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 11:40:48,062 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-18 11:40:48,062 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 11:40:48,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 44 conjunts are in the unsatisfiable core [2022-01-18 11:40:48,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 11:40:48,290 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 11 treesize of output 7 [2022-01-18 11:40:48,409 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 11:40:48,447 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 11:40:48,636 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 15 treesize of output 7 [2022-01-18 11:40:48,745 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 11:40:48,746 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 11:40:49,355 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 11:40:49,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924750128] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 11:40:49,355 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 11:40:49,355 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 22, 11] total 32 [2022-01-18 11:40:49,356 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983109433] [2022-01-18 11:40:49,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 11:40:49,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-18 11:40:49,356 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 11:40:49,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-18 11:40:49,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=838, Unknown=0, NotChecked=0, Total=992 [2022-01-18 11:40:49,357 INFO L87 Difference]: Start difference. First operand 3239 states and 10344 transitions. Second operand has 32 states, 32 states have (on average 9.8125) internal successors, (314), 32 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 11:40:52,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 11:40:52,426 INFO L93 Difference]: Finished difference Result 24288 states and 80709 transitions. [2022-01-18 11:40:52,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-01-18 11:40:52,426 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 9.8125) internal successors, (314), 32 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2022-01-18 11:40:52,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 11:40:52,454 INFO L225 Difference]: With dead ends: 24288 [2022-01-18 11:40:52,454 INFO L226 Difference]: Without dead ends: 10564 [2022-01-18 11:40:52,456 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2279 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2127, Invalid=6803, Unknown=0, NotChecked=0, Total=8930 [2022-01-18 11:40:52,457 INFO L933 BasicCegarLoop]: 325 mSDtfsCounter, 1846 mSDsluCounter, 4191 mSDsCounter, 0 mSdLazyCounter, 2158 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1846 SdHoareTripleChecker+Valid, 4155 SdHoareTripleChecker+Invalid, 2316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 2158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-18 11:40:52,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1846 Valid, 4155 Invalid, 2316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 2158 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-18 11:40:52,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10564 states. [2022-01-18 11:40:52,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10564 to 3179. [2022-01-18 11:40:52,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3179 states, 3178 states have (on average 3.196035242290749) internal successors, (10157), 3178 states have internal predecessors, (10157), 0 states have call successors, (0), 0 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 11:40:52,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3179 states to 3179 states and 10157 transitions. [2022-01-18 11:40:52,620 INFO L78 Accepts]: Start accepts. Automaton has 3179 states and 10157 transitions. Word has length 148 [2022-01-18 11:40:52,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 11:40:52,620 INFO L470 AbstractCegarLoop]: Abstraction has 3179 states and 10157 transitions. [2022-01-18 11:40:52,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 9.8125) internal successors, (314), 32 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 11:40:52,620 INFO L276 IsEmpty]: Start isEmpty. Operand 3179 states and 10157 transitions. [2022-01-18 11:40:52,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-01-18 11:40:52,627 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 11:40:52,627 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 11:40:52,647 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 11:40:52,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 11:40:52,844 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 11:40:52,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 11:40:52,845 INFO L85 PathProgramCache]: Analyzing trace with hash 304969057, now seen corresponding path program 5 times [2022-01-18 11:40:52,845 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 11:40:52,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31212378] [2022-01-18 11:40:52,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 11:40:52,845 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 11:40:52,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 11:40:53,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 11:40:53,198 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 11:40:53,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31212378] [2022-01-18 11:40:53,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31212378] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 11:40:53,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919305585] [2022-01-18 11:40:53,198 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-18 11:40:53,198 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 11:40:53,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 11:40:53,199 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 11:40:53,200 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 11:40:53,285 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 11:40:53,285 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 11:40:53,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 40 conjunts are in the unsatisfiable core [2022-01-18 11:40:53,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 11:40:53,310 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 11:40:53,369 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 11:40:53,369 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 11:40:53,742 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 11:40:53,840 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 15 treesize of output 7 [2022-01-18 11:40:53,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 11:40:53,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 11:40:54,139 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_265 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_265) c_~A~0.base) c_~A~0.offset) c_~max~0)) is different from false [2022-01-18 11:40:54,317 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 18 treesize of output 14 [2022-01-18 11:40:54,559 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-01-18 11:40:54,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919305585] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 11:40:54,560 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 11:40:54,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18, 18] total 49 [2022-01-18 11:40:54,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451660882] [2022-01-18 11:40:54,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 11:40:54,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-01-18 11:40:54,560 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 11:40:54,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-01-18 11:40:54,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=2057, Unknown=11, NotChecked=92, Total=2352 [2022-01-18 11:40:54,562 INFO L87 Difference]: Start difference. First operand 3179 states and 10157 transitions. Second operand has 49 states, 49 states have (on average 7.836734693877551) internal successors, (384), 49 states have internal predecessors, (384), 0 states have call successors, (0), 0 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 11:40:57,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 11:40:57,045 INFO L93 Difference]: Finished difference Result 11185 states and 37067 transitions. [2022-01-18 11:40:57,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-01-18 11:40:57,045 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 7.836734693877551) internal successors, (384), 49 states have internal predecessors, (384), 0 states have call successors, (0), 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 148 [2022-01-18 11:40:57,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 11:40:57,057 INFO L225 Difference]: With dead ends: 11185 [2022-01-18 11:40:57,057 INFO L226 Difference]: Without dead ends: 4617 [2022-01-18 11:40:57,059 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 274 SyntacticMatches, 15 SemanticMatches, 91 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2213 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1691, Invalid=6674, Unknown=11, NotChecked=180, Total=8556 [2022-01-18 11:40:57,059 INFO L933 BasicCegarLoop]: 238 mSDtfsCounter, 2444 mSDsluCounter, 4528 mSDsCounter, 0 mSdLazyCounter, 2106 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2444 SdHoareTripleChecker+Valid, 4432 SdHoareTripleChecker+Invalid, 2680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 2106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 439 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-18 11:40:57,060 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2444 Valid, 4432 Invalid, 2680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 2106 Invalid, 0 Unknown, 439 Unchecked, 0.8s Time] [2022-01-18 11:40:57,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4617 states. [2022-01-18 11:40:57,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4617 to 1767. [2022-01-18 11:40:57,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1767 states, 1766 states have (on average 3.1438278595696487) internal successors, (5552), 1766 states have internal predecessors, (5552), 0 states have call successors, (0), 0 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 11:40:57,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1767 states and 5552 transitions. [2022-01-18 11:40:57,100 INFO L78 Accepts]: Start accepts. Automaton has 1767 states and 5552 transitions. Word has length 148 [2022-01-18 11:40:57,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 11:40:57,100 INFO L470 AbstractCegarLoop]: Abstraction has 1767 states and 5552 transitions. [2022-01-18 11:40:57,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 7.836734693877551) internal successors, (384), 49 states have internal predecessors, (384), 0 states have call successors, (0), 0 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 11:40:57,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 5552 transitions. [2022-01-18 11:40:57,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-01-18 11:40:57,104 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 11:40:57,104 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 11:40:57,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-18 11:40:57,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 11:40:57,311 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 11:40:57,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 11:40:57,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1792400041, now seen corresponding path program 6 times [2022-01-18 11:40:57,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 11:40:57,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242760816] [2022-01-18 11:40:57,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 11:40:57,312 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 11:40:57,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 11:40:57,505 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 11:40:57,505 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 11:40:57,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242760816] [2022-01-18 11:40:57,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242760816] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 11:40:57,505 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 11:40:57,505 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-18 11:40:57,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577313703] [2022-01-18 11:40:57,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 11:40:57,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-18 11:40:57,506 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 11:40:57,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-18 11:40:57,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-01-18 11:40:57,507 INFO L87 Difference]: Start difference. First operand 1767 states and 5552 transitions. Second operand has 12 states, 12 states have (on average 12.333333333333334) internal successors, (148), 12 states have internal predecessors, (148), 0 states have call successors, (0), 0 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 11:40:57,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 11:40:57,690 INFO L93 Difference]: Finished difference Result 1764 states and 5549 transitions. [2022-01-18 11:40:57,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-18 11:40:57,690 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 12.333333333333334) internal successors, (148), 12 states have internal predecessors, (148), 0 states have call successors, (0), 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 148 [2022-01-18 11:40:57,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 11:40:57,691 INFO L225 Difference]: With dead ends: 1764 [2022-01-18 11:40:57,691 INFO L226 Difference]: Without dead ends: 0 [2022-01-18 11:40:57,691 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2022-01-18 11:40:57,691 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 276 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 11:40:57,692 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 1093 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 11:40:57,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-18 11:40:57,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-18 11:40:57,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 11:40:57,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-18 11:40:57,692 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 148 [2022-01-18 11:40:57,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 11:40:57,692 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-18 11:40:57,692 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.333333333333334) internal successors, (148), 12 states have internal predecessors, (148), 0 states have call successors, (0), 0 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 11:40:57,692 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-18 11:40:57,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-18 11:40:57,694 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-01-18 11:40:57,694 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-01-18 11:40:57,694 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-01-18 11:40:57,694 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-01-18 11:40:57,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-18 11:40:57,696 INFO L732 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1] [2022-01-18 11:40:57,697 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-18 11:40:57,697 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-18 11:40:57,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.01 11:40:57 BasicIcfg [2022-01-18 11:40:57,699 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-18 11:40:57,699 INFO L158 Benchmark]: Toolchain (without parser) took 24525.04ms. Allocated memory was 394.3MB in the beginning and 947.9MB in the end (delta: 553.6MB). Free memory was 340.9MB in the beginning and 755.1MB in the end (delta: -414.2MB). Peak memory consumption was 141.0MB. Max. memory is 16.0GB. [2022-01-18 11:40:57,699 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 394.3MB. Free memory was 357.4MB in the beginning and 357.3MB in the end (delta: 69.5kB). There was no memory consumed. Max. memory is 16.0GB. [2022-01-18 11:40:57,699 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.64ms. Allocated memory was 394.3MB in the beginning and 499.1MB in the end (delta: 104.9MB). Free memory was 340.7MB in the beginning and 471.6MB in the end (delta: -130.9MB). Peak memory consumption was 11.0MB. Max. memory is 16.0GB. [2022-01-18 11:40:57,700 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.03ms. Allocated memory is still 499.1MB. Free memory was 471.6MB in the beginning and 469.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-18 11:40:57,700 INFO L158 Benchmark]: Boogie Preprocessor took 20.33ms. Allocated memory is still 499.1MB. Free memory was 469.5MB in the beginning and 468.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.0GB. [2022-01-18 11:40:57,700 INFO L158 Benchmark]: RCFGBuilder took 427.78ms. Allocated memory is still 499.1MB. Free memory was 468.5MB in the beginning and 446.4MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2022-01-18 11:40:57,700 INFO L158 Benchmark]: TraceAbstraction took 23831.24ms. Allocated memory was 499.1MB in the beginning and 947.9MB in the end (delta: 448.8MB). Free memory was 446.4MB in the beginning and 755.1MB in the end (delta: -308.6MB). Peak memory consumption was 141.2MB. Max. memory is 16.0GB. [2022-01-18 11:40:57,701 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 394.3MB. Free memory was 357.4MB in the beginning and 357.3MB in the end (delta: 69.5kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 217.64ms. Allocated memory was 394.3MB in the beginning and 499.1MB in the end (delta: 104.9MB). Free memory was 340.7MB in the beginning and 471.6MB in the end (delta: -130.9MB). Peak memory consumption was 11.0MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 24.03ms. Allocated memory is still 499.1MB. Free memory was 471.6MB in the beginning and 469.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 20.33ms. Allocated memory is still 499.1MB. Free memory was 469.5MB in the beginning and 468.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 427.78ms. Allocated memory is still 499.1MB. Free memory was 468.5MB in the beginning and 446.4MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * TraceAbstraction took 23831.24ms. Allocated memory was 499.1MB in the beginning and 947.9MB in the end (delta: 448.8MB). Free memory was 446.4MB in the beginning and 755.1MB in the end (delta: -308.6MB). Peak memory consumption was 141.2MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 115]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 194 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 23.7s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.1s, AutomataDifference: 10.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9021 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9021 mSDsluCounter, 20164 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 5021 IncrementalHoareTripleChecker+Unchecked, 19489 mSDsCounter, 500 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7367 IncrementalHoareTripleChecker+Invalid, 12888 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 500 mSolverCounterUnsat, 2092 mSDtfsCounter, 7367 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2129 GetRequests, 1683 SyntacticMatches, 44 SemanticMatches, 402 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 7218 ImplicationChecksByTransitivity, 8.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3840occurred in iteration=6, InterpolantAutomatonStates: 245, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 19932 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 2448 NumberOfCodeBlocks, 2443 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 3306 ConstructedInterpolants, 97 QuantifiedInterpolants, 19864 SizeOfPredicates, 125 NumberOfNonLiveVariables, 1927 ConjunctsInSsa, 185 ConjunctsInUnsatCore, 23 InterpolantComputations, 6 PerfectInterpolantSequences, 29/58 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-01-18 11:40:57,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...