/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf -i ../../../trunk/examples/svcomp/heap-manipulation/dll_of_dll-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 23:30:37,715 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 23:30:37,716 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 23:30:37,742 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 23:30:37,742 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 23:30:37,746 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 23:30:37,761 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 23:30:37,767 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 23:30:37,768 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 23:30:37,784 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 23:30:37,785 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 23:30:37,786 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 23:30:37,786 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 23:30:37,787 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 23:30:37,787 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 23:30:37,788 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 23:30:37,789 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 23:30:37,789 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 23:30:37,791 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 23:30:37,792 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 23:30:37,793 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 23:30:37,800 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 23:30:37,802 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 23:30:37,803 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 23:30:37,808 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 23:30:37,808 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 23:30:37,809 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 23:30:37,810 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 23:30:37,811 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 23:30:37,811 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 23:30:37,812 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 23:30:37,812 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 23:30:37,814 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 23:30:37,814 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 23:30:37,815 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 23:30:37,816 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 23:30:37,816 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 23:30:37,816 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 23:30:37,816 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 23:30:37,817 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 23:30:37,818 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 23:30:37,818 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf [2022-01-10 23:30:37,852 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 23:30:37,853 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 23:30:37,853 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 23:30:37,853 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 23:30:37,854 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 23:30:37,854 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 23:30:37,855 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 23:30:37,855 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 23:30:37,855 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 23:30:37,855 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 23:30:37,856 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 23:30:37,856 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 23:30:37,856 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 23:30:37,856 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 23:30:37,856 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 23:30:37,856 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 23:30:37,856 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 23:30:37,857 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 23:30:37,857 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 23:30:37,857 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 23:30:37,857 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 23:30:37,858 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 23:30:37,858 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 23:30:37,859 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 23:30:37,859 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 23:30:37,859 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 23:30:37,859 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 23:30:37,859 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 23:30:37,859 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 23:30:37,859 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 23:30:37,859 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 23:30:37,860 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 23:30:37,861 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 23:30:37,861 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_NONE 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 23:30:38,077 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 23:30:38,094 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 23:30:38,096 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 23:30:38,097 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 23:30:38,098 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 23:30:38,099 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/dll_of_dll-2.i [2022-01-10 23:30:38,157 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f4842a2f/de4ed8b9b75440a88249e1a953b6562c/FLAG6391bd768 [2022-01-10 23:30:38,597 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 23:30:38,598 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/dll_of_dll-2.i [2022-01-10 23:30:38,607 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f4842a2f/de4ed8b9b75440a88249e1a953b6562c/FLAG6391bd768 [2022-01-10 23:30:38,622 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f4842a2f/de4ed8b9b75440a88249e1a953b6562c [2022-01-10 23:30:38,624 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 23:30:38,625 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 23:30:38,627 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 23:30:38,627 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 23:30:38,629 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 23:30:38,630 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 11:30:38" (1/1) ... [2022-01-10 23:30:38,630 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b021791 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:30:38, skipping insertion in model container [2022-01-10 23:30:38,631 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 11:30:38" (1/1) ... [2022-01-10 23:30:38,636 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 23:30:38,669 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 23:30:38,916 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/dll_of_dll-2.i[22634,22647] [2022-01-10 23:30:38,954 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 23:30:38,962 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 23:30:39,017 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/dll_of_dll-2.i[22634,22647] [2022-01-10 23:30:39,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 23:30:39,073 INFO L208 MainTranslator]: Completed translation [2022-01-10 23:30:39,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:30:39 WrapperNode [2022-01-10 23:30:39,074 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 23:30:39,075 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 23:30:39,075 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 23:30:39,075 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 23:30:39,081 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:30:39" (1/1) ... [2022-01-10 23:30:39,097 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:30:39" (1/1) ... [2022-01-10 23:30:39,132 INFO L137 Inliner]: procedures = 141, calls = 94, calls flagged for inlining = 30, calls inlined = 42, statements flattened = 511 [2022-01-10 23:30:39,132 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 23:30:39,133 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 23:30:39,133 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 23:30:39,133 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 23:30:39,140 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:30:39" (1/1) ... [2022-01-10 23:30:39,140 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:30:39" (1/1) ... [2022-01-10 23:30:39,161 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:30:39" (1/1) ... [2022-01-10 23:30:39,162 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:30:39" (1/1) ... [2022-01-10 23:30:39,178 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:30:39" (1/1) ... [2022-01-10 23:30:39,201 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:30:39" (1/1) ... [2022-01-10 23:30:39,205 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:30:39" (1/1) ... [2022-01-10 23:30:39,211 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 23:30:39,212 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 23:30:39,212 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 23:30:39,212 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 23:30:39,213 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:30:39" (1/1) ... [2022-01-10 23:30:39,227 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 23:30:39,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:30:39,246 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 23:30:39,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 23:30:39,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 23:30:39,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 23:30:39,282 INFO L130 BoogieDeclarations]: Found specification of procedure dll_insert_master [2022-01-10 23:30:39,282 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_insert_master [2022-01-10 23:30:39,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-10 23:30:39,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 23:30:39,282 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-01-10 23:30:39,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-01-10 23:30:39,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 23:30:39,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 23:30:39,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-01-10 23:30:39,283 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_generic [2022-01-10 23:30:39,283 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_generic [2022-01-10 23:30:39,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 23:30:39,283 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_slave [2022-01-10 23:30:39,283 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_slave [2022-01-10 23:30:39,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 23:30:39,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 23:30:39,464 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 23:30:39,466 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 23:30:40,154 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 23:30:40,166 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 23:30:40,166 INFO L299 CfgBuilder]: Removed 64 assume(true) statements. [2022-01-10 23:30:40,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:30:40 BoogieIcfgContainer [2022-01-10 23:30:40,168 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 23:30:40,169 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 23:30:40,169 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 23:30:40,170 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 23:30:40,173 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:30:40" (1/1) ... [2022-01-10 23:30:40,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 11:30:40 BasicIcfg [2022-01-10 23:30:40,344 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 23:30:40,346 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 23:30:40,346 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 23:30:40,352 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 23:30:40,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 11:30:38" (1/4) ... [2022-01-10 23:30:40,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ee946a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 11:30:40, skipping insertion in model container [2022-01-10 23:30:40,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:30:39" (2/4) ... [2022-01-10 23:30:40,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ee946a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 11:30:40, skipping insertion in model container [2022-01-10 23:30:40,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:30:40" (3/4) ... [2022-01-10 23:30:40,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ee946a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 11:30:40, skipping insertion in model container [2022-01-10 23:30:40,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 11:30:40" (4/4) ... [2022-01-10 23:30:40,355 INFO L111 eAbstractionObserver]: Analyzing ICFG dll_of_dll-2.iTransformedIcfg [2022-01-10 23:30:40,359 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 23:30:40,359 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2022-01-10 23:30:40,395 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 23:30:40,408 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=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 23:30:40,408 INFO L340 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2022-01-10 23:30:40,431 INFO L276 IsEmpty]: Start isEmpty. Operand has 224 states, 186 states have (on average 1.7150537634408602) internal successors, (319), 214 states have internal predecessors, (319), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-01-10 23:30:40,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-10 23:30:40,438 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:30:40,439 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:30:40,439 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2022-01-10 23:30:40,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:30:40,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1039200710, now seen corresponding path program 1 times [2022-01-10 23:30:40,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:30:40,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238058539] [2022-01-10 23:30:40,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:30:40,458 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:30:40,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:40,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 23:30:40,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:40,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 23:30:40,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:40,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 23:30:40,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:40,936 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-10 23:30:40,937 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:30:40,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238058539] [2022-01-10 23:30:40,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238058539] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:30:40,938 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:30:40,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 23:30:40,940 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036094958] [2022-01-10 23:30:40,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:30:40,946 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 23:30:40,947 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:30:40,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 23:30:40,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 23:30:40,974 INFO L87 Difference]: Start difference. First operand has 224 states, 186 states have (on average 1.7150537634408602) internal successors, (319), 214 states have internal predecessors, (319), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 23:30:41,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:30:41,188 INFO L93 Difference]: Finished difference Result 419 states and 643 transitions. [2022-01-10 23:30:41,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 23:30:41,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2022-01-10 23:30:41,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:30:41,198 INFO L225 Difference]: With dead ends: 419 [2022-01-10 23:30:41,198 INFO L226 Difference]: Without dead ends: 192 [2022-01-10 23:30:41,201 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 23:30:41,204 INFO L933 BasicCegarLoop]: 212 mSDtfsCounter, 2 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 23:30:41,205 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 364 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 23:30:41,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-01-10 23:30:41,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2022-01-10 23:30:41,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 155 states have (on average 1.2516129032258065) internal successors, (194), 182 states have internal predecessors, (194), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-01-10 23:30:41,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 208 transitions. [2022-01-10 23:30:41,244 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 208 transitions. Word has length 34 [2022-01-10 23:30:41,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:30:41,245 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 208 transitions. [2022-01-10 23:30:41,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 23:30:41,245 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 208 transitions. [2022-01-10 23:30:41,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-10 23:30:41,247 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:30:41,247 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:30:41,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 23:30:41,247 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2022-01-10 23:30:41,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:30:41,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1154689465, now seen corresponding path program 1 times [2022-01-10 23:30:41,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:30:41,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579263582] [2022-01-10 23:30:41,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:30:41,249 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:30:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:41,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 23:30:41,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:41,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 23:30:41,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:41,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 23:30:41,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:41,695 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 23:30:41,695 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:30:41,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579263582] [2022-01-10 23:30:41,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579263582] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:30:41,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225243890] [2022-01-10 23:30:41,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:30:41,696 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:30:41,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:30:41,697 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 23:30:41,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 23:30:41,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:41,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-10 23:30:41,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:30:42,151 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 23:30:42,151 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 23:30:42,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225243890] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:30:42,152 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 23:30:42,152 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-01-10 23:30:42,153 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642532555] [2022-01-10 23:30:42,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:30:42,154 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 23:30:42,154 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:30:42,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 23:30:42,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 23:30:42,155 INFO L87 Difference]: Start difference. First operand 192 states and 208 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 23:30:42,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:30:42,244 INFO L93 Difference]: Finished difference Result 391 states and 438 transitions. [2022-01-10 23:30:42,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 23:30:42,245 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2022-01-10 23:30:42,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:30:42,247 INFO L225 Difference]: With dead ends: 391 [2022-01-10 23:30:42,247 INFO L226 Difference]: Without dead ends: 202 [2022-01-10 23:30:42,248 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-10 23:30:42,250 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 11 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 23:30:42,250 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 797 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 23:30:42,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-01-10 23:30:42,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2022-01-10 23:30:42,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 161 states have (on average 1.2484472049689441) internal successors, (201), 188 states have internal predecessors, (201), 9 states have call successors, (9), 5 states have call predecessors, (9), 6 states have return successors, (13), 8 states have call predecessors, (13), 9 states have call successors, (13) [2022-01-10 23:30:42,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 223 transitions. [2022-01-10 23:30:42,266 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 223 transitions. Word has length 34 [2022-01-10 23:30:42,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:30:42,266 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 223 transitions. [2022-01-10 23:30:42,266 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 23:30:42,266 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 223 transitions. [2022-01-10 23:30:42,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-01-10 23:30:42,269 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:30:42,269 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:30:42,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-10 23:30:42,493 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:30:42,494 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2022-01-10 23:30:42,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:30:42,494 INFO L85 PathProgramCache]: Analyzing trace with hash 191099717, now seen corresponding path program 1 times [2022-01-10 23:30:42,494 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:30:42,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441776239] [2022-01-10 23:30:42,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:30:42,495 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:30:42,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:43,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 23:30:43,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:43,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 23:30:43,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:43,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 23:30:43,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:43,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-10 23:30:43,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:43,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 23:30:43,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:43,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 23:30:43,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:43,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 23:30:43,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:43,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 23:30:43,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:43,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 23:30:43,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:43,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-10 23:30:43,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:44,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 23:30:44,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:44,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 23:30:44,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:44,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 23:30:44,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:44,687 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 52 proven. 9 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-01-10 23:30:44,687 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:30:44,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441776239] [2022-01-10 23:30:44,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441776239] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:30:44,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266563003] [2022-01-10 23:30:44,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:30:44,691 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:30:44,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:30:44,692 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 23:30:44,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-10 23:30:45,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:45,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 1906 conjuncts, 45 conjunts are in the unsatisfiable core [2022-01-10 23:30:45,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:30:45,534 INFO L353 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-01-10 23:30:45,535 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 51 [2022-01-10 23:30:45,541 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-01-10 23:30:45,548 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 11 [2022-01-10 23:30:45,570 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-01-10 23:30:45,572 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 7 [2022-01-10 23:30:45,587 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 27 treesize of output 15 [2022-01-10 23:30:45,686 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 16 treesize of output 8 [2022-01-10 23:30:45,769 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 31 proven. 5 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-01-10 23:30:45,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:30:46,212 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:30:46,213 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 218 treesize of output 215 [2022-01-10 23:30:46,220 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 250 treesize of output 242 [2022-01-10 23:30:46,228 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 242 treesize of output 238 [2022-01-10 23:30:46,312 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 6 treesize of output 4 [2022-01-10 23:30:46,320 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 20 treesize of output 18 [2022-01-10 23:30:46,347 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:30:46,348 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 104 treesize of output 107 [2022-01-10 23:30:46,353 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 120 treesize of output 116 [2022-01-10 23:30:46,358 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 116 treesize of output 114 [2022-01-10 23:30:46,403 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 6 treesize of output 4 [2022-01-10 23:30:46,408 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 20 treesize of output 18 [2022-01-10 23:30:46,621 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-01-10 23:30:46,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266563003] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 23:30:46,624 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 23:30:46,624 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 13] total 26 [2022-01-10 23:30:46,625 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971913946] [2022-01-10 23:30:46,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 23:30:46,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-10 23:30:46,626 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:30:46,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-10 23:30:46,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=596, Unknown=0, NotChecked=0, Total=650 [2022-01-10 23:30:46,628 INFO L87 Difference]: Start difference. First operand 202 states and 223 transitions. Second operand has 26 states, 24 states have (on average 2.9166666666666665) internal successors, (70), 23 states have internal predecessors, (70), 7 states have call successors, (18), 2 states have call predecessors, (18), 6 states have return successors, (19), 10 states have call predecessors, (19), 7 states have call successors, (19) [2022-01-10 23:30:48,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:30:48,738 INFO L93 Difference]: Finished difference Result 416 states and 471 transitions. [2022-01-10 23:30:48,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-10 23:30:48,739 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.9166666666666665) internal successors, (70), 23 states have internal predecessors, (70), 7 states have call successors, (18), 2 states have call predecessors, (18), 6 states have return successors, (19), 10 states have call predecessors, (19), 7 states have call successors, (19) Word has length 104 [2022-01-10 23:30:48,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:30:48,741 INFO L225 Difference]: With dead ends: 416 [2022-01-10 23:30:48,741 INFO L226 Difference]: Without dead ends: 217 [2022-01-10 23:30:48,743 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 225 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=176, Invalid=1894, Unknown=0, NotChecked=0, Total=2070 [2022-01-10 23:30:48,743 INFO L933 BasicCegarLoop]: 191 mSDtfsCounter, 383 mSDsluCounter, 3462 mSDsCounter, 0 mSdLazyCounter, 1418 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 3653 SdHoareTripleChecker+Invalid, 1452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-10 23:30:48,744 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [387 Valid, 3653 Invalid, 1452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1418 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-10 23:30:48,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-01-10 23:30:48,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 213. [2022-01-10 23:30:48,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 170 states have (on average 1.2411764705882353) internal successors, (211), 197 states have internal predecessors, (211), 10 states have call successors, (10), 6 states have call predecessors, (10), 8 states have return successors, (16), 9 states have call predecessors, (16), 10 states have call successors, (16) [2022-01-10 23:30:48,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 237 transitions. [2022-01-10 23:30:48,759 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 237 transitions. Word has length 104 [2022-01-10 23:30:48,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:30:48,759 INFO L470 AbstractCegarLoop]: Abstraction has 213 states and 237 transitions. [2022-01-10 23:30:48,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.9166666666666665) internal successors, (70), 23 states have internal predecessors, (70), 7 states have call successors, (18), 2 states have call predecessors, (18), 6 states have return successors, (19), 10 states have call predecessors, (19), 7 states have call successors, (19) [2022-01-10 23:30:48,759 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 237 transitions. [2022-01-10 23:30:48,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-01-10 23:30:48,762 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:30:48,762 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:30:48,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-10 23:30:48,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-01-10 23:30:48,984 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2022-01-10 23:30:48,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:30:48,984 INFO L85 PathProgramCache]: Analyzing trace with hash 89854983, now seen corresponding path program 1 times [2022-01-10 23:30:48,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:30:48,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278467119] [2022-01-10 23:30:48,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:30:48,985 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:30:49,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:49,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 23:30:49,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:49,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 23:30:49,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:50,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 23:30:50,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:50,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-10 23:30:50,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:50,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 23:30:50,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:50,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 23:30:50,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:50,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 23:30:50,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:50,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 23:30:50,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:50,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 23:30:50,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:50,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-10 23:30:50,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:50,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 23:30:50,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:50,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 23:30:50,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:50,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 23:30:50,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:50,729 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 13 proven. 23 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-01-10 23:30:50,730 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:30:50,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278467119] [2022-01-10 23:30:50,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278467119] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:30:50,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936823585] [2022-01-10 23:30:50,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:30:50,730 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:30:50,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:30:50,731 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 23:30:50,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-10 23:30:51,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:51,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 1898 conjuncts, 234 conjunts are in the unsatisfiable core [2022-01-10 23:30:51,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:30:51,436 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 23:30:51,531 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 11 treesize of output 7 [2022-01-10 23:30:51,539 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 11 treesize of output 7 [2022-01-10 23:30:51,618 INFO L353 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-01-10 23:30:51,619 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 45 [2022-01-10 23:30:51,632 INFO L353 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-01-10 23:30:51,632 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 1 case distinctions, treesize of input 47 treesize of output 55 [2022-01-10 23:30:51,647 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 17 treesize of output 15 [2022-01-10 23:30:51,664 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 24 treesize of output 20 [2022-01-10 23:30:55,909 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:30:55,910 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 92 [2022-01-10 23:30:55,916 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 92 treesize of output 80 [2022-01-10 23:30:55,920 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-01-10 23:30:56,150 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 23:30:56,154 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 7 treesize of output 3 [2022-01-10 23:30:56,522 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3144 (Array Int Int)) (|##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.baseInt| Int) (v_ArrVal_3145 (Array Int Int)) (|##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.offsetInt| Int) (|##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.offsetInt| Int)) (let ((.cse0 (select |c_old(#validInt)| |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.baseInt|))) (and (= |c_#validInt| (store |c_old(#validInt)| |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.baseInt| 1)) (<= 0 .cse0) (<= .cse0 0) (<= 0 |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.offsetInt|) (= |c_#memory_$Pointer$.baseInt| (let ((.cse1 (store |c_old(#memory_$Pointer$.baseInt)| |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.baseInt| v_ArrVal_3145))) (store .cse1 |c_##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_#in~10#1.baseInt| (store (select .cse1 |c_##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_#in~10#1.baseInt|) |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.offsetInt| |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.baseInt|)))) (<= |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.offsetInt| 0) (= (let ((.cse2 (store |c_old(#memory_$Pointer$.offsetInt)| |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.baseInt| v_ArrVal_3144))) (store .cse2 |c_##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_#in~10#1.baseInt| (store (select .cse2 |c_##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_#in~10#1.baseInt|) |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.offsetInt| |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.offsetInt|))) |c_#memory_$Pointer$.offsetInt|)))) is different from true [2022-01-10 23:30:56,886 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 24 treesize of output 20 [2022-01-10 23:30:56,891 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 23:30:56,895 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 7 treesize of output 3 [2022-01-10 23:30:58,504 WARN L860 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.offsetInt| Int) (v_ArrVal_3154 (Array Int Int)) (v_ArrVal_3155 (Array Int Int)) (|##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.baseInt| Int) (v_ArrVal_3156 (Array Int Int)) (v_ArrVal_3157 (Array Int Int)) (v_ArrVal_3159 (Array Int Int))) (let ((.cse0 (select (select (store |c_old(#memory_$Pointer$.baseInt)| |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.baseInt| (store (select |c_old(#memory_$Pointer$.baseInt)| |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.baseInt|) |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.offsetInt| 0)) |c_##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_#in~10#1.baseInt|) |c_##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_#in~10#1.offsetInt|)) (.cse1 (select |c_old(#validInt)| |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.baseInt|))) (and (or (not (= .cse0 0)) (not (= (select (select (store |c_old(#memory_$Pointer$.offsetInt)| |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.baseInt| (store (select |c_old(#memory_$Pointer$.offsetInt)| |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.baseInt|) |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.offsetInt| 0)) |c_##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_#in~10#1.baseInt|) |c_##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_#in~10#1.offsetInt|) 0))) (<= 0 |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.offsetInt|) (= (store (store (store |c_old(#memory_$Pointer$.offsetInt)| |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.baseInt| v_ArrVal_3154) .cse0 v_ArrVal_3156) |c_##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_#in~10#1.baseInt| v_ArrVal_3159) |c_#memory_$Pointer$.offsetInt|) (<= 0 .cse1) (= (let ((.cse2 (store (store |c_old(#memory_$Pointer$.baseInt)| |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.baseInt| v_ArrVal_3155) .cse0 v_ArrVal_3157))) (store .cse2 |c_##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_#in~10#1.baseInt| (store (select .cse2 |c_##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_#in~10#1.baseInt|) |c_##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_#in~10#1.offsetInt| |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.baseInt|))) |c_#memory_$Pointer$.baseInt|) (<= .cse1 0) (<= |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.offsetInt| 0) (not (= |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.baseInt| 0))))) is different from true [2022-01-10 23:31:00,699 WARN L860 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.offsetInt| Int) (|##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.baseInt| Int) (|##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.offsetInt| Int) (|v_dll_create_generic_dll_create_generic_~#dll~0.baseInt_49| Int) (|##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.offsetInt| Int) (|v_##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.baseInt_97| Int) (v_ArrVal_3154 (Array Int Int)) (v_ArrVal_3144 (Array Int Int)) (v_ArrVal_3155 (Array Int Int)) (v_ArrVal_3145 (Array Int Int)) (v_ArrVal_3156 (Array Int Int)) (v_ArrVal_3157 (Array Int Int)) (v_ArrVal_3159 (Array Int Int))) (let ((.cse4 (let ((.cse8 (store |c_old(#memory_$Pointer$.baseInt)| |v_##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.baseInt_97| v_ArrVal_3145))) (store .cse8 |v_dll_create_generic_dll_create_generic_~#dll~0.baseInt_49| (store (select .cse8 |v_dll_create_generic_dll_create_generic_~#dll~0.baseInt_49|) |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.offsetInt| |v_##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.baseInt_97|)))) (.cse7 (store |c_old(#validInt)| |v_dll_create_generic_dll_create_generic_~#dll~0.baseInt_49| 1))) (let ((.cse1 (select (store .cse7 |v_##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.baseInt_97| 1) |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.baseInt|)) (.cse0 (select (select |c_old(#memory_$Pointer$.baseInt)| |v_dll_create_generic_dll_create_generic_~#dll~0.baseInt_49|) 0)) (.cse2 (select .cse7 |v_##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.baseInt_97|)) (.cse5 (select (select (store .cse4 |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.baseInt| (store (select .cse4 |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.baseInt|) |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.offsetInt| 0)) |v_dll_create_generic_dll_create_generic_~#dll~0.baseInt_49|) 0))) (and (<= .cse0 0) (<= 0 .cse1) (= |c_dll_create_generic_dll_create_generic_#res.baseInt| (select (select |c_#memory_$Pointer$.baseInt| |v_dll_create_generic_dll_create_generic_~#dll~0.baseInt_49|) 0)) (= (select (select |c_old(#memory_$Pointer$.offsetInt)| |v_dll_create_generic_dll_create_generic_~#dll~0.baseInt_49|) 0) 0) (<= 0 .cse2) (<= .cse1 0) (<= 0 |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.offsetInt|) (<= 0 .cse0) (= |c_#memory_$Pointer$.baseInt| (let ((.cse3 (store (store .cse4 |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.baseInt| v_ArrVal_3155) .cse5 v_ArrVal_3157))) (store .cse3 |v_dll_create_generic_dll_create_generic_~#dll~0.baseInt_49| (store (select .cse3 |v_dll_create_generic_dll_create_generic_~#dll~0.baseInt_49|) 0 |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.baseInt|)))) (= (store (store (store (let ((.cse6 (store |c_old(#memory_$Pointer$.offsetInt)| |v_##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.baseInt_97| v_ArrVal_3144))) (store .cse6 |v_dll_create_generic_dll_create_generic_~#dll~0.baseInt_49| (store (select .cse6 |v_dll_create_generic_dll_create_generic_~#dll~0.baseInt_49|) |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.offsetInt| |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.offsetInt|))) |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.baseInt| v_ArrVal_3154) .cse5 v_ArrVal_3156) |v_dll_create_generic_dll_create_generic_~#dll~0.baseInt_49| v_ArrVal_3159) |c_#memory_$Pointer$.offsetInt|) (<= 0 |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.offsetInt|) (<= |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.offsetInt| 0) (<= |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.offsetInt| 0) (= |c_dll_create_generic_dll_create_generic_#res.offsetInt| (select (select |c_#memory_$Pointer$.offsetInt| |v_dll_create_generic_dll_create_generic_~#dll~0.baseInt_49|) 0)) (<= .cse2 0) (not (= .cse5 0)) (not (= |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.baseInt| 0)) (< |c_#StackHeapBarrierInt| |v_dll_create_generic_dll_create_generic_~#dll~0.baseInt_49|))))) is different from true [2022-01-10 23:31:01,863 WARN L860 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.offsetInt| Int) (|##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.baseInt| Int) (|##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.offsetInt| Int) (|v_dll_create_generic_dll_create_generic_~#dll~0.baseInt_49| Int) (|##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.offsetInt| Int) (|v_##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.baseInt_97| Int) (v_ArrVal_3154 (Array Int Int)) (v_ArrVal_3144 (Array Int Int)) (v_ArrVal_3155 (Array Int Int)) (v_ArrVal_3145 (Array Int Int)) (v_ArrVal_3156 (Array Int Int)) (v_ArrVal_3157 (Array Int Int)) (v_ArrVal_3159 (Array Int Int))) (let ((.cse4 (let ((.cse8 (store |c_old(#memory_$Pointer$.baseInt)| |v_##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.baseInt_97| v_ArrVal_3145))) (store .cse8 |v_dll_create_generic_dll_create_generic_~#dll~0.baseInt_49| (store (select .cse8 |v_dll_create_generic_dll_create_generic_~#dll~0.baseInt_49|) |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.offsetInt| |v_##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.baseInt_97|)))) (.cse7 (store |c_old(#validInt)| |v_dll_create_generic_dll_create_generic_~#dll~0.baseInt_49| 1))) (let ((.cse1 (select (store .cse7 |v_##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.baseInt_97| 1) |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.baseInt|)) (.cse0 (select (select |c_old(#memory_$Pointer$.baseInt)| |v_dll_create_generic_dll_create_generic_~#dll~0.baseInt_49|) 0)) (.cse2 (select .cse7 |v_##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.baseInt_97|)) (.cse5 (select (select (store .cse4 |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.baseInt| (store (select .cse4 |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.baseInt|) |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.offsetInt| 0)) |v_dll_create_generic_dll_create_generic_~#dll~0.baseInt_49|) 0))) (and (<= .cse0 0) (<= 0 .cse1) (= (select (select |c_old(#memory_$Pointer$.offsetInt)| |v_dll_create_generic_dll_create_generic_~#dll~0.baseInt_49|) 0) 0) (<= 0 .cse2) (<= .cse1 0) (<= 0 |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.offsetInt|) (<= 0 .cse0) (= |c_dll_create_slave_dll_create_slave_#t~ret12.offsetInt| (select (select |c_#memory_$Pointer$.offsetInt| |v_dll_create_generic_dll_create_generic_~#dll~0.baseInt_49|) 0)) (= |c_#memory_$Pointer$.baseInt| (let ((.cse3 (store (store .cse4 |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.baseInt| v_ArrVal_3155) .cse5 v_ArrVal_3157))) (store .cse3 |v_dll_create_generic_dll_create_generic_~#dll~0.baseInt_49| (store (select .cse3 |v_dll_create_generic_dll_create_generic_~#dll~0.baseInt_49|) 0 |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.baseInt|)))) (= (select (select |c_#memory_$Pointer$.baseInt| |v_dll_create_generic_dll_create_generic_~#dll~0.baseInt_49|) 0) |c_dll_create_slave_dll_create_slave_#t~ret12.baseInt|) (= (store (store (store (let ((.cse6 (store |c_old(#memory_$Pointer$.offsetInt)| |v_##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.baseInt_97| v_ArrVal_3144))) (store .cse6 |v_dll_create_generic_dll_create_generic_~#dll~0.baseInt_49| (store (select .cse6 |v_dll_create_generic_dll_create_generic_~#dll~0.baseInt_49|) |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.offsetInt| |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.offsetInt|))) |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.baseInt| v_ArrVal_3154) .cse5 v_ArrVal_3156) |v_dll_create_generic_dll_create_generic_~#dll~0.baseInt_49| v_ArrVal_3159) |c_#memory_$Pointer$.offsetInt|) (<= 0 |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.offsetInt|) (<= |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.offsetInt| 0) (<= |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.offsetInt| 0) (<= .cse2 0) (not (= .cse5 0)) (not (= |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.baseInt| 0)) (< |c_#StackHeapBarrierInt| |v_dll_create_generic_dll_create_generic_~#dll~0.baseInt_49|))))) is different from true [2022-01-10 23:31:02,306 WARN L860 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.offsetInt| Int) (|##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.baseInt| Int) (|##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.offsetInt| Int) (|v_dll_create_generic_dll_create_generic_~#dll~0.baseInt_49| Int) (|##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.offsetInt| Int) (|v_##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.baseInt_97| Int) (v_ArrVal_3154 (Array Int Int)) (v_ArrVal_3144 (Array Int Int)) (v_ArrVal_3155 (Array Int Int)) (v_ArrVal_3145 (Array Int Int)) (v_ArrVal_3156 (Array Int Int)) (v_ArrVal_3157 (Array Int Int)) (v_ArrVal_3159 (Array Int Int))) (let ((.cse4 (let ((.cse8 (store |c_old(#memory_$Pointer$.baseInt)| |v_##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.baseInt_97| v_ArrVal_3145))) (store .cse8 |v_dll_create_generic_dll_create_generic_~#dll~0.baseInt_49| (store (select .cse8 |v_dll_create_generic_dll_create_generic_~#dll~0.baseInt_49|) |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.offsetInt| |v_##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.baseInt_97|)))) (.cse7 (store |c_old(#validInt)| |v_dll_create_generic_dll_create_generic_~#dll~0.baseInt_49| 1))) (let ((.cse1 (select (store .cse7 |v_##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.baseInt_97| 1) |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.baseInt|)) (.cse0 (select (select |c_old(#memory_$Pointer$.baseInt)| |v_dll_create_generic_dll_create_generic_~#dll~0.baseInt_49|) 0)) (.cse2 (select .cse7 |v_##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.baseInt_97|)) (.cse5 (select (select (store .cse4 |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.baseInt| (store (select .cse4 |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.baseInt|) |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.offsetInt| 0)) |v_dll_create_generic_dll_create_generic_~#dll~0.baseInt_49|) 0))) (and (= |c_dll_create_slave_dll_create_slave_#res.offsetInt| (select (select |c_#memory_$Pointer$.offsetInt| |v_dll_create_generic_dll_create_generic_~#dll~0.baseInt_49|) 0)) (<= .cse0 0) (<= 0 .cse1) (= (select (select |c_old(#memory_$Pointer$.offsetInt)| |v_dll_create_generic_dll_create_generic_~#dll~0.baseInt_49|) 0) 0) (<= 0 .cse2) (<= .cse1 0) (<= 0 |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.offsetInt|) (<= 0 .cse0) (= |c_#memory_$Pointer$.baseInt| (let ((.cse3 (store (store .cse4 |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.baseInt| v_ArrVal_3155) .cse5 v_ArrVal_3157))) (store .cse3 |v_dll_create_generic_dll_create_generic_~#dll~0.baseInt_49| (store (select .cse3 |v_dll_create_generic_dll_create_generic_~#dll~0.baseInt_49|) 0 |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.baseInt|)))) (= (store (store (store (let ((.cse6 (store |c_old(#memory_$Pointer$.offsetInt)| |v_##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.baseInt_97| v_ArrVal_3144))) (store .cse6 |v_dll_create_generic_dll_create_generic_~#dll~0.baseInt_49| (store (select .cse6 |v_dll_create_generic_dll_create_generic_~#dll~0.baseInt_49|) |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.offsetInt| |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.offsetInt|))) |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.baseInt| v_ArrVal_3154) .cse5 v_ArrVal_3156) |v_dll_create_generic_dll_create_generic_~#dll~0.baseInt_49| v_ArrVal_3159) |c_#memory_$Pointer$.offsetInt|) (<= 0 |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.offsetInt|) (= (select (select |c_#memory_$Pointer$.baseInt| |v_dll_create_generic_dll_create_generic_~#dll~0.baseInt_49|) 0) |c_dll_create_slave_dll_create_slave_#res.baseInt|) (<= |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.offsetInt| 0) (<= |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.offsetInt| 0) (<= .cse2 0) (not (= .cse5 0)) (not (= |##fun~$Pointer$~TO~VOID_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.baseInt| 0)) (< |c_#StackHeapBarrierInt| |v_dll_create_generic_dll_create_generic_~#dll~0.baseInt_49|))))) is different from true [2022-01-10 23:31:02,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:31:02,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:31:02,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:31:02,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:31:02,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:31:02,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:31:02,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:31:02,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:31:02,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:31:02,831 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:31:02,833 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 144 [2022-01-10 23:31:02,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:31:02,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:31:02,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:31:02,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:31:02,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:31:02,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:31:02,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:31:02,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:31:02,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:31:02,966 INFO L353 Elim1Store]: treesize reduction 270, result has 20.4 percent of original size [2022-01-10 23:31:02,967 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 231 treesize of output 232 [2022-01-10 23:31:02,985 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Should have been eliminated by DER [2022-01-10 23:31:02,985 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-01-10 23:31:02,985 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-01-10 23:31:02,985 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208575196] [2022-01-10 23:31:02,985 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-01-10 23:31:02,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-10 23:31:02,986 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:31:02,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-10 23:31:02,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=804, Unknown=7, NotChecked=300, Total=1190 [2022-01-10 23:31:02,987 INFO L87 Difference]: Start difference. First operand 213 states and 237 transitions. Second operand has 11 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 6 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 6 states have call successors, (10) [2022-01-10 23:31:02,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 23:31:02,988 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=79, Invalid=804, Unknown=7, NotChecked=300, Total=1190 [2022-01-10 23:31:02,989 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:31:02,989 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:31:03,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-10 23:31:03,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:31:03,216 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@26538aed at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:206) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:455) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:103) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:868) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:784) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-01-10 23:31:03,219 INFO L158 Benchmark]: Toolchain (without parser) took 24593.93ms. Allocated memory was 199.2MB in the beginning and 419.4MB in the end (delta: 220.2MB). Free memory was 141.4MB in the beginning and 153.6MB in the end (delta: -12.3MB). Peak memory consumption was 208.4MB. Max. memory is 8.0GB. [2022-01-10 23:31:03,219 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 199.2MB. Free memory is still 159.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 23:31:03,219 INFO L158 Benchmark]: CACSL2BoogieTranslator took 447.46ms. Allocated memory was 199.2MB in the beginning and 251.7MB in the end (delta: 52.4MB). Free memory was 141.1MB in the beginning and 211.1MB in the end (delta: -70.0MB). Peak memory consumption was 9.2MB. Max. memory is 8.0GB. [2022-01-10 23:31:03,220 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.11ms. Allocated memory is still 251.7MB. Free memory was 211.1MB in the beginning and 208.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-10 23:31:03,220 INFO L158 Benchmark]: Boogie Preprocessor took 78.15ms. Allocated memory is still 251.7MB. Free memory was 208.0MB in the beginning and 203.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-01-10 23:31:03,220 INFO L158 Benchmark]: RCFGBuilder took 956.88ms. Allocated memory is still 251.7MB. Free memory was 203.8MB in the beginning and 171.3MB in the end (delta: 32.5MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2022-01-10 23:31:03,220 INFO L158 Benchmark]: IcfgTransformer took 175.38ms. Allocated memory is still 251.7MB. Free memory was 171.3MB in the beginning and 155.5MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-01-10 23:31:03,221 INFO L158 Benchmark]: TraceAbstraction took 22872.93ms. Allocated memory was 251.7MB in the beginning and 419.4MB in the end (delta: 167.8MB). Free memory was 155.0MB in the beginning and 153.6MB in the end (delta: 1.4MB). Peak memory consumption was 169.7MB. Max. memory is 8.0GB. [2022-01-10 23:31:03,222 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.12ms. Allocated memory is still 199.2MB. Free memory is still 159.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 447.46ms. Allocated memory was 199.2MB in the beginning and 251.7MB in the end (delta: 52.4MB). Free memory was 141.1MB in the beginning and 211.1MB in the end (delta: -70.0MB). Peak memory consumption was 9.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 57.11ms. Allocated memory is still 251.7MB. Free memory was 211.1MB in the beginning and 208.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 78.15ms. Allocated memory is still 251.7MB. Free memory was 208.0MB in the beginning and 203.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 956.88ms. Allocated memory is still 251.7MB. Free memory was 203.8MB in the beginning and 171.3MB in the end (delta: 32.5MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * IcfgTransformer took 175.38ms. Allocated memory is still 251.7MB. Free memory was 171.3MB in the beginning and 155.5MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 22872.93ms. Allocated memory was 251.7MB in the beginning and 419.4MB in the end (delta: 167.8MB). Free memory was 155.0MB in the beginning and 153.6MB in the end (delta: 1.4MB). Peak memory consumption was 169.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@26538aed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@26538aed: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-01-10 23:31:03,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...