/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.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bc79526 [2022-01-18 02:13:02,340 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-18 02:13:02,342 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-18 02:13:02,393 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-18 02:13:02,393 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-18 02:13:02,395 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-18 02:13:02,397 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-18 02:13:02,401 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-18 02:13:02,402 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-18 02:13:02,405 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-18 02:13:02,406 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-18 02:13:02,407 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-18 02:13:02,407 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-18 02:13:02,408 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-18 02:13:02,409 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-18 02:13:02,410 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-18 02:13:02,410 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-18 02:13:02,411 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-18 02:13:02,413 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-18 02:13:02,417 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-18 02:13:02,418 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-18 02:13:02,418 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-18 02:13:02,419 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-18 02:13:02,420 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-18 02:13:02,428 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-18 02:13:02,428 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-18 02:13:02,428 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-18 02:13:02,429 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-18 02:13:02,429 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-18 02:13:02,430 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-18 02:13:02,430 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-18 02:13:02,430 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-18 02:13:02,432 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-18 02:13:02,432 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-18 02:13:02,433 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-18 02:13:02,433 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-18 02:13:02,434 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-18 02:13:02,434 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-18 02:13:02,434 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-18 02:13:02,434 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-18 02:13:02,435 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-18 02:13:02,436 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-01-18 02:13:02,464 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-18 02:13:02,464 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-18 02:13:02,465 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-18 02:13:02,465 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-18 02:13:02,465 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-18 02:13:02,466 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-18 02:13:02,466 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-18 02:13:02,466 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-18 02:13:02,466 INFO L138 SettingsManager]: * Use SBE=true [2022-01-18 02:13:02,466 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-18 02:13:02,467 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-18 02:13:02,467 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-18 02:13:02,467 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-18 02:13:02,467 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-18 02:13:02,468 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-18 02:13:02,468 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-18 02:13:02,468 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-18 02:13:02,468 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-18 02:13:02,468 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-18 02:13:02,469 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-18 02:13:02,469 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-18 02:13:02,472 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-18 02:13:02,472 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-18 02:13:02,473 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-18 02:13:02,473 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-18 02:13:02,473 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 02:13:02,473 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-18 02:13:02,473 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-18 02:13:02,473 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-18 02:13:02,473 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-18 02:13:02,473 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-18 02:13:02,473 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-18 02:13:02,473 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-18 02:13:02,473 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 02:13:02,651 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-18 02:13:02,666 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-18 02:13:02,668 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-18 02:13:02,669 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-18 02:13:02,670 INFO L275 PluginConnector]: CDTParser initialized [2022-01-18 02:13:02,670 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2022-01-18 02:13:02,713 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff46dba54/cc11cfff2e384e0eb67634142e50b049/FLAGb2f6094ab [2022-01-18 02:13:03,080 INFO L306 CDTParser]: Found 1 translation units. [2022-01-18 02:13:03,081 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2022-01-18 02:13:03,089 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff46dba54/cc11cfff2e384e0eb67634142e50b049/FLAGb2f6094ab [2022-01-18 02:13:03,101 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff46dba54/cc11cfff2e384e0eb67634142e50b049 [2022-01-18 02:13:03,103 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-18 02:13:03,105 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-18 02:13:03,107 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-18 02:13:03,107 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-18 02:13:03,109 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-18 02:13:03,109 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 02:13:03" (1/1) ... [2022-01-18 02:13:03,110 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78856760 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:13:03, skipping insertion in model container [2022-01-18 02:13:03,110 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 02:13:03" (1/1) ... [2022-01-18 02:13:03,114 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-18 02:13:03,130 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-18 02:13:03,316 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c[2924,2937] [2022-01-18 02:13:03,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 02:13:03,335 INFO L203 MainTranslator]: Completed pre-run [2022-01-18 02:13:03,374 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c[2924,2937] [2022-01-18 02:13:03,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 02:13:03,390 INFO L208 MainTranslator]: Completed translation [2022-01-18 02:13:03,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:13:03 WrapperNode [2022-01-18 02:13:03,391 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-18 02:13:03,391 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-18 02:13:03,391 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-18 02:13:03,391 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-18 02:13:03,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:13:03" (1/1) ... [2022-01-18 02:13:03,402 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:13:03" (1/1) ... [2022-01-18 02:13:03,421 INFO L137 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 191 [2022-01-18 02:13:03,421 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-18 02:13:03,422 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-18 02:13:03,422 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-18 02:13:03,422 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-18 02:13:03,427 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:13:03" (1/1) ... [2022-01-18 02:13:03,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:13:03" (1/1) ... [2022-01-18 02:13:03,430 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:13:03" (1/1) ... [2022-01-18 02:13:03,430 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:13:03" (1/1) ... [2022-01-18 02:13:03,434 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:13:03" (1/1) ... [2022-01-18 02:13:03,437 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:13:03" (1/1) ... [2022-01-18 02:13:03,438 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:13:03" (1/1) ... [2022-01-18 02:13:03,439 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-18 02:13:03,440 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-18 02:13:03,440 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-18 02:13:03,440 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-18 02:13:03,445 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:13:03" (1/1) ... [2022-01-18 02:13:03,449 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 02:13:03,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:13:03,468 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 02:13:03,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 02:13:03,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-18 02:13:03,505 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-18 02:13:03,505 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-18 02:13:03,505 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-18 02:13:03,506 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-18 02:13:03,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-18 02:13:03,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-18 02:13:03,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-18 02:13:03,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-18 02:13:03,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-18 02:13:03,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-18 02:13:03,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-18 02:13:03,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-18 02:13:03,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-18 02:13:03,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-18 02:13:03,507 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 02:13:03,614 INFO L234 CfgBuilder]: Building ICFG [2022-01-18 02:13:03,615 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-18 02:13:03,921 INFO L275 CfgBuilder]: Performing block encoding [2022-01-18 02:13:03,961 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-18 02:13:03,961 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-18 02:13:03,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 02:13:03 BoogieIcfgContainer [2022-01-18 02:13:03,963 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-18 02:13:03,964 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-18 02:13:03,964 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-18 02:13:03,969 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-18 02:13:03,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.01 02:13:03" (1/3) ... [2022-01-18 02:13:03,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79890fb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 02:13:03, skipping insertion in model container [2022-01-18 02:13:03,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:13:03" (2/3) ... [2022-01-18 02:13:03,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79890fb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 02:13:03, skipping insertion in model container [2022-01-18 02:13:03,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 02:13:03" (3/3) ... [2022-01-18 02:13:03,971 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-dec-subseq.wvr.c [2022-01-18 02:13:03,974 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-01-18 02:13:03,975 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-18 02:13:03,975 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-18 02:13:03,975 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-18 02:13:04,007 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,007 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,007 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,008 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,008 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,008 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,008 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,008 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,008 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,009 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,009 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,009 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,009 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,009 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,009 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,009 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,009 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,010 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,010 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,010 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,010 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,010 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,010 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,010 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,011 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,011 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,011 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,011 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,011 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,012 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,012 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,012 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,013 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,013 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,013 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,013 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,013 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,013 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,014 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,014 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,014 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,014 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,014 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,014 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,014 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,014 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,015 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,015 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,015 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,015 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,015 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,016 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,018 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,018 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,018 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,018 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,018 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,018 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,018 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,018 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,018 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,019 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,019 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,019 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,019 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,020 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,020 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,020 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,020 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:04,024 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-01-18 02:13:04,050 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-18 02:13:04,054 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 02:13:04,054 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-18 02:13:04,077 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 181 places, 189 transitions, 394 flow [2022-01-18 02:13:04,145 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 704 states, 703 states have (on average 2.52773826458037) internal successors, (1777), 703 states have internal predecessors, (1777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:13:04,148 INFO L276 IsEmpty]: Start isEmpty. Operand has 704 states, 703 states have (on average 2.52773826458037) internal successors, (1777), 703 states have internal predecessors, (1777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:13:04,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-18 02:13:04,169 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:13:04,170 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 02:13:04,171 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-18 02:13:04,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:13:04,178 INFO L85 PathProgramCache]: Analyzing trace with hash -7555604, now seen corresponding path program 1 times [2022-01-18 02:13:04,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:13:04,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77662363] [2022-01-18 02:13:04,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:13:04,186 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:13:04,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:13:04,399 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 02:13:04,400 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:13:04,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77662363] [2022-01-18 02:13:04,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77662363] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 02:13:04,406 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 02:13:04,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-18 02:13:04,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322841090] [2022-01-18 02:13:04,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 02:13:04,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-18 02:13:04,412 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:13:04,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-18 02:13:04,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-18 02:13:04,435 INFO L87 Difference]: Start difference. First operand has 704 states, 703 states have (on average 2.52773826458037) internal successors, (1777), 703 states have internal predecessors, (1777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 66.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:13:04,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:13:04,477 INFO L93 Difference]: Finished difference Result 704 states and 1672 transitions. [2022-01-18 02:13:04,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-18 02:13:04,480 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 66.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 132 [2022-01-18 02:13:04,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:13:04,497 INFO L225 Difference]: With dead ends: 704 [2022-01-18 02:13:04,497 INFO L226 Difference]: Without dead ends: 698 [2022-01-18 02:13:04,499 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 02:13:04,502 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 02:13:04,503 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 161 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 02:13:04,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2022-01-18 02:13:04,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 698. [2022-01-18 02:13:04,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 697 states have (on average 2.3902439024390243) internal successors, (1666), 697 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:13:04,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1666 transitions. [2022-01-18 02:13:04,574 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1666 transitions. Word has length 132 [2022-01-18 02:13:04,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:13:04,574 INFO L470 AbstractCegarLoop]: Abstraction has 698 states and 1666 transitions. [2022-01-18 02:13:04,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 66.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:13:04,575 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1666 transitions. [2022-01-18 02:13:04,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-18 02:13:04,581 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:13:04,581 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 02:13:04,581 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-18 02:13:04,582 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-18 02:13:04,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:13:04,584 INFO L85 PathProgramCache]: Analyzing trace with hash 962025419, now seen corresponding path program 1 times [2022-01-18 02:13:04,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:13:04,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702017111] [2022-01-18 02:13:04,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:13:04,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:13:04,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:13:04,830 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 02:13:04,830 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:13:04,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702017111] [2022-01-18 02:13:04,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702017111] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 02:13:04,831 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 02:13:04,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-18 02:13:04,831 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813761596] [2022-01-18 02:13:04,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 02:13:04,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-18 02:13:04,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:13:04,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-18 02:13:04,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-18 02:13:04,833 INFO L87 Difference]: Start difference. First operand 698 states and 1666 transitions. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:13:04,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:13:04,999 INFO L93 Difference]: Finished difference Result 1118 states and 2818 transitions. [2022-01-18 02:13:05,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-18 02:13:05,000 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 132 [2022-01-18 02:13:05,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:13:05,006 INFO L225 Difference]: With dead ends: 1118 [2022-01-18 02:13:05,007 INFO L226 Difference]: Without dead ends: 1118 [2022-01-18 02:13:05,010 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-01-18 02:13:05,011 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 132 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 02:13:05,011 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 431 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 02:13:05,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2022-01-18 02:13:05,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 740. [2022-01-18 02:13:05,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 739 states have (on average 2.404600811907984) internal successors, (1777), 739 states have internal predecessors, (1777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:13:05,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1777 transitions. [2022-01-18 02:13:05,038 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1777 transitions. Word has length 132 [2022-01-18 02:13:05,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:13:05,040 INFO L470 AbstractCegarLoop]: Abstraction has 740 states and 1777 transitions. [2022-01-18 02:13:05,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:13:05,041 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1777 transitions. [2022-01-18 02:13:05,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-01-18 02:13:05,046 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:13:05,046 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 02:13:05,046 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-18 02:13:05,046 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-18 02:13:05,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:13:05,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1932159763, now seen corresponding path program 1 times [2022-01-18 02:13:05,047 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:13:05,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926530994] [2022-01-18 02:13:05,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:13:05,048 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:13:05,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:13:05,180 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 02:13:05,181 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:13:05,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926530994] [2022-01-18 02:13:05,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926530994] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 02:13:05,181 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 02:13:05,182 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-18 02:13:05,182 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90059591] [2022-01-18 02:13:05,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 02:13:05,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 02:13:05,183 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:13:05,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 02:13:05,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-01-18 02:13:05,184 INFO L87 Difference]: Start difference. First operand 740 states and 1777 transitions. Second operand has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 7 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:13:05,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:13:05,311 INFO L93 Difference]: Finished difference Result 1185 states and 2913 transitions. [2022-01-18 02:13:05,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-18 02:13:05,311 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 7 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 137 [2022-01-18 02:13:05,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:13:05,322 INFO L225 Difference]: With dead ends: 1185 [2022-01-18 02:13:05,322 INFO L226 Difference]: Without dead ends: 1124 [2022-01-18 02:13:05,323 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2022-01-18 02:13:05,327 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 318 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 02:13:05,327 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [318 Valid, 484 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 02:13:05,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2022-01-18 02:13:05,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 741. [2022-01-18 02:13:05,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 740 states have (on average 2.402702702702703) internal successors, (1778), 740 states have internal predecessors, (1778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:13:05,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1778 transitions. [2022-01-18 02:13:05,346 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1778 transitions. Word has length 137 [2022-01-18 02:13:05,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:13:05,346 INFO L470 AbstractCegarLoop]: Abstraction has 741 states and 1778 transitions. [2022-01-18 02:13:05,346 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 7 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:13:05,347 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1778 transitions. [2022-01-18 02:13:05,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-01-18 02:13:05,349 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:13:05,349 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 02:13:05,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-18 02:13:05,349 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-18 02:13:05,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:13:05,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1113696768, now seen corresponding path program 1 times [2022-01-18 02:13:05,350 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:13:05,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805991116] [2022-01-18 02:13:05,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:13:05,350 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:13:05,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:13:05,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 02:13:05,416 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:13:05,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805991116] [2022-01-18 02:13:05,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805991116] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 02:13:05,416 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 02:13:05,416 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-18 02:13:05,416 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772778792] [2022-01-18 02:13:05,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 02:13:05,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-18 02:13:05,417 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:13:05,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-18 02:13:05,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-18 02:13:05,417 INFO L87 Difference]: Start difference. First operand 741 states and 1778 transitions. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:13:05,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:13:05,472 INFO L93 Difference]: Finished difference Result 1101 states and 2768 transitions. [2022-01-18 02:13:05,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-18 02:13:05,472 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2022-01-18 02:13:05,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:13:05,476 INFO L225 Difference]: With dead ends: 1101 [2022-01-18 02:13:05,477 INFO L226 Difference]: Without dead ends: 918 [2022-01-18 02:13:05,477 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 02:13:05,482 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 19 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 02:13:05,483 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 483 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 02:13:05,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2022-01-18 02:13:05,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 800. [2022-01-18 02:13:05,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 799 states have (on average 2.430538172715895) internal successors, (1942), 799 states have internal predecessors, (1942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:13:05,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1942 transitions. [2022-01-18 02:13:05,503 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1942 transitions. Word has length 144 [2022-01-18 02:13:05,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:13:05,504 INFO L470 AbstractCegarLoop]: Abstraction has 800 states and 1942 transitions. [2022-01-18 02:13:05,504 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:13:05,504 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1942 transitions. [2022-01-18 02:13:05,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-01-18 02:13:05,506 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:13:05,506 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:13:05,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-18 02:13:05,507 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-18 02:13:05,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:13:05,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1975010592, now seen corresponding path program 1 times [2022-01-18 02:13:05,507 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:13:05,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33861186] [2022-01-18 02:13:05,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:13:05,508 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:13:05,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:13:05,664 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 02:13:05,664 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:13:05,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33861186] [2022-01-18 02:13:05,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33861186] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 02:13:05,664 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 02:13:05,664 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-18 02:13:05,664 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412653545] [2022-01-18 02:13:05,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 02:13:05,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-18 02:13:05,665 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:13:05,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-18 02:13:05,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-01-18 02:13:05,666 INFO L87 Difference]: Start difference. First operand 800 states and 1942 transitions. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:13:05,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:13:05,717 INFO L93 Difference]: Finished difference Result 976 states and 2324 transitions. [2022-01-18 02:13:05,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-18 02:13:05,717 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 149 [2022-01-18 02:13:05,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:13:05,720 INFO L225 Difference]: With dead ends: 976 [2022-01-18 02:13:05,720 INFO L226 Difference]: Without dead ends: 898 [2022-01-18 02:13:05,721 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-01-18 02:13:05,721 INFO L933 BasicCegarLoop]: 170 mSDtfsCounter, 36 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 02:13:05,721 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 524 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 02:13:05,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2022-01-18 02:13:05,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 880. [2022-01-18 02:13:05,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 879 states have (on average 2.4175199089874857) internal successors, (2125), 879 states have internal predecessors, (2125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:13:05,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 2125 transitions. [2022-01-18 02:13:05,740 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 2125 transitions. Word has length 149 [2022-01-18 02:13:05,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:13:05,740 INFO L470 AbstractCegarLoop]: Abstraction has 880 states and 2125 transitions. [2022-01-18 02:13:05,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:13:05,741 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 2125 transitions. [2022-01-18 02:13:05,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-01-18 02:13:05,743 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:13:05,743 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 02:13:05,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-18 02:13:05,744 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-18 02:13:05,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:13:05,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1498906467, now seen corresponding path program 1 times [2022-01-18 02:13:05,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:13:05,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468135522] [2022-01-18 02:13:05,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:13:05,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:13:05,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:13:05,805 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 02:13:05,806 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:13:05,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468135522] [2022-01-18 02:13:05,806 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468135522] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 02:13:05,806 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 02:13:05,806 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-18 02:13:05,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096933361] [2022-01-18 02:13:05,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 02:13:05,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-18 02:13:05,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:13:05,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-18 02:13:05,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-18 02:13:05,808 INFO L87 Difference]: Start difference. First operand 880 states and 2125 transitions. Second operand has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:13:05,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:13:05,894 INFO L93 Difference]: Finished difference Result 1065 states and 2473 transitions. [2022-01-18 02:13:05,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-18 02:13:05,895 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 153 [2022-01-18 02:13:05,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:13:05,898 INFO L225 Difference]: With dead ends: 1065 [2022-01-18 02:13:05,898 INFO L226 Difference]: Without dead ends: 886 [2022-01-18 02:13:05,898 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-01-18 02:13:05,898 INFO L933 BasicCegarLoop]: 147 mSDtfsCounter, 107 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 02:13:05,899 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 632 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 02:13:05,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2022-01-18 02:13:05,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 881. [2022-01-18 02:13:05,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 880 states have (on average 2.415909090909091) internal successors, (2126), 880 states have internal predecessors, (2126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:13:05,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 2126 transitions. [2022-01-18 02:13:05,919 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 2126 transitions. Word has length 153 [2022-01-18 02:13:05,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:13:05,920 INFO L470 AbstractCegarLoop]: Abstraction has 881 states and 2126 transitions. [2022-01-18 02:13:05,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:13:05,920 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 2126 transitions. [2022-01-18 02:13:05,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-01-18 02:13:05,923 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:13:05,923 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 02:13:05,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-18 02:13:05,923 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-18 02:13:05,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:13:05,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1833342822, now seen corresponding path program 1 times [2022-01-18 02:13:05,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:13:05,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681624230] [2022-01-18 02:13:05,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:13:05,924 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:13:06,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:13:07,762 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:13:07,762 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:13:07,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681624230] [2022-01-18 02:13:07,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681624230] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:13:07,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531130704] [2022-01-18 02:13:07,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:13:07,763 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:13:07,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:13:07,764 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 02:13:07,770 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 02:13:07,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:13:07,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 56 conjunts are in the unsatisfiable core [2022-01-18 02:13:07,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:13:07,940 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 02:13:08,283 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 02:13:08,284 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 02:13:09,531 INFO L353 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-01-18 02:13:09,532 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2022-01-18 02:13:09,550 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-01-18 02:13:09,781 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 02:13:09,844 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:13:09,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:13:10,579 INFO L353 Elim1Store]: treesize reduction 23, result has 58.2 percent of original size [2022-01-18 02:13:10,580 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 68 [2022-01-18 02:13:10,584 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2022-01-18 02:13:13,148 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:13:13,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531130704] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:13:13,149 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:13:13,149 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 26, 27] total 79 [2022-01-18 02:13:13,149 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924717460] [2022-01-18 02:13:13,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:13:13,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-01-18 02:13:13,150 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:13:13,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-01-18 02:13:13,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=570, Invalid=5589, Unknown=3, NotChecked=0, Total=6162 [2022-01-18 02:13:13,152 INFO L87 Difference]: Start difference. First operand 881 states and 2126 transitions. Second operand has 79 states, 79 states have (on average 5.518987341772152) internal successors, (436), 79 states have internal predecessors, (436), 0 states have call successors, (0), 0 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 02:13:43,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:13:43,144 INFO L93 Difference]: Finished difference Result 10604 states and 27821 transitions. [2022-01-18 02:13:43,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 216 states. [2022-01-18 02:13:43,144 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 79 states have (on average 5.518987341772152) internal successors, (436), 79 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2022-01-18 02:13:43,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:13:43,177 INFO L225 Difference]: With dead ends: 10604 [2022-01-18 02:13:43,177 INFO L226 Difference]: Without dead ends: 9482 [2022-01-18 02:13:43,187 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 640 GetRequests, 313 SyntacticMatches, 51 SemanticMatches, 276 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 34991 ImplicationChecksByTransitivity, 28.0s TimeCoverageRelationStatistics Valid=8769, Invalid=68178, Unknown=59, NotChecked=0, Total=77006 [2022-01-18 02:13:43,188 INFO L933 BasicCegarLoop]: 218 mSDtfsCounter, 9161 mSDsluCounter, 11980 mSDsCounter, 0 mSdLazyCounter, 6129 mSolverCounterSat, 863 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9161 SdHoareTripleChecker+Valid, 10791 SdHoareTripleChecker+Invalid, 11303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 863 IncrementalHoareTripleChecker+Valid, 6129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4311 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-01-18 02:13:43,188 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9161 Valid, 10791 Invalid, 11303 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [863 Valid, 6129 Invalid, 0 Unknown, 4311 Unchecked, 3.6s Time] [2022-01-18 02:13:43,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9482 states. [2022-01-18 02:13:43,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9482 to 1569. [2022-01-18 02:13:43,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1569 states, 1568 states have (on average 2.403698979591837) internal successors, (3769), 1568 states have internal predecessors, (3769), 0 states have call successors, (0), 0 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 02:13:43,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 3769 transitions. [2022-01-18 02:13:43,278 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 3769 transitions. Word has length 160 [2022-01-18 02:13:43,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:13:43,278 INFO L470 AbstractCegarLoop]: Abstraction has 1569 states and 3769 transitions. [2022-01-18 02:13:43,278 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 79 states have (on average 5.518987341772152) internal successors, (436), 79 states have internal predecessors, (436), 0 states have call successors, (0), 0 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 02:13:43,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 3769 transitions. [2022-01-18 02:13:43,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-01-18 02:13:43,281 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:13:43,281 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 02:13:43,310 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 02:13:43,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:13:43,494 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-18 02:13:43,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:13:43,495 INFO L85 PathProgramCache]: Analyzing trace with hash -2000453552, now seen corresponding path program 2 times [2022-01-18 02:13:43,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:13:43,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31960811] [2022-01-18 02:13:43,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:13:43,495 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:13:43,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:13:44,738 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:13:44,739 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:13:44,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31960811] [2022-01-18 02:13:44,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31960811] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:13:44,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195428861] [2022-01-18 02:13:44,739 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 02:13:44,739 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:13:44,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:13:44,740 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 02:13:44,740 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 02:13:44,824 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 02:13:44,824 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:13:44,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 66 conjunts are in the unsatisfiable core [2022-01-18 02:13:44,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:13:44,910 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 02:13:45,366 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-18 02:13:45,367 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-18 02:13:45,949 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 02:13:45,950 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 02:13:46,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 02:13:46,606 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 02:13:46,807 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 02:13:47,367 INFO L353 Elim1Store]: treesize reduction 50, result has 5.7 percent of original size [2022-01-18 02:13:47,368 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 13 [2022-01-18 02:13:47,427 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:13:47,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:13:48,531 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:13:48,531 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 938 treesize of output 894 [2022-01-18 02:13:48,559 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:13:48,560 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 794 treesize of output 740 [2022-01-18 02:13:48,592 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:13:48,592 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 692 treesize of output 536 [2022-01-18 02:14:00,658 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-18 02:14:00,754 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:14:00,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195428861] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:14:00,754 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:14:00,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 28, 28] total 77 [2022-01-18 02:14:00,754 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214667419] [2022-01-18 02:14:00,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:14:00,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-01-18 02:14:00,755 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:14:00,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-01-18 02:14:00,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=5278, Unknown=13, NotChecked=0, Total=5852 [2022-01-18 02:14:00,756 INFO L87 Difference]: Start difference. First operand 1569 states and 3769 transitions. Second operand has 77 states, 77 states have (on average 5.675324675324675) internal successors, (437), 77 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:14:26,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:14:26,918 INFO L93 Difference]: Finished difference Result 12316 states and 32539 transitions. [2022-01-18 02:14:26,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2022-01-18 02:14:26,919 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 77 states have (on average 5.675324675324675) internal successors, (437), 77 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2022-01-18 02:14:26,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:14:26,944 INFO L225 Difference]: With dead ends: 12316 [2022-01-18 02:14:26,944 INFO L226 Difference]: Without dead ends: 10027 [2022-01-18 02:14:26,948 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 568 GetRequests, 279 SyntacticMatches, 49 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24023 ImplicationChecksByTransitivity, 26.0s TimeCoverageRelationStatistics Valid=7801, Invalid=50486, Unknown=35, NotChecked=0, Total=58322 [2022-01-18 02:14:26,948 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 8380 mSDsluCounter, 8671 mSDsCounter, 0 mSdLazyCounter, 4189 mSolverCounterSat, 872 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8380 SdHoareTripleChecker+Valid, 7931 SdHoareTripleChecker+Invalid, 8797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 872 IncrementalHoareTripleChecker+Valid, 4189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3736 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-01-18 02:14:26,948 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8380 Valid, 7931 Invalid, 8797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [872 Valid, 4189 Invalid, 0 Unknown, 3736 Unchecked, 2.5s Time] [2022-01-18 02:14:26,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10027 states. [2022-01-18 02:14:27,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10027 to 2198. [2022-01-18 02:14:27,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2198 states, 2197 states have (on average 2.470186618115612) internal successors, (5427), 2197 states have internal predecessors, (5427), 0 states have call successors, (0), 0 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 02:14:27,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2198 states to 2198 states and 5427 transitions. [2022-01-18 02:14:27,031 INFO L78 Accepts]: Start accepts. Automaton has 2198 states and 5427 transitions. Word has length 160 [2022-01-18 02:14:27,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:14:27,031 INFO L470 AbstractCegarLoop]: Abstraction has 2198 states and 5427 transitions. [2022-01-18 02:14:27,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 5.675324675324675) internal successors, (437), 77 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:14:27,032 INFO L276 IsEmpty]: Start isEmpty. Operand 2198 states and 5427 transitions. [2022-01-18 02:14:27,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-18 02:14:27,036 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:14:27,036 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 02:14:27,053 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 02:14:27,253 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-01-18 02:14:27,253 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-18 02:14:27,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:14:27,253 INFO L85 PathProgramCache]: Analyzing trace with hash -400624774, now seen corresponding path program 3 times [2022-01-18 02:14:27,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:14:27,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994500628] [2022-01-18 02:14:27,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:14:27,254 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:14:27,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:14:27,326 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 02:14:27,326 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:14:27,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994500628] [2022-01-18 02:14:27,327 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994500628] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:14:27,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599364097] [2022-01-18 02:14:27,327 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-18 02:14:27,327 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:14:27,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:14:27,344 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 02:14:27,345 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 02:14:27,444 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-18 02:14:27,444 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:14:27,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-18 02:14:27,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:14:27,693 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 02:14:27,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:14:28,120 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 02:14:28,121 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599364097] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:14:28,121 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:14:28,121 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 5] total 10 [2022-01-18 02:14:28,121 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630335700] [2022-01-18 02:14:28,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:14:28,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-18 02:14:28,121 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:14:28,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-18 02:14:28,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2022-01-18 02:14:28,122 INFO L87 Difference]: Start difference. First operand 2198 states and 5427 transitions. Second operand has 10 states, 10 states have (on average 30.1) internal successors, (301), 10 states have internal predecessors, (301), 0 states have call successors, (0), 0 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 02:14:28,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:14:28,213 INFO L93 Difference]: Finished difference Result 3996 states and 10152 transitions. [2022-01-18 02:14:28,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-18 02:14:28,214 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 30.1) internal successors, (301), 10 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2022-01-18 02:14:28,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:14:28,221 INFO L225 Difference]: With dead ends: 3996 [2022-01-18 02:14:28,221 INFO L226 Difference]: Without dead ends: 3843 [2022-01-18 02:14:28,221 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2022-01-18 02:14:28,221 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 434 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 02:14:28,222 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [434 Valid, 751 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 02:14:28,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3843 states. [2022-01-18 02:14:28,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3843 to 3226. [2022-01-18 02:14:28,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3226 states, 3225 states have (on average 2.566201550387597) internal successors, (8276), 3225 states have internal predecessors, (8276), 0 states have call successors, (0), 0 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 02:14:28,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3226 states to 3226 states and 8276 transitions. [2022-01-18 02:14:28,272 INFO L78 Accepts]: Start accepts. Automaton has 3226 states and 8276 transitions. Word has length 165 [2022-01-18 02:14:28,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:14:28,272 INFO L470 AbstractCegarLoop]: Abstraction has 3226 states and 8276 transitions. [2022-01-18 02:14:28,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 30.1) internal successors, (301), 10 states have internal predecessors, (301), 0 states have call successors, (0), 0 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 02:14:28,272 INFO L276 IsEmpty]: Start isEmpty. Operand 3226 states and 8276 transitions. [2022-01-18 02:14:28,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-01-18 02:14:28,278 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:14:28,278 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 02:14:28,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-18 02:14:28,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:14:28,488 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-18 02:14:28,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:14:28,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1626521301, now seen corresponding path program 1 times [2022-01-18 02:14:28,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:14:28,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173047362] [2022-01-18 02:14:28,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:14:28,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:14:28,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:14:28,590 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-18 02:14:28,590 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:14:28,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173047362] [2022-01-18 02:14:28,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173047362] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:14:28,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711729032] [2022-01-18 02:14:28,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:14:28,590 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:14:28,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:14:28,591 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 02:14:28,592 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 02:14:28,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:14:28,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-18 02:14:28,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:14:29,045 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-18 02:14:29,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:14:29,424 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-18 02:14:29,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711729032] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:14:29,425 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:14:29,425 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2022-01-18 02:14:29,425 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052238367] [2022-01-18 02:14:29,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:14:29,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-18 02:14:29,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:14:29,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-18 02:14:29,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2022-01-18 02:14:29,426 INFO L87 Difference]: Start difference. First operand 3226 states and 8276 transitions. Second operand has 24 states, 24 states have (on average 13.791666666666666) internal successors, (331), 24 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:14:29,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:14:29,728 INFO L93 Difference]: Finished difference Result 4076 states and 10252 transitions. [2022-01-18 02:14:29,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-18 02:14:29,728 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 13.791666666666666) internal successors, (331), 24 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 172 [2022-01-18 02:14:29,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:14:29,734 INFO L225 Difference]: With dead ends: 4076 [2022-01-18 02:14:29,734 INFO L226 Difference]: Without dead ends: 3421 [2022-01-18 02:14:29,735 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 329 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=321, Invalid=939, Unknown=0, NotChecked=0, Total=1260 [2022-01-18 02:14:29,736 INFO L933 BasicCegarLoop]: 151 mSDtfsCounter, 990 mSDsluCounter, 1308 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 990 SdHoareTripleChecker+Valid, 1398 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-18 02:14:29,736 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [990 Valid, 1398 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-18 02:14:29,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3421 states. [2022-01-18 02:14:29,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3421 to 3164. [2022-01-18 02:14:29,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3164 states, 3163 states have (on average 2.5776161871640846) internal successors, (8153), 3163 states have internal predecessors, (8153), 0 states have call successors, (0), 0 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 02:14:29,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3164 states to 3164 states and 8153 transitions. [2022-01-18 02:14:29,794 INFO L78 Accepts]: Start accepts. Automaton has 3164 states and 8153 transitions. Word has length 172 [2022-01-18 02:14:29,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:14:29,794 INFO L470 AbstractCegarLoop]: Abstraction has 3164 states and 8153 transitions. [2022-01-18 02:14:29,795 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 13.791666666666666) internal successors, (331), 24 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:14:29,795 INFO L276 IsEmpty]: Start isEmpty. Operand 3164 states and 8153 transitions. [2022-01-18 02:14:29,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-01-18 02:14:29,801 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:14:29,801 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 02:14:29,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-18 02:14:30,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:14:30,012 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-18 02:14:30,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:14:30,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1088583688, now seen corresponding path program 2 times [2022-01-18 02:14:30,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:14:30,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106702343] [2022-01-18 02:14:30,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:14:30,012 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:14:30,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:14:30,272 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-01-18 02:14:30,272 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:14:30,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106702343] [2022-01-18 02:14:30,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106702343] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 02:14:30,273 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 02:14:30,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-18 02:14:30,273 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249105501] [2022-01-18 02:14:30,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 02:14:30,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-18 02:14:30,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:14:30,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-18 02:14:30,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-01-18 02:14:30,274 INFO L87 Difference]: Start difference. First operand 3164 states and 8153 transitions. Second operand has 13 states, 13 states have (on average 12.615384615384615) internal successors, (164), 13 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:14:30,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:14:30,623 INFO L93 Difference]: Finished difference Result 3215 states and 8343 transitions. [2022-01-18 02:14:30,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-18 02:14:30,624 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 12.615384615384615) internal successors, (164), 13 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 179 [2022-01-18 02:14:30,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:14:30,629 INFO L225 Difference]: With dead ends: 3215 [2022-01-18 02:14:30,629 INFO L226 Difference]: Without dead ends: 3215 [2022-01-18 02:14:30,629 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2022-01-18 02:14:30,629 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 344 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 02:14:30,630 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [344 Valid, 928 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 02:14:30,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3215 states. [2022-01-18 02:14:30,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3215 to 2977. [2022-01-18 02:14:30,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2977 states, 2976 states have (on average 2.6011424731182795) internal successors, (7741), 2976 states have internal predecessors, (7741), 0 states have call successors, (0), 0 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 02:14:30,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2977 states to 2977 states and 7741 transitions. [2022-01-18 02:14:30,688 INFO L78 Accepts]: Start accepts. Automaton has 2977 states and 7741 transitions. Word has length 179 [2022-01-18 02:14:30,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:14:30,688 INFO L470 AbstractCegarLoop]: Abstraction has 2977 states and 7741 transitions. [2022-01-18 02:14:30,689 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.615384615384615) internal successors, (164), 13 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:14:30,689 INFO L276 IsEmpty]: Start isEmpty. Operand 2977 states and 7741 transitions. [2022-01-18 02:14:30,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-01-18 02:14:30,693 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:14:30,693 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 02:14:30,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-18 02:14:30,694 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-18 02:14:30,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:14:30,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1465175280, now seen corresponding path program 3 times [2022-01-18 02:14:30,694 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:14:30,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724946289] [2022-01-18 02:14:30,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:14:30,695 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:14:30,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:14:31,016 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-01-18 02:14:31,016 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:14:31,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724946289] [2022-01-18 02:14:31,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724946289] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 02:14:31,016 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 02:14:31,016 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-18 02:14:31,018 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353854125] [2022-01-18 02:14:31,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 02:14:31,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-18 02:14:31,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:14:31,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-18 02:14:31,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-01-18 02:14:31,019 INFO L87 Difference]: Start difference. First operand 2977 states and 7741 transitions. Second operand has 15 states, 15 states have (on average 10.933333333333334) internal successors, (164), 15 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:14:31,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:14:31,428 INFO L93 Difference]: Finished difference Result 2864 states and 7406 transitions. [2022-01-18 02:14:31,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-18 02:14:31,429 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 10.933333333333334) internal successors, (164), 15 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 179 [2022-01-18 02:14:31,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:14:31,434 INFO L225 Difference]: With dead ends: 2864 [2022-01-18 02:14:31,434 INFO L226 Difference]: Without dead ends: 2864 [2022-01-18 02:14:31,434 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=178, Invalid=524, Unknown=0, NotChecked=0, Total=702 [2022-01-18 02:14:31,435 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 420 mSDsluCounter, 1131 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 1230 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-18 02:14:31,435 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [420 Valid, 1230 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-18 02:14:31,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2864 states. [2022-01-18 02:14:31,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2864 to 2757. [2022-01-18 02:14:31,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2757 states, 2756 states have (on average 2.5932510885341076) internal successors, (7147), 2756 states have internal predecessors, (7147), 0 states have call successors, (0), 0 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 02:14:31,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2757 states to 2757 states and 7147 transitions. [2022-01-18 02:14:31,474 INFO L78 Accepts]: Start accepts. Automaton has 2757 states and 7147 transitions. Word has length 179 [2022-01-18 02:14:31,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:14:31,474 INFO L470 AbstractCegarLoop]: Abstraction has 2757 states and 7147 transitions. [2022-01-18 02:14:31,475 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.933333333333334) internal successors, (164), 15 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:14:31,475 INFO L276 IsEmpty]: Start isEmpty. Operand 2757 states and 7147 transitions. [2022-01-18 02:14:31,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-01-18 02:14:31,479 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:14:31,479 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:14:31,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-18 02:14:31,479 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-18 02:14:31,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:14:31,479 INFO L85 PathProgramCache]: Analyzing trace with hash 546908008, now seen corresponding path program 4 times [2022-01-18 02:14:31,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:14:31,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45111882] [2022-01-18 02:14:31,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:14:31,480 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:14:31,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:14:31,538 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-18 02:14:31,539 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:14:31,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45111882] [2022-01-18 02:14:31,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45111882] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:14:31,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634956898] [2022-01-18 02:14:31,539 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-18 02:14:31,539 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:14:31,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:14:31,540 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 02:14:31,541 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 02:14:31,625 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-18 02:14:31,625 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:14:31,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-18 02:14:31,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:14:31,965 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-18 02:14:31,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:14:32,346 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-18 02:14:32,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634956898] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:14:32,346 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:14:32,346 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-01-18 02:14:32,347 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634549932] [2022-01-18 02:14:32,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:14:32,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-18 02:14:32,347 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:14:32,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-18 02:14:32,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-01-18 02:14:32,348 INFO L87 Difference]: Start difference. First operand 2757 states and 7147 transitions. Second operand has 19 states, 19 states have (on average 12.421052631578947) internal successors, (236), 19 states have internal predecessors, (236), 0 states have call successors, (0), 0 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 02:14:32,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:14:32,542 INFO L93 Difference]: Finished difference Result 3092 states and 8012 transitions. [2022-01-18 02:14:32,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-18 02:14:32,543 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 12.421052631578947) internal successors, (236), 19 states have internal predecessors, (236), 0 states have call successors, (0), 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 181 [2022-01-18 02:14:32,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:14:32,546 INFO L225 Difference]: With dead ends: 3092 [2022-01-18 02:14:32,546 INFO L226 Difference]: Without dead ends: 2432 [2022-01-18 02:14:32,546 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=200, Invalid=612, Unknown=0, NotChecked=0, Total=812 [2022-01-18 02:14:32,547 INFO L933 BasicCegarLoop]: 156 mSDtfsCounter, 510 mSDsluCounter, 1363 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 1462 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 02:14:32,547 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [510 Valid, 1462 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 02:14:32,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2432 states. [2022-01-18 02:14:32,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2432 to 2427. [2022-01-18 02:14:32,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2427 states, 2426 states have (on average 2.6504534212695794) internal successors, (6430), 2426 states have internal predecessors, (6430), 0 states have call successors, (0), 0 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 02:14:32,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2427 states to 2427 states and 6430 transitions. [2022-01-18 02:14:32,577 INFO L78 Accepts]: Start accepts. Automaton has 2427 states and 6430 transitions. Word has length 181 [2022-01-18 02:14:32,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:14:32,578 INFO L470 AbstractCegarLoop]: Abstraction has 2427 states and 6430 transitions. [2022-01-18 02:14:32,578 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 12.421052631578947) internal successors, (236), 19 states have internal predecessors, (236), 0 states have call successors, (0), 0 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 02:14:32,578 INFO L276 IsEmpty]: Start isEmpty. Operand 2427 states and 6430 transitions. [2022-01-18 02:14:32,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-01-18 02:14:32,581 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:14:32,582 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:14:32,600 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 02:14:32,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-01-18 02:14:32,792 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-18 02:14:32,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:14:32,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1376543345, now seen corresponding path program 5 times [2022-01-18 02:14:32,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:14:32,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751831203] [2022-01-18 02:14:32,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:14:32,792 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:14:32,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:14:32,858 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-18 02:14:32,858 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:14:32,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751831203] [2022-01-18 02:14:32,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751831203] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:14:32,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933899382] [2022-01-18 02:14:32,859 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-18 02:14:32,859 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:14:32,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:14:32,861 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 02:14:32,862 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 02:14:32,983 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-01-18 02:14:32,983 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:14:32,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-18 02:14:32,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:14:33,276 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-18 02:14:33,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:14:33,881 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-18 02:14:33,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933899382] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:14:33,881 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:14:33,881 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 9] total 16 [2022-01-18 02:14:33,882 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272036010] [2022-01-18 02:14:33,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:14:33,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-18 02:14:33,882 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:14:33,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-18 02:14:33,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-01-18 02:14:33,883 INFO L87 Difference]: Start difference. First operand 2427 states and 6430 transitions. Second operand has 16 states, 16 states have (on average 18.5625) internal successors, (297), 16 states have internal predecessors, (297), 0 states have call successors, (0), 0 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 02:14:34,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:14:34,424 INFO L93 Difference]: Finished difference Result 8245 states and 22542 transitions. [2022-01-18 02:14:34,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-01-18 02:14:34,424 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 18.5625) internal successors, (297), 16 states have internal predecessors, (297), 0 states have call successors, (0), 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 183 [2022-01-18 02:14:34,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:14:34,436 INFO L225 Difference]: With dead ends: 8245 [2022-01-18 02:14:34,436 INFO L226 Difference]: Without dead ends: 8230 [2022-01-18 02:14:34,436 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=500, Invalid=1222, Unknown=0, NotChecked=0, Total=1722 [2022-01-18 02:14:34,437 INFO L933 BasicCegarLoop]: 309 mSDtfsCounter, 869 mSDsluCounter, 1882 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 2117 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-18 02:14:34,437 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [869 Valid, 2117 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-18 02:14:34,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8230 states. [2022-01-18 02:14:34,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8230 to 2816. [2022-01-18 02:14:34,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2816 states, 2815 states have (on average 2.738898756660746) internal successors, (7710), 2815 states have internal predecessors, (7710), 0 states have call successors, (0), 0 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 02:14:34,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2816 states to 2816 states and 7710 transitions. [2022-01-18 02:14:34,501 INFO L78 Accepts]: Start accepts. Automaton has 2816 states and 7710 transitions. Word has length 183 [2022-01-18 02:14:34,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:14:34,502 INFO L470 AbstractCegarLoop]: Abstraction has 2816 states and 7710 transitions. [2022-01-18 02:14:34,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 18.5625) internal successors, (297), 16 states have internal predecessors, (297), 0 states have call successors, (0), 0 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 02:14:34,502 INFO L276 IsEmpty]: Start isEmpty. Operand 2816 states and 7710 transitions. [2022-01-18 02:14:34,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-01-18 02:14:34,507 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:14:34,507 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 02:14:34,532 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 02:14:34,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:14:34,719 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-18 02:14:34,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:14:34,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1641267285, now seen corresponding path program 6 times [2022-01-18 02:14:34,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:14:34,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326110464] [2022-01-18 02:14:34,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:14:34,720 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:14:34,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:14:36,046 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-18 02:14:36,046 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:14:36,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326110464] [2022-01-18 02:14:36,046 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326110464] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:14:36,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147300379] [2022-01-18 02:14:36,046 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-18 02:14:36,046 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:14:36,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:14:36,047 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:14:36,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-18 02:14:36,176 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-01-18 02:14:36,176 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:14:36,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 68 conjunts are in the unsatisfiable core [2022-01-18 02:14:36,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:14:36,207 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 02:14:36,459 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 02:14:36,460 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 02:14:39,022 INFO L353 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-01-18 02:14:39,023 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 75 [2022-01-18 02:14:39,040 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:14:39,040 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 60 treesize of output 46 [2022-01-18 02:14:39,617 INFO L353 Elim1Store]: treesize reduction 96, result has 6.8 percent of original size [2022-01-18 02:14:39,617 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 16 [2022-01-18 02:14:39,711 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-18 02:14:39,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:14:40,072 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_374 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_374) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0)) (forall ((v_ArrVal_374 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_374) c_~queue~0.base)) (.cse1 (* c_~start~0 4))) (<= (select .cse0 (+ .cse1 c_~queue~0.offset 4)) (select .cse0 (+ .cse1 c_~queue~0.offset))))) (not (= (mod c_~ok~0 256) 0))) is different from false [2022-01-18 02:14:40,148 WARN L838 $PredicateComparison]: unable to prove that (or (not (< c_~end~0 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (and (forall ((v_ArrVal_374 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_374) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0)) (forall ((v_ArrVal_374 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_374) c_~queue~0.base)) (.cse1 (* c_~start~0 4))) (<= (select .cse0 (+ .cse1 c_~queue~0.offset 4)) (select .cse0 (+ .cse1 c_~queue~0.offset))))) (not (= (mod c_~ok~0 256) 0))) (not (<= 0 c_~end~0))) is different from false [2022-01-18 02:14:40,181 WARN L838 $PredicateComparison]: unable to prove that (or (not (<= |c_thread1Thread1of1ForFork0_#t~mem1#1| c_~last~0)) (not (< c_~end~0 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (and (forall ((v_ArrVal_374 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_374) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0)) (forall ((v_ArrVal_374 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_374) c_~queue~0.base)) (.cse1 (* c_~start~0 4))) (<= (select .cse0 (+ .cse1 c_~queue~0.offset 4)) (select .cse0 (+ .cse1 c_~queue~0.offset))))) (not (= (mod c_~ok~0 256) 0))) (not (<= 0 c_~end~0))) is different from false [2022-01-18 02:14:40,211 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((~i~0 Int)) (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* ~i~0 4))))) (or (< c_~last~0 .cse0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) .cse0))))) (not (< c_~end~0 c_~n~0)) (and (forall ((v_ArrVal_374 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_374) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0)) (forall ((v_ArrVal_374 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_374) c_~queue~0.base)) (.cse2 (* c_~start~0 4))) (<= (select .cse1 (+ .cse2 c_~queue~0.offset 4)) (select .cse1 (+ .cse2 c_~queue~0.offset))))) (not (= (mod c_~ok~0 256) 0))) (not (<= 0 c_~end~0))) is different from false [2022-01-18 02:14:40,276 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((~i~0 Int)) (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* ~i~0 4))))) (or (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) .cse0)) (< |c_thread1Thread1of1ForFork0_#t~mem5#1| .cse0)))) (not (< c_~end~0 c_~n~0)) (and (forall ((v_ArrVal_374 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_374) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0)) (forall ((v_ArrVal_374 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_374) c_~queue~0.base)) (.cse2 (* c_~start~0 4))) (<= (select .cse1 (+ .cse2 c_~queue~0.offset 4)) (select .cse1 (+ .cse2 c_~queue~0.offset))))) (not (= (mod c_~ok~0 256) 0))) (not (<= 0 c_~end~0))) is different from false [2022-01-18 02:14:40,323 WARN L838 $PredicateComparison]: unable to prove that (or (not (< c_~end~0 c_~n~0)) (and (forall ((v_ArrVal_374 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_374) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0)) (forall ((v_ArrVal_374 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_374) c_~queue~0.base)) (.cse1 (* c_~start~0 4))) (<= (select .cse0 (+ .cse1 c_~queue~0.offset 4)) (select .cse0 (+ .cse1 c_~queue~0.offset))))) (not (= (mod c_~ok~0 256) 0))) (not (<= 0 c_~end~0)) (forall ((v_~i~0_42 Int)) (let ((.cse3 (select |c_#memory_int| c_~A~0.base))) (let ((.cse2 (select .cse3 (+ (* v_~i~0_42 4) c_~A~0.offset)))) (or (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) .cse2)) (< (select .cse3 (+ c_~A~0.offset (* c_~i~0 4))) .cse2)))))) is different from false [2022-01-18 02:14:40,664 INFO L353 Elim1Store]: treesize reduction 93, result has 66.2 percent of original size [2022-01-18 02:14:40,664 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 155 treesize of output 254 [2022-01-18 02:14:40,677 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-18 02:14:40,678 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 45 [2022-01-18 02:14:40,684 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2022-01-18 02:14:46,101 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 11 not checked. [2022-01-18 02:14:46,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147300379] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:14:46,102 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:14:46,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 35, 35] total 93 [2022-01-18 02:14:46,102 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371436150] [2022-01-18 02:14:46,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:14:46,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 93 states [2022-01-18 02:14:46,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:14:46,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2022-01-18 02:14:46,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=707, Invalid=6793, Unknown=6, NotChecked=1050, Total=8556 [2022-01-18 02:14:46,104 INFO L87 Difference]: Start difference. First operand 2816 states and 7710 transitions. Second operand has 93 states, 93 states have (on average 5.075268817204301) internal successors, (472), 93 states have internal predecessors, (472), 0 states have call successors, (0), 0 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 02:15:00,367 WARN L838 $PredicateComparison]: unable to prove that (and (<= c_~new~0 c_~v_old~0) (= c_~ok~0 1) (or (not (< c_~end~0 c_~n~0)) (and (forall ((v_ArrVal_374 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_374) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0)) (forall ((v_ArrVal_374 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_374) c_~queue~0.base)) (.cse1 (* c_~start~0 4))) (<= (select .cse0 (+ .cse1 c_~queue~0.offset 4)) (select .cse0 (+ .cse1 c_~queue~0.offset))))) (not (= (mod c_~ok~0 256) 0))) (not (<= 0 c_~end~0)) (forall ((v_~i~0_42 Int)) (let ((.cse3 (select |c_#memory_int| c_~A~0.base))) (let ((.cse2 (select .cse3 (+ (* v_~i~0_42 4) c_~A~0.offset)))) (or (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) .cse2)) (< (select .cse3 (+ c_~A~0.offset (* c_~i~0 4))) .cse2))))))) is different from false [2022-01-18 02:15:01,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:15:01,813 INFO L93 Difference]: Finished difference Result 7953 states and 21516 transitions. [2022-01-18 02:15:01,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2022-01-18 02:15:01,814 INFO L78 Accepts]: Start accepts. Automaton has has 93 states, 93 states have (on average 5.075268817204301) internal successors, (472), 93 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 188 [2022-01-18 02:15:01,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:15:01,840 INFO L225 Difference]: With dead ends: 7953 [2022-01-18 02:15:01,841 INFO L226 Difference]: Without dead ends: 7944 [2022-01-18 02:15:01,844 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 609 GetRequests, 341 SyntacticMatches, 53 SemanticMatches, 215 ConstructedPredicates, 7 IntricatePredicates, 4 DeprecatedPredicates, 18144 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=4273, Invalid=39611, Unknown=34, NotChecked=2954, Total=46872 [2022-01-18 02:15:01,844 INFO L933 BasicCegarLoop]: 282 mSDtfsCounter, 4582 mSDsluCounter, 11123 mSDsCounter, 0 mSdLazyCounter, 4041 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4582 SdHoareTripleChecker+Valid, 10410 SdHoareTripleChecker+Invalid, 14017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 4041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9744 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-01-18 02:15:01,844 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4582 Valid, 10410 Invalid, 14017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 4041 Invalid, 0 Unknown, 9744 Unchecked, 1.8s Time] [2022-01-18 02:15:01,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7944 states. [2022-01-18 02:15:01,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7944 to 3616. [2022-01-18 02:15:01,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3616 states, 3615 states have (on average 2.6697095435684646) internal successors, (9651), 3615 states have internal predecessors, (9651), 0 states have call successors, (0), 0 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 02:15:01,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3616 states to 3616 states and 9651 transitions. [2022-01-18 02:15:01,950 INFO L78 Accepts]: Start accepts. Automaton has 3616 states and 9651 transitions. Word has length 188 [2022-01-18 02:15:01,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:15:01,950 INFO L470 AbstractCegarLoop]: Abstraction has 3616 states and 9651 transitions. [2022-01-18 02:15:01,951 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 93 states, 93 states have (on average 5.075268817204301) internal successors, (472), 93 states have internal predecessors, (472), 0 states have call successors, (0), 0 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 02:15:01,951 INFO L276 IsEmpty]: Start isEmpty. Operand 3616 states and 9651 transitions. [2022-01-18 02:15:01,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-01-18 02:15:01,956 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:15:01,956 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 02:15:01,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-18 02:15:02,156 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:15:02,157 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-18 02:15:02,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:15:02,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1624005731, now seen corresponding path program 7 times [2022-01-18 02:15:02,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:15:02,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385734947] [2022-01-18 02:15:02,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:15:02,158 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:15:02,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:15:03,908 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-18 02:15:03,909 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:15:03,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385734947] [2022-01-18 02:15:03,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385734947] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:15:03,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194353458] [2022-01-18 02:15:03,909 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-18 02:15:03,909 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:15:03,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:15:03,910 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:15:03,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-18 02:15:04,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:15:04,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 75 conjunts are in the unsatisfiable core [2022-01-18 02:15:04,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:15:04,074 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 02:15:04,390 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 02:15:04,390 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 02:15:06,634 INFO L353 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-01-18 02:15:06,635 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 74 [2022-01-18 02:15:06,655 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:15:06,655 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 45 [2022-01-18 02:15:07,255 INFO L353 Elim1Store]: treesize reduction 48, result has 5.9 percent of original size [2022-01-18 02:15:07,255 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 13 [2022-01-18 02:15:07,348 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-18 02:15:07,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:15:08,059 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~start~0 1))) (or (and (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_416 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_416) c_~queue~0.base)) (.cse1 (* c_~start~0 4))) (<= (select .cse0 (+ .cse1 c_~queue~0.offset 4)) (select .cse0 (+ .cse1 c_~queue~0.offset))))) (forall ((v_ArrVal_416 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_416) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0))) (not (< c_~end~0 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (< .cse2 0) (<= c_~n~0 .cse2) (not (<= 0 c_~end~0)))) is different from false [2022-01-18 02:15:08,217 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_~start~0 1))) (or (forall ((~i~0 Int)) (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* ~i~0 4))))) (or (< c_~last~0 .cse0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) .cse0))))) (and (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_416 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_416) c_~queue~0.base)) (.cse2 (* c_~start~0 4))) (<= (select .cse1 (+ .cse2 c_~queue~0.offset 4)) (select .cse1 (+ .cse2 c_~queue~0.offset))))) (forall ((v_ArrVal_416 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_416) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0))) (not (< c_~end~0 c_~n~0)) (< .cse3 0) (<= c_~n~0 .cse3) (not (<= 0 c_~end~0)))) is different from false [2022-01-18 02:15:08,300 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_~start~0 1))) (or (and (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_416 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_416) c_~queue~0.base)) (.cse1 (* c_~start~0 4))) (<= (select .cse0 (+ .cse1 c_~queue~0.offset 4)) (select .cse0 (+ .cse1 c_~queue~0.offset))))) (forall ((v_ArrVal_416 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_416) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0))) (forall ((~i~0 Int)) (let ((.cse2 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* ~i~0 4))))) (or (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) .cse2)) (< |c_thread1Thread1of1ForFork0_#t~mem5#1| .cse2)))) (not (< c_~end~0 c_~n~0)) (< .cse3 0) (<= c_~n~0 .cse3) (not (<= 0 c_~end~0)))) is different from false [2022-01-18 02:15:08,362 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~start~0 1))) (or (and (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_416 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_416) c_~queue~0.base)) (.cse1 (* c_~start~0 4))) (<= (select .cse0 (+ .cse1 c_~queue~0.offset 4)) (select .cse0 (+ .cse1 c_~queue~0.offset))))) (forall ((v_ArrVal_416 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_416) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0))) (not (< c_~end~0 c_~n~0)) (< .cse2 0) (<= c_~n~0 .cse2) (forall ((v_~i~0_46 Int)) (let ((.cse3 (select |c_#memory_int| c_~A~0.base))) (let ((.cse4 (select .cse3 (+ c_~A~0.offset (* v_~i~0_46 4))))) (or (< (select .cse3 (+ c_~A~0.offset (* c_~i~0 4))) .cse4) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) .cse4)))))) (not (<= 0 c_~end~0)))) is different from false [2022-01-18 02:15:08,411 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~start~0 1))) (or (and (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_416 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_416) c_~queue~0.base)) (.cse1 (* c_~start~0 4))) (<= (select .cse0 (+ .cse1 c_~queue~0.offset 4)) (select .cse0 (+ .cse1 c_~queue~0.offset))))) (forall ((v_ArrVal_416 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_416) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0))) (not (< c_~end~0 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (< .cse2 0) (<= c_~n~0 .cse2) (not (<= 0 c_~end~0)) (forall ((v_~end~0_90 Int) (v_~i~0_46 Int)) (let ((.cse4 (select |c_#memory_int| c_~A~0.base))) (let ((.cse3 (select .cse4 (+ c_~A~0.offset (* v_~i~0_46 4))))) (or (not (<= (+ c_~end~0 1) v_~end~0_90)) (not (< v_~end~0_90 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* v_~end~0_90 4))) .cse3)) (< (select .cse4 (+ c_~A~0.offset (* c_~i~0 4))) .cse3))))))) is different from false [2022-01-18 02:15:08,509 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~start~0 1))) (or (not (<= |c_thread1Thread1of1ForFork0_#t~mem1#1| c_~last~0)) (and (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_416 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_416) c_~queue~0.base)) (.cse1 (* c_~start~0 4))) (<= (select .cse0 (+ .cse1 c_~queue~0.offset 4)) (select .cse0 (+ .cse1 c_~queue~0.offset))))) (forall ((v_ArrVal_416 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_416) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0))) (not (< c_~end~0 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (< .cse2 0) (<= c_~n~0 .cse2) (not (<= 0 c_~end~0)) (forall ((v_~end~0_90 Int) (v_~i~0_46 Int)) (let ((.cse4 (select |c_#memory_int| c_~A~0.base))) (let ((.cse3 (select .cse4 (+ c_~A~0.offset (* v_~i~0_46 4))))) (or (not (<= (+ c_~end~0 1) v_~end~0_90)) (not (< v_~end~0_90 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* v_~end~0_90 4))) .cse3)) (< (select .cse4 (+ c_~A~0.offset (* c_~i~0 4))) .cse3))))))) is different from false [2022-01-18 02:15:08,621 INFO L353 Elim1Store]: treesize reduction 89, result has 67.0 percent of original size [2022-01-18 02:15:08,621 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 154 treesize of output 253 [2022-01-18 02:15:08,651 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 58 treesize of output 52 [2022-01-18 02:15:08,658 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-18 02:15:08,659 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 39 [2022-01-18 02:15:25,734 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 9 trivial. 10 not checked. [2022-01-18 02:15:25,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194353458] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:15:25,735 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:15:25,735 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 36, 37] total 100 [2022-01-18 02:15:25,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451751275] [2022-01-18 02:15:25,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:15:25,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 100 states [2022-01-18 02:15:25,735 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:15:25,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2022-01-18 02:15:25,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=887, Invalid=7866, Unknown=13, NotChecked=1134, Total=9900 [2022-01-18 02:15:25,736 INFO L87 Difference]: Start difference. First operand 3616 states and 9651 transitions. Second operand has 100 states, 100 states have (on average 4.85) internal successors, (485), 100 states have internal predecessors, (485), 0 states have call successors, (0), 0 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 02:15:37,431 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_~start~0 1))) (let ((.cse0 (and (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_416 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_416) c_~queue~0.base)) (.cse7 (* c_~start~0 4))) (<= (select .cse6 (+ .cse7 c_~queue~0.offset 4)) (select .cse6 (+ .cse7 c_~queue~0.offset))))) (forall ((v_ArrVal_416 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_416) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0)))) (.cse1 (< .cse5 0)) (.cse2 (<= c_~n~0 .cse5))) (and (or (not (<= |c_thread1Thread1of1ForFork0_#t~mem1#1| c_~last~0)) .cse0 (not (< c_~end~0 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) .cse1 .cse2 (not (<= 0 c_~end~0)) (forall ((v_~end~0_90 Int) (v_~i~0_46 Int)) (let ((.cse4 (select |c_#memory_int| c_~A~0.base))) (let ((.cse3 (select .cse4 (+ c_~A~0.offset (* v_~i~0_46 4))))) (or (not (<= (+ c_~end~0 1) v_~end~0_90)) (not (< v_~end~0_90 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* v_~end~0_90 4))) .cse3)) (< (select .cse4 (+ c_~A~0.offset (* c_~i~0 4))) .cse3)))))) (or .cse0 .cse1 .cse2) (<= c_~new~0 c_~v_old~0) (= c_~ok~0 1)))) is different from false [2022-01-18 02:15:37,694 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_~start~0 1))) (let ((.cse0 (and (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_416 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_416) c_~queue~0.base)) (.cse10 (* c_~start~0 4))) (<= (select .cse9 (+ .cse10 c_~queue~0.offset 4)) (select .cse9 (+ .cse10 c_~queue~0.offset))))) (forall ((v_ArrVal_416 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_416) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0)))) (.cse1 (not (< c_~end~0 c_~n~0))) (.cse2 (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4)))))) (.cse3 (< .cse8 0)) (.cse4 (<= c_~n~0 .cse8)) (.cse5 (not (<= 0 c_~end~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (forall ((v_~end~0_90 Int) (v_~i~0_46 Int)) (let ((.cse7 (select |c_#memory_int| c_~A~0.base))) (let ((.cse6 (select .cse7 (+ c_~A~0.offset (* v_~i~0_46 4))))) (or (not (<= (+ c_~end~0 1) v_~end~0_90)) (not (< v_~end~0_90 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* v_~end~0_90 4))) .cse6)) (< (select .cse7 (+ c_~A~0.offset (* c_~i~0 4))) .cse6))))))))) is different from false [2022-01-18 02:15:38,288 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_~start~0 1))) (let ((.cse0 (and (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_416 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_416) c_~queue~0.base)) (.cse7 (* c_~start~0 4))) (<= (select .cse6 (+ .cse7 c_~queue~0.offset 4)) (select .cse6 (+ .cse7 c_~queue~0.offset))))) (forall ((v_ArrVal_416 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_416) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0)))) (.cse1 (< .cse5 0)) (.cse2 (<= c_~n~0 .cse5))) (and (or .cse0 (not (< c_~end~0 c_~n~0)) .cse1 .cse2 (forall ((v_~i~0_46 Int)) (let ((.cse3 (select |c_#memory_int| c_~A~0.base))) (let ((.cse4 (select .cse3 (+ c_~A~0.offset (* v_~i~0_46 4))))) (or (< (select .cse3 (+ c_~A~0.offset (* c_~i~0 4))) .cse4) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) .cse4)))))) (not (<= 0 c_~end~0))) (or .cse0 .cse1 .cse2)))) is different from false [2022-01-18 02:15:38,839 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_~start~0 1))) (let ((.cse0 (and (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_416 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_416) c_~queue~0.base)) (.cse6 (* c_~start~0 4))) (<= (select .cse5 (+ .cse6 c_~queue~0.offset 4)) (select .cse5 (+ .cse6 c_~queue~0.offset))))) (forall ((v_ArrVal_416 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_416) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0)))) (.cse2 (< .cse4 0)) (.cse3 (<= c_~n~0 .cse4))) (and (or .cse0 (forall ((~i~0 Int)) (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* ~i~0 4))))) (or (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) .cse1)) (< |c_thread1Thread1of1ForFork0_#t~mem5#1| .cse1)))) (not (< c_~end~0 c_~n~0)) .cse2 .cse3 (not (<= 0 c_~end~0))) (or .cse0 .cse2 .cse3)))) is different from false [2022-01-18 02:15:38,971 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_~start~0 1))) (let ((.cse1 (and (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_416 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_416) c_~queue~0.base)) (.cse6 (* c_~start~0 4))) (<= (select .cse5 (+ .cse6 c_~queue~0.offset 4)) (select .cse5 (+ .cse6 c_~queue~0.offset))))) (forall ((v_ArrVal_416 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_416) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0)))) (.cse2 (< .cse4 0)) (.cse3 (<= c_~n~0 .cse4))) (and (or (forall ((~i~0 Int)) (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* ~i~0 4))))) (or (< c_~last~0 .cse0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) .cse0))))) .cse1 (not (< c_~end~0 c_~n~0)) .cse2 .cse3 (not (<= 0 c_~end~0))) (or .cse1 .cse2 .cse3)))) is different from false [2022-01-18 02:15:39,104 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_~start~0 1))) (let ((.cse0 (and (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_416 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_416) c_~queue~0.base)) (.cse8 (* c_~start~0 4))) (<= (select .cse7 (+ .cse8 c_~queue~0.offset 4)) (select .cse7 (+ .cse8 c_~queue~0.offset))))) (forall ((v_ArrVal_416 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_416) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0)))) (.cse1 (not (< c_~end~0 c_~n~0))) (.cse2 (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4)))))) (.cse3 (< .cse6 0)) (.cse4 (<= c_~n~0 .cse6)) (.cse5 (not (<= 0 c_~end~0)))) (and (or (not (<= |c_thread1Thread1of1ForFork0_#t~mem1#1| c_~last~0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)))) is different from false [2022-01-18 02:15:39,698 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse2 (+ c_~start~0 1))) (or (not (<= |c_thread1Thread1of1ForFork0_#t~mem1#1| c_~last~0)) (and (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_416 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_416) c_~queue~0.base)) (.cse1 (* c_~start~0 4))) (<= (select .cse0 (+ .cse1 c_~queue~0.offset 4)) (select .cse0 (+ .cse1 c_~queue~0.offset))))) (forall ((v_ArrVal_416 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_416) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0))) (not (< c_~end~0 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (< .cse2 0) (<= c_~n~0 .cse2) (not (<= 0 c_~end~0)))) (= c_~ok~0 1)) is different from false [2022-01-18 02:15:40,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:15:40,277 INFO L93 Difference]: Finished difference Result 10685 states and 28964 transitions. [2022-01-18 02:15:40,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2022-01-18 02:15:40,278 INFO L78 Accepts]: Start accepts. Automaton has has 100 states, 100 states have (on average 4.85) internal successors, (485), 100 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 188 [2022-01-18 02:15:40,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:15:40,335 INFO L225 Difference]: With dead ends: 10685 [2022-01-18 02:15:40,335 INFO L226 Difference]: Without dead ends: 10652 [2022-01-18 02:15:40,336 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 600 GetRequests, 338 SyntacticMatches, 70 SemanticMatches, 192 ConstructedPredicates, 13 IntricatePredicates, 3 DeprecatedPredicates, 15005 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=3801, Invalid=28770, Unknown=61, NotChecked=4810, Total=37442 [2022-01-18 02:15:40,337 INFO L933 BasicCegarLoop]: 228 mSDtfsCounter, 4704 mSDsluCounter, 9719 mSDsCounter, 0 mSdLazyCounter, 2893 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4704 SdHoareTripleChecker+Valid, 9490 SdHoareTripleChecker+Invalid, 9523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 2893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6375 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-18 02:15:40,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4704 Valid, 9490 Invalid, 9523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 2893 Invalid, 0 Unknown, 6375 Unchecked, 1.4s Time] [2022-01-18 02:15:40,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10652 states. [2022-01-18 02:15:40,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10652 to 4858. [2022-01-18 02:15:40,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4858 states, 4857 states have (on average 2.697138151122092) internal successors, (13100), 4857 states have internal predecessors, (13100), 0 states have call successors, (0), 0 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 02:15:40,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4858 states to 4858 states and 13100 transitions. [2022-01-18 02:15:40,437 INFO L78 Accepts]: Start accepts. Automaton has 4858 states and 13100 transitions. Word has length 188 [2022-01-18 02:15:40,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:15:40,437 INFO L470 AbstractCegarLoop]: Abstraction has 4858 states and 13100 transitions. [2022-01-18 02:15:40,438 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 100 states, 100 states have (on average 4.85) internal successors, (485), 100 states have internal predecessors, (485), 0 states have call successors, (0), 0 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 02:15:40,438 INFO L276 IsEmpty]: Start isEmpty. Operand 4858 states and 13100 transitions. [2022-01-18 02:15:40,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-01-18 02:15:40,446 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:15:40,446 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 02:15:40,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-18 02:15:40,664 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-01-18 02:15:40,664 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-18 02:15:40,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:15:40,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1613183643, now seen corresponding path program 8 times [2022-01-18 02:15:40,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:15:40,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289718725] [2022-01-18 02:15:40,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:15:40,665 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:15:40,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:15:43,246 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-18 02:15:43,246 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:15:43,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289718725] [2022-01-18 02:15:43,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289718725] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:15:43,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079119606] [2022-01-18 02:15:43,247 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 02:15:43,247 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:15:43,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:15:43,248 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:15:43,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-18 02:15:43,350 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 02:15:43,350 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:15:43,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 89 conjunts are in the unsatisfiable core [2022-01-18 02:15:43,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:15:43,407 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 02:15:43,854 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-18 02:15:43,855 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-18 02:15:44,283 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-18 02:15:44,922 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-01-18 02:15:44,923 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-01-18 02:15:45,091 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 02:15:45,204 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 02:15:45,512 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 02:15:47,077 INFO L353 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-01-18 02:15:47,077 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 74 [2022-01-18 02:15:47,106 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:15:47,107 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 45 [2022-01-18 02:15:47,913 INFO L353 Elim1Store]: treesize reduction 48, result has 5.9 percent of original size [2022-01-18 02:15:47,913 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 13 [2022-01-18 02:15:48,031 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-18 02:15:48,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:15:48,864 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~start~0 1))) (or (not (< c_~end~0 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (< .cse0 0) (<= c_~n~0 .cse0) (not (<= 0 c_~end~0)) (and (forall ((v_ArrVal_464 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_464) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0)) (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_464 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_464) c_~queue~0.base)) (.cse2 (* c_~start~0 4))) (<= (select .cse1 (+ .cse2 c_~queue~0.offset 4)) (select .cse1 (+ .cse2 c_~queue~0.offset)))))))) is different from false [2022-01-18 02:15:48,910 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~start~0 1))) (or (not (<= |c_thread1Thread1of1ForFork0_#t~mem1#1| c_~last~0)) (not (< c_~end~0 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (< .cse0 0) (<= c_~n~0 .cse0) (not (<= 0 c_~end~0)) (and (forall ((v_ArrVal_464 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_464) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0)) (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_464 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_464) c_~queue~0.base)) (.cse2 (* c_~start~0 4))) (<= (select .cse1 (+ .cse2 c_~queue~0.offset 4)) (select .cse1 (+ .cse2 c_~queue~0.offset)))))))) is different from false [2022-01-18 02:15:48,933 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~start~0 1))) (or (forall ((~i~0 Int)) (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* ~i~0 4))))) (or (< c_~last~0 .cse0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) .cse0))))) (not (< c_~end~0 c_~n~0)) (< .cse1 0) (<= c_~n~0 .cse1) (not (<= 0 c_~end~0)) (and (forall ((v_ArrVal_464 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_464) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0)) (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_464 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_464) c_~queue~0.base)) (.cse3 (* c_~start~0 4))) (<= (select .cse2 (+ .cse3 c_~queue~0.offset 4)) (select .cse2 (+ .cse3 c_~queue~0.offset)))))))) is different from false [2022-01-18 02:15:49,017 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~start~0 1))) (or (forall ((~i~0 Int)) (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* ~i~0 4))))) (or (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) .cse0)) (< |c_thread1Thread1of1ForFork0_#t~mem5#1| .cse0)))) (not (< c_~end~0 c_~n~0)) (< .cse1 0) (<= c_~n~0 .cse1) (not (<= 0 c_~end~0)) (and (forall ((v_ArrVal_464 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_464) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0)) (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_464 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_464) c_~queue~0.base)) (.cse3 (* c_~start~0 4))) (<= (select .cse2 (+ .cse3 c_~queue~0.offset 4)) (select .cse2 (+ .cse3 c_~queue~0.offset)))))))) is different from false [2022-01-18 02:15:49,088 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~start~0 1))) (or (forall ((v_~i~0_50 Int)) (let ((.cse1 (select |c_#memory_int| c_~A~0.base))) (let ((.cse0 (select .cse1 (+ (* v_~i~0_50 4) c_~A~0.offset)))) (or (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) .cse0)) (< (select .cse1 (+ c_~A~0.offset (* c_~i~0 4))) .cse0))))) (not (< c_~end~0 c_~n~0)) (< .cse2 0) (<= c_~n~0 .cse2) (not (<= 0 c_~end~0)) (and (forall ((v_ArrVal_464 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_464) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0)) (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_464 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_464) c_~queue~0.base)) (.cse4 (* c_~start~0 4))) (<= (select .cse3 (+ .cse4 c_~queue~0.offset 4)) (select .cse3 (+ .cse4 c_~queue~0.offset)))))))) is different from false [2022-01-18 02:15:49,138 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~start~0 1))) (or (not (< c_~end~0 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (< .cse0 0) (forall ((v_~end~0_95 Int) (v_~i~0_50 Int)) (let ((.cse2 (select |c_#memory_int| c_~A~0.base))) (let ((.cse1 (select .cse2 (+ (* v_~i~0_50 4) c_~A~0.offset)))) (or (not (= .cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ (* v_~end~0_95 4) c_~queue~0.offset)))) (not (<= (+ c_~end~0 1) v_~end~0_95)) (< (select .cse2 (+ c_~A~0.offset (* c_~i~0 4))) .cse1) (not (< v_~end~0_95 c_~n~0)))))) (<= c_~n~0 .cse0) (not (<= 0 c_~end~0)) (and (forall ((v_ArrVal_464 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_464) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0)) (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_464 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_464) c_~queue~0.base)) (.cse4 (* c_~start~0 4))) (<= (select .cse3 (+ .cse4 c_~queue~0.offset 4)) (select .cse3 (+ .cse4 c_~queue~0.offset)))))))) is different from false [2022-01-18 02:15:49,228 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~start~0 1))) (or (not (<= |c_thread1Thread1of1ForFork0_#t~mem1#1| c_~last~0)) (not (< c_~end~0 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (< .cse0 0) (forall ((v_~end~0_95 Int) (v_~i~0_50 Int)) (let ((.cse2 (select |c_#memory_int| c_~A~0.base))) (let ((.cse1 (select .cse2 (+ (* v_~i~0_50 4) c_~A~0.offset)))) (or (not (= .cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ (* v_~end~0_95 4) c_~queue~0.offset)))) (not (<= (+ c_~end~0 1) v_~end~0_95)) (< (select .cse2 (+ c_~A~0.offset (* c_~i~0 4))) .cse1) (not (< v_~end~0_95 c_~n~0)))))) (<= c_~n~0 .cse0) (not (<= 0 c_~end~0)) (and (forall ((v_ArrVal_464 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_464) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0)) (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_464 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_464) c_~queue~0.base)) (.cse4 (* c_~start~0 4))) (<= (select .cse3 (+ .cse4 c_~queue~0.offset 4)) (select .cse3 (+ .cse4 c_~queue~0.offset)))))))) is different from false [2022-01-18 02:15:49,298 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_~start~0 1))) (or (forall ((~A~0.offset Int) (v_~end~0_95 Int) (v_~i~0_50 Int) (~i~0 Int) (~A~0.base Int)) (let ((.cse3 (select |c_#memory_int| ~A~0.base))) (let ((.cse1 (select .cse3 (+ (* ~i~0 4) ~A~0.offset))) (.cse0 (select |c_#memory_int| c_~queue~0.base)) (.cse2 (select .cse3 (+ (* v_~i~0_50 4) ~A~0.offset)))) (or (not (= (select .cse0 (+ (* c_~end~0 4) c_~queue~0.offset)) .cse1)) (not (<= (+ c_~end~0 1) v_~end~0_95)) (< .cse1 .cse2) (< c_~last~0 .cse1) (not (< v_~end~0_95 c_~n~0)) (not (= (select .cse0 (+ (* v_~end~0_95 4) c_~queue~0.offset)) .cse2)))))) (not (< c_~end~0 c_~n~0)) (< .cse4 0) (<= c_~n~0 .cse4) (not (<= 0 c_~end~0)) (and (forall ((v_ArrVal_464 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_464) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0)) (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_464 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_464) c_~queue~0.base)) (.cse6 (* c_~start~0 4))) (<= (select .cse5 (+ .cse6 c_~queue~0.offset 4)) (select .cse5 (+ .cse6 c_~queue~0.offset)))))))) is different from false [2022-01-18 02:17:12,855 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:17:12,856 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 295 treesize of output 187 [2022-01-18 02:17:13,103 INFO L353 Elim1Store]: treesize reduction 66, result has 82.3 percent of original size [2022-01-18 02:17:13,104 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 3009 treesize of output 2937 [2022-01-18 02:17:13,257 INFO L353 Elim1Store]: treesize reduction 51, result has 79.3 percent of original size [2022-01-18 02:17:13,258 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 2937 treesize of output 2575 [2022-01-18 02:17:13,454 INFO L353 Elim1Store]: treesize reduction 51, result has 79.3 percent of original size [2022-01-18 02:17:13,455 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 2575 treesize of output 2491 [2022-01-18 02:17:13,551 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 1323 treesize of output 1131 [2022-01-18 02:17:13,602 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-18 02:17:13,603 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1131 treesize of output 1027 [2022-01-18 02:17:13,661 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2022-01-18 02:17:13,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-18 02:17:13,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-01-18 02:17:13,875 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:685) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:668) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:635) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-01-18 02:17:13,886 INFO L158 Benchmark]: Toolchain (without parser) took 250780.27ms. Allocated memory was 354.4MB in the beginning and 708.8MB in the end (delta: 354.4MB). Free memory was 300.5MB in the beginning and 253.5MB in the end (delta: 47.1MB). Peak memory consumption was 442.4MB. Max. memory is 16.0GB. [2022-01-18 02:17:13,886 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 354.4MB. Free memory was 317.6MB in the beginning and 317.5MB in the end (delta: 69.5kB). There was no memory consumed. Max. memory is 16.0GB. [2022-01-18 02:17:13,886 INFO L158 Benchmark]: CACSL2BoogieTranslator took 284.10ms. Allocated memory was 354.4MB in the beginning and 474.0MB in the end (delta: 119.5MB). Free memory was 300.3MB in the beginning and 447.2MB in the end (delta: -146.9MB). Peak memory consumption was 8.5MB. Max. memory is 16.0GB. [2022-01-18 02:17:13,886 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.05ms. Allocated memory is still 474.0MB. Free memory was 447.2MB in the beginning and 445.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-18 02:17:13,886 INFO L158 Benchmark]: Boogie Preprocessor took 17.66ms. Allocated memory is still 474.0MB. Free memory was 445.1MB in the beginning and 444.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.0GB. [2022-01-18 02:17:13,886 INFO L158 Benchmark]: RCFGBuilder took 522.89ms. Allocated memory is still 474.0MB. Free memory was 443.0MB in the beginning and 418.9MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2022-01-18 02:17:13,887 INFO L158 Benchmark]: TraceAbstraction took 249921.58ms. Allocated memory was 474.0MB in the beginning and 708.8MB in the end (delta: 234.9MB). Free memory was 418.9MB in the beginning and 253.5MB in the end (delta: 165.4MB). Peak memory consumption was 439.1MB. Max. memory is 16.0GB. [2022-01-18 02:17:13,887 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 354.4MB. Free memory was 317.6MB in the beginning and 317.5MB in the end (delta: 69.5kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 284.10ms. Allocated memory was 354.4MB in the beginning and 474.0MB in the end (delta: 119.5MB). Free memory was 300.3MB in the beginning and 447.2MB in the end (delta: -146.9MB). Peak memory consumption was 8.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 30.05ms. Allocated memory is still 474.0MB. Free memory was 447.2MB in the beginning and 445.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 17.66ms. Allocated memory is still 474.0MB. Free memory was 445.1MB in the beginning and 444.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 522.89ms. Allocated memory is still 474.0MB. Free memory was 443.0MB in the beginning and 418.9MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * TraceAbstraction took 249921.58ms. Allocated memory was 474.0MB in the beginning and 708.8MB in the end (delta: 234.9MB). Free memory was 418.9MB in the beginning and 253.5MB in the end (delta: 165.4MB). Peak memory consumption was 439.1MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-01-18 02:17:13,943 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...