/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-POR-NewStatesSleepPersistentFixedOrder-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-lit/sssc12_variant.i
--------------------------------------------------------------------------------
This is Ultimate 0.2.2-wip.dk.mcr-reduction-820ea7a
[2022-02-19 00:35:35,890 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-02-19 00:35:35,891 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-02-19 00:35:35,939 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-02-19 00:35:35,940 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-02-19 00:35:35,941 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-02-19 00:35:35,942 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-02-19 00:35:35,944 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-02-19 00:35:35,946 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-02-19 00:35:35,946 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-02-19 00:35:35,947 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-02-19 00:35:35,948 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-02-19 00:35:35,949 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-02-19 00:35:35,949 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-02-19 00:35:35,950 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-02-19 00:35:35,951 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-02-19 00:35:35,952 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-02-19 00:35:35,953 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-02-19 00:35:35,955 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-02-19 00:35:35,956 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-02-19 00:35:35,957 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-02-19 00:35:35,958 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-02-19 00:35:35,959 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-02-19 00:35:35,960 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-02-19 00:35:35,962 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-02-19 00:35:35,963 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-02-19 00:35:35,963 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-02-19 00:35:35,964 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-02-19 00:35:35,964 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-02-19 00:35:35,965 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-02-19 00:35:35,965 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-02-19 00:35:35,966 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-02-19 00:35:35,967 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-02-19 00:35:35,967 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-02-19 00:35:35,968 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-02-19 00:35:35,969 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-02-19 00:35:35,969 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-02-19 00:35:35,970 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-02-19 00:35:35,970 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-02-19 00:35:35,971 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-02-19 00:35:35,971 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-02-19 00:35:35,972 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
[2022-02-19 00:35:35,989 INFO L113 SettingsManager]: Loading preferences was successful
[2022-02-19 00:35:35,990 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-02-19 00:35:35,990 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2022-02-19 00:35:35,990 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2022-02-19 00:35:35,991 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2022-02-19 00:35:35,991 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2022-02-19 00:35:35,991 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2022-02-19 00:35:35,992 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2022-02-19 00:35:35,992 INFO L138 SettingsManager]: * Use SBE=true
[2022-02-19 00:35:35,992 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-02-19 00:35:35,992 INFO L138 SettingsManager]: * sizeof long=4
[2022-02-19 00:35:35,992 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-02-19 00:35:35,992 INFO L138 SettingsManager]: * sizeof POINTER=4
[2022-02-19 00:35:35,993 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-02-19 00:35:35,993 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-02-19 00:35:35,993 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-02-19 00:35:35,993 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-02-19 00:35:35,993 INFO L138 SettingsManager]: * sizeof long double=12
[2022-02-19 00:35:35,994 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-02-19 00:35:35,994 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-02-19 00:35:35,994 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-02-19 00:35:35,994 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-02-19 00:35:35,994 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-02-19 00:35:35,994 INFO L138 SettingsManager]: * To the following directory=./dump/
[2022-02-19 00:35:35,995 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-02-19 00:35:35,995 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-02-19 00:35:35,995 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-02-19 00:35:35,995 INFO L138 SettingsManager]: * Construct finite automaton lazily=true
[2022-02-19 00:35:35,995 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2022-02-19 00:35:35,996 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2022-02-19 00:35:35,996 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2022-02-19 00:35:35,996 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2022-02-19 00:35:35,996 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF
[2022-02-19 00:35:35,996 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA
[2022-02-19 00:35:35,996 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-02-19 00:35:35,997 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE
[2022-02-19 00:35:35,997 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER
[2022-02-19 00:35:35,997 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
[2022-02-19 00:35:36,180 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-02-19 00:35:36,200 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-02-19 00:35:36,202 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-02-19 00:35:36,202 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-02-19 00:35:36,205 INFO L275 PluginConnector]: CDTParser initialized
[2022-02-19 00:35:36,206 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-lit/sssc12_variant.i
[2022-02-19 00:35:36,278 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bf93b0e7/9c3fbb7d91c74760b1e4205c99be3f7f/FLAGffc5a1fa5
[2022-02-19 00:35:36,789 INFO L306 CDTParser]: Found 1 translation units.
[2022-02-19 00:35:36,789 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-lit/sssc12_variant.i
[2022-02-19 00:35:36,810 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bf93b0e7/9c3fbb7d91c74760b1e4205c99be3f7f/FLAGffc5a1fa5
[2022-02-19 00:35:37,287 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bf93b0e7/9c3fbb7d91c74760b1e4205c99be3f7f
[2022-02-19 00:35:37,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-02-19 00:35:37,292 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements.
[2022-02-19 00:35:37,295 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-02-19 00:35:37,295 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-02-19 00:35:37,297 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-02-19 00:35:37,297 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 12:35:37" (1/1) ...
[2022-02-19 00:35:37,298 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a629c07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 12:35:37, skipping insertion in model container
[2022-02-19 00:35:37,298 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 12:35:37" (1/1) ...
[2022-02-19 00:35:37,303 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-02-19 00:35:37,352 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-02-19 00:35:37,682 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-lit/sssc12_variant.i[46865,46878]
[2022-02-19 00:35:37,695 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-02-19 00:35:37,701 INFO L203 MainTranslator]: Completed pre-run
[2022-02-19 00:35:37,737 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-lit/sssc12_variant.i[46865,46878]
[2022-02-19 00:35:37,741 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-02-19 00:35:37,787 INFO L208 MainTranslator]: Completed translation
[2022-02-19 00:35:37,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 12:35:37 WrapperNode
[2022-02-19 00:35:37,788 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-02-19 00:35:37,789 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2022-02-19 00:35:37,789 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2022-02-19 00:35:37,789 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2022-02-19 00:35:37,795 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 12:35:37" (1/1) ...
[2022-02-19 00:35:37,809 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 12:35:37" (1/1) ...
[2022-02-19 00:35:37,829 INFO L137 Inliner]: procedures = 275, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 87
[2022-02-19 00:35:37,830 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2022-02-19 00:35:37,830 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-02-19 00:35:37,830 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-02-19 00:35:37,830 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-02-19 00:35:37,836 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 12:35:37" (1/1) ...
[2022-02-19 00:35:37,837 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 12:35:37" (1/1) ...
[2022-02-19 00:35:37,840 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 12:35:37" (1/1) ...
[2022-02-19 00:35:37,841 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 12:35:37" (1/1) ...
[2022-02-19 00:35:37,846 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 12:35:37" (1/1) ...
[2022-02-19 00:35:37,849 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 12:35:37" (1/1) ...
[2022-02-19 00:35:37,850 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 12:35:37" (1/1) ...
[2022-02-19 00:35:37,853 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-02-19 00:35:37,856 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-02-19 00:35:37,856 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-02-19 00:35:37,856 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-02-19 00:35:37,857 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 12:35:37" (1/1) ...
[2022-02-19 00:35:37,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-02-19 00:35:37,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-19 00:35:37,885 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2022-02-19 00:35:37,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2022-02-19 00:35:37,914 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2022-02-19 00:35:37,914 INFO L130 BoogieDeclarations]: Found specification of procedure thr
[2022-02-19 00:35:37,914 INFO L138 BoogieDeclarations]: Found implementation of procedure thr
[2022-02-19 00:35:37,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2022-02-19 00:35:37,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-02-19 00:35:37,915 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2022-02-19 00:35:37,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2022-02-19 00:35:37,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2022-02-19 00:35:37,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2022-02-19 00:35:37,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-02-19 00:35:37,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-02-19 00:35:37,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-02-19 00:35:37,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-02-19 00:35:37,917 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2022-02-19 00:35:38,004 INFO L234 CfgBuilder]: Building ICFG
[2022-02-19 00:35:38,006 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-02-19 00:35:38,193 INFO L275 CfgBuilder]: Performing block encoding
[2022-02-19 00:35:38,219 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-02-19 00:35:38,219 INFO L299 CfgBuilder]: Removed 2 assume(true) statements.
[2022-02-19 00:35:38,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 12:35:38 BoogieIcfgContainer
[2022-02-19 00:35:38,221 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-02-19 00:35:38,223 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-02-19 00:35:38,223 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-02-19 00:35:38,226 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-02-19 00:35:38,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.02 12:35:37" (1/3) ...
[2022-02-19 00:35:38,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30b2a63b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 12:35:38, skipping insertion in model container
[2022-02-19 00:35:38,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 12:35:37" (2/3) ...
[2022-02-19 00:35:38,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30b2a63b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 12:35:38, skipping insertion in model container
[2022-02-19 00:35:38,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 12:35:38" (3/3) ...
[2022-02-19 00:35:38,228 INFO L111 eAbstractionObserver]: Analyzing ICFG sssc12_variant.i
[2022-02-19 00:35:38,232 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2022-02-19 00:35:38,232 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2022-02-19 00:35:38,232 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2022-02-19 00:35:38,233 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2022-02-19 00:35:38,259 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,260 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,260 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,260 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,260 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,260 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,260 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,261 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,261 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,261 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,261 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,262 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,262 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,262 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,265 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,265 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,266 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,266 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,266 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,266 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,267 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,268 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,268 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,268 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,268 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,268 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,269 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,269 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,269 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,269 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,270 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,270 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,270 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,270 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,270 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,270 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,270 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,270 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,271 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,271 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,271 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,271 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,271 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,272 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,272 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,273 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,273 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,274 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,274 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,274 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,275 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,275 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,275 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,275 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,275 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,275 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,276 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,276 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,276 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,276 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,276 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,276 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,277 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,277 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,277 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,277 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,277 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,278 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,278 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,278 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,281 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,281 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,281 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,282 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,282 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,282 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,282 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,282 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,283 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,283 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,283 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,284 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2022-02-19 00:35:38,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000
[2022-02-19 00:35:38,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-19 00:35:38,339 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)
[2022-02-19 00:35:38,360 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
[2022-02-19 00:35:38,376 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ========
[2022-02-19 00:35:38,386 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, mLazyFiniteAutomaton=true, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true
[2022-02-19 00:35:38,391 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2022-02-19 00:35:38,548 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0INUSE_VIOLATION] ===
[2022-02-19 00:35:38,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-19 00:35:38,555 INFO L85 PathProgramCache]: Analyzing trace with hash -147767055, now seen corresponding path program 1 times
[2022-02-19 00:35:38,563 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-19 00:35:38,563 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333036081]
[2022-02-19 00:35:38,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-19 00:35:38,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-19 00:35:38,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-19 00:35:38,779 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2022-02-19 00:35:38,779 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-19 00:35:38,780 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333036081]
[2022-02-19 00:35:38,781 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333036081] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-19 00:35:38,781 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-19 00:35:38,781 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-02-19 00:35:38,782 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905588178]
[2022-02-19 00:35:38,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-19 00:35:38,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2022-02-19 00:35:38,787 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-19 00:35:38,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2022-02-19 00:35:38,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2022-02-19 00:35:38,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:35:38,811 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2022-02-19 00:35:38,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-19 00:35:38,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:35:38,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:35:38,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-02-19 00:35:38,829 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0INUSE_VIOLATION] ===
[2022-02-19 00:35:38,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-19 00:35:38,831 INFO L85 PathProgramCache]: Analyzing trace with hash 178627719, now seen corresponding path program 1 times
[2022-02-19 00:35:38,832 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-19 00:35:38,832 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746404152]
[2022-02-19 00:35:38,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-19 00:35:38,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-19 00:35:38,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-02-19 00:35:38,873 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2022-02-19 00:35:38,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-02-19 00:35:38,939 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2022-02-19 00:35:38,939 INFO L628 BasicCegarLoop]: Counterexample is feasible
[2022-02-19 00:35:38,941 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATION (0 of 1 remaining)
[2022-02-19 00:35:38,942 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2022-02-19 00:35:38,958 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1]
[2022-02-19 00:35:38,965 INFO L309 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/2)
[2022-02-19 00:35:38,966 WARN L235 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2022-02-19 00:35:38,966 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2022-02-19 00:35:38,982 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,983 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,983 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,983 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,983 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,983 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,983 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,984 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,984 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,984 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,984 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,984 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,985 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,985 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,985 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,985 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,985 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,986 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,986 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,986 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,987 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,988 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,988 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,989 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,989 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,989 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,989 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,989 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,989 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,990 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,990 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,990 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,990 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,990 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,990 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,991 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,991 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,991 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,991 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,991 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,992 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,992 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,992 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,992 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,993 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,993 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,993 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,993 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,994 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,994 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,995 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,995 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,995 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,995 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,995 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,995 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,995 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,995 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,996 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,996 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,996 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,996 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,996 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,996 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,997 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,997 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,997 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,997 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,997 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,997 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,999 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,999 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,999 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,999 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:38,999 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,000 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,000 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,000 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,000 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,001 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,001 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,005 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,007 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,007 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,008 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,008 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,008 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,008 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,008 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,008 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,011 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,011 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,011 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,011 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,012 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,012 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,012 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,012 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,012 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,012 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,013 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,013 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,013 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,013 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,013 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,013 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,014 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,014 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,014 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,014 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,023 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,023 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,023 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,024 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,024 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,024 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,024 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,024 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,025 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,025 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,025 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,025 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,025 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,025 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,026 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,026 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,026 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,026 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,026 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,026 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,026 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,026 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,026 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,027 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,027 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,027 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,027 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,027 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,027 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,027 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,028 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,028 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,028 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,028 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,028 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,029 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,029 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,029 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,029 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,029 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,029 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,030 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,030 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,030 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,030 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,030 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,030 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,030 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,031 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,031 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,031 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,031 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-19 00:35:39,031 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2022-02-19 00:35:39,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000
[2022-02-19 00:35:39,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-19 00:35:39,047 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null)
[2022-02-19 00:35:39,088 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thrThread2of2ForFork0 ========
[2022-02-19 00:35:39,089 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, mLazyFiniteAutomaton=true, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true
[2022-02-19 00:35:39,089 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2022-02-19 00:35:39,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process
[2022-02-19 00:35:39,282 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-19 00:35:39,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-19 00:35:39,283 INFO L85 PathProgramCache]: Analyzing trace with hash -495900000, now seen corresponding path program 1 times
[2022-02-19 00:35:39,283 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-19 00:35:39,283 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722049450]
[2022-02-19 00:35:39,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-19 00:35:39,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-19 00:35:39,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-19 00:35:39,352 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2022-02-19 00:35:39,352 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-19 00:35:39,352 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722049450]
[2022-02-19 00:35:39,353 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722049450] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-19 00:35:39,353 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-19 00:35:39,353 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-02-19 00:35:39,353 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535261058]
[2022-02-19 00:35:39,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-19 00:35:39,353 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2022-02-19 00:35:39,353 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-19 00:35:39,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2022-02-19 00:35:39,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2022-02-19 00:35:39,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:35:39,354 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2022-02-19 00:35:39,354 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 43.0) internal successors, (86), 2 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-19 00:35:39,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:35:39,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:35:39,372 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2022-02-19 00:35:39,373 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-19 00:35:39,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-19 00:35:39,373 INFO L85 PathProgramCache]: Analyzing trace with hash 712477608, now seen corresponding path program 1 times
[2022-02-19 00:35:39,373 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-19 00:35:39,373 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118527150]
[2022-02-19 00:35:39,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-19 00:35:39,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-19 00:35:39,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-19 00:35:39,497 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2022-02-19 00:35:39,497 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-19 00:35:39,497 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118527150]
[2022-02-19 00:35:39,498 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118527150] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-19 00:35:39,498 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-19 00:35:39,498 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-02-19 00:35:39,498 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412621319]
[2022-02-19 00:35:39,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-19 00:35:39,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-02-19 00:35:39,499 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-19 00:35:39,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-02-19 00:35:39,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-02-19 00:35:39,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:35:39,499 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2022-02-19 00:35:39,500 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-19 00:35:39,500 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:35:39,500 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:35:39,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:35:39,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2022-02-19 00:35:39,665 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2022-02-19 00:35:39,665 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-19 00:35:39,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-19 00:35:39,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1020135921, now seen corresponding path program 1 times
[2022-02-19 00:35:39,666 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-19 00:35:39,666 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157884121]
[2022-02-19 00:35:39,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-19 00:35:39,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-19 00:35:39,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-19 00:35:39,788 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked.
[2022-02-19 00:35:39,788 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-19 00:35:39,788 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157884121]
[2022-02-19 00:35:39,788 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157884121] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-19 00:35:39,789 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-19 00:35:39,791 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-02-19 00:35:39,791 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268916353]
[2022-02-19 00:35:39,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-19 00:35:39,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-02-19 00:35:39,791 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-19 00:35:39,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-02-19 00:35:39,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2022-02-19 00:35:39,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:35:39,792 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2022-02-19 00:35:39,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-19 00:35:39,792 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:35:39,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states.
[2022-02-19 00:35:39,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:35:39,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:35:39,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2022-02-19 00:35:39,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2022-02-19 00:35:39,917 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2022-02-19 00:35:39,920 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-19 00:35:39,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-19 00:35:39,920 INFO L85 PathProgramCache]: Analyzing trace with hash -469146024, now seen corresponding path program 1 times
[2022-02-19 00:35:39,920 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-19 00:35:39,921 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212830739]
[2022-02-19 00:35:39,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-19 00:35:39,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-19 00:35:39,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-19 00:35:40,067 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked.
[2022-02-19 00:35:40,067 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-19 00:35:40,067 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212830739]
[2022-02-19 00:35:40,067 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212830739] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-19 00:35:40,068 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-19 00:35:40,068 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-02-19 00:35:40,068 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767783582]
[2022-02-19 00:35:40,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-19 00:35:40,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-02-19 00:35:40,068 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-19 00:35:40,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-02-19 00:35:40,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-02-19 00:35:40,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:35:40,069 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2022-02-19 00:35:40,069 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-19 00:35:40,069 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:35:40,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states.
[2022-02-19 00:35:40,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states.
[2022-02-19 00:35:40,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:35:40,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:35:40,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2022-02-19 00:35:40,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2022-02-19 00:35:40,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2022-02-19 00:35:40,186 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2022-02-19 00:35:40,186 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-19 00:35:40,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-19 00:35:40,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1873658618, now seen corresponding path program 1 times
[2022-02-19 00:35:40,187 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-19 00:35:40,187 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021665682]
[2022-02-19 00:35:40,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-19 00:35:40,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-19 00:35:40,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-19 00:35:40,299 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked.
[2022-02-19 00:35:40,299 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-19 00:35:40,299 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021665682]
[2022-02-19 00:35:40,299 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021665682] provided 0 perfect and 1 imperfect interpolant sequences
[2022-02-19 00:35:40,299 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714016721]
[2022-02-19 00:35:40,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-19 00:35:40,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-02-19 00:35:40,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-19 00:35:40,301 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-02-19 00:35:40,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2022-02-19 00:35:40,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-19 00:35:40,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 4 conjunts are in the unsatisfiable core
[2022-02-19 00:35:40,414 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-02-19 00:35:40,686 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked.
[2022-02-19 00:35:40,686 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-02-19 00:35:40,898 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked.
[2022-02-19 00:35:40,899 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714016721] provided 0 perfect and 2 imperfect interpolant sequences
[2022-02-19 00:35:40,899 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-02-19 00:35:40,899 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11
[2022-02-19 00:35:40,899 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986575391]
[2022-02-19 00:35:40,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-02-19 00:35:40,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-19 00:35:40,900 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-19 00:35:40,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-19 00:35:40,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110
[2022-02-19 00:35:40,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:35:40,901 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2022-02-19 00:35:40,901 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.727272727272727) internal successors, (173), 11 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-19 00:35:40,902 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:35:40,902 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states.
[2022-02-19 00:35:40,902 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states.
[2022-02-19 00:35:40,902 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states.
[2022-02-19 00:35:40,902 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:35:41,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:35:41,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2022-02-19 00:35:41,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2022-02-19 00:35:41,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2022-02-19 00:35:41,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2022-02-19 00:35:41,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2022-02-19 00:35:41,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-02-19 00:35:41,258 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-19 00:35:41,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-19 00:35:41,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1716499179, now seen corresponding path program 2 times
[2022-02-19 00:35:41,258 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-19 00:35:41,258 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819712245]
[2022-02-19 00:35:41,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-19 00:35:41,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-19 00:35:41,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-19 00:35:41,378 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 11 proven. 76 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked.
[2022-02-19 00:35:41,378 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-19 00:35:41,378 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819712245]
[2022-02-19 00:35:41,378 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819712245] provided 0 perfect and 1 imperfect interpolant sequences
[2022-02-19 00:35:41,379 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150674275]
[2022-02-19 00:35:41,379 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-02-19 00:35:41,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-02-19 00:35:41,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-19 00:35:41,380 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-02-19 00:35:41,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2022-02-19 00:35:41,505 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-02-19 00:35:41,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-02-19 00:35:41,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 7 conjunts are in the unsatisfiable core
[2022-02-19 00:35:41,511 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-02-19 00:35:41,747 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 11 proven. 76 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked.
[2022-02-19 00:35:41,747 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-02-19 00:35:42,046 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 11 proven. 76 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked.
[2022-02-19 00:35:42,047 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150674275] provided 0 perfect and 2 imperfect interpolant sequences
[2022-02-19 00:35:42,047 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-02-19 00:35:42,047 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17
[2022-02-19 00:35:42,047 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792395941]
[2022-02-19 00:35:42,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-02-19 00:35:42,048 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2022-02-19 00:35:42,048 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-19 00:35:42,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2022-02-19 00:35:42,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272
[2022-02-19 00:35:42,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:35:42,050 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2022-02-19 00:35:42,051 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 14.411764705882353) internal successors, (245), 17 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-19 00:35:42,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:35:42,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states.
[2022-02-19 00:35:42,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states.
[2022-02-19 00:35:42,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states.
[2022-02-19 00:35:42,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states.
[2022-02-19 00:35:42,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:35:42,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:35:42,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2022-02-19 00:35:42,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2022-02-19 00:35:42,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2022-02-19 00:35:42,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2022-02-19 00:35:42,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:35:42,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2022-02-19 00:35:42,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-02-19 00:35:42,417 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-19 00:35:42,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-19 00:35:42,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1446186187, now seen corresponding path program 3 times
[2022-02-19 00:35:42,418 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-19 00:35:42,418 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84048203]
[2022-02-19 00:35:42,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-19 00:35:42,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-19 00:35:42,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-19 00:35:42,619 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 558 trivial. 0 not checked.
[2022-02-19 00:35:42,619 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-19 00:35:42,619 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84048203]
[2022-02-19 00:35:42,619 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84048203] provided 0 perfect and 1 imperfect interpolant sequences
[2022-02-19 00:35:42,619 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110317380]
[2022-02-19 00:35:42,619 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2022-02-19 00:35:42,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-02-19 00:35:42,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-19 00:35:42,621 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-02-19 00:35:42,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2022-02-19 00:35:42,722 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2022-02-19 00:35:42,722 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-02-19 00:35:42,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 17 conjunts are in the unsatisfiable core
[2022-02-19 00:35:42,727 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-02-19 00:35:42,772 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2022-02-19 00:35:42,802 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2022-02-19 00:35:42,803 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2022-02-19 00:35:43,104 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2022-02-19 00:35:43,143 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2022-02-19 00:35:43,153 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7
[2022-02-19 00:35:43,180 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 558 trivial. 0 not checked.
[2022-02-19 00:35:43,180 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-02-19 00:35:43,211 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_312 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_312) c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) is different from false
[2022-02-19 00:35:43,262 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-02-19 00:35:43,262 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27
[2022-02-19 00:35:43,265 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26
[2022-02-19 00:35:43,627 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 558 trivial. 10 not checked.
[2022-02-19 00:35:43,627 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110317380] provided 0 perfect and 2 imperfect interpolant sequences
[2022-02-19 00:35:43,627 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-02-19 00:35:43,627 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 14
[2022-02-19 00:35:43,627 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276831091]
[2022-02-19 00:35:43,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-02-19 00:35:43,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2022-02-19 00:35:43,628 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-19 00:35:43,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2022-02-19 00:35:43,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=129, Unknown=1, NotChecked=22, Total=182
[2022-02-19 00:35:43,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:35:43,629 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2022-02-19 00:35:43,629 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.785714285714286) internal successors, (137), 14 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-19 00:35:43,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:35:43,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states.
[2022-02-19 00:35:43,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states.
[2022-02-19 00:35:43,630 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states.
[2022-02-19 00:35:43,630 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states.
[2022-02-19 00:35:43,630 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:35:43,630 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:35:44,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:35:44,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2022-02-19 00:35:44,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2022-02-19 00:35:44,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2022-02-19 00:35:44,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2022-02-19 00:35:44,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:35:44,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2022-02-19 00:35:44,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2022-02-19 00:35:44,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-02-19 00:35:44,548 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-19 00:35:44,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-19 00:35:44,548 INFO L85 PathProgramCache]: Analyzing trace with hash 2043294425, now seen corresponding path program 1 times
[2022-02-19 00:35:44,548 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-19 00:35:44,548 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279927651]
[2022-02-19 00:35:44,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-19 00:35:44,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-19 00:35:44,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-19 00:35:44,873 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 469 proven. 120 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked.
[2022-02-19 00:35:44,873 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-19 00:35:44,873 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279927651]
[2022-02-19 00:35:44,873 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279927651] provided 0 perfect and 1 imperfect interpolant sequences
[2022-02-19 00:35:44,873 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123490625]
[2022-02-19 00:35:44,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-19 00:35:44,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-02-19 00:35:44,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-19 00:35:44,875 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-02-19 00:35:44,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2022-02-19 00:35:45,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-19 00:35:45,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 13 conjunts are in the unsatisfiable core
[2022-02-19 00:35:45,036 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-02-19 00:35:45,510 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 589 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked.
[2022-02-19 00:35:45,510 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-02-19 00:35:45,510 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123490625] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-19 00:35:45,510 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2022-02-19 00:35:45,510 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 17
[2022-02-19 00:35:45,511 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105978868]
[2022-02-19 00:35:45,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-19 00:35:45,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2022-02-19 00:35:45,511 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-19 00:35:45,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2022-02-19 00:35:45,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272
[2022-02-19 00:35:45,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:35:45,512 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2022-02-19 00:35:45,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 15.642857142857142) internal successors, (219), 14 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-19 00:35:45,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:35:45,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states.
[2022-02-19 00:35:45,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states.
[2022-02-19 00:35:45,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states.
[2022-02-19 00:35:45,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states.
[2022-02-19 00:35:45,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:35:45,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states.
[2022-02-19 00:35:45,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:35:46,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:35:46,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:35:46,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2022-02-19 00:35:46,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2022-02-19 00:35:46,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2022-02-19 00:35:46,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:35:46,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2022-02-19 00:35:46,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:35:46,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0
[2022-02-19 00:35:46,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-02-19 00:35:46,376 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-19 00:35:46,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-19 00:35:46,376 INFO L85 PathProgramCache]: Analyzing trace with hash 421905766, now seen corresponding path program 2 times
[2022-02-19 00:35:46,376 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-19 00:35:46,376 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050383683]
[2022-02-19 00:35:46,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-19 00:35:46,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-19 00:35:46,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-19 00:35:46,723 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 36 proven. 488 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2022-02-19 00:35:46,723 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-19 00:35:46,723 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050383683]
[2022-02-19 00:35:46,723 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050383683] provided 0 perfect and 1 imperfect interpolant sequences
[2022-02-19 00:35:46,723 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222511500]
[2022-02-19 00:35:46,723 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-02-19 00:35:46,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-02-19 00:35:46,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-19 00:35:46,728 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-02-19 00:35:46,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2022-02-19 00:35:46,885 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-02-19 00:35:46,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-02-19 00:35:46,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 27 conjunts are in the unsatisfiable core
[2022-02-19 00:35:46,892 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-02-19 00:35:47,397 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2022-02-19 00:35:47,439 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size
[2022-02-19 00:35:47,440 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26
[2022-02-19 00:35:47,449 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7
[2022-02-19 00:35:47,487 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 56 proven. 468 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2022-02-19 00:35:47,487 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-02-19 00:35:48,168 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 47 proven. 477 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2022-02-19 00:35:48,168 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222511500] provided 0 perfect and 2 imperfect interpolant sequences
[2022-02-19 00:35:48,168 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-02-19 00:35:48,169 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 38
[2022-02-19 00:35:48,169 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549793328]
[2022-02-19 00:35:48,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-02-19 00:35:48,170 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states
[2022-02-19 00:35:48,170 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-19 00:35:48,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants.
[2022-02-19 00:35:48,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=1181, Unknown=0, NotChecked=0, Total=1406
[2022-02-19 00:35:48,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:35:48,171 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2022-02-19 00:35:48,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 10.263157894736842) internal successors, (390), 38 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-19 00:35:48,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:35:48,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:35:48,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states.
[2022-02-19 00:35:48,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states.
[2022-02-19 00:35:48,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states.
[2022-02-19 00:35:48,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:35:48,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states.
[2022-02-19 00:35:48,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:35:48,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:35:50,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:35:50,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:35:50,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2022-02-19 00:35:50,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2022-02-19 00:35:50,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2022-02-19 00:35:50,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:35:50,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2022-02-19 00:35:50,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:35:50,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states.
[2022-02-19 00:35:50,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0
[2022-02-19 00:35:50,446 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-02-19 00:35:50,446 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-19 00:35:50,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-19 00:35:50,447 INFO L85 PathProgramCache]: Analyzing trace with hash -91412896, now seen corresponding path program 1 times
[2022-02-19 00:35:50,447 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-19 00:35:50,447 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912454036]
[2022-02-19 00:35:50,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-19 00:35:50,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-19 00:35:50,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-19 00:35:50,532 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked.
[2022-02-19 00:35:50,533 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-19 00:35:50,533 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912454036]
[2022-02-19 00:35:50,533 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912454036] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-19 00:35:50,533 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-19 00:35:50,533 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-02-19 00:35:50,533 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176315704]
[2022-02-19 00:35:50,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-19 00:35:50,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-02-19 00:35:50,534 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-19 00:35:50,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-02-19 00:35:50,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2022-02-19 00:35:50,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:35:50,535 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2022-02-19 00:35:50,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-19 00:35:50,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:35:50,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:35:50,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states.
[2022-02-19 00:35:50,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states.
[2022-02-19 00:35:50,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states.
[2022-02-19 00:35:50,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:35:50,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states.
[2022-02-19 00:35:50,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:35:50,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 74 states.
[2022-02-19 00:35:50,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:35:52,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:35:52,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:35:52,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2022-02-19 00:35:52,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2022-02-19 00:35:52,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2022-02-19 00:35:52,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:35:52,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2022-02-19 00:35:52,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:35:52,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states.
[2022-02-19 00:35:52,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-02-19 00:35:52,220 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2022-02-19 00:35:52,220 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-19 00:35:52,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-19 00:35:52,220 INFO L85 PathProgramCache]: Analyzing trace with hash -2007965222, now seen corresponding path program 3 times
[2022-02-19 00:35:52,220 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-19 00:35:52,220 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771661837]
[2022-02-19 00:35:52,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-19 00:35:52,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-19 00:35:52,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-19 00:35:52,651 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 45 proven. 479 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2022-02-19 00:35:52,651 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-19 00:35:52,651 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771661837]
[2022-02-19 00:35:52,651 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771661837] provided 0 perfect and 1 imperfect interpolant sequences
[2022-02-19 00:35:52,651 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635805873]
[2022-02-19 00:35:52,652 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2022-02-19 00:35:52,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-02-19 00:35:52,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-19 00:35:52,653 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-02-19 00:35:52,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2022-02-19 00:35:53,108 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s)
[2022-02-19 00:35:53,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-02-19 00:35:53,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 34 conjunts are in the unsatisfiable core
[2022-02-19 00:35:53,115 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-02-19 00:35:53,500 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2022-02-19 00:35:53,590 INFO L353 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size
[2022-02-19 00:35:53,591 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 34
[2022-02-19 00:35:53,636 INFO L353 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size
[2022-02-19 00:35:53,637 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 42
[2022-02-19 00:35:53,753 INFO L353 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size
[2022-02-19 00:35:53,754 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 34
[2022-02-19 00:35:53,791 INFO L353 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size
[2022-02-19 00:35:53,791 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 42
[2022-02-19 00:35:53,898 INFO L353 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size
[2022-02-19 00:35:53,898 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 34
[2022-02-19 00:35:53,921 INFO L353 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size
[2022-02-19 00:35:53,921 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 42
[2022-02-19 00:35:54,141 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size
[2022-02-19 00:35:54,142 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26
[2022-02-19 00:35:54,149 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7
[2022-02-19 00:35:54,195 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 56 proven. 297 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked.
[2022-02-19 00:35:54,195 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-02-19 00:35:56,492 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (forall ((|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ |thrThread1of2ForFork0_~c~0#1| 1))))) is different from false
[2022-02-19 00:36:08,139 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|)) is different from false
[2022-02-19 00:36:14,523 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30
[2022-02-19 00:36:14,872 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 56 proven. 95 refuted. 0 times theorem prover too weak. 151 trivial. 226 not checked.
[2022-02-19 00:36:14,873 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635805873] provided 0 perfect and 2 imperfect interpolant sequences
[2022-02-19 00:36:14,873 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-02-19 00:36:14,873 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 15, 18] total 45
[2022-02-19 00:36:14,873 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140878565]
[2022-02-19 00:36:14,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-02-19 00:36:14,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states
[2022-02-19 00:36:14,874 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-19 00:36:14,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants.
[2022-02-19 00:36:14,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1595, Unknown=6, NotChecked=166, Total=1980
[2022-02-19 00:36:14,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:36:14,875 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2022-02-19 00:36:14,875 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 10.666666666666666) internal successors, (480), 45 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-19 00:36:14,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:36:14,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:36:14,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states.
[2022-02-19 00:36:14,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states.
[2022-02-19 00:36:14,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states.
[2022-02-19 00:36:14,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:36:14,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states.
[2022-02-19 00:36:14,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:36:14,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 92 states.
[2022-02-19 00:36:14,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states.
[2022-02-19 00:36:14,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:36:17,421 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 5 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)))) is different from false
[2022-02-19 00:36:19,549 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 1) |c_thrThread2of2ForFork0_~c~0#1|) (<= (+ 6 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|)) is different from false
[2022-02-19 00:36:21,680 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 7 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 2) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|)) is different from false
[2022-02-19 00:36:23,826 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 8 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 3) |c_thrThread2of2ForFork0_~c~0#1|) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|)) is different from false
[2022-02-19 00:36:25,914 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 7 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 2) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (not (= |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1| 0)) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)))) is different from false
[2022-02-19 00:36:27,916 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 7 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)))) is different from false
[2022-02-19 00:36:30,000 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 8 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 3) |c_thrThread2of2ForFork0_~c~0#1|)) is different from false
[2022-02-19 00:36:32,010 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 7 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 3) |c_thrThread2of2ForFork0_~c~0#1|)) is different from false
[2022-02-19 00:36:34,040 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 7 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (forall ((|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ |thrThread1of2ForFork0_~c~0#1| 1)))) (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 3) |c_thrThread2of2ForFork0_~c~0#1|)) is different from false
[2022-02-19 00:36:36,046 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 6 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (forall ((|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ |thrThread1of2ForFork0_~c~0#1| 1)))) (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 3) |c_thrThread2of2ForFork0_~c~0#1|)) is different from false
[2022-02-19 00:36:38,076 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 5 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (forall ((|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ |thrThread1of2ForFork0_~c~0#1| 1)))) (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 3) |c_thrThread2of2ForFork0_~c~0#1|)) is different from false
[2022-02-19 00:36:40,116 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (and (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) .cse0)) (forall ((|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ |thrThread1of2ForFork0_~c~0#1| 1)))) (not (= (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) .cse0)) (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 3) |c_thrThread2of2ForFork0_~c~0#1|))) is different from false
[2022-02-19 00:36:42,120 WARN L838 $PredicateComparison]: unable to prove that (and (< (+ 3 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (forall ((|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ |thrThread1of2ForFork0_~c~0#1| 1)))) (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 3) |c_thrThread2of2ForFork0_~c~0#1|)) is different from false
[2022-02-19 00:36:44,147 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (forall ((|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ |thrThread1of2ForFork0_~c~0#1| 1)))) (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 3) |c_thrThread2of2ForFork0_~c~0#1|)) is different from false
[2022-02-19 00:36:46,388 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 1) |c_thrThread2of2ForFork0_~c~0#1|) (or (let ((.cse0 (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (and (= 1 (select (select |c_#memory_int| c_~data~0.base) .cse0)) (not (= (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) .cse0)))) (not (< |c_thrThread1of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|))) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|)) is different from false
[2022-02-19 00:36:48,695 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 6 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)))) is different from false
[2022-02-19 00:36:50,698 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 6 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (forall ((v_subst_1 Int)) (or (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)) (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))))) is different from false
[2022-02-19 00:36:52,702 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 6 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (forall ((|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ |thrThread1of2ForFork0_~c~0#1| 1))))) is different from false
[2022-02-19 00:36:54,708 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 5 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (forall ((|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ |thrThread1of2ForFork0_~c~0#1| 1))))) is different from false
[2022-02-19 00:36:56,711 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 5 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (forall ((v_subst_1 Int)) (or (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)) (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))))) is different from false
[2022-02-19 00:36:58,718 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)))) (.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 1))) (and (or (<= |c_thrThread1of2ForFork0_~end~0#1| .cse0) .cse1) (<= (+ 5 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) .cse1 (forall ((|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ |thrThread1of2ForFork0_~c~0#1| 1)))) (or (not (<= .cse0 |c_thrThread2of2ForFork0_~c~0#1|)) (not (< |c_thrThread2of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|))))) is different from false
[2022-02-19 00:37:00,725 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (and (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) .cse0)) (forall ((|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ |thrThread1of2ForFork0_~c~0#1| 1)))) (not (= (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) .cse0)))) is different from false
[2022-02-19 00:37:30,761 WARN L228 SmtUtils]: Spent 6.01s on a formula simplification. DAG size of input: 30 DAG size of output: 14 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2022-02-19 00:37:32,769 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (let ((.cse1 (= 1 (select (select |c_#memory_int| c_~data~0.base) .cse2))) (.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 1))) (and (or (<= |c_thrThread1of2ForFork0_~end~0#1| .cse0) .cse1) (or (and .cse1 (not (= (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) .cse2))) (not (< |c_thrThread1of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|))) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) .cse1 (forall ((|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ |thrThread1of2ForFork0_~c~0#1| 1)))) (or (not (<= .cse0 |c_thrThread2of2ForFork0_~c~0#1|)) (not (< |c_thrThread2of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|)))))) is different from false
[2022-02-19 00:37:34,778 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 1))) (and (or (<= |c_thrThread1of2ForFork0_~end~0#1| .cse0) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)))) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (forall ((|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ |thrThread1of2ForFork0_~c~0#1| 1)))) (or (not (<= .cse0 |c_thrThread2of2ForFork0_~c~0#1|)) (not (< |c_thrThread2of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|))))) is different from false
[2022-02-19 00:37:36,782 WARN L838 $PredicateComparison]: unable to prove that (and (or (let ((.cse0 (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (and (= 1 (select (select |c_#memory_int| c_~data~0.base) .cse0)) (not (= (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) .cse0)))) (not (< |c_thrThread1of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|))) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (forall ((|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ |thrThread1of2ForFork0_~c~0#1| 1))))) is different from false
[2022-02-19 00:37:37,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:37:37,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:37:37,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2022-02-19 00:37:37,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2022-02-19 00:37:37,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2022-02-19 00:37:37,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:37:37,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2022-02-19 00:37:37,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:37:37,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states.
[2022-02-19 00:37:37,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-02-19 00:37:37,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states.
[2022-02-19 00:37:37,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0
[2022-02-19 00:37:37,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12
[2022-02-19 00:37:37,275 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-19 00:37:37,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-19 00:37:37,275 INFO L85 PathProgramCache]: Analyzing trace with hash 45194586, now seen corresponding path program 4 times
[2022-02-19 00:37:37,275 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-19 00:37:37,275 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183804124]
[2022-02-19 00:37:37,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-19 00:37:37,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-19 00:37:37,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-19 00:37:37,873 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 45 proven. 479 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2022-02-19 00:37:37,873 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-19 00:37:37,873 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183804124]
[2022-02-19 00:37:37,873 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183804124] provided 0 perfect and 1 imperfect interpolant sequences
[2022-02-19 00:37:37,873 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428963230]
[2022-02-19 00:37:37,873 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-02-19 00:37:37,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-02-19 00:37:37,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-19 00:37:37,876 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-02-19 00:37:37,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2022-02-19 00:37:38,032 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-02-19 00:37:38,032 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-02-19 00:37:38,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 47 conjunts are in the unsatisfiable core
[2022-02-19 00:37:38,040 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-02-19 00:37:38,064 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2022-02-19 00:37:38,089 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2022-02-19 00:37:38,089 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2022-02-19 00:37:38,690 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2022-02-19 00:37:38,727 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2022-02-19 00:37:38,784 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size
[2022-02-19 00:37:38,785 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26
[2022-02-19 00:37:38,799 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size
[2022-02-19 00:37:38,799 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26
[2022-02-19 00:37:38,854 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size
[2022-02-19 00:37:38,855 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26
[2022-02-19 00:37:38,868 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size
[2022-02-19 00:37:38,869 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26
[2022-02-19 00:37:38,920 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size
[2022-02-19 00:37:38,921 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26
[2022-02-19 00:37:38,933 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size
[2022-02-19 00:37:38,934 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26
[2022-02-19 00:37:39,009 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size
[2022-02-19 00:37:39,010 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26
[2022-02-19 00:37:39,022 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7
[2022-02-19 00:37:39,070 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 56 proven. 468 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2022-02-19 00:37:39,071 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-02-19 00:37:39,598 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 5 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_ArrVal_920 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_920) c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) is different from false
[2022-02-19 00:37:39,626 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-02-19 00:37:39,626 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27
[2022-02-19 00:37:39,629 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26
[2022-02-19 00:37:39,634 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3
[2022-02-19 00:37:40,426 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 46 proven. 468 refuted. 0 times theorem prover too weak. 4 trivial. 10 not checked.
[2022-02-19 00:37:40,427 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428963230] provided 0 perfect and 2 imperfect interpolant sequences
[2022-02-19 00:37:40,427 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-02-19 00:37:40,427 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 48
[2022-02-19 00:37:40,427 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717327386]
[2022-02-19 00:37:40,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-02-19 00:37:40,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states
[2022-02-19 00:37:40,428 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-19 00:37:40,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants.
[2022-02-19 00:37:40,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=1896, Unknown=1, NotChecked=90, Total=2256
[2022-02-19 00:37:40,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:37:40,429 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2022-02-19 00:37:40,429 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 9.104166666666666) internal successors, (437), 48 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-19 00:37:40,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:37:40,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:37:40,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states.
[2022-02-19 00:37:40,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states.
[2022-02-19 00:37:40,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states.
[2022-02-19 00:37:40,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:37:40,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states.
[2022-02-19 00:37:40,430 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:37:40,430 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 96 states.
[2022-02-19 00:37:40,430 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states.
[2022-02-19 00:37:40,430 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 94 states.
[2022-02-19 00:37:40,430 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:37:44,188 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (let ((.cse1 (= 1 (select (select |c_#memory_int| c_~data~0.base) .cse2))) (.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 1))) (and (or (<= |c_thrThread1of2ForFork0_~end~0#1| .cse0) .cse1) (or (and .cse1 (not (= (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) .cse2))) (not (< |c_thrThread1of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|))) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) .cse1 (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (or (not (<= .cse0 |c_thrThread2of2ForFork0_~c~0#1|)) (not (< |c_thrThread2of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|)))))) is different from false
[2022-02-19 00:37:46,298 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (let ((.cse1 (= 1 (select (select |c_#memory_int| c_~data~0.base) .cse2))) (.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 1))) (and (or (<= |c_thrThread1of2ForFork0_~end~0#1| .cse0) .cse1) (or (and .cse1 (not (= (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) .cse2))) (not (< |c_thrThread1of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|))) (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 2) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (not (= |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1| 0)) .cse1 (or (not (<= .cse0 |c_thrThread2of2ForFork0_~c~0#1|)) (not (< |c_thrThread2of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|)))))) is different from false
[2022-02-19 00:37:48,377 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 3) |c_thrThread2of2ForFork0_~c~0#1|) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|)) is different from false
[2022-02-19 00:37:56,085 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 7 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (forall ((v_subst_1 Int)) (or (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)) (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))))) is different from false
[2022-02-19 00:37:58,147 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 7 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (forall ((|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ |thrThread1of2ForFork0_~c~0#1| 1))))) is different from false
[2022-02-19 00:38:00,262 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 1))) (and (or (<= |c_thrThread1of2ForFork0_~end~0#1| .cse0) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)))) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (forall ((|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ |thrThread1of2ForFork0_~c~0#1| 1)))) (or (not (<= .cse0 |c_thrThread2of2ForFork0_~c~0#1|)) (not (< |c_thrThread2of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|))) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ 2 |c_thrThread2of2ForFork0_~c~0#1|)))) is different from false
[2022-02-19 00:38:02,555 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)))) (.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 1))) (and (or (<= |c_thrThread1of2ForFork0_~end~0#1| .cse0) .cse1) (<= (+ 6 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) .cse1 (or (not (<= .cse0 |c_thrThread2of2ForFork0_~c~0#1|)) (not (< |c_thrThread2of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|))))) is different from false
[2022-02-19 00:38:04,684 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)))) (.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 1))) (and (or (<= |c_thrThread1of2ForFork0_~end~0#1| .cse0) .cse1) (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 1) |c_thrThread2of2ForFork0_~c~0#1|) (<= (+ 7 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) .cse1 (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (or (not (<= .cse0 |c_thrThread2of2ForFork0_~c~0#1|)) (not (< |c_thrThread2of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|))))) is different from false
[2022-02-19 00:38:06,715 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)))) (.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 1))) (and (or (<= |c_thrThread1of2ForFork0_~end~0#1| .cse0) .cse1) (<= (+ 8 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 2) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) .cse1 (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (or (not (<= .cse0 |c_thrThread2of2ForFork0_~c~0#1|)) (not (< |c_thrThread2of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|))))) is different from false
[2022-02-19 00:38:08,941 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)))) (.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 1))) (and (or (<= |c_thrThread1of2ForFork0_~end~0#1| .cse0) .cse1) (<= (+ 8 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) .cse1 (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (or (not (<= .cse0 |c_thrThread2of2ForFork0_~c~0#1|)) (not (< |c_thrThread2of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|))))) is different from false
[2022-02-19 00:38:11,017 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)))) (.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 1))) (and (or (<= |c_thrThread1of2ForFork0_~end~0#1| .cse0) .cse1) (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 1) |c_thrThread2of2ForFork0_~c~0#1|) (<= (+ 8 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) .cse1 (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (or (not (<= .cse0 |c_thrThread2of2ForFork0_~c~0#1|)) (not (< |c_thrThread2of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|))))) is different from false
[2022-02-19 00:38:11,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:38:11,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:38:11,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2022-02-19 00:38:11,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2022-02-19 00:38:11,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2022-02-19 00:38:11,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:38:11,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2022-02-19 00:38:11,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:38:11,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states.
[2022-02-19 00:38:11,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-02-19 00:38:11,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states.
[2022-02-19 00:38:11,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states.
[2022-02-19 00:38:11,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0
[2022-02-19 00:38:11,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13
[2022-02-19 00:38:11,708 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-19 00:38:11,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-19 00:38:11,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1056291974, now seen corresponding path program 5 times
[2022-02-19 00:38:11,708 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-19 00:38:11,708 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691445859]
[2022-02-19 00:38:11,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-19 00:38:11,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-19 00:38:11,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-19 00:38:12,258 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 3 proven. 467 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2022-02-19 00:38:12,258 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-19 00:38:12,258 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691445859]
[2022-02-19 00:38:12,258 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691445859] provided 0 perfect and 1 imperfect interpolant sequences
[2022-02-19 00:38:12,258 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800528650]
[2022-02-19 00:38:12,258 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2022-02-19 00:38:12,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-02-19 00:38:12,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-19 00:38:12,264 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-02-19 00:38:12,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2022-02-19 00:38:12,657 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s)
[2022-02-19 00:38:12,658 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-02-19 00:38:12,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 49 conjunts are in the unsatisfiable core
[2022-02-19 00:38:12,665 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-02-19 00:38:12,689 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2022-02-19 00:38:12,715 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2022-02-19 00:38:12,715 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2022-02-19 00:38:13,124 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2022-02-19 00:38:13,219 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2022-02-19 00:38:13,268 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size
[2022-02-19 00:38:13,269 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26
[2022-02-19 00:38:13,283 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size
[2022-02-19 00:38:13,283 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26
[2022-02-19 00:38:13,332 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size
[2022-02-19 00:38:13,332 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26
[2022-02-19 00:38:13,346 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size
[2022-02-19 00:38:13,346 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26
[2022-02-19 00:38:13,393 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size
[2022-02-19 00:38:13,393 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26
[2022-02-19 00:38:13,406 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size
[2022-02-19 00:38:13,406 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26
[2022-02-19 00:38:13,470 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size
[2022-02-19 00:38:13,470 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26
[2022-02-19 00:38:13,486 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size
[2022-02-19 00:38:13,487 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26
[2022-02-19 00:38:13,556 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size
[2022-02-19 00:38:13,557 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26
[2022-02-19 00:38:13,561 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7
[2022-02-19 00:38:13,598 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 14 proven. 456 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2022-02-19 00:38:13,598 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-02-19 00:38:14,105 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 6 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_ArrVal_1050 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1050) c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) is different from false
[2022-02-19 00:38:14,131 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-02-19 00:38:14,131 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27
[2022-02-19 00:38:14,133 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26
[2022-02-19 00:38:14,135 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3
[2022-02-19 00:38:14,654 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 4 proven. 456 refuted. 0 times theorem prover too weak. 4 trivial. 10 not checked.
[2022-02-19 00:38:14,654 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800528650] provided 0 perfect and 2 imperfect interpolant sequences
[2022-02-19 00:38:14,654 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-02-19 00:38:14,654 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 40
[2022-02-19 00:38:14,654 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773501008]
[2022-02-19 00:38:14,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-02-19 00:38:14,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states
[2022-02-19 00:38:14,655 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-19 00:38:14,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants.
[2022-02-19 00:38:14,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1300, Unknown=1, NotChecked=74, Total=1560
[2022-02-19 00:38:14,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:38:14,656 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2022-02-19 00:38:14,656 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 8.525) internal successors, (341), 40 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-19 00:38:14,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:38:14,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:38:14,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states.
[2022-02-19 00:38:14,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states.
[2022-02-19 00:38:14,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states.
[2022-02-19 00:38:14,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:38:14,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states.
[2022-02-19 00:38:14,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:38:14,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 102 states.
[2022-02-19 00:38:14,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states.
[2022-02-19 00:38:14,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 163 states.
[2022-02-19 00:38:14,657 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states.
[2022-02-19 00:38:14,657 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:38:17,744 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)))) (.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 1))) (and (or (<= |c_thrThread1of2ForFork0_~end~0#1| .cse0) .cse1) (<= (+ 7 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) .cse1 (or (not (<= .cse0 |c_thrThread2of2ForFork0_~c~0#1|)) (not (< |c_thrThread2of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|))))) is different from false
[2022-02-19 00:38:20,327 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)))) (.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 1))) (and (or (<= |c_thrThread1of2ForFork0_~end~0#1| .cse0) .cse1) (<= (+ 8 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) .cse1 (or (not (<= .cse0 |c_thrThread2of2ForFork0_~c~0#1|)) (not (< |c_thrThread2of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|))))) is different from false
[2022-02-19 00:38:23,982 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)))) (.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 1))) (and (or (<= |c_thrThread1of2ForFork0_~end~0#1| .cse0) .cse1) (<= (+ 8 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (<= 10 |c_thrThread1of2ForFork0_~end~0#1|) .cse1 (= |c_thrThread1of2ForFork0_~c~0#1| 0) (or (not (<= .cse0 |c_thrThread2of2ForFork0_~c~0#1|)) (not (< |c_thrThread2of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|))))) is different from false
[2022-02-19 00:38:26,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:38:26,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:38:26,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2022-02-19 00:38:26,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2022-02-19 00:38:26,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2022-02-19 00:38:26,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2022-02-19 00:38:26,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2022-02-19 00:38:26,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:38:26,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states.
[2022-02-19 00:38:26,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-02-19 00:38:26,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states.
[2022-02-19 00:38:26,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states.
[2022-02-19 00:38:26,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states.
[2022-02-19 00:38:26,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0
[2022-02-19 00:38:26,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14
[2022-02-19 00:38:26,333 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-19 00:38:26,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-19 00:38:26,333 INFO L85 PathProgramCache]: Analyzing trace with hash -213185003, now seen corresponding path program 6 times
[2022-02-19 00:38:26,333 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-19 00:38:26,333 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994399079]
[2022-02-19 00:38:26,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-19 00:38:26,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-19 00:38:26,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-19 00:38:27,090 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 45 proven. 381 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2022-02-19 00:38:27,091 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-19 00:38:27,091 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994399079]
[2022-02-19 00:38:27,091 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994399079] provided 0 perfect and 1 imperfect interpolant sequences
[2022-02-19 00:38:27,091 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578347992]
[2022-02-19 00:38:27,091 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2022-02-19 00:38:27,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-02-19 00:38:27,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-19 00:38:27,096 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-02-19 00:38:27,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2022-02-19 00:38:27,227 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s)
[2022-02-19 00:38:27,227 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-02-19 00:38:27,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 12 conjunts are in the unsatisfiable core
[2022-02-19 00:38:27,230 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-02-19 00:38:27,509 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked.
[2022-02-19 00:38:27,509 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-02-19 00:38:27,509 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578347992] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-19 00:38:27,509 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2022-02-19 00:38:27,509 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [29] total 30
[2022-02-19 00:38:27,509 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160838390]
[2022-02-19 00:38:27,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-19 00:38:27,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-02-19 00:38:27,510 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-19 00:38:27,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-02-19 00:38:27,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=730, Unknown=0, NotChecked=0, Total=870
[2022-02-19 00:38:27,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:38:27,511 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2022-02-19 00:38:27,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-19 00:38:27,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:38:27,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:38:27,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states.
[2022-02-19 00:38:27,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states.
[2022-02-19 00:38:27,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states.
[2022-02-19 00:38:27,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states.
[2022-02-19 00:38:27,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states.
[2022-02-19 00:38:27,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:38:27,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 129 states.
[2022-02-19 00:38:27,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states.
[2022-02-19 00:38:27,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 181 states.
[2022-02-19 00:38:27,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 83 states.
[2022-02-19 00:38:27,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states.
[2022-02-19 00:38:27,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:38:33,445 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (let ((.cse1 (= 1 (select (select |c_#memory_int| c_~data~0.base) .cse2))) (.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 1))) (and (or (<= |c_thrThread1of2ForFork0_~end~0#1| .cse0) .cse1) (or (and .cse1 (not (= (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) .cse2))) (not (< |c_thrThread1of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|))) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) .cse1 (or (not (<= .cse0 |c_thrThread2of2ForFork0_~c~0#1|)) (not (< |c_thrThread2of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|)))))) is different from false
[2022-02-19 00:38:37,777 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (let ((.cse1 (= 1 (select (select |c_#memory_int| c_~data~0.base) .cse2))) (.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 1))) (and (or (<= |c_thrThread1of2ForFork0_~end~0#1| .cse0) .cse1) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) .cse1 (forall ((|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ |thrThread1of2ForFork0_~c~0#1| 1)))) (not (= (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) .cse2)) (or (not (<= .cse0 |c_thrThread2of2ForFork0_~c~0#1|)) (not (< |c_thrThread2of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|)))))) is different from false
[2022-02-19 00:38:39,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:38:39,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:38:39,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2022-02-19 00:38:39,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2022-02-19 00:38:39,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2022-02-19 00:38:39,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2022-02-19 00:38:39,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2022-02-19 00:38:39,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:38:39,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 229 states.
[2022-02-19 00:38:39,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-02-19 00:38:39,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states.
[2022-02-19 00:38:39,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states.
[2022-02-19 00:38:39,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states.
[2022-02-19 00:38:39,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-19 00:38:39,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0
[2022-02-19 00:38:39,874 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15
[2022-02-19 00:38:39,874 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-19 00:38:39,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-19 00:38:39,875 INFO L85 PathProgramCache]: Analyzing trace with hash 728137024, now seen corresponding path program 1 times
[2022-02-19 00:38:39,875 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-19 00:38:39,875 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514408625]
[2022-02-19 00:38:39,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-19 00:38:39,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-19 00:38:39,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-19 00:38:40,256 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 118 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2022-02-19 00:38:40,256 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-19 00:38:40,256 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514408625]
[2022-02-19 00:38:40,257 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514408625] provided 0 perfect and 1 imperfect interpolant sequences
[2022-02-19 00:38:40,257 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811907259]
[2022-02-19 00:38:40,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-19 00:38:40,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-02-19 00:38:40,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-19 00:38:40,260 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-02-19 00:38:40,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process
[2022-02-19 00:38:40,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-19 00:38:40,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 27 conjunts are in the unsatisfiable core
[2022-02-19 00:38:40,414 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-02-19 00:38:40,442 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2022-02-19 00:38:40,466 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2022-02-19 00:38:40,466 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2022-02-19 00:38:40,784 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2022-02-19 00:38:40,821 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2022-02-19 00:38:40,896 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size
[2022-02-19 00:38:40,896 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26
[2022-02-19 00:38:40,901 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7
[2022-02-19 00:38:40,933 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 10 proven. 108 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2022-02-19 00:38:40,933 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-02-19 00:38:41,057 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= c_~next~0 |c_thrThread2of2ForFork0_~c~0#1|)) (forall ((v_ArrVal_1256 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1256) c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) is different from false
[2022-02-19 00:38:41,090 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-02-19 00:38:41,090 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27
[2022-02-19 00:38:41,094 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26
[2022-02-19 00:38:41,097 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3
[2022-02-19 00:38:41,588 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 5 trivial. 10 not checked.
[2022-02-19 00:38:41,588 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811907259] provided 0 perfect and 2 imperfect interpolant sequences
[2022-02-19 00:38:41,588 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-02-19 00:38:41,588 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38
[2022-02-19 00:38:41,588 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955608235]
[2022-02-19 00:38:41,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-02-19 00:38:41,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states
[2022-02-19 00:38:41,589 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-19 00:38:41,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants.
[2022-02-19 00:38:41,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1136, Unknown=1, NotChecked=70, Total=1406
[2022-02-19 00:38:41,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:38:41,590 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2022-02-19 00:38:41,591 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 7.473684210526316) internal successors, (284), 38 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-19 00:38:41,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:38:41,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:38:41,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states.
[2022-02-19 00:38:41,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states.
[2022-02-19 00:38:41,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states.
[2022-02-19 00:38:41,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states.
[2022-02-19 00:38:41,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states.
[2022-02-19 00:38:41,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:38:41,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 229 states.
[2022-02-19 00:38:41,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states.
[2022-02-19 00:38:41,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 219 states.
[2022-02-19 00:38:41,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 120 states.
[2022-02-19 00:38:41,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 116 states.
[2022-02-19 00:38:41,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2022-02-19 00:38:41,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:38:42,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:38:42,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:38:42,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2022-02-19 00:38:42,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2022-02-19 00:38:42,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2022-02-19 00:38:42,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2022-02-19 00:38:42,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2022-02-19 00:38:42,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:38:42,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 229 states.
[2022-02-19 00:38:42,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-02-19 00:38:42,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states.
[2022-02-19 00:38:42,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states.
[2022-02-19 00:38:42,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states.
[2022-02-19 00:38:42,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-19 00:38:42,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states.
[2022-02-19 00:38:42,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0
[2022-02-19 00:38:43,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16
[2022-02-19 00:38:43,115 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-19 00:38:43,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-19 00:38:43,115 INFO L85 PathProgramCache]: Analyzing trace with hash -332878701, now seen corresponding path program 2 times
[2022-02-19 00:38:43,115 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-19 00:38:43,115 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271730544]
[2022-02-19 00:38:43,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-19 00:38:43,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-19 00:38:43,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-19 00:38:43,530 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 523 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2022-02-19 00:38:43,530 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-19 00:38:43,530 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271730544]
[2022-02-19 00:38:43,531 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271730544] provided 0 perfect and 1 imperfect interpolant sequences
[2022-02-19 00:38:43,531 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603363265]
[2022-02-19 00:38:43,531 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-02-19 00:38:43,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-02-19 00:38:43,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-19 00:38:43,532 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-02-19 00:38:43,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process
[2022-02-19 00:38:43,671 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-02-19 00:38:43,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-02-19 00:38:43,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 32 conjunts are in the unsatisfiable core
[2022-02-19 00:38:43,691 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-02-19 00:38:43,717 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2022-02-19 00:38:43,740 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2022-02-19 00:38:43,740 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2022-02-19 00:38:44,258 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2022-02-19 00:38:44,294 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2022-02-19 00:38:44,351 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size
[2022-02-19 00:38:44,351 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26
[2022-02-19 00:38:44,357 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7
[2022-02-19 00:38:44,391 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 10 proven. 513 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2022-02-19 00:38:44,392 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-02-19 00:38:46,472 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread1of2ForFork0_~c~0#1_136| Int)) (or (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_136|)) (forall ((v_ArrVal_1367 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_136| 4) c_~data~0.offset) v_ArrVal_1367) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) is different from false
[2022-02-19 00:38:46,501 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1367 Int) (|v_thrThread1of2ForFork0_~c~0#1_136| Int)) (or (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_136|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1366) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_136| 4) c_~data~0.offset) v_ArrVal_1367) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) is different from false
[2022-02-19 00:38:46,585 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-02-19 00:38:46,585 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34
[2022-02-19 00:38:46,588 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52
[2022-02-19 00:38:46,596 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36
[2022-02-19 00:38:46,599 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42
[2022-02-19 00:38:47,193 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 513 refuted. 0 times theorem prover too weak. 5 trivial. 10 not checked.
[2022-02-19 00:38:47,193 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603363265] provided 0 perfect and 2 imperfect interpolant sequences
[2022-02-19 00:38:47,193 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-02-19 00:38:47,193 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 36
[2022-02-19 00:38:47,193 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667561001]
[2022-02-19 00:38:47,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-02-19 00:38:47,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states
[2022-02-19 00:38:47,194 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-19 00:38:47,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants.
[2022-02-19 00:38:47,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=959, Unknown=2, NotChecked=130, Total=1260
[2022-02-19 00:38:47,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:38:47,195 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2022-02-19 00:38:47,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 7.972222222222222) internal successors, (287), 36 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-19 00:38:47,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:38:47,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:38:47,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states.
[2022-02-19 00:38:47,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states.
[2022-02-19 00:38:47,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states.
[2022-02-19 00:38:47,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states.
[2022-02-19 00:38:47,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states.
[2022-02-19 00:38:47,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:38:47,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 229 states.
[2022-02-19 00:38:47,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states.
[2022-02-19 00:38:47,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 219 states.
[2022-02-19 00:38:47,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 120 states.
[2022-02-19 00:38:47,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 116 states.
[2022-02-19 00:38:47,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2022-02-19 00:38:47,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 68 states.
[2022-02-19 00:38:47,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:38:47,751 WARN L838 $PredicateComparison]: unable to prove that (and (<= 10 |c_thrThread2of2ForFork0_~end~0#1|) (<= 10 c_~next~0) (= |c_thrThread2of2ForFork0_~c~0#1| 0) (forall ((v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1367 Int) (|v_thrThread1of2ForFork0_~c~0#1_136| Int)) (or (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_136|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1366) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_136| 4) c_~data~0.offset) v_ArrVal_1367) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (<= (+ |c_thrThread2of2ForFork0_~c~0#1| 1) c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false
[2022-02-19 00:38:48,152 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1367 Int) (|v_thrThread1of2ForFork0_~c~0#1_136| Int)) (or (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_136|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1366) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_136| 4) c_~data~0.offset) v_ArrVal_1367) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= (+ |c_thrThread2of2ForFork0_~c~0#1| 1) c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false
[2022-02-19 00:38:48,666 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 9 |c_thrThread2of2ForFork0_~c~0#1|) c_~next~0) (forall ((v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1367 Int) (|v_thrThread1of2ForFork0_~c~0#1_136| Int)) (or (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_136|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1366) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_136| 4) c_~data~0.offset) v_ArrVal_1367) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (<= (+ |c_thrThread2of2ForFork0_~c~0#1| 1) c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false
[2022-02-19 00:38:49,149 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 8 |c_thrThread2of2ForFork0_~c~0#1|) c_~next~0) (forall ((v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1367 Int) (|v_thrThread1of2ForFork0_~c~0#1_136| Int)) (or (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_136|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1366) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_136| 4) c_~data~0.offset) v_ArrVal_1367) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (<= (+ |c_thrThread2of2ForFork0_~c~0#1| 1) c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false
[2022-02-19 00:38:49,631 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 7 |c_thrThread2of2ForFork0_~c~0#1|) c_~next~0) (forall ((v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1367 Int) (|v_thrThread1of2ForFork0_~c~0#1_136| Int)) (or (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_136|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1366) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_136| 4) c_~data~0.offset) v_ArrVal_1367) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (<= (+ |c_thrThread2of2ForFork0_~c~0#1| 1) c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false
[2022-02-19 00:38:50,098 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1367 Int) (|v_thrThread1of2ForFork0_~c~0#1_136| Int)) (or (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_136|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1366) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_136| 4) c_~data~0.offset) v_ArrVal_1367) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= (+ 6 |c_thrThread2of2ForFork0_~c~0#1|) c_~next~0) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (<= (+ |c_thrThread2of2ForFork0_~c~0#1| 1) c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false
[2022-02-19 00:38:50,590 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1367 Int) (|v_thrThread1of2ForFork0_~c~0#1_136| Int)) (or (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_136|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1366) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_136| 4) c_~data~0.offset) v_ArrVal_1367) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (<= (+ 5 |c_thrThread2of2ForFork0_~c~0#1|) c_~next~0) (<= (+ |c_thrThread2of2ForFork0_~c~0#1| 1) c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false
[2022-02-19 00:38:51,094 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ |c_thrThread2of2ForFork0_~c~0#1| 4) c_~next~0) (forall ((v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1367 Int) (|v_thrThread1of2ForFork0_~c~0#1_136| Int)) (or (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_136|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1366) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_136| 4) c_~data~0.offset) v_ArrVal_1367) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (<= (+ |c_thrThread2of2ForFork0_~c~0#1| 1) c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false
[2022-02-19 00:38:51,575 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1367 Int) (|v_thrThread1of2ForFork0_~c~0#1_136| Int)) (or (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_136|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1366) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_136| 4) c_~data~0.offset) v_ArrVal_1367) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= (+ 3 |c_thrThread2of2ForFork0_~c~0#1|) c_~next~0) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (<= (+ |c_thrThread2of2ForFork0_~c~0#1| 1) c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false
[2022-02-19 00:38:52,071 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1367 Int) (|v_thrThread1of2ForFork0_~c~0#1_136| Int)) (or (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_136|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1366) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_136| 4) c_~data~0.offset) v_ArrVal_1367) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (<= (+ 2 |c_thrThread2of2ForFork0_~c~0#1|) c_~next~0) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (<= (+ |c_thrThread2of2ForFork0_~c~0#1| 1) c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false
[2022-02-19 00:38:52,578 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1367 Int) (|v_thrThread1of2ForFork0_~c~0#1_136| Int)) (or (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_136|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1366) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_136| 4) c_~data~0.offset) v_ArrVal_1367) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (<= (+ |c_thrThread2of2ForFork0_~c~0#1| 1) c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false
[2022-02-19 00:38:52,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:38:52,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:38:52,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2022-02-19 00:38:52,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2022-02-19 00:38:52,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2022-02-19 00:38:52,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2022-02-19 00:38:52,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2022-02-19 00:38:52,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:38:52,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 229 states.
[2022-02-19 00:38:52,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-02-19 00:38:52,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states.
[2022-02-19 00:38:52,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states.
[2022-02-19 00:38:52,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states.
[2022-02-19 00:38:52,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-19 00:38:52,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states.
[2022-02-19 00:38:52,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states.
[2022-02-19 00:38:52,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0
[2022-02-19 00:38:52,892 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2022-02-19 00:38:52,892 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-19 00:38:52,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-19 00:38:52,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1358387711, now seen corresponding path program 3 times
[2022-02-19 00:38:52,893 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-19 00:38:52,893 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854364931]
[2022-02-19 00:38:52,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-19 00:38:52,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-19 00:38:52,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-19 00:38:53,082 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 648 proven. 121 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2022-02-19 00:38:53,082 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-19 00:38:53,082 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854364931]
[2022-02-19 00:38:53,082 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854364931] provided 0 perfect and 1 imperfect interpolant sequences
[2022-02-19 00:38:53,083 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357079792]
[2022-02-19 00:38:53,083 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2022-02-19 00:38:53,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-02-19 00:38:53,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-19 00:38:53,084 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-02-19 00:38:53,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process
[2022-02-19 00:38:53,220 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2022-02-19 00:38:53,220 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-02-19 00:38:53,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 22 conjunts are in the unsatisfiable core
[2022-02-19 00:38:53,225 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-02-19 00:38:53,248 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2022-02-19 00:38:53,280 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2022-02-19 00:38:53,280 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2022-02-19 00:38:53,872 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2022-02-19 00:38:53,921 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2022-02-19 00:38:53,993 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size
[2022-02-19 00:38:53,993 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26
[2022-02-19 00:38:54,014 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7
[2022-02-19 00:38:54,066 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 10 proven. 88 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked.
[2022-02-19 00:38:54,066 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-02-19 00:38:56,150 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread1of2ForFork0_~c~0#1_140| Int)) (or (forall ((v_ArrVal_1494 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_140| 4) c_~data~0.offset) v_ArrVal_1494) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_140|)))) is different from false
[2022-02-19 00:38:56,181 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread1of2ForFork0_~c~0#1_140| Int) (v_ArrVal_1494 Int) (v_ArrVal_1492 (Array Int Int))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1492) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_140| 4) c_~data~0.offset) v_ArrVal_1494) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_140|)))) is different from false
[2022-02-19 00:38:56,238 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-02-19 00:38:56,239 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34
[2022-02-19 00:38:56,242 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52
[2022-02-19 00:38:56,247 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36
[2022-02-19 00:38:56,251 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42
[2022-02-19 00:38:56,932 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 676 trivial. 10 not checked.
[2022-02-19 00:38:56,933 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357079792] provided 0 perfect and 2 imperfect interpolant sequences
[2022-02-19 00:38:56,933 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-02-19 00:38:56,933 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 32
[2022-02-19 00:38:56,933 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470855418]
[2022-02-19 00:38:56,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-02-19 00:38:56,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-19 00:38:56,934 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-19 00:38:56,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-19 00:38:56,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=748, Unknown=2, NotChecked=114, Total=992
[2022-02-19 00:38:56,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:38:56,934 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2022-02-19 00:38:56,935 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 10.46875) internal successors, (335), 32 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-19 00:38:56,935 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:38:56,935 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:38:56,935 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states.
[2022-02-19 00:38:56,935 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states.
[2022-02-19 00:38:56,935 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states.
[2022-02-19 00:38:56,935 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states.
[2022-02-19 00:38:56,935 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states.
[2022-02-19 00:38:56,935 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:38:56,935 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 229 states.
[2022-02-19 00:38:56,935 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states.
[2022-02-19 00:38:56,935 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 219 states.
[2022-02-19 00:38:56,935 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 120 states.
[2022-02-19 00:38:56,935 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 116 states.
[2022-02-19 00:38:56,935 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2022-02-19 00:38:56,935 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 68 states.
[2022-02-19 00:38:56,935 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states.
[2022-02-19 00:38:56,935 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:38:57,544 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_thrThread2of2ForFork0_~c~0#1| 0) (< |c_thrThread2of2ForFork0_~c~0#1| c_~next~0) (<= |c_thrThread2of2ForFork0_~end~0#1| 10) (<= |c_thrThread2of2ForFork0_~end~0#1| c_~next~0) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (forall ((|v_thrThread1of2ForFork0_~c~0#1_140| Int) (v_ArrVal_1494 Int) (v_ArrVal_1492 (Array Int Int))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1492) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_140| 4) c_~data~0.offset) v_ArrVal_1494) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_140|)))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false
[2022-02-19 00:38:57,950 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_thrThread2of2ForFork0_~c~0#1| c_~next~0) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (forall ((|v_thrThread1of2ForFork0_~c~0#1_140| Int) (v_ArrVal_1494 Int) (v_ArrVal_1492 (Array Int Int))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1492) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_140| 4) c_~data~0.offset) v_ArrVal_1494) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_140|)))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false
[2022-02-19 00:38:58,527 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_thrThread2of2ForFork0_~end~0#1| (+ 9 |c_thrThread2of2ForFork0_~c~0#1|)) (< |c_thrThread2of2ForFork0_~c~0#1| c_~next~0) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= |c_thrThread2of2ForFork0_~end~0#1| c_~next~0) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (forall ((|v_thrThread1of2ForFork0_~c~0#1_140| Int) (v_ArrVal_1494 Int) (v_ArrVal_1492 (Array Int Int))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1492) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_140| 4) c_~data~0.offset) v_ArrVal_1494) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_140|)))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false
[2022-02-19 00:38:59,072 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_thrThread2of2ForFork0_~c~0#1| c_~next~0) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= |c_thrThread2of2ForFork0_~end~0#1| c_~next~0) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (forall ((|v_thrThread1of2ForFork0_~c~0#1_140| Int) (v_ArrVal_1494 Int) (v_ArrVal_1492 (Array Int Int))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1492) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_140| 4) c_~data~0.offset) v_ArrVal_1494) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_140|)))) (<= |c_thrThread2of2ForFork0_~end~0#1| (+ 8 |c_thrThread2of2ForFork0_~c~0#1|)) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false
[2022-02-19 00:38:59,628 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_thrThread2of2ForFork0_~c~0#1| c_~next~0) (<= |c_thrThread2of2ForFork0_~end~0#1| (+ 7 |c_thrThread2of2ForFork0_~c~0#1|)) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= |c_thrThread2of2ForFork0_~end~0#1| c_~next~0) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (forall ((|v_thrThread1of2ForFork0_~c~0#1_140| Int) (v_ArrVal_1494 Int) (v_ArrVal_1492 (Array Int Int))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1492) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_140| 4) c_~data~0.offset) v_ArrVal_1494) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_140|)))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false
[2022-02-19 00:39:00,190 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_thrThread2of2ForFork0_~c~0#1| c_~next~0) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= |c_thrThread2of2ForFork0_~end~0#1| c_~next~0) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (forall ((|v_thrThread1of2ForFork0_~c~0#1_140| Int) (v_ArrVal_1494 Int) (v_ArrVal_1492 (Array Int Int))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1492) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_140| 4) c_~data~0.offset) v_ArrVal_1494) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_140|)))) (<= |c_thrThread2of2ForFork0_~end~0#1| (+ 6 |c_thrThread2of2ForFork0_~c~0#1|)) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false
[2022-02-19 00:39:00,760 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_thrThread2of2ForFork0_~end~0#1| (+ 5 |c_thrThread2of2ForFork0_~c~0#1|)) (< |c_thrThread2of2ForFork0_~c~0#1| c_~next~0) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= |c_thrThread2of2ForFork0_~end~0#1| c_~next~0) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (forall ((|v_thrThread1of2ForFork0_~c~0#1_140| Int) (v_ArrVal_1494 Int) (v_ArrVal_1492 (Array Int Int))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1492) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_140| 4) c_~data~0.offset) v_ArrVal_1494) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_140|)))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false
[2022-02-19 00:39:01,334 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_thrThread2of2ForFork0_~c~0#1| c_~next~0) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= |c_thrThread2of2ForFork0_~end~0#1| c_~next~0) (<= |c_thrThread2of2ForFork0_~end~0#1| (+ |c_thrThread2of2ForFork0_~c~0#1| 4)) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (forall ((|v_thrThread1of2ForFork0_~c~0#1_140| Int) (v_ArrVal_1494 Int) (v_ArrVal_1492 (Array Int Int))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1492) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_140| 4) c_~data~0.offset) v_ArrVal_1494) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_140|)))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false
[2022-02-19 00:39:01,908 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_thrThread2of2ForFork0_~c~0#1| c_~next~0) (<= |c_thrThread2of2ForFork0_~end~0#1| (+ 3 |c_thrThread2of2ForFork0_~c~0#1|)) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= |c_thrThread2of2ForFork0_~end~0#1| c_~next~0) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (forall ((|v_thrThread1of2ForFork0_~c~0#1_140| Int) (v_ArrVal_1494 Int) (v_ArrVal_1492 (Array Int Int))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1492) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_140| 4) c_~data~0.offset) v_ArrVal_1494) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_140|)))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false
[2022-02-19 00:39:02,482 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_thrThread2of2ForFork0_~end~0#1| (+ 2 |c_thrThread2of2ForFork0_~c~0#1|)) (< |c_thrThread2of2ForFork0_~c~0#1| c_~next~0) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= |c_thrThread2of2ForFork0_~end~0#1| c_~next~0) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (forall ((|v_thrThread1of2ForFork0_~c~0#1_140| Int) (v_ArrVal_1494 Int) (v_ArrVal_1492 (Array Int Int))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1492) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_140| 4) c_~data~0.offset) v_ArrVal_1494) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_140|)))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false
[2022-02-19 00:39:03,079 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_thrThread2of2ForFork0_~end~0#1| (+ |c_thrThread2of2ForFork0_~c~0#1| 1)) (< |c_thrThread2of2ForFork0_~c~0#1| c_~next~0) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= |c_thrThread2of2ForFork0_~end~0#1| c_~next~0) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (forall ((|v_thrThread1of2ForFork0_~c~0#1_140| Int) (v_ArrVal_1494 Int) (v_ArrVal_1492 (Array Int Int))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1492) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_140| 4) c_~data~0.offset) v_ArrVal_1494) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_140|)))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false
[2022-02-19 00:39:05,306 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread1of2ForFork0_~c~0#1_136| Int)) (or (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_136|)) (forall ((v_ArrVal_1367 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_136| 4) c_~data~0.offset) v_ArrVal_1367) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= (+ |c_thrThread2of2ForFork0_~c~0#1| 1) c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false
[2022-02-19 00:39:07,308 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread1of2ForFork0_~c~0#1_140| Int)) (or (forall ((v_ArrVal_1494 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_140| 4) c_~data~0.offset) v_ArrVal_1494) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_140|)))) (< |c_thrThread2of2ForFork0_~c~0#1| c_~next~0) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false
[2022-02-19 00:39:09,312 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread1of2ForFork0_~c~0#1_136| Int)) (or (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_136|)) (forall ((v_ArrVal_1367 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_136| 4) c_~data~0.offset) v_ArrVal_1367) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= (+ |c_thrThread2of2ForFork0_~c~0#1| 1) c_~next~0)) is different from false
[2022-02-19 00:39:11,314 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread1of2ForFork0_~c~0#1_140| Int)) (or (forall ((v_ArrVal_1494 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_140| 4) c_~data~0.offset) v_ArrVal_1494) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_140|)))) (< |c_thrThread2of2ForFork0_~c~0#1| c_~next~0) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)))) is different from false
[2022-02-19 00:39:11,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:39:11,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:39:11,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2022-02-19 00:39:11,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2022-02-19 00:39:11,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2022-02-19 00:39:11,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2022-02-19 00:39:11,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2022-02-19 00:39:11,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:39:11,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 229 states.
[2022-02-19 00:39:11,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-02-19 00:39:11,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states.
[2022-02-19 00:39:11,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states.
[2022-02-19 00:39:11,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states.
[2022-02-19 00:39:11,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-19 00:39:11,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states.
[2022-02-19 00:39:11,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states.
[2022-02-19 00:39:11,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states.
[2022-02-19 00:39:11,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0
[2022-02-19 00:39:11,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-02-19 00:39:11,606 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-19 00:39:11,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-19 00:39:11,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1549144161, now seen corresponding path program 1 times
[2022-02-19 00:39:11,606 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-19 00:39:11,606 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336577916]
[2022-02-19 00:39:11,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-19 00:39:11,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-19 00:39:11,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-19 00:39:11,704 INFO L134 CoverageAnalysis]: Checked inductivity of 608 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 539 trivial. 0 not checked.
[2022-02-19 00:39:11,704 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-19 00:39:11,704 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336577916]
[2022-02-19 00:39:11,704 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336577916] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-19 00:39:11,759 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-19 00:39:11,760 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-02-19 00:39:11,760 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415978552]
[2022-02-19 00:39:11,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-19 00:39:11,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-02-19 00:39:11,760 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-19 00:39:11,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-02-19 00:39:11,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2022-02-19 00:39:11,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:39:11,761 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2022-02-19 00:39:11,761 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-19 00:39:11,761 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:39:11,761 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:39:11,761 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states.
[2022-02-19 00:39:11,761 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states.
[2022-02-19 00:39:11,761 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states.
[2022-02-19 00:39:11,761 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states.
[2022-02-19 00:39:11,761 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states.
[2022-02-19 00:39:11,761 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:39:11,761 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 229 states.
[2022-02-19 00:39:11,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states.
[2022-02-19 00:39:11,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 219 states.
[2022-02-19 00:39:11,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 120 states.
[2022-02-19 00:39:11,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 116 states.
[2022-02-19 00:39:11,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2022-02-19 00:39:11,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 68 states.
[2022-02-19 00:39:11,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states.
[2022-02-19 00:39:11,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states.
[2022-02-19 00:39:11,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:39:11,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:39:11,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:39:11,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2022-02-19 00:39:11,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2022-02-19 00:39:11,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2022-02-19 00:39:11,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2022-02-19 00:39:11,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2022-02-19 00:39:11,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:39:11,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 229 states.
[2022-02-19 00:39:11,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-02-19 00:39:11,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states.
[2022-02-19 00:39:11,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states.
[2022-02-19 00:39:11,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states.
[2022-02-19 00:39:11,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-19 00:39:11,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states.
[2022-02-19 00:39:11,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states.
[2022-02-19 00:39:11,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states.
[2022-02-19 00:39:11,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-02-19 00:39:11,821 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2022-02-19 00:39:11,821 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-19 00:39:11,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-19 00:39:11,821 INFO L85 PathProgramCache]: Analyzing trace with hash -76019294, now seen corresponding path program 4 times
[2022-02-19 00:39:11,821 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-19 00:39:11,821 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911159080]
[2022-02-19 00:39:11,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-19 00:39:11,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-19 00:39:11,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-19 00:39:12,079 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 0 proven. 521 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2022-02-19 00:39:12,080 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-19 00:39:12,080 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911159080]
[2022-02-19 00:39:12,080 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911159080] provided 0 perfect and 1 imperfect interpolant sequences
[2022-02-19 00:39:12,080 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254704720]
[2022-02-19 00:39:12,080 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-02-19 00:39:12,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-02-19 00:39:12,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-19 00:39:12,082 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-02-19 00:39:12,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process
[2022-02-19 00:39:12,270 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-02-19 00:39:12,271 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-02-19 00:39:12,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 24 conjunts are in the unsatisfiable core
[2022-02-19 00:39:12,276 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-02-19 00:39:12,593 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2022-02-19 00:39:12,694 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size
[2022-02-19 00:39:12,694 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26
[2022-02-19 00:39:12,699 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7
[2022-02-19 00:39:12,731 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 8 proven. 513 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2022-02-19 00:39:12,732 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-02-19 00:39:13,146 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 8 proven. 513 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2022-02-19 00:39:13,146 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254704720] provided 0 perfect and 2 imperfect interpolant sequences
[2022-02-19 00:39:13,146 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-02-19 00:39:13,146 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 27
[2022-02-19 00:39:13,146 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937977271]
[2022-02-19 00:39:13,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-02-19 00:39:13,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2022-02-19 00:39:13,147 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-19 00:39:13,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2022-02-19 00:39:13,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=574, Unknown=0, NotChecked=0, Total=702
[2022-02-19 00:39:13,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:39:13,148 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2022-02-19 00:39:13,148 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 9.74074074074074) internal successors, (263), 27 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-19 00:39:13,148 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:39:13,148 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:39:13,148 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states.
[2022-02-19 00:39:13,148 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states.
[2022-02-19 00:39:13,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states.
[2022-02-19 00:39:13,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states.
[2022-02-19 00:39:13,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states.
[2022-02-19 00:39:13,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:39:13,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 229 states.
[2022-02-19 00:39:13,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states.
[2022-02-19 00:39:13,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 219 states.
[2022-02-19 00:39:13,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 120 states.
[2022-02-19 00:39:13,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 116 states.
[2022-02-19 00:39:13,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2022-02-19 00:39:13,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 68 states.
[2022-02-19 00:39:13,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states.
[2022-02-19 00:39:13,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states.
[2022-02-19 00:39:13,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states.
[2022-02-19 00:39:13,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:39:15,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:39:15,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:39:15,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2022-02-19 00:39:15,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2022-02-19 00:39:15,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2022-02-19 00:39:15,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2022-02-19 00:39:15,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2022-02-19 00:39:15,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:39:15,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 234 states.
[2022-02-19 00:39:15,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-02-19 00:39:15,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 225 states.
[2022-02-19 00:39:15,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states.
[2022-02-19 00:39:15,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states.
[2022-02-19 00:39:15,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-19 00:39:15,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states.
[2022-02-19 00:39:15,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states.
[2022-02-19 00:39:15,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states.
[2022-02-19 00:39:15,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-02-19 00:39:15,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states.
[2022-02-19 00:39:15,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0
[2022-02-19 00:39:15,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-02-19 00:39:15,655 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-19 00:39:15,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-19 00:39:15,655 INFO L85 PathProgramCache]: Analyzing trace with hash 244179958, now seen corresponding path program 7 times
[2022-02-19 00:39:15,656 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-19 00:39:15,656 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870786192]
[2022-02-19 00:39:15,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-19 00:39:15,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-19 00:39:15,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-19 00:39:15,929 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 525 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2022-02-19 00:39:15,929 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-19 00:39:15,929 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870786192]
[2022-02-19 00:39:15,929 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870786192] provided 0 perfect and 1 imperfect interpolant sequences
[2022-02-19 00:39:15,930 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421257495]
[2022-02-19 00:39:15,930 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2022-02-19 00:39:15,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-02-19 00:39:15,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-19 00:39:15,932 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-02-19 00:39:15,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process
[2022-02-19 00:39:16,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-19 00:39:16,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 29 conjunts are in the unsatisfiable core
[2022-02-19 00:39:16,136 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-02-19 00:39:16,502 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2022-02-19 00:39:16,514 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size
[2022-02-19 00:39:16,514 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26
[2022-02-19 00:39:16,631 INFO L353 Elim1Store]: treesize reduction 88, result has 20.7 percent of original size
[2022-02-19 00:39:16,632 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 40
[2022-02-19 00:39:16,663 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size
[2022-02-19 00:39:16,663 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10
[2022-02-19 00:39:16,696 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 12 proven. 513 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2022-02-19 00:39:16,696 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-02-19 00:39:16,842 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23
[2022-02-19 00:39:17,153 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 10 proven. 515 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2022-02-19 00:39:17,154 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421257495] provided 0 perfect and 2 imperfect interpolant sequences
[2022-02-19 00:39:17,154 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-02-19 00:39:17,154 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 35
[2022-02-19 00:39:17,154 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457277624]
[2022-02-19 00:39:17,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-02-19 00:39:17,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states
[2022-02-19 00:39:17,155 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-19 00:39:17,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants.
[2022-02-19 00:39:17,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1008, Unknown=0, NotChecked=0, Total=1190
[2022-02-19 00:39:17,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:39:17,155 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2022-02-19 00:39:17,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 9.342857142857143) internal successors, (327), 35 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-19 00:39:17,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:39:17,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:39:17,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states.
[2022-02-19 00:39:17,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states.
[2022-02-19 00:39:17,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states.
[2022-02-19 00:39:17,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states.
[2022-02-19 00:39:17,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states.
[2022-02-19 00:39:17,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:39:17,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 234 states.
[2022-02-19 00:39:17,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states.
[2022-02-19 00:39:17,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 225 states.
[2022-02-19 00:39:17,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 120 states.
[2022-02-19 00:39:17,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 121 states.
[2022-02-19 00:39:17,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2022-02-19 00:39:17,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 68 states.
[2022-02-19 00:39:17,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 74 states.
[2022-02-19 00:39:17,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 88 states.
[2022-02-19 00:39:17,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states.
[2022-02-19 00:39:17,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states.
[2022-02-19 00:39:17,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:39:24,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:39:24,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:39:24,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2022-02-19 00:39:24,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2022-02-19 00:39:24,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2022-02-19 00:39:24,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2022-02-19 00:39:24,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2022-02-19 00:39:24,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:39:24,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 239 states.
[2022-02-19 00:39:24,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-02-19 00:39:24,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 229 states.
[2022-02-19 00:39:24,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states.
[2022-02-19 00:39:24,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states.
[2022-02-19 00:39:24,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-19 00:39:24,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states.
[2022-02-19 00:39:24,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states.
[2022-02-19 00:39:24,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states.
[2022-02-19 00:39:24,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-02-19 00:39:24,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states.
[2022-02-19 00:39:24,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states.
[2022-02-19 00:39:24,308 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2022-02-19 00:39:24,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0
[2022-02-19 00:39:24,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21
[2022-02-19 00:39:24,526 INFO L732 BasicCegarLoop]: Path program histogram: [7, 4, 3, 1, 1, 1, 1, 1, 1]
[2022-02-19 00:39:24,527 INFO L309 ceAbstractionStarter]: Result for error location thrThread2of2ForFork0 was SAFE (1/3)
[2022-02-19 00:39:24,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000
[2022-02-19 00:39:24,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-19 00:39:24,530 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null)
[2022-02-19 00:39:24,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (18)] Waiting until timeout for monitored process
[2022-02-19 00:39:24,534 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thrThread1of2ForFork0 ========
[2022-02-19 00:39:24,535 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, mLazyFiniteAutomaton=true, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true
[2022-02-19 00:39:24,535 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2022-02-19 00:39:24,625 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-19 00:39:24,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-19 00:39:24,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1314986904, now seen corresponding path program 1 times
[2022-02-19 00:39:24,626 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-19 00:39:24,626 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295663571]
[2022-02-19 00:39:24,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-19 00:39:24,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-19 00:39:24,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-19 00:39:24,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-19 00:39:24,638 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-19 00:39:24,638 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295663571]
[2022-02-19 00:39:24,638 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295663571] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-19 00:39:24,638 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-19 00:39:24,638 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-02-19 00:39:24,639 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253307389]
[2022-02-19 00:39:24,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-19 00:39:24,639 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2022-02-19 00:39:24,639 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-19 00:39:24,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2022-02-19 00:39:24,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2022-02-19 00:39:24,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:39:24,639 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2022-02-19 00:39:24,640 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-19 00:39:24,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:39:24,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:39:24,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2022-02-19 00:39:24,643 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-19 00:39:24,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-19 00:39:24,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1543138609, now seen corresponding path program 1 times
[2022-02-19 00:39:24,643 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-19 00:39:24,644 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901437652]
[2022-02-19 00:39:24,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-19 00:39:24,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-19 00:39:24,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-19 00:39:24,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-19 00:39:24,676 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-19 00:39:24,676 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901437652]
[2022-02-19 00:39:24,676 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901437652] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-19 00:39:24,676 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-19 00:39:24,676 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-02-19 00:39:24,676 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011574254]
[2022-02-19 00:39:24,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-19 00:39:24,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-02-19 00:39:24,677 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-19 00:39:24,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-02-19 00:39:24,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-02-19 00:39:24,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:39:24,677 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2022-02-19 00:39:24,677 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 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)
[2022-02-19 00:39:24,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:39:24,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:39:24,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:39:24,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2022-02-19 00:39:24,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2022-02-19 00:39:24,751 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-19 00:39:24,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-19 00:39:24,752 INFO L85 PathProgramCache]: Analyzing trace with hash -216175272, now seen corresponding path program 1 times
[2022-02-19 00:39:24,752 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-19 00:39:24,752 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114574594]
[2022-02-19 00:39:24,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-19 00:39:24,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-19 00:39:24,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-19 00:39:24,834 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2022-02-19 00:39:24,835 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-19 00:39:24,835 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114574594]
[2022-02-19 00:39:24,835 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114574594] provided 0 perfect and 1 imperfect interpolant sequences
[2022-02-19 00:39:24,835 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223888666]
[2022-02-19 00:39:24,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-19 00:39:24,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-02-19 00:39:24,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-19 00:39:24,839 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-02-19 00:39:24,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process
[2022-02-19 00:39:25,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-19 00:39:25,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 17 conjunts are in the unsatisfiable core
[2022-02-19 00:39:25,131 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-02-19 00:39:25,160 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2022-02-19 00:39:25,184 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2022-02-19 00:39:25,184 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2022-02-19 00:39:25,246 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2022-02-19 00:39:25,272 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2022-02-19 00:39:25,278 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7
[2022-02-19 00:39:25,300 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2022-02-19 00:39:25,300 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-02-19 00:39:25,323 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1840 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1840) c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) is different from false
[2022-02-19 00:39:25,340 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-02-19 00:39:25,340 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27
[2022-02-19 00:39:25,342 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26
[2022-02-19 00:39:25,441 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 4 not checked.
[2022-02-19 00:39:25,441 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [223888666] provided 0 perfect and 2 imperfect interpolant sequences
[2022-02-19 00:39:25,441 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-02-19 00:39:25,441 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 14
[2022-02-19 00:39:25,441 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207154043]
[2022-02-19 00:39:25,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-02-19 00:39:25,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2022-02-19 00:39:25,442 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-19 00:39:25,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2022-02-19 00:39:25,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=129, Unknown=1, NotChecked=22, Total=182
[2022-02-19 00:39:25,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:39:25,442 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2022-02-19 00:39:25,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.428571428571429) internal successors, (104), 14 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-19 00:39:25,443 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:39:25,443 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states.
[2022-02-19 00:39:25,443 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:39:25,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:39:25,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2022-02-19 00:39:25,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2022-02-19 00:39:25,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0
[2022-02-19 00:39:25,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-02-19 00:39:25,875 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-19 00:39:25,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-19 00:39:25,876 INFO L85 PathProgramCache]: Analyzing trace with hash -967143089, now seen corresponding path program 1 times
[2022-02-19 00:39:25,876 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-19 00:39:25,876 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682730393]
[2022-02-19 00:39:25,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-19 00:39:25,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-19 00:39:25,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-19 00:39:26,118 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-19 00:39:26,119 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-19 00:39:26,119 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682730393]
[2022-02-19 00:39:26,119 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682730393] provided 0 perfect and 1 imperfect interpolant sequences
[2022-02-19 00:39:26,119 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595405843]
[2022-02-19 00:39:26,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-19 00:39:26,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-02-19 00:39:26,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-19 00:39:26,124 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-02-19 00:39:26,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process
[2022-02-19 00:39:26,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-19 00:39:26,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 26 conjunts are in the unsatisfiable core
[2022-02-19 00:39:26,267 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-02-19 00:39:26,310 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2022-02-19 00:39:26,335 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2022-02-19 00:39:26,335 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2022-02-19 00:39:26,597 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2022-02-19 00:39:26,636 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2022-02-19 00:39:26,705 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size
[2022-02-19 00:39:26,705 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26
[2022-02-19 00:39:26,709 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7
[2022-02-19 00:39:26,740 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 9 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-19 00:39:26,740 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-02-19 00:39:28,821 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread2of2ForFork0_~c~0#1_161| Int)) (or (forall ((v_ArrVal_1902 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_161|) c_~data~0.offset) v_ArrVal_1902) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_161|)))) is different from false
[2022-02-19 00:39:28,885 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1902 Int) (|v_thrThread2of2ForFork0_~c~0#1_161| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1900) c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_161|) c_~data~0.offset) v_ArrVal_1902) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_161|)))) is different from false
[2022-02-19 00:39:28,935 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-02-19 00:39:28,935 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34
[2022-02-19 00:39:28,937 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52
[2022-02-19 00:39:28,941 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36
[2022-02-19 00:39:28,946 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42
[2022-02-19 00:39:29,337 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 4 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked.
[2022-02-19 00:39:29,338 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595405843] provided 0 perfect and 2 imperfect interpolant sequences
[2022-02-19 00:39:29,338 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-02-19 00:39:29,338 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36
[2022-02-19 00:39:29,338 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599103719]
[2022-02-19 00:39:29,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-02-19 00:39:29,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states
[2022-02-19 00:39:29,338 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-19 00:39:29,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants.
[2022-02-19 00:39:29,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=962, Unknown=2, NotChecked=130, Total=1260
[2022-02-19 00:39:29,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:39:29,339 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2022-02-19 00:39:29,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 7.416666666666667) internal successors, (267), 36 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-19 00:39:29,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:39:29,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states.
[2022-02-19 00:39:29,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states.
[2022-02-19 00:39:29,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:39:29,880 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (<= (+ 7 |c_thrThread1of2ForFork0_~c~0#1|) c_~next~0) (<= 10 |c_thrThread1of2ForFork0_~end~0#1|) (forall ((v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1902 Int) (|v_thrThread2of2ForFork0_~c~0#1_161| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1900) c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_161|) c_~data~0.offset) v_ArrVal_1902) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_161|)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false
[2022-02-19 00:39:30,292 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= (+ 7 |c_thrThread1of2ForFork0_~c~0#1|) c_~next~0) (<= (+ 9 |c_thrThread1of2ForFork0_~c~0#1|) c_~next~0) (forall ((v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1902 Int) (|v_thrThread2of2ForFork0_~c~0#1_161| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1900) c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_161|) c_~data~0.offset) v_ArrVal_1902) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_161|)))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false
[2022-02-19 00:39:30,778 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= (+ 7 |c_thrThread1of2ForFork0_~c~0#1|) c_~next~0) (<= (+ 9 |c_thrThread1of2ForFork0_~c~0#1|) c_~next~0) (forall ((v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1902 Int) (|v_thrThread2of2ForFork0_~c~0#1_161| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1900) c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_161|) c_~data~0.offset) v_ArrVal_1902) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_161|)))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false
[2022-02-19 00:39:31,237 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= (+ 7 |c_thrThread1of2ForFork0_~c~0#1|) c_~next~0) (<= (+ 8 |c_thrThread1of2ForFork0_~c~0#1|) c_~next~0) (forall ((v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1902 Int) (|v_thrThread2of2ForFork0_~c~0#1_161| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1900) c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_161|) c_~data~0.offset) v_ArrVal_1902) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_161|)))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false
[2022-02-19 00:39:31,651 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= (+ 7 |c_thrThread1of2ForFork0_~c~0#1|) c_~next~0) (forall ((v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1902 Int) (|v_thrThread2of2ForFork0_~c~0#1_161| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1900) c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_161|) c_~data~0.offset) v_ArrVal_1902) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_161|)))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false
[2022-02-19 00:39:32,110 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= (+ 7 |c_thrThread1of2ForFork0_~c~0#1|) c_~next~0) (forall ((v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1902 Int) (|v_thrThread2of2ForFork0_~c~0#1_161| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1900) c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_161|) c_~data~0.offset) v_ArrVal_1902) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_161|)))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false
[2022-02-19 00:39:32,602 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (< (+ 2 |c_thrThread1of2ForFork0_~c~0#1|) c_~next~0) (forall ((v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1902 Int) (|v_thrThread2of2ForFork0_~c~0#1_161| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1900) c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_161|) c_~data~0.offset) v_ArrVal_1902) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_161|)))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false
[2022-02-19 00:39:33,037 WARN L838 $PredicateComparison]: unable to prove that (and (< (+ 2 |c_thrThread1of2ForFork0_~c~0#1|) c_~next~0) (forall ((v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1902 Int) (|v_thrThread2of2ForFork0_~c~0#1_161| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1900) c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_161|) c_~data~0.offset) v_ArrVal_1902) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_161|)))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false
[2022-02-19 00:39:33,507 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (< (+ |c_thrThread1of2ForFork0_~c~0#1| 1) c_~next~0) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (forall ((v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1902 Int) (|v_thrThread2of2ForFork0_~c~0#1_161| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1900) c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_161|) c_~data~0.offset) v_ArrVal_1902) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_161|)))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false
[2022-02-19 00:39:33,976 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (forall ((v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1902 Int) (|v_thrThread2of2ForFork0_~c~0#1_161| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1900) c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_161|) c_~data~0.offset) v_ArrVal_1902) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_161|)))) (not (<= c_~next~0 |c_thrThread1of2ForFork0_~c~0#1|)) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false
[2022-02-19 00:39:34,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:39:34,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2022-02-19 00:39:34,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2022-02-19 00:39:34,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states.
[2022-02-19 00:39:34,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0
[2022-02-19 00:39:34,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-02-19 00:39:34,471 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-19 00:39:34,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-19 00:39:34,471 INFO L85 PathProgramCache]: Analyzing trace with hash -389824699, now seen corresponding path program 2 times
[2022-02-19 00:39:34,471 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-19 00:39:34,471 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960005557]
[2022-02-19 00:39:34,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-19 00:39:34,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-19 00:39:34,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-19 00:39:34,824 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-19 00:39:34,824 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-19 00:39:34,824 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960005557]
[2022-02-19 00:39:34,824 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960005557] provided 0 perfect and 1 imperfect interpolant sequences
[2022-02-19 00:39:34,824 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379210728]
[2022-02-19 00:39:34,824 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-02-19 00:39:34,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-02-19 00:39:34,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-19 00:39:34,825 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-02-19 00:39:34,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process
[2022-02-19 00:39:34,985 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-02-19 00:39:34,985 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-02-19 00:39:34,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 32 conjunts are in the unsatisfiable core
[2022-02-19 00:39:34,989 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-02-19 00:39:35,014 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2022-02-19 00:39:35,037 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2022-02-19 00:39:35,037 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2022-02-19 00:39:35,550 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2022-02-19 00:39:35,592 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2022-02-19 00:39:35,677 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size
[2022-02-19 00:39:35,678 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26
[2022-02-19 00:39:35,682 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7
[2022-02-19 00:39:35,718 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 9 proven. 519 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-19 00:39:35,718 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-02-19 00:39:35,857 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2010 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2010) c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= (+ |c_thrThread1of2ForFork0_~c~0#1| 1) c_~next~0)) is different from false
[2022-02-19 00:39:35,888 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-02-19 00:39:35,888 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27
[2022-02-19 00:39:35,890 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26
[2022-02-19 00:39:35,892 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3
[2022-02-19 00:39:36,459 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 4 proven. 513 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked.
[2022-02-19 00:39:36,459 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379210728] provided 0 perfect and 2 imperfect interpolant sequences
[2022-02-19 00:39:36,459 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-02-19 00:39:36,459 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 35
[2022-02-19 00:39:36,459 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619993769]
[2022-02-19 00:39:36,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-02-19 00:39:36,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states
[2022-02-19 00:39:36,460 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-19 00:39:36,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants.
[2022-02-19 00:39:36,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=958, Unknown=1, NotChecked=64, Total=1190
[2022-02-19 00:39:36,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:39:36,460 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2022-02-19 00:39:36,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 8.0) internal successors, (280), 35 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-19 00:39:36,461 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:39:36,461 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states.
[2022-02-19 00:39:36,461 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states.
[2022-02-19 00:39:36,461 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states.
[2022-02-19 00:39:36,461 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:39:37,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:39:37,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2022-02-19 00:39:37,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2022-02-19 00:39:37,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states.
[2022-02-19 00:39:37,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states.
[2022-02-19 00:39:37,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0
[2022-02-19 00:39:37,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26
[2022-02-19 00:39:37,950 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-19 00:39:37,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-19 00:39:37,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1111430144, now seen corresponding path program 3 times
[2022-02-19 00:39:37,951 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-19 00:39:37,951 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527229943]
[2022-02-19 00:39:37,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-19 00:39:37,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-19 00:39:37,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-19 00:39:38,141 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 778 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-19 00:39:38,141 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-19 00:39:38,141 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527229943]
[2022-02-19 00:39:38,141 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527229943] provided 0 perfect and 1 imperfect interpolant sequences
[2022-02-19 00:39:38,141 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728408509]
[2022-02-19 00:39:38,142 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2022-02-19 00:39:38,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-02-19 00:39:38,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-19 00:39:38,143 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-02-19 00:39:38,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process
[2022-02-19 00:39:38,342 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s)
[2022-02-19 00:39:38,342 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-02-19 00:39:38,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 22 conjunts are in the unsatisfiable core
[2022-02-19 00:39:38,347 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-02-19 00:39:38,371 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2022-02-19 00:39:38,402 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2022-02-19 00:39:38,402 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2022-02-19 00:39:39,006 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2022-02-19 00:39:39,062 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2022-02-19 00:39:39,159 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size
[2022-02-19 00:39:39,160 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26
[2022-02-19 00:39:39,177 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7
[2022-02-19 00:39:39,222 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 9 proven. 102 refuted. 0 times theorem prover too weak. 804 trivial. 0 not checked.
[2022-02-19 00:39:39,222 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-02-19 00:39:41,290 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread2of2ForFork0_~c~0#1_169| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_169|)) (forall ((v_ArrVal_2145 Int)) (= 1 (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* 4 |v_thrThread2of2ForFork0_~c~0#1_169|)) v_ArrVal_2145) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)))))) is different from false
[2022-02-19 00:39:41,371 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2145 Int) (v_ArrVal_2144 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_169| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_169|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2144) c_~data~0.base) (+ c_~data~0.offset (* 4 |v_thrThread2of2ForFork0_~c~0#1_169|)) v_ArrVal_2145) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) is different from false
[2022-02-19 00:39:41,420 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-02-19 00:39:41,421 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34
[2022-02-19 00:39:41,423 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52
[2022-02-19 00:39:41,428 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36
[2022-02-19 00:39:41,432 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42
[2022-02-19 00:39:42,062 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 4 proven. 96 refuted. 0 times theorem prover too weak. 804 trivial. 11 not checked.
[2022-02-19 00:39:42,062 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728408509] provided 0 perfect and 2 imperfect interpolant sequences
[2022-02-19 00:39:42,062 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-02-19 00:39:42,062 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 14] total 33
[2022-02-19 00:39:42,062 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016299052]
[2022-02-19 00:39:42,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-02-19 00:39:42,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2022-02-19 00:39:42,063 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-19 00:39:42,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2022-02-19 00:39:42,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=795, Unknown=2, NotChecked=118, Total=1056
[2022-02-19 00:39:42,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:39:42,064 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2022-02-19 00:39:42,064 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 10.969696969696969) internal successors, (362), 33 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-19 00:39:42,064 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:39:42,064 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states.
[2022-02-19 00:39:42,064 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states.
[2022-02-19 00:39:42,064 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states.
[2022-02-19 00:39:42,064 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states.
[2022-02-19 00:39:42,064 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:39:42,653 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (forall ((v_ArrVal_2145 Int) (v_ArrVal_2144 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_169| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_169|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2144) c_~data~0.base) (+ c_~data~0.offset (* 4 |v_thrThread2of2ForFork0_~c~0#1_169|)) v_ArrVal_2145) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (<= |c_thrThread1of2ForFork0_~end~0#1| c_~next~0) (<= |c_thrThread1of2ForFork0_~end~0#1| 10) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (< |c_thrThread1of2ForFork0_~c~0#1| c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false
[2022-02-19 00:39:43,092 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (forall ((v_ArrVal_2145 Int) (v_ArrVal_2144 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_169| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_169|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2144) c_~data~0.base) (+ c_~data~0.offset (* 4 |v_thrThread2of2ForFork0_~c~0#1_169|)) v_ArrVal_2145) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (<= |c_thrThread1of2ForFork0_~end~0#1| c_~next~0) (< |c_thrThread1of2ForFork0_~c~0#1| c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false
[2022-02-19 00:39:43,602 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (forall ((v_ArrVal_2145 Int) (v_ArrVal_2144 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_169| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_169|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2144) c_~data~0.base) (+ c_~data~0.offset (* 4 |v_thrThread2of2ForFork0_~c~0#1_169|)) v_ArrVal_2145) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= |c_thrThread1of2ForFork0_~end~0#1| c_~next~0) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ 9 |c_thrThread1of2ForFork0_~c~0#1|)) (< |c_thrThread1of2ForFork0_~c~0#1| c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false
[2022-02-19 00:39:44,107 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (forall ((v_ArrVal_2145 Int) (v_ArrVal_2144 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_169| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_169|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2144) c_~data~0.base) (+ c_~data~0.offset (* 4 |v_thrThread2of2ForFork0_~c~0#1_169|)) v_ArrVal_2145) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= |c_thrThread1of2ForFork0_~end~0#1| c_~next~0) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ 8 |c_thrThread1of2ForFork0_~c~0#1|)) (< |c_thrThread1of2ForFork0_~c~0#1| c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false
[2022-02-19 00:39:44,675 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (forall ((v_ArrVal_2145 Int) (v_ArrVal_2144 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_169| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_169|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2144) c_~data~0.base) (+ c_~data~0.offset (* 4 |v_thrThread2of2ForFork0_~c~0#1_169|)) v_ArrVal_2145) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ 7 |c_thrThread1of2ForFork0_~c~0#1|)) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= |c_thrThread1of2ForFork0_~end~0#1| c_~next~0) (< |c_thrThread1of2ForFork0_~c~0#1| c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false
[2022-02-19 00:39:45,178 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (forall ((v_ArrVal_2145 Int) (v_ArrVal_2144 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_169| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_169|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2144) c_~data~0.base) (+ c_~data~0.offset (* 4 |v_thrThread2of2ForFork0_~c~0#1_169|)) v_ArrVal_2145) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= |c_thrThread1of2ForFork0_~end~0#1| c_~next~0) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ 6 |c_thrThread1of2ForFork0_~c~0#1|)) (< |c_thrThread1of2ForFork0_~c~0#1| c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false
[2022-02-19 00:39:45,685 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (forall ((v_ArrVal_2145 Int) (v_ArrVal_2144 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_169| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_169|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2144) c_~data~0.base) (+ c_~data~0.offset (* 4 |v_thrThread2of2ForFork0_~c~0#1_169|)) v_ArrVal_2145) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ 5 |c_thrThread1of2ForFork0_~c~0#1|)) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= |c_thrThread1of2ForFork0_~end~0#1| c_~next~0) (< |c_thrThread1of2ForFork0_~c~0#1| c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false
[2022-02-19 00:39:46,196 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (forall ((v_ArrVal_2145 Int) (v_ArrVal_2144 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_169| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_169|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2144) c_~data~0.base) (+ c_~data~0.offset (* 4 |v_thrThread2of2ForFork0_~c~0#1_169|)) v_ArrVal_2145) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= |c_thrThread1of2ForFork0_~end~0#1| c_~next~0) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ |c_thrThread1of2ForFork0_~c~0#1| 4)) (< |c_thrThread1of2ForFork0_~c~0#1| c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false
[2022-02-19 00:39:46,711 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (forall ((v_ArrVal_2145 Int) (v_ArrVal_2144 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_169| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_169|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2144) c_~data~0.base) (+ c_~data~0.offset (* 4 |v_thrThread2of2ForFork0_~c~0#1_169|)) v_ArrVal_2145) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ 3 |c_thrThread1of2ForFork0_~c~0#1|)) (<= |c_thrThread1of2ForFork0_~end~0#1| c_~next~0) (< |c_thrThread1of2ForFork0_~c~0#1| c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false
[2022-02-19 00:39:47,236 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_thrThread1of2ForFork0_~end~0#1| (+ 2 |c_thrThread1of2ForFork0_~c~0#1|)) (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (forall ((v_ArrVal_2145 Int) (v_ArrVal_2144 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_169| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_169|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2144) c_~data~0.base) (+ c_~data~0.offset (* 4 |v_thrThread2of2ForFork0_~c~0#1_169|)) v_ArrVal_2145) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= |c_thrThread1of2ForFork0_~end~0#1| c_~next~0) (< |c_thrThread1of2ForFork0_~c~0#1| c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false
[2022-02-19 00:39:47,763 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (forall ((v_ArrVal_2145 Int) (v_ArrVal_2144 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_169| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_169|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2144) c_~data~0.base) (+ c_~data~0.offset (* 4 |v_thrThread2of2ForFork0_~c~0#1_169|)) v_ArrVal_2145) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= |c_thrThread1of2ForFork0_~end~0#1| c_~next~0) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)) (< |c_thrThread1of2ForFork0_~c~0#1| c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false
[2022-02-19 00:39:49,963 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= |c_thrThread1of2ForFork0_~end~0#1| c_~next~0) (forall ((|v_thrThread2of2ForFork0_~c~0#1_169| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_169|)) (forall ((v_ArrVal_2145 Int)) (= 1 (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* 4 |v_thrThread2of2ForFork0_~c~0#1_169|)) v_ArrVal_2145) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)))))) (< |c_thrThread1of2ForFork0_~c~0#1| c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false
[2022-02-19 00:39:50,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:39:50,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2022-02-19 00:39:50,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2022-02-19 00:39:50,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states.
[2022-02-19 00:39:50,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states.
[2022-02-19 00:39:50,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states.
[2022-02-19 00:39:50,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0
[2022-02-19 00:39:50,350 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27
[2022-02-19 00:39:50,351 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-19 00:39:50,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-19 00:39:50,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1284615935, now seen corresponding path program 1 times
[2022-02-19 00:39:50,351 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-19 00:39:50,351 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438492903]
[2022-02-19 00:39:50,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-19 00:39:50,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-19 00:39:50,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-19 00:39:50,402 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 474 trivial. 0 not checked.
[2022-02-19 00:39:50,402 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-19 00:39:50,402 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438492903]
[2022-02-19 00:39:50,403 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438492903] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-19 00:39:50,403 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-19 00:39:50,403 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-02-19 00:39:50,403 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981426139]
[2022-02-19 00:39:50,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-19 00:39:50,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-02-19 00:39:50,403 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-19 00:39:50,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-02-19 00:39:50,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2022-02-19 00:39:50,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:39:50,404 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2022-02-19 00:39:50,404 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-19 00:39:50,404 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:39:50,404 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states.
[2022-02-19 00:39:50,404 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states.
[2022-02-19 00:39:50,404 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states.
[2022-02-19 00:39:50,404 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states.
[2022-02-19 00:39:50,404 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 76 states.
[2022-02-19 00:39:50,404 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:39:50,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:39:50,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2022-02-19 00:39:50,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2022-02-19 00:39:50,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states.
[2022-02-19 00:39:50,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states.
[2022-02-19 00:39:50,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states.
[2022-02-19 00:39:50,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-02-19 00:39:50,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2022-02-19 00:39:50,785 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-19 00:39:50,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-19 00:39:50,785 INFO L85 PathProgramCache]: Analyzing trace with hash -441929258, now seen corresponding path program 1 times
[2022-02-19 00:39:50,785 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-19 00:39:50,785 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957216885]
[2022-02-19 00:39:50,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-19 00:39:50,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-19 00:39:50,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-19 00:39:51,053 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 524 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2022-02-19 00:39:51,053 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-19 00:39:51,053 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957216885]
[2022-02-19 00:39:51,054 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957216885] provided 0 perfect and 1 imperfect interpolant sequences
[2022-02-19 00:39:51,054 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952392598]
[2022-02-19 00:39:51,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-19 00:39:51,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-02-19 00:39:51,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-19 00:39:51,056 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-02-19 00:39:51,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process
[2022-02-19 00:39:51,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-19 00:39:51,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 29 conjunts are in the unsatisfiable core
[2022-02-19 00:39:51,238 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-02-19 00:39:51,543 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2022-02-19 00:39:51,557 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size
[2022-02-19 00:39:51,557 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26
[2022-02-19 00:39:51,676 INFO L353 Elim1Store]: treesize reduction 88, result has 20.7 percent of original size
[2022-02-19 00:39:51,677 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 40
[2022-02-19 00:39:51,707 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size
[2022-02-19 00:39:51,707 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10
[2022-02-19 00:39:51,741 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 11 proven. 513 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2022-02-19 00:39:51,742 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-02-19 00:39:51,866 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23
[2022-02-19 00:39:52,192 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 9 proven. 515 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2022-02-19 00:39:52,193 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952392598] provided 0 perfect and 2 imperfect interpolant sequences
[2022-02-19 00:39:52,193 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-02-19 00:39:52,193 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 35
[2022-02-19 00:39:52,193 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370397570]
[2022-02-19 00:39:52,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-02-19 00:39:52,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states
[2022-02-19 00:39:52,193 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-19 00:39:52,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants.
[2022-02-19 00:39:52,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1008, Unknown=0, NotChecked=0, Total=1190
[2022-02-19 00:39:52,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:39:52,194 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2022-02-19 00:39:52,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 9.228571428571428) internal successors, (323), 35 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-19 00:39:52,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:39:52,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states.
[2022-02-19 00:39:52,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states.
[2022-02-19 00:39:52,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states.
[2022-02-19 00:39:52,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states.
[2022-02-19 00:39:52,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 84 states.
[2022-02-19 00:39:52,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states.
[2022-02-19 00:39:52,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:39:52,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:39:52,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2022-02-19 00:39:52,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2022-02-19 00:39:52,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states.
[2022-02-19 00:39:52,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states.
[2022-02-19 00:39:52,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states.
[2022-02-19 00:39:52,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-02-19 00:39:52,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states.
[2022-02-19 00:39:52,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0
[2022-02-19 00:39:52,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-02-19 00:39:52,830 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-19 00:39:52,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-19 00:39:52,830 INFO L85 PathProgramCache]: Analyzing trace with hash 8575096, now seen corresponding path program 2 times
[2022-02-19 00:39:52,830 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-19 00:39:52,830 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629964678]
[2022-02-19 00:39:52,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-19 00:39:52,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-19 00:39:52,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-19 00:39:53,093 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 524 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2022-02-19 00:39:53,094 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-19 00:39:53,094 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629964678]
[2022-02-19 00:39:53,094 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629964678] provided 0 perfect and 1 imperfect interpolant sequences
[2022-02-19 00:39:53,094 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357168111]
[2022-02-19 00:39:53,094 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-02-19 00:39:53,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-02-19 00:39:53,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-19 00:39:53,095 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-02-19 00:39:53,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process
[2022-02-19 00:39:53,285 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-02-19 00:39:53,285 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-02-19 00:39:53,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 25 conjunts are in the unsatisfiable core
[2022-02-19 00:39:53,290 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-02-19 00:39:53,625 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2022-02-19 00:39:53,687 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size
[2022-02-19 00:39:53,688 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26
[2022-02-19 00:39:53,693 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7
[2022-02-19 00:39:53,728 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 11 proven. 513 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2022-02-19 00:39:53,728 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-02-19 00:39:54,178 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 9 proven. 515 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2022-02-19 00:39:54,178 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357168111] provided 0 perfect and 2 imperfect interpolant sequences
[2022-02-19 00:39:54,178 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-02-19 00:39:54,179 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 32
[2022-02-19 00:39:54,179 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147125653]
[2022-02-19 00:39:54,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-02-19 00:39:54,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-19 00:39:54,179 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-19 00:39:54,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-19 00:39:54,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=830, Unknown=0, NotChecked=0, Total=992
[2022-02-19 00:39:54,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:39:54,180 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2022-02-19 00:39:54,180 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 9.78125) internal successors, (313), 32 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-19 00:39:54,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:39:54,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states.
[2022-02-19 00:39:54,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states.
[2022-02-19 00:39:54,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states.
[2022-02-19 00:39:54,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states.
[2022-02-19 00:39:54,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 84 states.
[2022-02-19 00:39:54,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states.
[2022-02-19 00:39:54,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states.
[2022-02-19 00:39:54,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:39:58,412 WARN L838 $PredicateComparison]: unable to prove that (and (< (+ 2 |c_thrThread1of2ForFork0_~c~0#1|) c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base)) (forall ((|v_thrThread2of2ForFork0_~c~0#1_161| Int)) (or (forall ((v_ArrVal_1902 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_161|) c_~data~0.offset) v_ArrVal_1902) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_161|))))) is different from false
[2022-02-19 00:40:00,724 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= (+ 7 |c_thrThread1of2ForFork0_~c~0#1|) c_~next~0) (< (+ 2 |c_thrThread1of2ForFork0_~c~0#1|) c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base)) (forall ((|v_thrThread2of2ForFork0_~c~0#1_161| Int)) (or (forall ((v_ArrVal_1902 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_161|) c_~data~0.offset) v_ArrVal_1902) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_161|))))) is different from false
[2022-02-19 00:40:03,464 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= (+ 7 |c_thrThread1of2ForFork0_~c~0#1|) c_~next~0) (<= (+ 9 |c_thrThread1of2ForFork0_~c~0#1|) c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base)) (forall ((|v_thrThread2of2ForFork0_~c~0#1_161| Int)) (or (forall ((v_ArrVal_1902 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_161|) c_~data~0.offset) v_ArrVal_1902) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_161|))))) is different from false
[2022-02-19 00:40:07,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:40:07,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2022-02-19 00:40:07,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2022-02-19 00:40:07,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states.
[2022-02-19 00:40:07,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states.
[2022-02-19 00:40:07,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states.
[2022-02-19 00:40:07,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-02-19 00:40:07,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states.
[2022-02-19 00:40:07,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states.
[2022-02-19 00:40:07,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0
[2022-02-19 00:40:07,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-02-19 00:40:07,883 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-19 00:40:07,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-19 00:40:07,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1838239499, now seen corresponding path program 4 times
[2022-02-19 00:40:07,884 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-19 00:40:07,884 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918156702]
[2022-02-19 00:40:07,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-19 00:40:07,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-19 00:40:07,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-19 00:40:08,222 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 345 proven. 177 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2022-02-19 00:40:08,222 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-19 00:40:08,222 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918156702]
[2022-02-19 00:40:08,222 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918156702] provided 0 perfect and 1 imperfect interpolant sequences
[2022-02-19 00:40:08,222 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701697775]
[2022-02-19 00:40:08,223 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-02-19 00:40:08,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-02-19 00:40:08,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-19 00:40:08,224 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-02-19 00:40:08,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process
[2022-02-19 00:40:08,442 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-02-19 00:40:08,443 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-02-19 00:40:08,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 6 conjunts are in the unsatisfiable core
[2022-02-19 00:40:08,447 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-02-19 00:40:08,684 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked.
[2022-02-19 00:40:08,684 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-02-19 00:40:08,684 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701697775] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-19 00:40:08,684 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2022-02-19 00:40:08,684 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [19] total 20
[2022-02-19 00:40:08,684 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901554999]
[2022-02-19 00:40:08,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-19 00:40:08,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-02-19 00:40:08,685 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-19 00:40:08,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-02-19 00:40:08,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380
[2022-02-19 00:40:08,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:40:08,685 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2022-02-19 00:40:08,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-19 00:40:08,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:40:08,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states.
[2022-02-19 00:40:08,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states.
[2022-02-19 00:40:08,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states.
[2022-02-19 00:40:08,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 95 states.
[2022-02-19 00:40:08,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 106 states.
[2022-02-19 00:40:08,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states.
[2022-02-19 00:40:08,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states.
[2022-02-19 00:40:08,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 132 states.
[2022-02-19 00:40:08,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:40:09,681 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 10))) (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= (+ 7 |c_thrThread1of2ForFork0_~c~0#1|) c_~next~0) (<= .cse0 c_~next~0) (<= .cse0 |c_thrThread1of2ForFork0_~end~0#1|) (forall ((v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1902 Int) (|v_thrThread2of2ForFork0_~c~0#1_161| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1900) c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_161|) c_~data~0.offset) v_ArrVal_1902) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_161|)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base)))) is different from false
[2022-02-19 00:40:10,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:40:10,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2022-02-19 00:40:10,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2022-02-19 00:40:10,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states.
[2022-02-19 00:40:10,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states.
[2022-02-19 00:40:10,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states.
[2022-02-19 00:40:10,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-02-19 00:40:10,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states.
[2022-02-19 00:40:10,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states.
[2022-02-19 00:40:10,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-19 00:40:10,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0
[2022-02-19 00:40:10,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-02-19 00:40:10,486 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-19 00:40:10,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-19 00:40:10,486 INFO L85 PathProgramCache]: Analyzing trace with hash -2031707968, now seen corresponding path program 5 times
[2022-02-19 00:40:10,486 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-19 00:40:10,486 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917018937]
[2022-02-19 00:40:10,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-19 00:40:10,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-19 00:40:10,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-19 00:40:10,672 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 900 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2022-02-19 00:40:10,672 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-19 00:40:10,672 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917018937]
[2022-02-19 00:40:10,672 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917018937] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-19 00:40:10,672 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-19 00:40:10,672 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16
[2022-02-19 00:40:10,673 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325854712]
[2022-02-19 00:40:10,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-19 00:40:10,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2022-02-19 00:40:10,673 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-19 00:40:10,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2022-02-19 00:40:10,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240
[2022-02-19 00:40:10,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:40:10,674 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2022-02-19 00:40:10,674 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 14.25) internal successors, (228), 16 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-19 00:40:10,674 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:40:10,674 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states.
[2022-02-19 00:40:10,674 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states.
[2022-02-19 00:40:10,674 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states.
[2022-02-19 00:40:10,674 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 105 states.
[2022-02-19 00:40:10,674 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 119 states.
[2022-02-19 00:40:10,674 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states.
[2022-02-19 00:40:10,674 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 68 states.
[2022-02-19 00:40:10,674 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 151 states.
[2022-02-19 00:40:10,674 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2022-02-19 00:40:10,675 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:40:10,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:40:10,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2022-02-19 00:40:10,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2022-02-19 00:40:10,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states.
[2022-02-19 00:40:10,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states.
[2022-02-19 00:40:10,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states.
[2022-02-19 00:40:10,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-02-19 00:40:10,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states.
[2022-02-19 00:40:10,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states.
[2022-02-19 00:40:10,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-19 00:40:10,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:40:10,920 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2022-02-19 00:40:10,920 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-19 00:40:10,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-19 00:40:10,920 INFO L85 PathProgramCache]: Analyzing trace with hash -977844965, now seen corresponding path program 6 times
[2022-02-19 00:40:10,920 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-19 00:40:10,920 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557332558]
[2022-02-19 00:40:10,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-19 00:40:10,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-19 00:40:10,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-19 00:40:11,201 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 432 proven. 81 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2022-02-19 00:40:11,202 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-19 00:40:11,202 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557332558]
[2022-02-19 00:40:11,202 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557332558] provided 0 perfect and 1 imperfect interpolant sequences
[2022-02-19 00:40:11,202 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122142397]
[2022-02-19 00:40:11,202 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2022-02-19 00:40:11,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-02-19 00:40:11,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-19 00:40:11,204 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-02-19 00:40:11,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process
[2022-02-19 00:40:11,584 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s)
[2022-02-19 00:40:11,585 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-02-19 00:40:11,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 24 conjunts are in the unsatisfiable core
[2022-02-19 00:40:11,590 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-02-19 00:40:12,006 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2022-02-19 00:40:12,044 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size
[2022-02-19 00:40:12,044 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26
[2022-02-19 00:40:12,049 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7
[2022-02-19 00:40:12,080 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 459 proven. 54 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2022-02-19 00:40:12,081 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-02-19 00:40:12,534 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 432 proven. 81 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2022-02-19 00:40:12,534 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122142397] provided 0 perfect and 2 imperfect interpolant sequences
[2022-02-19 00:40:12,534 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-02-19 00:40:12,534 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 49
[2022-02-19 00:40:12,534 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030600916]
[2022-02-19 00:40:12,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-02-19 00:40:12,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states
[2022-02-19 00:40:12,535 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-19 00:40:12,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants.
[2022-02-19 00:40:12,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=490, Invalid=1862, Unknown=0, NotChecked=0, Total=2352
[2022-02-19 00:40:12,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:40:12,536 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2022-02-19 00:40:12,536 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 9.83673469387755) internal successors, (482), 49 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-19 00:40:12,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:40:12,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states.
[2022-02-19 00:40:12,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states.
[2022-02-19 00:40:12,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states.
[2022-02-19 00:40:12,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 105 states.
[2022-02-19 00:40:12,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 119 states.
[2022-02-19 00:40:12,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states.
[2022-02-19 00:40:12,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 68 states.
[2022-02-19 00:40:12,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 155 states.
[2022-02-19 00:40:12,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2022-02-19 00:40:12,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:40:12,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:40:14,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:40:14,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2022-02-19 00:40:14,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2022-02-19 00:40:14,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states.
[2022-02-19 00:40:14,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states.
[2022-02-19 00:40:14,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states.
[2022-02-19 00:40:14,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-02-19 00:40:14,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states.
[2022-02-19 00:40:14,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states.
[2022-02-19 00:40:14,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-19 00:40:14,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:40:14,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states.
[2022-02-19 00:40:14,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0
[2022-02-19 00:40:14,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33
[2022-02-19 00:40:14,740 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-19 00:40:14,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-19 00:40:14,740 INFO L85 PathProgramCache]: Analyzing trace with hash -201255048, now seen corresponding path program 3 times
[2022-02-19 00:40:14,740 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-19 00:40:14,740 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550829631]
[2022-02-19 00:40:14,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-19 00:40:14,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-19 00:40:14,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-19 00:40:14,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1210 backedges. 615 proven. 121 refuted. 0 times theorem prover too weak. 474 trivial. 0 not checked.
[2022-02-19 00:40:14,947 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-19 00:40:14,947 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550829631]
[2022-02-19 00:40:14,947 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550829631] provided 0 perfect and 1 imperfect interpolant sequences
[2022-02-19 00:40:14,947 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927269031]
[2022-02-19 00:40:14,948 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2022-02-19 00:40:14,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-02-19 00:40:14,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-19 00:40:14,952 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-02-19 00:40:14,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process
[2022-02-19 00:40:20,376 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s)
[2022-02-19 00:40:20,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-02-19 00:40:20,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 676 conjuncts, 14 conjunts are in the unsatisfiable core
[2022-02-19 00:40:20,394 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-02-19 00:40:20,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1210 backedges. 736 proven. 0 refuted. 0 times theorem prover too weak. 474 trivial. 0 not checked.
[2022-02-19 00:40:20,903 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-02-19 00:40:20,903 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927269031] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-19 00:40:20,903 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2022-02-19 00:40:20,903 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [16] total 18
[2022-02-19 00:40:20,904 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778095043]
[2022-02-19 00:40:20,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-19 00:40:20,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2022-02-19 00:40:20,904 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-19 00:40:20,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2022-02-19 00:40:20,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306
[2022-02-19 00:40:20,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:40:20,904 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2022-02-19 00:40:20,905 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 15.0) internal successors, (225), 15 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-19 00:40:20,905 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:40:20,905 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states.
[2022-02-19 00:40:20,905 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states.
[2022-02-19 00:40:20,905 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states.
[2022-02-19 00:40:20,905 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 105 states.
[2022-02-19 00:40:20,905 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 119 states.
[2022-02-19 00:40:20,905 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states.
[2022-02-19 00:40:20,905 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 68 states.
[2022-02-19 00:40:20,905 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 155 states.
[2022-02-19 00:40:20,905 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2022-02-19 00:40:20,905 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:40:20,905 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 74 states.
[2022-02-19 00:40:20,905 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:40:21,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-19 00:40:21,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2022-02-19 00:40:21,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2022-02-19 00:40:21,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states.
[2022-02-19 00:40:21,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states.
[2022-02-19 00:40:21,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states.
[2022-02-19 00:40:21,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-02-19 00:40:21,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states.
[2022-02-19 00:40:21,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states.
[2022-02-19 00:40:21,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-19 00:40:21,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:40:21,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states.
[2022-02-19 00:40:21,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2022-02-19 00:40:21,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0
[2022-02-19 00:40:22,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34
[2022-02-19 00:40:22,131 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-19 00:40:22,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-19 00:40:22,131 INFO L85 PathProgramCache]: Analyzing trace with hash 2118196124, now seen corresponding path program 4 times
[2022-02-19 00:40:22,132 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-19 00:40:22,132 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255443720]
[2022-02-19 00:40:22,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-19 00:40:22,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-19 00:40:22,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-19 00:40:22,743 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 273 proven. 492 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2022-02-19 00:40:22,743 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-19 00:40:22,743 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255443720]
[2022-02-19 00:40:22,743 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255443720] provided 0 perfect and 1 imperfect interpolant sequences
[2022-02-19 00:40:22,743 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698835149]
[2022-02-19 00:40:22,744 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-02-19 00:40:22,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-02-19 00:40:22,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-19 00:40:22,745 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-02-19 00:40:22,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process
[2022-02-19 00:40:22,978 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-02-19 00:40:22,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-02-19 00:40:22,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 83 conjunts are in the unsatisfiable core
[2022-02-19 00:40:22,986 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-02-19 00:40:23,367 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2022-02-19 00:40:23,402 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size
[2022-02-19 00:40:23,402 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26
[2022-02-19 00:40:23,414 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size
[2022-02-19 00:40:23,414 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26
[2022-02-19 00:40:23,543 INFO L353 Elim1Store]: treesize reduction 80, result has 27.9 percent of original size
[2022-02-19 00:40:23,543 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 48
[2022-02-19 00:40:23,617 INFO L353 Elim1Store]: treesize reduction 80, result has 27.9 percent of original size
[2022-02-19 00:40:23,617 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 56
[2022-02-19 00:40:23,871 INFO L353 Elim1Store]: treesize reduction 80, result has 27.9 percent of original size
[2022-02-19 00:40:23,871 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 60
[2022-02-19 00:40:23,931 INFO L353 Elim1Store]: treesize reduction 80, result has 27.9 percent of original size
[2022-02-19 00:40:23,931 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 60
[2022-02-19 00:40:24,436 INFO L353 Elim1Store]: treesize reduction 128, result has 32.6 percent of original size
[2022-02-19 00:40:24,437 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 94
[2022-02-19 00:40:24,927 INFO L353 Elim1Store]: treesize reduction 128, result has 32.6 percent of original size
[2022-02-19 00:40:24,927 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 110
[2022-02-19 00:40:26,233 INFO L353 Elim1Store]: treesize reduction 192, result has 32.6 percent of original size
[2022-02-19 00:40:26,234 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 72 treesize of output 128
[2022-02-19 00:40:27,195 INFO L353 Elim1Store]: treesize reduction 180, result has 36.8 percent of original size
[2022-02-19 00:40:27,196 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 96 treesize of output 164
[2022-02-19 00:40:30,127 INFO L353 Elim1Store]: treesize reduction 272, result has 31.3 percent of original size
[2022-02-19 00:40:30,127 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 83 treesize of output 162
[2022-02-19 00:40:32,714 INFO L353 Elim1Store]: treesize reduction 236, result has 40.4 percent of original size
[2022-02-19 00:40:32,714 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 115 treesize of output 230
[2022-02-19 00:40:40,152 INFO L353 Elim1Store]: treesize reduction 368, result has 29.6 percent of original size
[2022-02-19 00:40:40,152 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 117 treesize of output 203
[2022-02-19 00:40:48,022 INFO L353 Elim1Store]: treesize reduction 296, result has 43.4 percent of original size
[2022-02-19 00:40:48,023 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 173 treesize of output 331
[2022-02-19 00:41:06,747 INFO L353 Elim1Store]: treesize reduction 480, result has 27.9 percent of original size
[2022-02-19 00:41:06,748 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 28 case distinctions, treesize of input 174 treesize of output 243
[2022-02-19 00:41:42,531 INFO L353 Elim1Store]: treesize reduction 360, result has 45.9 percent of original size
[2022-02-19 00:41:42,532 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 28 case distinctions, treesize of input 327 treesize of output 484
[2022-02-19 00:42:59,262 INFO L353 Elim1Store]: treesize reduction 608, result has 26.3 percent of original size
[2022-02-19 00:42:59,263 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 36 case distinctions, treesize of input 228 treesize of output 280
[2022-02-19 00:44:50,772 INFO L353 Elim1Store]: treesize reduction 428, result has 48.1 percent of original size
[2022-02-19 00:44:50,772 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 36 case distinctions, treesize of input 268 treesize of output 556
[2022-02-19 00:47:08,714 INFO L353 Elim1Store]: treesize reduction 752, result has 24.8 percent of original size
[2022-02-19 00:47:08,715 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 45 case distinctions, treesize of input 218 treesize of output 317
Received shutdown request...
[2022-02-19 00:49:11,841 WARN L244 SmtUtils]: Removed 2 from assertion stack
[2022-02-19 00:49:11,842 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2022-02-19 00:49:11,854 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end
[2022-02-19 00:49:11,854 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end
[2022-02-19 00:49:11,863 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (18)] Timeout while monitored process is still running, waiting 1000 ms for graceful end
[2022-02-19 00:49:11,863 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
[2022-02-19 00:49:11,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0
[2022-02-19 00:49:11,864 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Timeout while monitored process is still running, waiting 1000 ms for graceful end
[2022-02-19 00:49:12,046 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35
[2022-02-19 00:49:12,046 WARN L594 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 287 with TraceHistMax 10,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 4ms..
[2022-02-19 00:49:12,048 INFO L732 BasicCegarLoop]: Path program histogram: [6, 4, 1, 1, 1, 1]
[2022-02-19 00:49:12,048 INFO L309 ceAbstractionStarter]: Result for error location thrThread1of2ForFork0 was TIMEOUT (2/3)
[2022-02-19 00:49:12,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000
[2022-02-19 00:49:12,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-19 00:49:12,051 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null)
[2022-02-19 00:49:12,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (29)] Waiting until timeout for monitored process
[2022-02-19 00:49:12,052 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (29)] Timeout while monitored process is still running, waiting 1000 ms for graceful end
[2022-02-19 00:49:12,056 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ========
[2022-02-19 00:49:12,057 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, mLazyFiniteAutomaton=true, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true
[2022-02-19 00:49:12,057 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2022-02-19 00:49:12,057 WARN L594 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was constructing initial abstraction,while executing PartialOrderCegarLoop.
[2022-02-19 00:49:12,057 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (0 of 1 remaining)
[2022-02-19 00:49:12,058 INFO L732 BasicCegarLoop]: Path program histogram: []
[2022-02-19 00:49:12,058 INFO L309 ceAbstractionStarter]: Result for error location ULTIMATE.start was TIMEOUT (3/3)
[2022-02-19 00:49:12,058 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances
[2022-02-19 00:49:12,058 INFO L180 ceAbstractionStarter]: Computing trace abstraction results
[2022-02-19 00:49:12,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.02 12:49:12 BasicIcfg
[2022-02-19 00:49:12,061 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2022-02-19 00:49:12,062 INFO L158 Benchmark]: Toolchain (without parser) took 814769.83ms. Allocated memory was 186.6MB in the beginning and 1.1GB in the end (delta: 918.6MB). Free memory was 126.7MB in the beginning and 479.9MB in the end (delta: -353.1MB). Peak memory consumption was 565.6MB. Max. memory is 8.0GB.
[2022-02-19 00:49:12,062 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 186.6MB. Free memory is still 145.4MB. There was no memory consumed. Max. memory is 8.0GB.
[2022-02-19 00:49:12,062 INFO L158 Benchmark]: CACSL2BoogieTranslator took 492.91ms. Allocated memory was 186.6MB in the beginning and 284.2MB in the end (delta: 97.5MB). Free memory was 126.6MB in the beginning and 237.3MB in the end (delta: -110.7MB). Peak memory consumption was 11.8MB. Max. memory is 8.0GB.
[2022-02-19 00:49:12,062 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.09ms. Allocated memory is still 284.2MB. Free memory was 237.3MB in the beginning and 235.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
[2022-02-19 00:49:12,062 INFO L158 Benchmark]: Boogie Preprocessor took 22.45ms. Allocated memory is still 284.2MB. Free memory was 235.2MB in the beginning and 233.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
[2022-02-19 00:49:12,062 INFO L158 Benchmark]: RCFGBuilder took 365.48ms. Allocated memory is still 284.2MB. Free memory was 233.7MB in the beginning and 218.5MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB.
[2022-02-19 00:49:12,063 INFO L158 Benchmark]: TraceAbstraction took 813838.54ms. Allocated memory was 284.2MB in the beginning and 1.1GB in the end (delta: 821.0MB). Free memory was 217.9MB in the beginning and 479.9MB in the end (delta: -261.9MB). Peak memory consumption was 559.6MB. Max. memory is 8.0GB.
[2022-02-19 00:49:12,064 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 186.6MB. Free memory is still 145.4MB. There was no memory consumed. Max. memory is 8.0GB.
* CACSL2BoogieTranslator took 492.91ms. Allocated memory was 186.6MB in the beginning and 284.2MB in the end (delta: 97.5MB). Free memory was 126.6MB in the beginning and 237.3MB in the end (delta: -110.7MB). Peak memory consumption was 11.8MB. Max. memory is 8.0GB.
* Boogie Procedure Inliner took 41.09ms. Allocated memory is still 284.2MB. Free memory was 237.3MB in the beginning and 235.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
* Boogie Preprocessor took 22.45ms. Allocated memory is still 284.2MB. Free memory was 235.2MB in the beginning and 233.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
* RCFGBuilder took 365.48ms. Allocated memory is still 284.2MB. Free memory was 233.7MB in the beginning and 218.5MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB.
* TraceAbstraction took 813838.54ms. Allocated memory was 284.2MB in the beginning and 1.1GB in the end (delta: 821.0MB). Free memory was 217.9MB in the beginning and 479.9MB in the end (delta: -261.9MB). Peak memory consumption was 559.6MB. Max. memory is 8.0GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: Independence relation benchmarks
ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 317, positive: 313, positive conditional: 16, positive unconditional: 297, negative: 4, negative conditional: 2, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 315, positive: 313, positive conditional: 16, positive unconditional: 297, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 315, positive: 313, positive conditional: 16, positive unconditional: 297, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 315, positive: 313, positive conditional: 0, positive unconditional: 313, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 315, positive: 313, positive conditional: 0, positive unconditional: 313, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 315, positive: 313, positive conditional: 0, positive unconditional: 313, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 289, positive: 287, positive conditional: 0, positive unconditional: 287, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 289, positive: 286, positive conditional: 0, positive unconditional: 286, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 69, positive: 52, positive conditional: 0, positive unconditional: 52, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 315, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 289, unknown conditional: 0, unknown unconditional: 289] , Statistics on independence cache: Total cache size (in pairs): 289, Positive cache size: 287, Positive conditional cache size: 0, Positive unconditional cache size: 287, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 2
- StatisticsResult: Persistent set benchmarks
Persistent set computation time: 0.1s, Number of persistent set computation: 47, Number of trivial persistent sets: 42, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 299, positive: 297, positive conditional: 0, positive unconditional: 297, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 317, positive: 313, positive conditional: 16, positive unconditional: 297, negative: 4, negative conditional: 2, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 315, positive: 313, positive conditional: 16, positive unconditional: 297, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 315, positive: 313, positive conditional: 16, positive unconditional: 297, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 315, positive: 313, positive conditional: 0, positive unconditional: 313, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 315, positive: 313, positive conditional: 0, positive unconditional: 313, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 315, positive: 313, positive conditional: 0, positive unconditional: 313, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 289, positive: 287, positive conditional: 0, positive unconditional: 287, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 289, positive: 286, positive conditional: 0, positive unconditional: 286, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 69, positive: 52, positive conditional: 0, positive unconditional: 52, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 315, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 289, unknown conditional: 0, unknown unconditional: 289] , Statistics on independence cache: Total cache size (in pairs): 289, Positive cache size: 287, Positive conditional cache size: 0, Positive unconditional cache size: 287, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 2
- 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
- StatisticsResult: Independence relation benchmarks
ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 304727, positive: 276761, positive conditional: 270858, positive unconditional: 5903, negative: 27966, negative conditional: 27884, negative unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 277239, positive: 276761, positive conditional: 270858, positive unconditional: 5903, negative: 478, negative conditional: 396, negative unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 277239, positive: 276761, positive conditional: 270858, positive unconditional: 5903, negative: 478, negative conditional: 396, negative unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 284285, positive: 276761, positive conditional: 270689, positive unconditional: 6072, negative: 7524, negative conditional: 7046, negative unconditional: 478, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 284285, positive: 276761, positive conditional: 152045, positive unconditional: 124716, negative: 7524, negative conditional: 4128, negative unconditional: 3396, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 284285, positive: 276761, positive conditional: 152045, positive unconditional: 124716, negative: 7524, negative conditional: 4128, negative unconditional: 3396, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5725, positive: 5184, positive conditional: 834, positive unconditional: 4350, negative: 541, negative conditional: 458, negative unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5725, positive: 4407, positive conditional: 0, positive unconditional: 4407, negative: 1318, negative conditional: 0, negative unconditional: 1318, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1318, positive: 777, positive conditional: 729, positive unconditional: 48, negative: 512, negative conditional: 429, negative unconditional: 83, unknown: 29, unknown conditional: 29, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1964, positive: 1153, positive conditional: 1052, positive unconditional: 101, negative: 737, negative conditional: 627, negative unconditional: 109, unknown: 74, unknown conditional: 74, unknown unconditional: 0] ], Cache Queries: [ total: 284285, positive: 271577, positive conditional: 151211, positive unconditional: 120366, negative: 6983, negative conditional: 3670, negative unconditional: 3313, unknown: 5725, unknown conditional: 1292, unknown unconditional: 4433] , Statistics on independence cache: Total cache size (in pairs): 5725, Positive cache size: 5184, Positive conditional cache size: 834, Positive unconditional cache size: 4350, Negative cache size: 541, Negative conditional cache size: 458, Negative unconditional cache size: 83, Eliminated conditions: 121562, Maximal queried relation: 15, Independence queries for same thread: 27488
- StatisticsResult: Persistent set benchmarks
Persistent set computation time: 0.4s, Number of persistent set computation: 3261, Number of trivial persistent sets: 1606, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5985, positive: 5903, positive conditional: 0, positive unconditional: 5903, negative: 82, negative conditional: 0, negative unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 304727, positive: 276761, positive conditional: 270858, positive unconditional: 5903, negative: 27966, negative conditional: 27884, negative unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 277239, positive: 276761, positive conditional: 270858, positive unconditional: 5903, negative: 478, negative conditional: 396, negative unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 277239, positive: 276761, positive conditional: 270858, positive unconditional: 5903, negative: 478, negative conditional: 396, negative unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 284285, positive: 276761, positive conditional: 270689, positive unconditional: 6072, negative: 7524, negative conditional: 7046, negative unconditional: 478, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 284285, positive: 276761, positive conditional: 152045, positive unconditional: 124716, negative: 7524, negative conditional: 4128, negative unconditional: 3396, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 284285, positive: 276761, positive conditional: 152045, positive unconditional: 124716, negative: 7524, negative conditional: 4128, negative unconditional: 3396, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5725, positive: 5184, positive conditional: 834, positive unconditional: 4350, negative: 541, negative conditional: 458, negative unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5725, positive: 4407, positive conditional: 0, positive unconditional: 4407, negative: 1318, negative conditional: 0, negative unconditional: 1318, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1318, positive: 777, positive conditional: 729, positive unconditional: 48, negative: 512, negative conditional: 429, negative unconditional: 83, unknown: 29, unknown conditional: 29, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1964, positive: 1153, positive conditional: 1052, positive unconditional: 101, negative: 737, negative conditional: 627, negative unconditional: 109, unknown: 74, unknown conditional: 74, unknown unconditional: 0] ], Cache Queries: [ total: 284285, positive: 271577, positive conditional: 151211, positive unconditional: 120366, negative: 6983, negative conditional: 3670, negative unconditional: 3313, unknown: 5725, unknown conditional: 1292, unknown unconditional: 4433] , Statistics on independence cache: Total cache size (in pairs): 5725, Positive cache size: 5184, Positive conditional cache size: 834, Positive unconditional cache size: 4350, Negative cache size: 541, Negative conditional cache size: 458, Negative unconditional cache size: 83, Eliminated conditions: 121562, Maximal queried relation: 15, Independence queries for same thread: 27488
- 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
- StatisticsResult: Independence relation benchmarks
ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 84279, positive: 77199, positive conditional: 72012, positive unconditional: 5187, negative: 7080, negative conditional: 7003, negative unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 77321, positive: 77199, positive conditional: 72012, positive unconditional: 5187, negative: 122, negative conditional: 45, negative unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 77321, positive: 77199, positive conditional: 72012, positive unconditional: 5187, negative: 122, negative conditional: 45, negative unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 78714, positive: 77199, positive conditional: 71885, positive unconditional: 5314, negative: 1515, negative conditional: 1393, negative unconditional: 122, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 78714, positive: 77199, positive conditional: 43236, positive unconditional: 33963, negative: 1515, negative conditional: 1018, negative unconditional: 497, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 78714, positive: 77199, positive conditional: 43236, positive unconditional: 33963, negative: 1515, negative conditional: 1018, negative unconditional: 497, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4583, positive: 4190, positive conditional: 246, positive unconditional: 3944, negative: 393, negative conditional: 316, negative unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4583, positive: 3900, positive conditional: 0, positive unconditional: 3900, negative: 683, negative conditional: 0, negative unconditional: 683, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 683, positive: 290, positive conditional: 243, positive unconditional: 47, negative: 392, negative conditional: 315, negative unconditional: 77, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 715, positive: 288, positive conditional: 248, positive unconditional: 40, negative: 424, negative conditional: 358, negative unconditional: 66, unknown: 2, unknown conditional: 2, unknown unconditional: 0] ], Cache Queries: [ total: 78714, positive: 73009, positive conditional: 42990, positive unconditional: 30019, negative: 1122, negative conditional: 702, negative unconditional: 420, unknown: 4583, unknown conditional: 562, unknown unconditional: 4021] , Statistics on independence cache: Total cache size (in pairs): 4583, Positive cache size: 4190, Positive conditional cache size: 246, Positive unconditional cache size: 3944, Negative cache size: 393, Negative conditional cache size: 316, Negative unconditional cache size: 77, Eliminated conditions: 29024, Maximal queried relation: 10, Independence queries for same thread: 6958
- StatisticsResult: Persistent set benchmarks
Persistent set computation time: 0.2s, Number of persistent set computation: 1609, Number of trivial persistent sets: 1301, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5264, positive: 5187, positive conditional: 0, positive unconditional: 5187, negative: 77, negative conditional: 0, negative unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 84279, positive: 77199, positive conditional: 72012, positive unconditional: 5187, negative: 7080, negative conditional: 7003, negative unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 77321, positive: 77199, positive conditional: 72012, positive unconditional: 5187, negative: 122, negative conditional: 45, negative unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 77321, positive: 77199, positive conditional: 72012, positive unconditional: 5187, negative: 122, negative conditional: 45, negative unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 78714, positive: 77199, positive conditional: 71885, positive unconditional: 5314, negative: 1515, negative conditional: 1393, negative unconditional: 122, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 78714, positive: 77199, positive conditional: 43236, positive unconditional: 33963, negative: 1515, negative conditional: 1018, negative unconditional: 497, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 78714, positive: 77199, positive conditional: 43236, positive unconditional: 33963, negative: 1515, negative conditional: 1018, negative unconditional: 497, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4583, positive: 4190, positive conditional: 246, positive unconditional: 3944, negative: 393, negative conditional: 316, negative unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4583, positive: 3900, positive conditional: 0, positive unconditional: 3900, negative: 683, negative conditional: 0, negative unconditional: 683, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 683, positive: 290, positive conditional: 243, positive unconditional: 47, negative: 392, negative conditional: 315, negative unconditional: 77, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 715, positive: 288, positive conditional: 248, positive unconditional: 40, negative: 424, negative conditional: 358, negative unconditional: 66, unknown: 2, unknown conditional: 2, unknown unconditional: 0] ], Cache Queries: [ total: 78714, positive: 73009, positive conditional: 42990, positive unconditional: 30019, negative: 1122, negative conditional: 702, negative unconditional: 420, unknown: 4583, unknown conditional: 562, unknown unconditional: 4021] , Statistics on independence cache: Total cache size (in pairs): 4583, Positive cache size: 4190, Positive conditional cache size: 246, Positive unconditional cache size: 3944, Negative cache size: 393, Negative conditional cache size: 316, Negative unconditional cache size: 77, Eliminated conditions: 29024, Maximal queried relation: 10, Independence queries for same thread: 6958
- 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
- StatisticsResult: Independence relation benchmarks
ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0
- StatisticsResult: Persistent set benchmarks
Persistent set computation time: 0.0s, Number of persistent set computation: 0, Number of trivial persistent sets: 0, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0
- 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: 998]: Timeout (TraceAbstraction)
Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 287 with TraceHistMax 10,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 4ms..
- TimeoutResultAtElement [Line: 1047]: Timeout (TraceAbstraction)
Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PartialOrderCegarLoop was constructing initial abstraction,while executing PartialOrderCegarLoop.
- StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances
CFG has 3 procedures, 116 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.2s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 93 NumberOfCodeBlocks, 93 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 46 ConstructedInterpolants, 0 QuantifiedInterpolants, 46 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 5/5 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
- StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 2 thread instances
CFG has 4 procedures, 149 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, 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: No data available, ReuseStatistics: No data available
- StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: thrThread2of2ForFork0 with 1 thread instances
CFG has 4 procedures, 149 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 225.5s, OverallIterations: 20, TraceHistogramMax: 0, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 173.7s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 1245, 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.4s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 45.3s InterpolantComputationTime, 6662 NumberOfCodeBlocks, 6241 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 9030 ConstructedInterpolants, 97 QuantifiedInterpolants, 53801 SizeOfPredicates, 138 NumberOfNonLiveVariables, 5394 ConjunctsInSsa, 344 ConjunctsInUnsatCore, 46 InterpolantComputations, 8 PerfectInterpolantSequences, 7630/19044 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
- StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: thrThread1of2ForFork0 with 1 thread instances
CFG has 4 procedures, 149 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 587.5s, OverallIterations: 14, TraceHistogramMax: 0, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 33.9s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 695, 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.3s SsaConstructionTime, 5.8s SatisfiabilityAnalysisTime, 14.4s InterpolantComputationTime, 4202 NumberOfCodeBlocks, 4080 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 5455 ConstructedInterpolants, 64 QuantifiedInterpolants, 29916 SizeOfPredicates, 90 NumberOfNonLiveVariables, 3667 ConjunctsInSsa, 195 ConjunctsInUnsatCore, 29 InterpolantComputations, 6 PerfectInterpolantSequences, 8507/14285 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