/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-POR-NewStatesSleepPersistentFixedOrder-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-ba0fd47f62a02cd5486659f03d300faf678a2e90-ba0fd47 [2021-11-13 21:37:03,514 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-13 21:37:03,515 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-13 21:37:03,541 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-13 21:37:03,542 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-13 21:37:03,542 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-13 21:37:03,544 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-13 21:37:03,545 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-13 21:37:03,547 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-13 21:37:03,551 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-13 21:37:03,551 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-13 21:37:03,553 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-13 21:37:03,554 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-13 21:37:03,555 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-13 21:37:03,557 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-13 21:37:03,561 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-13 21:37:03,562 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-13 21:37:03,563 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-13 21:37:03,566 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-13 21:37:03,567 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-13 21:37:03,568 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-13 21:37:03,572 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-13 21:37:03,574 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-13 21:37:03,575 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-13 21:37:03,579 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-13 21:37:03,580 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-13 21:37:03,580 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-13 21:37:03,580 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-13 21:37:03,581 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-13 21:37:03,581 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-13 21:37:03,582 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-13 21:37:03,582 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-13 21:37:03,583 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-13 21:37:03,583 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-13 21:37:03,584 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-13 21:37:03,584 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-13 21:37:03,585 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-13 21:37:03,585 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-13 21:37:03,585 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-13 21:37:03,586 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-13 21:37:03,586 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-13 21:37:03,593 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-POR-NewStatesSleepPersistentFixedOrder-NoLbe.epf [2021-11-13 21:37:03,626 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-13 21:37:03,626 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-13 21:37:03,626 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-13 21:37:03,627 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-13 21:37:03,627 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-13 21:37:03,628 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-13 21:37:03,628 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-13 21:37:03,628 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-13 21:37:03,628 INFO L138 SettingsManager]: * Use SBE=true [2021-11-13 21:37:03,628 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-13 21:37:03,629 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-13 21:37:03,629 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-13 21:37:03,630 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-13 21:37:03,630 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-13 21:37:03,630 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-13 21:37:03,630 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-13 21:37:03,630 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-13 21:37:03,630 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-13 21:37:03,631 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-13 21:37:03,631 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-13 21:37:03,631 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-13 21:37:03,631 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-13 21:37:03,631 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-13 21:37:03,631 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-11-13 21:37:03,633 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-13 21:37:03,633 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-13 21:37:03,633 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-13 21:37:03,633 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-13 21:37:03,633 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-13 21:37:03,633 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-13 21:37:03,634 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-13 21:37:03,634 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-13 21:37:03,634 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2021-11-13 21:37:03,634 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-13 21:37:03,634 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2021-11-13 21:37:03,634 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2021-11-13 21:37:03,634 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 [2021-11-13 21:37:03,825 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-13 21:37:03,848 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-13 21:37:03,850 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-13 21:37:03,851 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-13 21:37:03,855 INFO L275 PluginConnector]: CDTParser initialized [2021-11-13 21:37:03,857 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.wvr.c [2021-11-13 21:37:03,942 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b9003ac5/a6db7e177b654f7e988ded9d1009e1e3/FLAG8be878daf [2021-11-13 21:37:04,327 INFO L306 CDTParser]: Found 1 translation units. [2021-11-13 21:37:04,327 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.wvr.c [2021-11-13 21:37:04,333 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b9003ac5/a6db7e177b654f7e988ded9d1009e1e3/FLAG8be878daf [2021-11-13 21:37:04,760 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b9003ac5/a6db7e177b654f7e988ded9d1009e1e3 [2021-11-13 21:37:04,767 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-13 21:37:04,768 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-11-13 21:37:04,771 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-13 21:37:04,772 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-13 21:37:04,774 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-13 21:37:04,775 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 09:37:04" (1/1) ... [2021-11-13 21:37:04,775 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@649c715 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:37:04, skipping insertion in model container [2021-11-13 21:37:04,776 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 09:37:04" (1/1) ... [2021-11-13 21:37:04,781 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-13 21:37:04,795 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-13 21:37:04,968 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.wvr.c[2476,2489] [2021-11-13 21:37:04,971 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-13 21:37:04,977 INFO L203 MainTranslator]: Completed pre-run [2021-11-13 21:37:04,994 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.wvr.c[2476,2489] [2021-11-13 21:37:04,995 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-13 21:37:05,006 INFO L208 MainTranslator]: Completed translation [2021-11-13 21:37:05,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:37:05 WrapperNode [2021-11-13 21:37:05,007 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-13 21:37:05,009 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-13 21:37:05,009 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-13 21:37:05,009 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-13 21:37:05,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:37:05" (1/1) ... [2021-11-13 21:37:05,031 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:37:05" (1/1) ... [2021-11-13 21:37:05,052 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-13 21:37:05,053 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-13 21:37:05,053 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-13 21:37:05,054 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-13 21:37:05,060 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:37:05" (1/1) ... [2021-11-13 21:37:05,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:37:05" (1/1) ... [2021-11-13 21:37:05,064 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:37:05" (1/1) ... [2021-11-13 21:37:05,065 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:37:05" (1/1) ... [2021-11-13 21:37:05,078 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:37:05" (1/1) ... [2021-11-13 21:37:05,081 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:37:05" (1/1) ... [2021-11-13 21:37:05,082 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:37:05" (1/1) ... [2021-11-13 21:37:05,083 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-13 21:37:05,084 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-13 21:37:05,084 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-13 21:37:05,084 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-13 21:37:05,085 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:37:05" (1/1) ... [2021-11-13 21:37:05,094 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-13 21:37:05,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-13 21:37:05,114 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) [2021-11-13 21:37:05,137 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 [2021-11-13 21:37:05,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-13 21:37:05,159 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-11-13 21:37:05,160 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-11-13 21:37:05,160 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-11-13 21:37:05,160 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-11-13 21:37:05,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-13 21:37:05,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-13 21:37:05,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-13 21:37:05,161 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-11-13 21:37:05,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-11-13 21:37:05,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-13 21:37:05,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-13 21:37:05,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-13 21:37:05,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-13 21:37:05,163 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-13 21:37:05,453 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-13 21:37:05,454 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-11-13 21:37:05,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:37:05 BoogieIcfgContainer [2021-11-13 21:37:05,456 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-13 21:37:05,457 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-13 21:37:05,457 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-13 21:37:05,460 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-13 21:37:05,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 09:37:04" (1/3) ... [2021-11-13 21:37:05,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c661b56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 09:37:05, skipping insertion in model container [2021-11-13 21:37:05,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:37:05" (2/3) ... [2021-11-13 21:37:05,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c661b56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 09:37:05, skipping insertion in model container [2021-11-13 21:37:05,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:37:05" (3/3) ... [2021-11-13 21:37:05,462 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-bad-threaded-sum-2.wvr.c [2021-11-13 21:37:05,466 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-13 21:37:05,466 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-13 21:37:05,466 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-13 21:37:05,466 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-13 21:37:05,488 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 21:37:05,488 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 21:37:05,488 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 21:37:05,489 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 21:37:05,489 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 21:37:05,489 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 21:37:05,489 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 21:37:05,489 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 21:37:05,489 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 21:37:05,489 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 21:37:05,490 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 21:37:05,490 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 21:37:05,490 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 21:37:05,491 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 21:37:05,491 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 21:37:05,491 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 21:37:05,491 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 21:37:05,491 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 21:37:05,491 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 21:37:05,491 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 21:37:05,492 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~cond~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 21:37:05,492 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~cond~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 21:37:05,492 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~cond~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 21:37:05,492 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~cond~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 21:37:05,492 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~cond~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 21:37:05,493 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~cond~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 21:37:05,493 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 21:37:05,493 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 21:37:05,494 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 21:37:05,494 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 21:37:05,494 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 21:37:05,494 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 21:37:05,494 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 21:37:05,494 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 21:37:05,494 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~cond~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 21:37:05,495 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~cond~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 21:37:05,497 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 21:37:05,497 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 21:37:05,497 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 21:37:05,497 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 21:37:05,498 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~cond~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 21:37:05,499 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 21:37:05,499 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 21:37:05,499 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 21:37:05,499 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 21:37:05,499 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 21:37:05,501 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2021-11-13 21:37:05,536 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2021-11-13 21:37:05,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-13 21:37:05,540 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2021-11-13 21:37:05,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2021-11-13 21:37:05,562 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2021-11-13 21:37:05,568 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=PARTIAL_ORDER_FA, 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 [2021-11-13 21:37:05,568 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-11-13 21:37:05,677 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-13 21:37:05,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 21:37:05,681 INFO L85 PathProgramCache]: Analyzing trace with hash 489249638, now seen corresponding path program 1 times [2021-11-13 21:37:05,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 21:37:05,687 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108893032] [2021-11-13 21:37:05,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 21:37:05,687 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 21:37:05,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 21:37:05,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 21:37:05,814 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 21:37:05,814 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108893032] [2021-11-13 21:37:05,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108893032] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 21:37:05,815 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 21:37:05,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-13 21:37:05,816 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58110371] [2021-11-13 21:37:05,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 21:37:05,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-13 21:37:05,821 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 21:37:05,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-13 21:37:05,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-13 21:37:05,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 21:37:05,840 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-13 21:37:05,841 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 21:37:05,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 21:37:05,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 21:37:05,861 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-13 21:37:05,861 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-13 21:37:05,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 21:37:05,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1040236633, now seen corresponding path program 1 times [2021-11-13 21:37:05,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 21:37:05,862 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902790391] [2021-11-13 21:37:05,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 21:37:05,863 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 21:37:05,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 21:37:06,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 21:37:06,219 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 21:37:06,219 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902790391] [2021-11-13 21:37:06,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902790391] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 21:37:06,219 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 21:37:06,219 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-13 21:37:06,219 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102132724] [2021-11-13 21:37:06,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 21:37:06,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-13 21:37:06,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 21:37:06,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-13 21:37:06,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-13 21:37:06,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 21:37:06,222 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-13 21:37:06,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 21:37:06,222 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 21:37:06,222 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 21:37:06,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 21:37:06,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-13 21:37:06,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-13 21:37:06,369 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-13 21:37:06,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 21:37:06,369 INFO L85 PathProgramCache]: Analyzing trace with hash -894117372, now seen corresponding path program 1 times [2021-11-13 21:37:06,370 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 21:37:06,370 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382235564] [2021-11-13 21:37:06,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 21:37:06,370 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 21:37:06,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 21:37:06,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 21:37:06,507 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 21:37:06,507 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382235564] [2021-11-13 21:37:06,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382235564] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 21:37:06,507 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 21:37:06,508 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-13 21:37:06,508 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208866572] [2021-11-13 21:37:06,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 21:37:06,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-13 21:37:06,509 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 21:37:06,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-13 21:37:06,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-13 21:37:06,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 21:37:06,509 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-13 21:37:06,510 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 21:37:06,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 21:37:06,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2021-11-13 21:37:06,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 21:37:06,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 21:37:06,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-13 21:37:06,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-13 21:37:06,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-13 21:37:06,712 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-13 21:37:06,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 21:37:06,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1934098060, now seen corresponding path program 1 times [2021-11-13 21:37:06,714 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 21:37:06,714 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753816851] [2021-11-13 21:37:06,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 21:37:06,715 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 21:37:06,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 21:37:06,930 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-13 21:37:06,930 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 21:37:06,931 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753816851] [2021-11-13 21:37:06,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753816851] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 21:37:06,931 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 21:37:06,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-13 21:37:06,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554813327] [2021-11-13 21:37:06,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 21:37:06,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-13 21:37:06,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 21:37:06,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-13 21:37:06,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-13 21:37:06,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 21:37:06,933 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-13 21:37:06,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 21:37:06,933 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 21:37:06,933 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2021-11-13 21:37:06,933 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2021-11-13 21:37:06,933 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 21:37:07,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 21:37:07,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-13 21:37:07,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-13 21:37:07,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-13 21:37:07,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-13 21:37:07,029 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-13 21:37:07,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 21:37:07,034 INFO L85 PathProgramCache]: Analyzing trace with hash 611183953, now seen corresponding path program 2 times [2021-11-13 21:37:07,034 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 21:37:07,034 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007297822] [2021-11-13 21:37:07,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 21:37:07,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 21:37:07,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 21:37:07,299 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-13 21:37:07,299 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 21:37:07,300 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007297822] [2021-11-13 21:37:07,300 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007297822] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 21:37:07,300 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140112479] [2021-11-13 21:37:07,300 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-13 21:37:07,300 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 21:37:07,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-13 21:37:07,302 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) [2021-11-13 21:37:07,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-13 21:37:07,379 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-13 21:37:07,379 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-13 21:37:07,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-13 21:37:07,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 21:37:07,831 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-13 21:37:07,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 21:37:08,216 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-13 21:37:08,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140112479] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-13 21:37:08,217 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-13 21:37:08,217 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 18 [2021-11-13 21:37:08,217 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158368675] [2021-11-13 21:37:08,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-13 21:37:08,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-13 21:37:08,219 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 21:37:08,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-13 21:37:08,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2021-11-13 21:37:08,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 21:37:08,221 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-13 21:37:08,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.388888888888889) internal successors, (133), 18 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 21:37:08,222 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 21:37:08,222 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2021-11-13 21:37:08,223 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2021-11-13 21:37:08,223 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2021-11-13 21:37:08,223 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 21:37:08,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 21:37:08,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-13 21:37:08,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-13 21:37:08,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-13 21:37:08,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-13 21:37:08,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-13 21:37:08,993 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 21:37:08,994 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-13 21:37:08,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 21:37:08,994 INFO L85 PathProgramCache]: Analyzing trace with hash -29380355, now seen corresponding path program 3 times [2021-11-13 21:37:08,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 21:37:08,995 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878995226] [2021-11-13 21:37:08,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 21:37:08,995 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 21:37:09,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 21:37:09,115 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-13 21:37:09,116 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 21:37:09,116 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878995226] [2021-11-13 21:37:09,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878995226] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 21:37:09,116 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 21:37:09,117 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-13 21:37:09,117 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735042575] [2021-11-13 21:37:09,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 21:37:09,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-13 21:37:09,118 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 21:37:09,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-13 21:37:09,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-13 21:37:09,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 21:37:09,118 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-13 21:37:09,119 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 21:37:09,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 21:37:09,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2021-11-13 21:37:09,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2021-11-13 21:37:09,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2021-11-13 21:37:09,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2021-11-13 21:37:09,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 21:37:09,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 21:37:09,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-13 21:37:09,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-13 21:37:09,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-13 21:37:09,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-13 21:37:09,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-13 21:37:09,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-13 21:37:09,420 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-13 21:37:09,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 21:37:09,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1072426179, now seen corresponding path program 4 times [2021-11-13 21:37:09,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 21:37:09,421 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404813214] [2021-11-13 21:37:09,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 21:37:09,422 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 21:37:09,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 21:37:15,406 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 21:37:15,406 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 21:37:15,406 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404813214] [2021-11-13 21:37:15,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404813214] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 21:37:15,407 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904435317] [2021-11-13 21:37:15,407 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-13 21:37:15,407 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 21:37:15,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-13 21:37:15,411 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) [2021-11-13 21:37:15,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-13 21:37:15,892 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-13 21:37:15,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-13 21:37:15,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 29 conjunts are in the unsatisfiable core [2021-11-13 21:37:15,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 21:37:18,472 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 21:37:18,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 21:37:27,132 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 21:37:27,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904435317] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-13 21:37:27,133 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-13 21:37:27,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 41 [2021-11-13 21:37:27,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703053604] [2021-11-13 21:37:27,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-13 21:37:27,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-11-13 21:37:27,134 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 21:37:27,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-11-13 21:37:27,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=1375, Unknown=0, NotChecked=0, Total=1640 [2021-11-13 21:37:27,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 21:37:27,135 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-13 21:37:27,136 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 4.195121951219512) internal successors, (172), 41 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 21:37:27,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 21:37:27,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2021-11-13 21:37:27,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2021-11-13 21:37:27,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2021-11-13 21:37:27,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2021-11-13 21:37:27,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2021-11-13 21:37:27,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 21:37:41,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 21:37:41,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-13 21:37:41,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-13 21:37:41,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-13 21:37:41,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-13 21:37:41,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-13 21:37:41,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-13 21:37:41,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-13 21:37:41,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 21:37:41,892 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-13 21:37:41,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 21:37:41,892 INFO L85 PathProgramCache]: Analyzing trace with hash 632220060, now seen corresponding path program 5 times [2021-11-13 21:37:41,892 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 21:37:41,892 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450242118] [2021-11-13 21:37:41,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 21:37:41,892 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 21:37:42,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 21:37:55,134 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 21:37:55,134 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 21:37:55,134 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450242118] [2021-11-13 21:37:55,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450242118] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 21:37:55,135 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227291140] [2021-11-13 21:37:55,135 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-11-13 21:37:55,135 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 21:37:55,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-13 21:37:55,140 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) [2021-11-13 21:37:55,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-13 21:37:55,475 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2021-11-13 21:37:55,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-13 21:37:55,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 38 conjunts are in the unsatisfiable core [2021-11-13 21:37:55,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 21:38:04,732 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 21:38:04,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 21:40:23,046 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 21:40:23,046 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227291140] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-13 21:40:23,047 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-13 21:40:23,047 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 24, 24] total 56 [2021-11-13 21:40:23,047 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772469888] [2021-11-13 21:40:23,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-13 21:40:23,048 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2021-11-13 21:40:23,048 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 21:40:23,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2021-11-13 21:40:23,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=442, Invalid=2602, Unknown=36, NotChecked=0, Total=3080 [2021-11-13 21:40:23,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 21:40:23,049 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-13 21:40:23,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 3.625) internal successors, (203), 56 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 21:40:23,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 21:40:23,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2021-11-13 21:40:23,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2021-11-13 21:40:23,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2021-11-13 21:40:23,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2021-11-13 21:40:23,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2021-11-13 21:40:23,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2021-11-13 21:40:23,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 21:40:50,646 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:40:55,516 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:41:07,309 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:41:14,693 WARN L227 SmtUtils]: Spent 6.07s on a formula simplification. DAG size of input: 153 DAG size of output: 66 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-13 21:41:26,413 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:41:29,107 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:41:31,116 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:43:25,704 WARN L227 SmtUtils]: Spent 1.22m on a formula simplification. DAG size of input: 289 DAG size of output: 198 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-13 21:43:27,817 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:43:30,378 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:43:32,395 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:45:14,367 WARN L227 SmtUtils]: Spent 1.13m on a formula simplification. DAG size of input: 296 DAG size of output: 205 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-13 21:45:17,160 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:45:19,437 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:45:21,448 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:45:23,653 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse43 (+ c_~T~0 c_~S~0)) (.cse42 (div c_~m~0 4294967296))) (let ((.cse41 (* 4294967296 .cse42)) (.cse21 (div .cse43 4294967296))) (let ((.cse29 (* 4294967296 .cse21)) (.cse45 (+ c_~T~0 c_~S~0 .cse41))) (let ((.cse3 (* c_~S~0 (- 1))) (.cse39 (<= (+ .cse29 c_~m~0) .cse45)) (.cse25 (div c_~t~0 4294967296)) (.cse33 (+ .cse29 3 c_~m~0)) (.cse10 (div (+ 2 c_~m~0) 4294967296)) (.cse48 (+ .cse29 2 c_~m~0)) (.cse46 (+ .cse29 c_~m~0 1))) (let ((.cse14 (< 0 (mod (+ 4294967295 c_~t~0) 4294967296))) (.cse6 (< 0 (mod (+ 4294967294 c_~s~0) 4294967296))) (.cse2 (div (+ 3 c_~m~0) 4294967296)) (.cse11 (or (let ((.cse49 (+ (* 4294967296 (div (+ c_~m~0 1) 4294967296)) c_~T~0 c_~S~0))) (and (< .cse49 .cse48) (<= .cse46 .cse49))) (< 0 (mod c_~s~0 4294967296)))) (.cse7 (div (+ c_~m~0 4) 4294967296)) (.cse8 (< 0 (mod (+ c_~s~0 4294967293) 4294967296))) (.cse9 (< 0 (mod (+ 4294967295 c_~s~0) 4294967296))) (.cse12 (let ((.cse47 (+ (* 4294967296 .cse10) c_~T~0 c_~S~0))) (and (< .cse47 .cse33) (<= .cse48 .cse47)))) (.cse30 (div (+ 5 c_~m~0) 4294967296)) (.cse26 (div c_~s~0 4294967296)) (.cse15 (* 4294967296 .cse25)) (.cse0 (and .cse39 (< .cse45 .cse46))) (.cse1 (div (+ (- 8589934591) c_~S~0) (- 4294967296))) (.cse4 (* c_~m~0 (- 1))) (.cse5 (div (+ 4294967294 .cse3) 4294967296)) (.cse13 (* c_~s~0 (- 1)))) (and (or .cse0 (< 0 (mod c_thread2Thread1of1ForFork0_~cond~1 256))) (or (and (<= (+ .cse1 .cse2) (+ (div (+ c_~m~0 .cse3 4294967298) 4294967296) 1)) (<= (div (+ .cse4 c_~S~0 (- 4294967298)) (- 4294967296)) (+ .cse2 .cse5 1))) .cse6) (or (and (<= (div (+ .cse4 c_~S~0 (- 4294967299)) (- 4294967296)) (+ .cse5 .cse7 1)) (<= (+ .cse1 .cse7) (+ (div (+ c_~m~0 .cse3 4294967299) 4294967296) 1))) .cse8) (or .cse9 (and (<= (div (+ .cse4 c_~S~0 (- 4294967297)) (- 4294967296)) (+ .cse5 .cse10 1)) (<= (+ .cse1 .cse10) (+ (div (+ c_~m~0 .cse3 4294967297) 4294967296) 1)))) (or (and (or .cse0 (< 0 (mod (+ c_~s~0 1) 4294967296))) .cse11 (or .cse12 (< (div .cse13 (- 4294967296)) (+ 2 (div (+ (- 2) c_~s~0) 4294967296))))) .cse14) (let ((.cse20 (* 4294967296 .cse26))) (let ((.cse19 (<= c_~s~0 .cse20))) (or (<= c_~t~0 .cse15) (let ((.cse18 (+ c_~s~0 c_~m~0))) (let ((.cse17 (<= c_~S~0 .cse18)) (.cse16 (* .cse26 4294967296))) (and (or (and (<= (+ (* 4294967296 (div c_~S~0 4294967296)) 4) (+ (* 4294967296 (div (+ .cse4 c_~S~0 .cse16 .cse13) 4294967296)) c_~m~0)) .cse17 (<= .cse18 c_~S~0)) .cse19) (or (< .cse20 c_~s~0) (let ((.cse22 (+ .cse25 .cse26 1))) (let ((.cse23 (* 4294967296 (div (+ (* c_~t~0 (- 1)) (* .cse25 4294967296) .cse16 4) 4294967296))) (.cse24 (<= .cse22 .cse21))) (and (or (< .cse21 .cse22) (<= c_~S~0 (+ 3 c_~s~0))) (or (<= (+ .cse23 c_~m~0) c_~S~0) .cse24) (or (<= (+ .cse20 .cse23 3) (+ (* 4294967296 (div (+ (- 1) .cse4 c_~t~0 c_~S~0 (* .cse25 (- 4294967296))) 4294967296)) c_~S~0)) .cse24) (<= 3 c_~m~0) .cse17))) (and (<= 4 c_~m~0) (<= (+ .cse20 .cse15 c_~m~0 1) (+ c_~t~0 c_~S~0)) (<= c_~S~0 (+ c_~s~0 4))))))) (and .cse19 (<= c_~S~0 (+ c_~m~0 (* 4294967296 (div (+ .cse4 c_~S~0) 4294967296)))))))) (= c_~t~0 c_~T~0) (or .cse14 (let ((.cse32 (+ .cse29 c_~m~0 4)) (.cse27 (+ .cse29 5 c_~m~0))) (and (or (let ((.cse28 (+ (* 4294967296 .cse30) c_~T~0 c_~S~0))) (and (<= .cse27 .cse28) (< .cse28 (+ .cse29 6 c_~m~0)))) (< (div (+ 3 .cse13) (- 4294967296)) (+ 2 (div (+ c_~s~0 (- 5)) 4294967296)))) (or .cse6 (let ((.cse31 (+ c_~T~0 c_~S~0 (* 4294967296 .cse2)))) (and (< .cse31 .cse32) (<= .cse33 .cse31)))) .cse11 (or (let ((.cse34 (+ c_~T~0 c_~S~0 (* 4294967296 .cse7)))) (and (<= .cse32 .cse34) (< .cse34 .cse27))) .cse8) (or .cse9 .cse12)))) (or (and (<= (+ .cse1 .cse30) (+ (div (+ c_~m~0 .cse3 4294967300) 4294967296) 1)) (<= (div (+ .cse4 c_~S~0 (- 4294967300)) (- 4294967296)) (+ .cse30 .cse5 1))) (< 0 (mod (+ 4294967292 c_~s~0) 4294967296))) (let ((.cse37 (+ .cse15 c_~T~0 c_~S~0 .cse41)) (.cse35 (<= .cse43 (+ c_~t~0 c_~s~0 c_~m~0))) (.cse40 (<= (+ .cse25 .cse26 .cse42 1) .cse21)) (.cse38 (<= (+ .cse25 .cse26 .cse42) .cse21)) (.cse36 (+ .cse29 c_~t~0 c_~m~0))) (or (and .cse35 (<= .cse36 .cse37) .cse38) (and .cse39 (<= .cse37 .cse36)) (<= (+ .cse15 4) c_~t~0) (and .cse35 .cse40) (and (or .cse40 (and (<= (+ .cse29 4294967295) (+ c_~t~0 c_~s~0 .cse41)) .cse38)) (<= (+ .cse29 3) (+ .cse15 c_~s~0 c_~m~0))) (<= (+ .cse15 c_~T~0 c_~S~0 4294967296 .cse41) .cse36))) (or (< 0 (mod c_~t~0 4294967296)) .cse0) (or (let ((.cse44 (div (+ 6 c_~m~0) 4294967296))) (and (<= (+ .cse44 .cse1) (+ (div (+ c_~m~0 .cse3 4294967301) 4294967296) 1)) (<= (div (+ .cse4 (- 4294967301) c_~S~0) (- 4294967296)) (+ .cse44 .cse5 1)))) (< (div (+ 4 .cse13) (- 4294967296)) (+ 2 (div (+ c_~s~0 (- 6)) 4294967296)))))))))) is different from false [2021-11-13 21:45:27,419 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:45:29,489 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:45:32,333 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:45:34,341 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:45:36,356 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse19 (div (+ c_~T~0 c_~S~0) 4294967296)) (.cse20 (div c_~m~0 4294967296))) (let ((.cse26 (* 4294967296 .cse20)) (.cse14 (* 4294967296 .cse19))) (let ((.cse24 (+ .cse14 c_~m~0)) (.cse23 (+ c_~T~0 c_~S~0 .cse26)) (.cse42 (div c_~t~0 4294967296)) (.cse53 (+ .cse14 2 c_~m~0)) (.cse54 (+ .cse14 c_~m~0 1))) (let ((.cse2 (* c_~S~0 (- 1))) (.cse49 (+ .cse14 3 c_~m~0)) (.cse10 (div (+ 2 c_~m~0) 4294967296)) (.cse34 (let ((.cse55 (+ (* 4294967296 (div (+ c_~m~0 1) 4294967296)) c_~T~0 c_~S~0))) (and (< .cse55 .cse53) (<= .cse54 .cse55)))) (.cse33 (< 0 (mod c_~s~0 4294967296))) (.cse13 (* 4294967296 .cse42)) (.cse6 (<= .cse24 .cse23)) (.cse11 (< .cse23 .cse54))) (let ((.cse28 (and .cse6 .cse11)) (.cse12 (<= c_~t~0 .cse13)) (.cse25 (* 4294967296 (div c_~S~0 4294967296))) (.cse18 (* c_~t~0 (- 1))) (.cse27 (+ c_~s~0 c_~m~0)) (.cse32 (< 0 (mod (+ 4294967295 c_~t~0) 4294967296))) (.cse5 (< 0 (mod (+ 4294967294 c_~s~0) 4294967296))) (.cse1 (div (+ 3 c_~m~0) 4294967296)) (.cse29 (or .cse34 .cse33)) (.cse7 (div (+ c_~m~0 4) 4294967296)) (.cse8 (< 0 (mod (+ c_~s~0 4294967293) 4294967296))) (.cse9 (< 0 (mod (+ 4294967295 c_~s~0) 4294967296))) (.cse30 (let ((.cse52 (+ (* 4294967296 .cse10) c_~T~0 c_~S~0))) (and (< .cse52 .cse49) (<= .cse53 .cse52)))) (.cse46 (div (+ 5 c_~m~0) 4294967296)) (.cse0 (div (+ (- 8589934591) c_~S~0) (- 4294967296))) (.cse3 (* c_~m~0 (- 1))) (.cse4 (div (+ 4294967294 .cse2) 4294967296)) (.cse31 (* c_~s~0 (- 1)))) (and (or (and (<= (+ .cse0 .cse1) (+ (div (+ c_~m~0 .cse2 4294967298) 4294967296) 1)) (<= (div (+ .cse3 c_~S~0 (- 4294967298)) (- 4294967296)) (+ .cse1 .cse4 1))) .cse5) .cse6 (or (and (<= (div (+ .cse3 c_~S~0 (- 4294967299)) (- 4294967296)) (+ .cse4 .cse7 1)) (<= (+ .cse0 .cse7) (+ (div (+ c_~m~0 .cse2 4294967299) 4294967296) 1))) .cse8) (or .cse9 (and (<= (div (+ .cse3 c_~S~0 (- 4294967297)) (- 4294967296)) (+ .cse4 .cse10 1)) (<= (+ .cse0 .cse10) (+ (div (+ c_~m~0 .cse2 4294967297) 4294967296) 1)))) .cse11 (let ((.cse17 (+ c_~S~0 1))) (let ((.cse15 (<= (+ .cse13 c_~S~0 .cse26 1) .cse24)) (.cse21 (<= .cse27 .cse17))) (or .cse12 (<= (+ 4294967292 .cse13 c_~S~0) .cse14) (and (let ((.cse16 (* 4294967296 (div (+ .cse18 4 (* .cse19 4294967296)) 4294967296)))) (or (and .cse15 (<= (+ .cse16 c_~m~0) .cse17)) (<= (+ .cse16 4294967299) c_~S~0))) (< 0 (+ .cse20 1))) (<= (+ (* 4294967296 (div (+ .cse3 c_~S~0 4294967296) 4294967296)) c_~m~0) .cse17) (let ((.cse22 (<= .cse17 .cse27))) (and (or .cse6 (and .cse21 .cse22)) (or (< .cse23 .cse24) (and (<= (+ .cse25 5 .cse13 c_~s~0 .cse26) (+ .cse14 c_~S~0)) .cse22)))) (and .cse6 .cse15) (and (<= c_~S~0 (+ (* 4294967296 (div (+ c_~s~0 c_~m~0 (- 3)) 4294967296)) 2)) (or (<= (+ .cse13 c_~s~0 .cse26 1) .cse14) (and (<= (+ .cse14 4294967296) (+ c_~t~0 c_~s~0 .cse26)) .cse21)))))) (or (and (or .cse28 (< 0 (mod (+ c_~s~0 1) 4294967296))) .cse29 (or .cse30 (< (div .cse31 (- 4294967296)) (+ 2 (div (+ (- 2) c_~s~0) 4294967296))))) .cse32) (or (and (or .cse28 .cse33) (or .cse30 (< (div (+ .cse31 1) (- 4294967296)) (+ 2 (div (+ c_~s~0 (- 3)) 4294967296)))) (or .cse9 .cse34)) .cse32) (let ((.cse43 (div c_~s~0 4294967296))) (let ((.cse38 (* 4294967296 .cse43))) (let ((.cse37 (<= c_~s~0 .cse38))) (or .cse12 (let ((.cse36 (<= c_~S~0 .cse27)) (.cse35 (* .cse43 4294967296))) (and (or (and (<= (+ .cse25 4) (+ (* 4294967296 (div (+ .cse3 c_~S~0 .cse35 .cse31) 4294967296)) c_~m~0)) .cse36 (<= .cse27 c_~S~0)) .cse37) (or (< .cse38 c_~s~0) (let ((.cse39 (+ .cse42 .cse43 1))) (let ((.cse40 (* 4294967296 (div (+ .cse18 (* .cse42 4294967296) .cse35 4) 4294967296))) (.cse41 (<= .cse39 .cse19))) (and (or (< .cse19 .cse39) (<= c_~S~0 (+ 3 c_~s~0))) (or (<= (+ .cse40 c_~m~0) c_~S~0) .cse41) (or (<= (+ .cse38 .cse40 3) (+ (* 4294967296 (div (+ (- 1) .cse3 c_~t~0 c_~S~0 (* .cse42 (- 4294967296))) 4294967296)) c_~S~0)) .cse41) (<= 3 c_~m~0) .cse36))) (and (<= 4 c_~m~0) (<= (+ .cse38 .cse13 c_~m~0 1) (+ c_~t~0 c_~S~0)) (<= c_~S~0 (+ c_~s~0 4)))))) (and .cse37 (<= c_~S~0 (+ c_~m~0 (* 4294967296 (div (+ .cse3 c_~S~0) 4294967296))))))))) (= c_~t~0 c_~T~0) (or .cse32 (let ((.cse48 (+ .cse14 c_~m~0 4)) (.cse44 (+ .cse14 5 c_~m~0))) (and (or (let ((.cse45 (+ (* 4294967296 .cse46) c_~T~0 c_~S~0))) (and (<= .cse44 .cse45) (< .cse45 (+ .cse14 6 c_~m~0)))) (< (div (+ 3 .cse31) (- 4294967296)) (+ 2 (div (+ c_~s~0 (- 5)) 4294967296)))) (or .cse5 (let ((.cse47 (+ c_~T~0 c_~S~0 (* 4294967296 .cse1)))) (and (< .cse47 .cse48) (<= .cse49 .cse47)))) .cse29 (or (let ((.cse50 (+ c_~T~0 c_~S~0 (* 4294967296 .cse7)))) (and (<= .cse48 .cse50) (< .cse50 .cse44))) .cse8) (or .cse9 .cse30)))) (or (and (<= (+ .cse0 .cse46) (+ (div (+ c_~m~0 .cse2 4294967300) 4294967296) 1)) (<= (div (+ .cse3 c_~S~0 (- 4294967300)) (- 4294967296)) (+ .cse46 .cse4 1))) (< 0 (mod (+ 4294967292 c_~s~0) 4294967296))) (or (let ((.cse51 (div (+ 6 c_~m~0) 4294967296))) (and (<= (+ .cse51 .cse0) (+ (div (+ c_~m~0 .cse2 4294967301) 4294967296) 1)) (<= (div (+ .cse3 (- 4294967301) c_~S~0) (- 4294967296)) (+ .cse51 .cse4 1)))) (< (div (+ 4 .cse31) (- 4294967296)) (+ 2 (div (+ c_~s~0 (- 6)) 4294967296)))))))))) is different from false [2021-11-13 21:45:39,046 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:45:41,263 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:45:43,273 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:45:45,507 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:45:47,589 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:45:49,601 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:45:51,615 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse43 (+ c_~T~0 c_~S~0)) (.cse42 (div c_~m~0 4294967296))) (let ((.cse41 (* 4294967296 .cse42)) (.cse21 (div .cse43 4294967296))) (let ((.cse29 (* 4294967296 .cse21)) (.cse45 (+ c_~T~0 c_~S~0 .cse41))) (let ((.cse3 (* c_~S~0 (- 1))) (.cse39 (<= (+ .cse29 c_~m~0) .cse45)) (.cse25 (div c_~t~0 4294967296)) (.cse33 (+ .cse29 3 c_~m~0)) (.cse10 (div (+ 2 c_~m~0) 4294967296)) (.cse48 (+ .cse29 2 c_~m~0)) (.cse46 (+ .cse29 c_~m~0 1))) (let ((.cse14 (< 0 (mod (+ 4294967295 c_~t~0) 4294967296))) (.cse6 (< 0 (mod (+ 4294967294 c_~s~0) 4294967296))) (.cse2 (div (+ 3 c_~m~0) 4294967296)) (.cse11 (or (let ((.cse49 (+ (* 4294967296 (div (+ c_~m~0 1) 4294967296)) c_~T~0 c_~S~0))) (and (< .cse49 .cse48) (<= .cse46 .cse49))) (< 0 (mod c_~s~0 4294967296)))) (.cse7 (div (+ c_~m~0 4) 4294967296)) (.cse8 (< 0 (mod (+ c_~s~0 4294967293) 4294967296))) (.cse9 (< 0 (mod (+ 4294967295 c_~s~0) 4294967296))) (.cse12 (let ((.cse47 (+ (* 4294967296 .cse10) c_~T~0 c_~S~0))) (and (< .cse47 .cse33) (<= .cse48 .cse47)))) (.cse30 (div (+ 5 c_~m~0) 4294967296)) (.cse26 (div c_~s~0 4294967296)) (.cse15 (* 4294967296 .cse25)) (.cse0 (and .cse39 (< .cse45 .cse46))) (.cse1 (div (+ (- 8589934591) c_~S~0) (- 4294967296))) (.cse4 (* c_~m~0 (- 1))) (.cse5 (div (+ 4294967294 .cse3) 4294967296)) (.cse13 (* c_~s~0 (- 1)))) (and (or .cse0 (< 0 (mod c_thread2Thread1of1ForFork0_~cond~1 256))) (or (and (<= (+ .cse1 .cse2) (+ (div (+ c_~m~0 .cse3 4294967298) 4294967296) 1)) (<= (div (+ .cse4 c_~S~0 (- 4294967298)) (- 4294967296)) (+ .cse2 .cse5 1))) .cse6) (or (and (<= (div (+ .cse4 c_~S~0 (- 4294967299)) (- 4294967296)) (+ .cse5 .cse7 1)) (<= (+ .cse1 .cse7) (+ (div (+ c_~m~0 .cse3 4294967299) 4294967296) 1))) .cse8) (or .cse9 (and (<= (div (+ .cse4 c_~S~0 (- 4294967297)) (- 4294967296)) (+ .cse5 .cse10 1)) (<= (+ .cse1 .cse10) (+ (div (+ c_~m~0 .cse3 4294967297) 4294967296) 1)))) (or (and (or .cse0 (< 0 (mod (+ c_~s~0 1) 4294967296))) .cse11 (or .cse12 (< (div .cse13 (- 4294967296)) (+ 2 (div (+ (- 2) c_~s~0) 4294967296))))) .cse14) (let ((.cse20 (* 4294967296 .cse26))) (let ((.cse19 (<= c_~s~0 .cse20))) (or (<= c_~t~0 .cse15) (let ((.cse18 (+ c_~s~0 c_~m~0))) (let ((.cse17 (<= c_~S~0 .cse18)) (.cse16 (* .cse26 4294967296))) (and (or (and (<= (+ (* 4294967296 (div c_~S~0 4294967296)) 4) (+ (* 4294967296 (div (+ .cse4 c_~S~0 .cse16 .cse13) 4294967296)) c_~m~0)) .cse17 (<= .cse18 c_~S~0)) .cse19) (or (< .cse20 c_~s~0) (let ((.cse22 (+ .cse25 .cse26 1))) (let ((.cse23 (* 4294967296 (div (+ (* c_~t~0 (- 1)) (* .cse25 4294967296) .cse16 4) 4294967296))) (.cse24 (<= .cse22 .cse21))) (and (or (< .cse21 .cse22) (<= c_~S~0 (+ 3 c_~s~0))) (or (<= (+ .cse23 c_~m~0) c_~S~0) .cse24) (or (<= (+ .cse20 .cse23 3) (+ (* 4294967296 (div (+ (- 1) .cse4 c_~t~0 c_~S~0 (* .cse25 (- 4294967296))) 4294967296)) c_~S~0)) .cse24) (<= 3 c_~m~0) .cse17))) (and (<= 4 c_~m~0) (<= (+ .cse20 .cse15 c_~m~0 1) (+ c_~t~0 c_~S~0)) (<= c_~S~0 (+ c_~s~0 4))))))) (and .cse19 (<= c_~S~0 (+ c_~m~0 (* 4294967296 (div (+ .cse4 c_~S~0) 4294967296)))))))) (= c_~t~0 c_~T~0) (or .cse14 (let ((.cse32 (+ .cse29 c_~m~0 4)) (.cse27 (+ .cse29 5 c_~m~0))) (and (or (let ((.cse28 (+ (* 4294967296 .cse30) c_~T~0 c_~S~0))) (and (<= .cse27 .cse28) (< .cse28 (+ .cse29 6 c_~m~0)))) (< (div (+ 3 .cse13) (- 4294967296)) (+ 2 (div (+ c_~s~0 (- 5)) 4294967296)))) (or .cse6 (let ((.cse31 (+ c_~T~0 c_~S~0 (* 4294967296 .cse2)))) (and (< .cse31 .cse32) (<= .cse33 .cse31)))) .cse11 (or (let ((.cse34 (+ c_~T~0 c_~S~0 (* 4294967296 .cse7)))) (and (<= .cse32 .cse34) (< .cse34 .cse27))) .cse8) (or .cse9 .cse12)))) (or (and (<= (+ .cse1 .cse30) (+ (div (+ c_~m~0 .cse3 4294967300) 4294967296) 1)) (<= (div (+ .cse4 c_~S~0 (- 4294967300)) (- 4294967296)) (+ .cse30 .cse5 1))) (< 0 (mod (+ 4294967292 c_~s~0) 4294967296))) (let ((.cse37 (+ .cse15 c_~T~0 c_~S~0 .cse41)) (.cse35 (<= .cse43 (+ c_~t~0 c_~s~0 c_~m~0))) (.cse40 (<= (+ .cse25 .cse26 .cse42 1) .cse21)) (.cse38 (<= (+ .cse25 .cse26 .cse42) .cse21)) (.cse36 (+ .cse29 c_~t~0 c_~m~0))) (or (and .cse35 (<= .cse36 .cse37) .cse38) (and .cse39 (<= .cse37 .cse36)) (<= (+ .cse15 4) c_~t~0) (and .cse35 .cse40) (and (or .cse40 (and (<= (+ .cse29 4294967295) (+ c_~t~0 c_~s~0 .cse41)) .cse38)) (<= (+ .cse29 3) (+ .cse15 c_~s~0 c_~m~0))) (<= (+ .cse15 c_~T~0 c_~S~0 4294967296 .cse41) .cse36))) (or (< 0 (mod c_~t~0 4294967296)) .cse0) (or .cse0 (and (<= (div c_thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 c_thread1Thread1of1ForFork1_~cond~0))) (or (let ((.cse44 (div (+ 6 c_~m~0) 4294967296))) (and (<= (+ .cse44 .cse1) (+ (div (+ c_~m~0 .cse3 4294967301) 4294967296) 1)) (<= (div (+ .cse4 (- 4294967301) c_~S~0) (- 4294967296)) (+ .cse44 .cse5 1)))) (< (div (+ 4 .cse13) (- 4294967296)) (+ 2 (div (+ c_~s~0 (- 6)) 4294967296)))))))))) is different from false [2021-11-13 21:45:54,750 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:45:56,860 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:45:59,175 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:46:01,188 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:46:03,747 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:46:05,760 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:46:33,936 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:46:35,970 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:46:37,980 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:46:40,005 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:46:42,558 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:46:44,578 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:46:46,587 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:46:48,601 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:46:50,610 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:46:52,623 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:46:54,640 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:46:56,655 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:46:58,664 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:47:00,675 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:47:02,700 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:47:33,254 WARN L227 SmtUtils]: Spent 7.51s on a formula simplification. DAG size of input: 168 DAG size of output: 95 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-13 21:47:35,001 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:47:37,005 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:47:39,032 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:48:03,512 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:48:05,529 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:48:07,549 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:48:09,560 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:48:11,598 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:48:13,620 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:48:15,634 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:48:17,646 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:48:19,673 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:48:21,690 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:48:23,702 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:48:25,722 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:48:27,738 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:48:29,756 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:48:31,765 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:48:33,782 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:48:35,796 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:48:37,808 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:48:39,828 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:48:41,838 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:48:43,902 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:48:45,913 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:48:47,939 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:48:49,949 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:49:16,666 WARN L227 SmtUtils]: Spent 12.20s on a formula simplification. DAG size of input: 166 DAG size of output: 93 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-13 21:49:17,733 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:49:25,772 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:49:27,972 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:49:30,191 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 21:49:55,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 21:49:55,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-13 21:49:55,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-13 21:49:55,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-13 21:49:55,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-13 21:49:55,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-13 21:49:55,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-13 21:49:55,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-11-13 21:49:55,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-13 21:49:55,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 21:49:55,891 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-13 21:49:55,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 21:49:55,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1602258150, now seen corresponding path program 6 times [2021-11-13 21:49:55,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 21:49:55,891 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379085749] [2021-11-13 21:49:55,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 21:49:55,892 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 21:49:55,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 21:50:03,181 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 21:50:03,182 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 21:50:03,182 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379085749] [2021-11-13 21:50:03,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379085749] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 21:50:03,182 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954950333] [2021-11-13 21:50:03,182 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-11-13 21:50:03,182 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 21:50:03,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-13 21:50:03,183 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) [2021-11-13 21:50:03,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-13 21:50:03,767 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2021-11-13 21:50:03,767 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-13 21:50:03,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 40 conjunts are in the unsatisfiable core [2021-11-13 21:50:03,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 21:50:41,008 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 21:50:41,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2021-11-13 21:51:33,860 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2021-11-13 21:51:33,862 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2021-11-13 21:51:33,872 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2021-11-13 21:51:34,281 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2021-11-13 21:51:34,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-11-13 21:51:34,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 21:51:34,482 WARN L594 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 93 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. [2021-11-13 21:51:34,484 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2021-11-13 21:51:34,484 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2021-11-13 21:51:34,490 INFO L732 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1] [2021-11-13 21:51:34,491 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-11-13 21:51:34,491 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-13 21:51:34,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 09:51:34 BasicIcfg [2021-11-13 21:51:34,495 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-13 21:51:34,495 INFO L158 Benchmark]: Toolchain (without parser) took 869727.27ms. Allocated memory was 388.0MB in the beginning and 476.1MB in the end (delta: 88.1MB). Free memory was 333.7MB in the beginning and 437.0MB in the end (delta: -103.3MB). Peak memory consumption was 263.3MB. Max. memory is 16.0GB. [2021-11-13 21:51:34,496 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 388.0MB. Free memory was 350.1MB in the beginning and 350.0MB in the end (delta: 95.5kB). There was no memory consumed. Max. memory is 16.0GB. [2021-11-13 21:51:34,496 INFO L158 Benchmark]: CACSL2BoogieTranslator took 236.38ms. Allocated memory is still 388.0MB. Free memory was 333.5MB in the beginning and 359.8MB in the end (delta: -26.3MB). Peak memory consumption was 17.5MB. Max. memory is 16.0GB. [2021-11-13 21:51:34,496 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.10ms. Allocated memory is still 388.0MB. Free memory was 359.8MB in the beginning and 358.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2021-11-13 21:51:34,497 INFO L158 Benchmark]: Boogie Preprocessor took 30.03ms. Allocated memory is still 388.0MB. Free memory was 358.0MB in the beginning and 357.0MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2021-11-13 21:51:34,497 INFO L158 Benchmark]: RCFGBuilder took 371.62ms. Allocated memory is still 388.0MB. Free memory was 357.0MB in the beginning and 343.7MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2021-11-13 21:51:34,498 INFO L158 Benchmark]: TraceAbstraction took 869038.33ms. Allocated memory was 388.0MB in the beginning and 476.1MB in the end (delta: 88.1MB). Free memory was 343.4MB in the beginning and 437.0MB in the end (delta: -93.6MB). Peak memory consumption was 273.0MB. Max. memory is 16.0GB. [2021-11-13 21:51:34,499 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.16ms. Allocated memory is still 388.0MB. Free memory was 350.1MB in the beginning and 350.0MB in the end (delta: 95.5kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 236.38ms. Allocated memory is still 388.0MB. Free memory was 333.5MB in the beginning and 359.8MB in the end (delta: -26.3MB). Peak memory consumption was 17.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 44.10ms. Allocated memory is still 388.0MB. Free memory was 359.8MB in the beginning and 358.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 30.03ms. Allocated memory is still 388.0MB. Free memory was 358.0MB in the beginning and 357.0MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 371.62ms. Allocated memory is still 388.0MB. Free memory was 357.0MB in the beginning and 343.7MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * TraceAbstraction took 869038.33ms. Allocated memory was 388.0MB in the beginning and 476.1MB in the end (delta: 88.1MB). Free memory was 343.4MB in the beginning and 437.0MB in the end (delta: -93.6MB). Peak memory consumption was 273.0MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1067, positive: 847, positive conditional: 465, positive unconditional: 382, negative: 220, negative conditional: 212, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 877, positive: 847, positive conditional: 465, positive unconditional: 382, negative: 30, negative conditional: 22, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 877, positive: 847, positive conditional: 465, positive unconditional: 382, negative: 30, negative conditional: 22, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 954, positive: 847, positive conditional: 391, positive unconditional: 456, negative: 107, negative conditional: 77, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 954, positive: 847, positive conditional: 334, positive unconditional: 513, negative: 107, negative conditional: 46, negative unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 954, positive: 847, positive conditional: 334, positive unconditional: 513, negative: 107, negative conditional: 46, negative unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 381, positive: 364, positive conditional: 10, positive unconditional: 354, negative: 17, negative conditional: 9, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 381, positive: 363, positive conditional: 0, positive unconditional: 363, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 18, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 17, negative conditional: 9, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 135, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 134, negative conditional: 72, negative unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 954, positive: 483, positive conditional: 324, positive unconditional: 159, negative: 90, negative conditional: 37, negative unconditional: 53, unknown: 381, unknown conditional: 19, unknown unconditional: 362] , Statistics on independence cache: Total cache size (in pairs): 381, Positive cache size: 364, Positive conditional cache size: 10, Positive unconditional cache size: 354, Negative cache size: 17, Negative conditional cache size: 9, Negative unconditional cache size: 8, Eliminated conditions: 88, Maximal queried relation: 6, Independence queries for same thread: 190 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 92.80ms, Number of persistent set computation: 86, Number of trivial persistent sets: 60, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 390, positive: 382, positive conditional: 0, positive unconditional: 382, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1067, positive: 847, positive conditional: 465, positive unconditional: 382, negative: 220, negative conditional: 212, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 877, positive: 847, positive conditional: 465, positive unconditional: 382, negative: 30, negative conditional: 22, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 877, positive: 847, positive conditional: 465, positive unconditional: 382, negative: 30, negative conditional: 22, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 954, positive: 847, positive conditional: 391, positive unconditional: 456, negative: 107, negative conditional: 77, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 954, positive: 847, positive conditional: 334, positive unconditional: 513, negative: 107, negative conditional: 46, negative unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 954, positive: 847, positive conditional: 334, positive unconditional: 513, negative: 107, negative conditional: 46, negative unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 381, positive: 364, positive conditional: 10, positive unconditional: 354, negative: 17, negative conditional: 9, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 381, positive: 363, positive conditional: 0, positive unconditional: 363, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 18, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 17, negative conditional: 9, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 135, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 134, negative conditional: 72, negative unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 954, positive: 483, positive conditional: 324, positive unconditional: 159, negative: 90, negative conditional: 37, negative unconditional: 53, unknown: 381, unknown conditional: 19, unknown unconditional: 362] , Statistics on independence cache: Total cache size (in pairs): 381, Positive cache size: 364, Positive conditional cache size: 10, Positive unconditional cache size: 354, Negative cache size: 17, Negative conditional cache size: 9, Negative unconditional cache size: 8, Eliminated conditions: 88, Maximal queried relation: 6, Independence queries for same thread: 190 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 93 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PartialOrderCegarLoop was analyzing trace of length 93 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 90]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PartialOrderCegarLoop was analyzing trace of length 93 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 100 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 869.0s, OverallIterations: 9, TraceHistogramMax: 0, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 588.6s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 135, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 179.5s InterpolantComputationTime, 847 NumberOfCodeBlocks, 847 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1074 ConstructedInterpolants, 0 QuantifiedInterpolants, 30893 SizeOfPredicates, 39 NumberOfNonLiveVariables, 480 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 14 InterpolantComputations, 5 PerfectInterpolantSequences, 89/292 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown