/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/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/heap-manipulation/dll_of_dll-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 00:49:09,846 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 00:49:09,847 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 00:49:09,940 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 00:49:09,941 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 00:49:09,943 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 00:49:09,945 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 00:49:09,949 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 00:49:09,951 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 00:49:09,954 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 00:49:09,955 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 00:49:09,955 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 00:49:09,956 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 00:49:09,956 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 00:49:09,957 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 00:49:09,957 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 00:49:09,958 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 00:49:09,958 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 00:49:09,960 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 00:49:09,977 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 00:49:09,978 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 00:49:09,979 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 00:49:09,980 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 00:49:09,980 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 00:49:09,982 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 00:49:09,982 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 00:49:09,982 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 00:49:09,983 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 00:49:09,983 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 00:49:09,983 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 00:49:09,987 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 00:49:09,987 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 00:49:09,988 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 00:49:09,989 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 00:49:09,989 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 00:49:09,989 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 00:49:09,990 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 00:49:09,990 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 00:49:09,990 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 00:49:09,990 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 00:49:09,991 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 00:49:09,997 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf [2022-01-10 00:49:10,009 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 00:49:10,010 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 00:49:10,010 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 00:49:10,010 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 00:49:10,010 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 00:49:10,010 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 00:49:10,027 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 00:49:10,027 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 00:49:10,027 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 00:49:10,028 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 00:49:10,028 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 00:49:10,028 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 00:49:10,028 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 00:49:10,028 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 00:49:10,029 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 00:49:10,029 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 00:49:10,029 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 00:49:10,029 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 00:49:10,029 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 00:49:10,029 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 00:49:10,029 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 00:49:10,029 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 00:49:10,029 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 00:49:10,030 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 00:49:10,030 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 00:49:10,030 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 00:49:10,030 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 00:49:10,030 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 00:49:10,030 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 00:49:10,030 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 00:49:10,030 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 00:49:10,370 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 00:49:10,400 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 00:49:10,402 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 00:49:10,403 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 00:49:10,403 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 00:49:10,404 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 00:49:10,497 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5c511656/441ae998d1aa4c59a7dab2a708e6b98f/FLAG14a0583e4 [2022-01-10 00:49:11,034 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 00:49:11,034 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/dll_of_dll-2.i [2022-01-10 00:49:11,043 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5c511656/441ae998d1aa4c59a7dab2a708e6b98f/FLAG14a0583e4 [2022-01-10 00:49:11,362 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5c511656/441ae998d1aa4c59a7dab2a708e6b98f [2022-01-10 00:49:11,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 00:49:11,365 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 00:49:11,366 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 00:49:11,366 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 00:49:11,368 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 00:49:11,369 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:49:11" (1/1) ... [2022-01-10 00:49:11,369 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ba41f86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:11, skipping insertion in model container [2022-01-10 00:49:11,370 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:49:11" (1/1) ... [2022-01-10 00:49:11,374 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 00:49:11,408 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 00:49:11,672 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 00:49:11,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 00:49:11,722 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 00:49:11,753 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 00:49:11,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 00:49:11,796 INFO L208 MainTranslator]: Completed translation [2022-01-10 00:49:11,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:11 WrapperNode [2022-01-10 00:49:11,797 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 00:49:11,798 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 00:49:11,798 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 00:49:11,798 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 00:49:11,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:11" (1/1) ... [2022-01-10 00:49:11,823 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:11" (1/1) ... [2022-01-10 00:49:11,862 INFO L137 Inliner]: procedures = 140, calls = 94, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 228 [2022-01-10 00:49:11,862 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 00:49:11,863 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 00:49:11,863 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 00:49:11,863 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 00:49:11,869 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:11" (1/1) ... [2022-01-10 00:49:11,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:11" (1/1) ... [2022-01-10 00:49:11,872 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:11" (1/1) ... [2022-01-10 00:49:11,872 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:11" (1/1) ... [2022-01-10 00:49:11,890 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:11" (1/1) ... [2022-01-10 00:49:11,906 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:11" (1/1) ... [2022-01-10 00:49:11,908 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:11" (1/1) ... [2022-01-10 00:49:11,916 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 00:49:11,917 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 00:49:11,917 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 00:49:11,917 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 00:49:11,918 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:11" (1/1) ... [2022-01-10 00:49:11,923 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 00:49:11,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:49:11,941 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 00:49:11,958 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 00:49:11,973 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2022-01-10 00:49:11,973 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2022-01-10 00:49:11,973 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_base [2022-01-10 00:49:11,973 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_base [2022-01-10 00:49:11,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 00:49:11,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 00:49:11,974 INFO L130 BoogieDeclarations]: Found specification of procedure dll_insert_master [2022-01-10 00:49:11,974 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_insert_master [2022-01-10 00:49:11,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-10 00:49:11,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 00:49:11,974 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-01-10 00:49:11,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-01-10 00:49:11,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 00:49:11,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 00:49:11,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-01-10 00:49:11,974 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_generic [2022-01-10 00:49:11,974 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_generic [2022-01-10 00:49:11,974 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_slave [2022-01-10 00:49:11,974 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_slave [2022-01-10 00:49:11,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-10 00:49:11,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 00:49:11,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 00:49:12,060 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 00:49:12,062 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 00:49:12,349 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 00:49:12,355 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 00:49:12,355 INFO L299 CfgBuilder]: Removed 38 assume(true) statements. [2022-01-10 00:49:12,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:49:12 BoogieIcfgContainer [2022-01-10 00:49:12,356 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 00:49:12,358 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 00:49:12,358 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 00:49:12,360 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 00:49:12,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:49:11" (1/3) ... [2022-01-10 00:49:12,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e7ea46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:49:12, skipping insertion in model container [2022-01-10 00:49:12,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:11" (2/3) ... [2022-01-10 00:49:12,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e7ea46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:49:12, skipping insertion in model container [2022-01-10 00:49:12,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:49:12" (3/3) ... [2022-01-10 00:49:12,362 INFO L111 eAbstractionObserver]: Analyzing ICFG dll_of_dll-2.i [2022-01-10 00:49:12,366 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 00:49:12,366 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 00:49:12,398 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 00:49:12,405 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 00:49:12,405 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 00:49:12,424 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 96 states have (on average 1.7083333333333333) internal successors, (164), 116 states have internal predecessors, (164), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-01-10 00:49:12,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-10 00:49:12,428 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:49:12,429 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, 1, 1, 1] [2022-01-10 00:49:12,429 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:49:12,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:49:12,433 INFO L85 PathProgramCache]: Analyzing trace with hash 760908611, now seen corresponding path program 1 times [2022-01-10 00:49:12,439 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:49:12,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668963004] [2022-01-10 00:49:12,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:49:12,440 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:49:12,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:12,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 00:49:12,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:12,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 00:49:12,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:12,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 00:49:12,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:12,635 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 00:49:12,636 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:49:12,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668963004] [2022-01-10 00:49:12,636 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668963004] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:49:12,636 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:49:12,637 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:49:12,638 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905168007] [2022-01-10 00:49:12,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:49:12,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:49:12,641 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:49:12,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:49:12,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:49:12,667 INFO L87 Difference]: Start difference. First operand has 128 states, 96 states have (on average 1.7083333333333333) internal successors, (164), 116 states have internal predecessors, (164), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 00:49:12,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:49:12,843 INFO L93 Difference]: Finished difference Result 251 states and 429 transitions. [2022-01-10 00:49:12,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:49:12,845 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2022-01-10 00:49:12,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:49:12,851 INFO L225 Difference]: With dead ends: 251 [2022-01-10 00:49:12,852 INFO L226 Difference]: Without dead ends: 120 [2022-01-10 00:49:12,855 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 00:49:12,857 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 32 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 00:49:12,858 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 210 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 00:49:12,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-01-10 00:49:12,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-01-10 00:49:12,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 90 states have (on average 1.2777777777777777) internal successors, (115), 108 states have internal predecessors, (115), 24 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-01-10 00:49:12,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 149 transitions. [2022-01-10 00:49:12,911 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 149 transitions. Word has length 37 [2022-01-10 00:49:12,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:49:12,912 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 149 transitions. [2022-01-10 00:49:12,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 00:49:12,912 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 149 transitions. [2022-01-10 00:49:12,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-10 00:49:12,913 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:49:12,914 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, 1, 1, 1, 1] [2022-01-10 00:49:12,914 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 00:49:12,914 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:49:12,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:49:12,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1675514385, now seen corresponding path program 1 times [2022-01-10 00:49:12,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:49:12,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497226159] [2022-01-10 00:49:12,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:49:12,915 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:49:12,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:13,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 00:49:13,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:13,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 00:49:13,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:13,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 00:49:13,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:13,282 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 00:49:13,282 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:49:13,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497226159] [2022-01-10 00:49:13,283 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497226159] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:49:13,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014232687] [2022-01-10 00:49:13,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:49:13,284 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:49:13,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:49:13,308 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 00:49:13,309 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 00:49:13,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:13,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-10 00:49:13,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:49:13,638 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 00:49:13,639 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:49:13,922 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 00:49:13,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014232687] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:49:13,927 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:49:13,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 12 [2022-01-10 00:49:13,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545233929] [2022-01-10 00:49:13,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:49:13,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-10 00:49:13,934 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:49:13,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-10 00:49:13,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-01-10 00:49:13,935 INFO L87 Difference]: Start difference. First operand 120 states and 149 transitions. Second operand has 12 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-01-10 00:49:14,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:49:14,276 INFO L93 Difference]: Finished difference Result 250 states and 324 transitions. [2022-01-10 00:49:14,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 00:49:14,277 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 38 [2022-01-10 00:49:14,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:49:14,278 INFO L225 Difference]: With dead ends: 250 [2022-01-10 00:49:14,278 INFO L226 Difference]: Without dead ends: 133 [2022-01-10 00:49:14,280 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-01-10 00:49:14,280 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 55 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 00:49:14,281 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 907 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 00:49:14,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-01-10 00:49:14,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2022-01-10 00:49:14,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 98 states have (on average 1.2653061224489797) internal successors, (124), 116 states have internal predecessors, (124), 27 states have call successors, (27), 8 states have call predecessors, (27), 7 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) [2022-01-10 00:49:14,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 164 transitions. [2022-01-10 00:49:14,291 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 164 transitions. Word has length 38 [2022-01-10 00:49:14,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:49:14,291 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 164 transitions. [2022-01-10 00:49:14,291 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-01-10 00:49:14,292 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 164 transitions. [2022-01-10 00:49:14,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-10 00:49:14,294 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:49:14,294 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1] [2022-01-10 00:49:14,315 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 00:49:14,508 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 00:49:14,512 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:49:14,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:49:14,513 INFO L85 PathProgramCache]: Analyzing trace with hash 800158065, now seen corresponding path program 1 times [2022-01-10 00:49:14,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:49:14,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396430621] [2022-01-10 00:49:14,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:49:14,513 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:49:14,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:14,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 00:49:14,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:14,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 00:49:14,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:14,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 00:49:14,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:14,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-10 00:49:14,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:14,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 00:49:14,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:14,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 00:49:14,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:14,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 00:49:14,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:14,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-01-10 00:49:14,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:15,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 00:49:15,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:15,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-10 00:49:15,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:15,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 00:49:15,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:15,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 00:49:15,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:15,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 00:49:15,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:15,262 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 27 proven. 23 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-01-10 00:49:15,262 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:49:15,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396430621] [2022-01-10 00:49:15,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396430621] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:49:15,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114547080] [2022-01-10 00:49:15,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:49:15,262 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:49:15,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:49:15,264 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 00:49:15,265 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 00:49:15,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:15,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 948 conjuncts, 45 conjunts are in the unsatisfiable core [2022-01-10 00:49:15,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:49:15,696 INFO L353 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-01-10 00:49:15,697 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 00:49:15,701 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 00:49:15,708 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 00:49:15,734 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 11 treesize of output 7 [2022-01-10 00:49:15,755 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-10 00:49:15,755 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 34 [2022-01-10 00:49:15,760 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 22 treesize of output 16 [2022-01-10 00:49:15,805 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 00:49:15,841 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 33 proven. 5 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-01-10 00:49:15,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:49:16,149 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:49:16,150 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 00:49:16,156 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 00:49:16,162 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 00:49:16,205 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 00:49:16,213 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 00:49:16,235 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:49:16,235 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 00:49:16,240 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 00:49:16,279 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 00:49:16,324 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 00:49:16,333 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 00:49:16,504 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-01-10 00:49:16,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114547080] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:49:16,504 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:49:16,504 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 16, 15] total 27 [2022-01-10 00:49:16,505 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358742049] [2022-01-10 00:49:16,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:49:16,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-10 00:49:16,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:49:16,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-10 00:49:16,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=644, Unknown=0, NotChecked=0, Total=702 [2022-01-10 00:49:16,506 INFO L87 Difference]: Start difference. First operand 133 states and 164 transitions. Second operand has 27 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 23 states have internal predecessors, (68), 11 states have call successors, (22), 4 states have call predecessors, (22), 7 states have return successors, (17), 11 states have call predecessors, (17), 9 states have call successors, (17) [2022-01-10 00:49:18,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:49:18,063 INFO L93 Difference]: Finished difference Result 330 states and 410 transitions. [2022-01-10 00:49:18,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-10 00:49:18,064 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 23 states have internal predecessors, (68), 11 states have call successors, (22), 4 states have call predecessors, (22), 7 states have return successors, (17), 11 states have call predecessors, (17), 9 states have call successors, (17) Word has length 110 [2022-01-10 00:49:18,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:49:18,067 INFO L225 Difference]: With dead ends: 330 [2022-01-10 00:49:18,067 INFO L226 Difference]: Without dead ends: 201 [2022-01-10 00:49:18,068 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=175, Invalid=1895, Unknown=0, NotChecked=0, Total=2070 [2022-01-10 00:49:18,070 INFO L933 BasicCegarLoop]: 131 mSDtfsCounter, 256 mSDsluCounter, 1819 mSDsCounter, 0 mSdLazyCounter, 1753 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 1950 SdHoareTripleChecker+Invalid, 1830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:49:18,072 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [258 Valid, 1950 Invalid, 1830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1753 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-10 00:49:18,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-01-10 00:49:18,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 166. [2022-01-10 00:49:18,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 126 states have (on average 1.253968253968254) internal successors, (158), 144 states have internal predecessors, (158), 29 states have call successors, (29), 10 states have call predecessors, (29), 10 states have return successors, (17), 13 states have call predecessors, (17), 15 states have call successors, (17) [2022-01-10 00:49:18,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 204 transitions. [2022-01-10 00:49:18,096 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 204 transitions. Word has length 110 [2022-01-10 00:49:18,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:49:18,096 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 204 transitions. [2022-01-10 00:49:18,096 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 23 states have internal predecessors, (68), 11 states have call successors, (22), 4 states have call predecessors, (22), 7 states have return successors, (17), 11 states have call predecessors, (17), 9 states have call successors, (17) [2022-01-10 00:49:18,096 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 204 transitions. [2022-01-10 00:49:18,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-01-10 00:49:18,097 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:49:18,097 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1] [2022-01-10 00:49:18,120 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 00:49:18,317 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 00:49:18,318 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:49:18,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:49:18,318 INFO L85 PathProgramCache]: Analyzing trace with hash 614553281, now seen corresponding path program 1 times [2022-01-10 00:49:18,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:49:18,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715897843] [2022-01-10 00:49:18,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:49:18,318 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:49:18,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:18,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 00:49:18,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:18,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 00:49:18,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:18,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 00:49:18,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:18,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-10 00:49:18,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:18,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 00:49:18,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:18,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 00:49:18,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:18,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 00:49:18,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:18,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-01-10 00:49:18,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:18,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 00:49:18,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:18,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-10 00:49:18,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:18,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 00:49:18,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:18,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 00:49:18,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:18,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 00:49:18,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:18,910 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 15 proven. 23 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-01-10 00:49:18,911 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:49:18,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715897843] [2022-01-10 00:49:18,911 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715897843] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:49:18,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96803401] [2022-01-10 00:49:18,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:49:18,911 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:49:18,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:49:18,912 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 00:49:18,913 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 00:49:19,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:19,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 972 conjuncts, 55 conjunts are in the unsatisfiable core [2022-01-10 00:49:19,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:49:19,358 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 00:49:19,396 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 8 treesize of output 4 [2022-01-10 00:49:19,528 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2702 (Array Int Int)) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (and (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (= |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~next~0#1.base| (select (select (store |c_old(#memory_$Pointer$.base)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_2702) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|) |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|)))) is different from true [2022-01-10 00:49:19,560 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2702 (Array Int Int)) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (and (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (= (select (select (store |c_old(#memory_$Pointer$.base)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_2702) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|) |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|) 0))) is different from true [2022-01-10 00:49:19,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:49:19,609 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 80 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 5 not checked. [2022-01-10 00:49:19,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:49:20,510 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_139| Int) (v_ArrVal_2742 (Array Int Int))) (or (not (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_139| |c_#StackHeapBarrier|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_139| v_ArrVal_2742) |c_dll_create_generic_~#dll~0.base|) |c_dll_create_generic_~#dll~0.offset|) 0)))) is different from false [2022-01-10 00:49:20,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96803401] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:49:20,512 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 00:49:20,512 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15] total 24 [2022-01-10 00:49:20,512 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836644152] [2022-01-10 00:49:20,512 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 00:49:20,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-10 00:49:20,512 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:49:20,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-10 00:49:20,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=414, Unknown=3, NotChecked=126, Total=600 [2022-01-10 00:49:20,513 INFO L87 Difference]: Start difference. First operand 166 states and 204 transitions. Second operand has 24 states, 21 states have (on average 3.619047619047619) internal successors, (76), 21 states have internal predecessors, (76), 8 states have call successors, (20), 4 states have call predecessors, (20), 6 states have return successors, (17), 5 states have call predecessors, (17), 8 states have call successors, (17) [2022-01-10 00:49:20,724 WARN L860 $PredicateComparison]: unable to prove that (and (not (= (select (select |c_#memory_$Pointer$.base| |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|) |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|) 0)) (exists ((v_ArrVal_2702 (Array Int Int)) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (and (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (= (select (select (store |c_old(#memory_$Pointer$.base)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_2702) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|) |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|) 0)))) is different from true [2022-01-10 00:49:21,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:49:21,368 INFO L93 Difference]: Finished difference Result 338 states and 426 transitions. [2022-01-10 00:49:21,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-10 00:49:21,368 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 3.619047619047619) internal successors, (76), 21 states have internal predecessors, (76), 8 states have call successors, (20), 4 states have call predecessors, (20), 6 states have return successors, (17), 5 states have call predecessors, (17), 8 states have call successors, (17) Word has length 113 [2022-01-10 00:49:21,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:49:21,369 INFO L225 Difference]: With dead ends: 338 [2022-01-10 00:49:21,369 INFO L226 Difference]: Without dead ends: 180 [2022-01-10 00:49:21,370 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=144, Invalid=1053, Unknown=9, NotChecked=276, Total=1482 [2022-01-10 00:49:21,371 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 54 mSDsluCounter, 1195 mSDsCounter, 0 mSdLazyCounter, 1223 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 1321 SdHoareTripleChecker+Invalid, 1706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 440 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 00:49:21,371 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 1321 Invalid, 1706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1223 Invalid, 0 Unknown, 440 Unchecked, 0.5s Time] [2022-01-10 00:49:21,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-01-10 00:49:21,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 171. [2022-01-10 00:49:21,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 129 states have (on average 1.248062015503876) internal successors, (161), 148 states have internal predecessors, (161), 30 states have call successors, (30), 10 states have call predecessors, (30), 11 states have return successors, (19), 14 states have call predecessors, (19), 16 states have call successors, (19) [2022-01-10 00:49:21,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 210 transitions. [2022-01-10 00:49:21,380 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 210 transitions. Word has length 113 [2022-01-10 00:49:21,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:49:21,380 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 210 transitions. [2022-01-10 00:49:21,380 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 3.619047619047619) internal successors, (76), 21 states have internal predecessors, (76), 8 states have call successors, (20), 4 states have call predecessors, (20), 6 states have return successors, (17), 5 states have call predecessors, (17), 8 states have call successors, (17) [2022-01-10 00:49:21,380 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 210 transitions. [2022-01-10 00:49:21,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-01-10 00:49:21,382 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:49:21,382 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:49:21,423 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 00:49:21,600 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 00:49:21,600 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:49:21,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:49:21,600 INFO L85 PathProgramCache]: Analyzing trace with hash 522299907, now seen corresponding path program 1 times [2022-01-10 00:49:21,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:49:21,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102825998] [2022-01-10 00:49:21,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:49:21,601 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:49:21,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:21,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 00:49:21,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:22,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 00:49:22,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:22,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 00:49:22,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:22,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-10 00:49:22,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:22,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 00:49:22,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:22,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 00:49:22,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:22,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 00:49:22,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:22,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-01-10 00:49:22,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:22,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 00:49:22,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:23,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-10 00:49:23,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:23,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 00:49:23,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat