/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_BITWISE.epf -i ../../../trunk/examples/svcomp/list-simple/dll2c_insert_unequal.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 11:57:35,653 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 11:57:35,654 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 11:57:35,676 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 11:57:35,676 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 11:57:35,677 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 11:57:35,678 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 11:57:35,716 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 11:57:35,718 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 11:57:35,721 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 11:57:35,722 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 11:57:35,722 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 11:57:35,722 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 11:57:35,723 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 11:57:35,723 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 11:57:35,724 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 11:57:35,724 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 11:57:35,725 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 11:57:35,726 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 11:57:35,727 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 11:57:35,729 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 11:57:35,731 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 11:57:35,733 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 11:57:35,734 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 11:57:35,742 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 11:57:35,742 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 11:57:35,742 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 11:57:35,743 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 11:57:35,743 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 11:57:35,744 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 11:57:35,744 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 11:57:35,745 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 11:57:35,745 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 11:57:35,745 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 11:57:35,746 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 11:57:35,746 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 11:57:35,746 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 11:57:35,747 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 11:57:35,747 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 11:57:35,747 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 11:57:35,748 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 11:57:35,750 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_BITWISE.epf [2022-01-10 11:57:35,774 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 11:57:35,774 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 11:57:35,774 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 11:57:35,774 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 11:57:35,775 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 11:57:35,775 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 11:57:35,775 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 11:57:35,776 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 11:57:35,776 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 11:57:35,776 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 11:57:35,776 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 11:57:35,776 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 11:57:35,776 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 11:57:35,776 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 11:57:35,776 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 11:57:35,776 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 11:57:35,776 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 11:57:35,777 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 11:57:35,777 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 11:57:35,777 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 11:57:35,777 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 11:57:35,777 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 11:57:35,777 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 11:57:35,777 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 11:57:35,777 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 11:57:35,777 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 11:57:35,777 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 11:57:35,777 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 11:57:35,778 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 11:57:35,778 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 11:57:35,778 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 11:57:35,778 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 11:57:35,778 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 11:57:35,778 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_BITWISE 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 11:57:35,972 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 11:57:35,986 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 11:57:35,987 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 11:57:35,988 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 11:57:35,989 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 11:57:35,990 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_insert_unequal.i [2022-01-10 11:57:36,051 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/842084e0d/9aa1241c294d4c1e98b25bca30f428be/FLAG3972d7bc8 [2022-01-10 11:57:36,439 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 11:57:36,440 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_insert_unequal.i [2022-01-10 11:57:36,453 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/842084e0d/9aa1241c294d4c1e98b25bca30f428be/FLAG3972d7bc8 [2022-01-10 11:57:36,848 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/842084e0d/9aa1241c294d4c1e98b25bca30f428be [2022-01-10 11:57:36,850 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 11:57:36,852 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 11:57:36,855 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 11:57:36,855 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 11:57:36,857 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 11:57:36,858 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 11:57:36" (1/1) ... [2022-01-10 11:57:36,858 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@824c35b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:57:36, skipping insertion in model container [2022-01-10 11:57:36,859 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 11:57:36" (1/1) ... [2022-01-10 11:57:36,863 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 11:57:36,908 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 11:57:37,196 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_insert_unequal.i[25148,25161] [2022-01-10 11:57:37,198 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 11:57:37,208 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 11:57:37,256 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_insert_unequal.i[25148,25161] [2022-01-10 11:57:37,257 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 11:57:37,276 INFO L208 MainTranslator]: Completed translation [2022-01-10 11:57:37,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:57:37 WrapperNode [2022-01-10 11:57:37,276 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 11:57:37,277 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 11:57:37,277 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 11:57:37,277 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 11:57:37,282 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:57:37" (1/1) ... [2022-01-10 11:57:37,309 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:57:37" (1/1) ... [2022-01-10 11:57:37,336 INFO L137 Inliner]: procedures = 130, calls = 58, calls flagged for inlining = 9, calls inlined = 11, statements flattened = 214 [2022-01-10 11:57:37,336 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 11:57:37,337 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 11:57:37,337 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 11:57:37,337 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 11:57:37,342 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:57:37" (1/1) ... [2022-01-10 11:57:37,342 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:57:37" (1/1) ... [2022-01-10 11:57:37,356 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:57:37" (1/1) ... [2022-01-10 11:57:37,357 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:57:37" (1/1) ... [2022-01-10 11:57:37,364 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:57:37" (1/1) ... [2022-01-10 11:57:37,366 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:57:37" (1/1) ... [2022-01-10 11:57:37,368 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:57:37" (1/1) ... [2022-01-10 11:57:37,370 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 11:57:37,371 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 11:57:37,371 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 11:57:37,371 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 11:57:37,372 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:57:37" (1/1) ... [2022-01-10 11:57:37,386 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 11:57:37,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:57:37,420 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 11:57:37,428 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 11:57:37,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 11:57:37,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 11:57:37,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 11:57:37,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-10 11:57:37,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 11:57:37,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 11:57:37,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 11:57:37,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 11:57:37,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-01-10 11:57:37,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 11:57:37,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 11:57:37,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 11:57:37,537 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 11:57:37,538 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 11:57:38,026 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 11:57:38,032 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 11:57:38,033 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-01-10 11:57:38,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:57:38 BoogieIcfgContainer [2022-01-10 11:57:38,034 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 11:57:38,034 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 11:57:38,035 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 11:57:38,037 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 11:57:38,040 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:57:38" (1/1) ... [2022-01-10 11:57:38,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 11:57:38 BasicIcfg [2022-01-10 11:57:38,149 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 11:57:38,150 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 11:57:38,150 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 11:57:38,152 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 11:57:38,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 11:57:36" (1/4) ... [2022-01-10 11:57:38,153 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6af77fc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 11:57:38, skipping insertion in model container [2022-01-10 11:57:38,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:57:37" (2/4) ... [2022-01-10 11:57:38,153 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6af77fc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 11:57:38, skipping insertion in model container [2022-01-10 11:57:38,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:57:38" (3/4) ... [2022-01-10 11:57:38,153 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6af77fc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 11:57:38, skipping insertion in model container [2022-01-10 11:57:38,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 11:57:38" (4/4) ... [2022-01-10 11:57:38,158 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_insert_unequal.iTransformedIcfg [2022-01-10 11:57:38,163 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 11:57:38,163 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 11:57:38,199 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 11:57:38,206 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 11:57:38,207 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 11:57:38,217 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 43 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:57:38,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-10 11:57:38,221 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:57:38,222 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:57:38,223 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:57:38,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:57:38,229 INFO L85 PathProgramCache]: Analyzing trace with hash -34682956, now seen corresponding path program 1 times [2022-01-10 11:57:38,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:57:38,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709826926] [2022-01-10 11:57:38,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:57:38,236 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:57:38,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:57:38,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:57:38,437 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:57:38,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709826926] [2022-01-10 11:57:38,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709826926] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:57:38,439 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:57:38,439 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 11:57:38,440 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754032574] [2022-01-10 11:57:38,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:57:38,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 11:57:38,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:57:38,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 11:57:38,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 11:57:38,467 INFO L87 Difference]: Start difference. First operand has 44 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 43 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:57:38,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:57:38,484 INFO L93 Difference]: Finished difference Result 75 states and 110 transitions. [2022-01-10 11:57:38,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 11:57:38,486 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-01-10 11:57:38,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:57:38,498 INFO L225 Difference]: With dead ends: 75 [2022-01-10 11:57:38,498 INFO L226 Difference]: Without dead ends: 34 [2022-01-10 11:57:38,500 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 11:57:38,503 INFO L933 BasicCegarLoop]: 58 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, 58 SdHoareTripleChecker+Invalid, 0 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 11:57:38,504 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 11:57:38,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-01-10 11:57:38,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-01-10 11:57:38,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.303030303030303) internal successors, (43), 33 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:57:38,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-01-10 11:57:38,530 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 17 [2022-01-10 11:57:38,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:57:38,530 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-01-10 11:57:38,530 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:57:38,531 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-01-10 11:57:38,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-10 11:57:38,532 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:57:38,532 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:57:38,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 11:57:38,532 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:57:38,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:57:38,535 INFO L85 PathProgramCache]: Analyzing trace with hash 123028914, now seen corresponding path program 1 times [2022-01-10 11:57:38,535 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:57:38,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859206012] [2022-01-10 11:57:38,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:57:38,535 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:57:38,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:57:38,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:57:38,761 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:57:38,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859206012] [2022-01-10 11:57:38,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859206012] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:57:38,762 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:57:38,762 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 11:57:38,762 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105732081] [2022-01-10 11:57:38,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:57:38,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 11:57:38,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:57:38,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 11:57:38,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 11:57:38,765 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:57:38,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:57:38,804 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2022-01-10 11:57:38,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 11:57:38,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-01-10 11:57:38,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:57:38,807 INFO L225 Difference]: With dead ends: 64 [2022-01-10 11:57:38,807 INFO L226 Difference]: Without dead ends: 50 [2022-01-10 11:57:38,811 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 11:57:38,812 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 22 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 11:57:38,812 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 95 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 11:57:38,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-01-10 11:57:38,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 36. [2022-01-10 11:57:38,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:57:38,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2022-01-10 11:57:38,824 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 17 [2022-01-10 11:57:38,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:57:38,827 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 46 transitions. [2022-01-10 11:57:38,827 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:57:38,827 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2022-01-10 11:57:38,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 11:57:38,828 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:57:38,828 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:57:38,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 11:57:38,828 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:57:38,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:57:38,828 INFO L85 PathProgramCache]: Analyzing trace with hash 347235224, now seen corresponding path program 1 times [2022-01-10 11:57:38,829 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:57:38,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729914871] [2022-01-10 11:57:38,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:57:38,829 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:57:38,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:57:38,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 11:57:38,999 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:57:38,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729914871] [2022-01-10 11:57:39,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729914871] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:57:39,000 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:57:39,000 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 11:57:39,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082190276] [2022-01-10 11:57:39,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:57:39,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 11:57:39,001 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:57:39,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 11:57:39,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 11:57:39,002 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:57:39,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:57:39,039 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2022-01-10 11:57:39,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 11:57:39,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-01-10 11:57:39,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:57:39,041 INFO L225 Difference]: With dead ends: 62 [2022-01-10 11:57:39,041 INFO L226 Difference]: Without dead ends: 37 [2022-01-10 11:57:39,041 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 11:57:39,042 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 11:57:39,042 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 72 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 11:57:39,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-01-10 11:57:39,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-01-10 11:57:39,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:57:39,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2022-01-10 11:57:39,045 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 18 [2022-01-10 11:57:39,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:57:39,045 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2022-01-10 11:57:39,045 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:57:39,046 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-01-10 11:57:39,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 11:57:39,046 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:57:39,046 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:57:39,046 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 11:57:39,046 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:57:39,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:57:39,047 INFO L85 PathProgramCache]: Analyzing trace with hash 2078807023, now seen corresponding path program 1 times [2022-01-10 11:57:39,047 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:57:39,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614991415] [2022-01-10 11:57:39,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:57:39,047 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:57:39,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:57:41,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:57:41,285 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:57:41,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614991415] [2022-01-10 11:57:41,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614991415] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 11:57:41,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338665167] [2022-01-10 11:57:41,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:57:41,285 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:57:41,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:57:41,301 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 11:57:41,370 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 11:57:42,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:57:42,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 725 conjuncts, 140 conjunts are in the unsatisfiable core [2022-01-10 11:57:42,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 11:57:42,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:57:42,171 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 9 treesize of output 11 [2022-01-10 11:57:42,466 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-10 11:57:42,467 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 23 [2022-01-10 11:57:42,715 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-10 11:57:42,852 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 11:57:42,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:57:42,864 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-10 11:57:42,996 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 11:57:42,997 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2022-01-10 11:57:43,003 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-01-10 11:57:43,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:57:43,288 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:57:43,297 INFO L353 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-01-10 11:57:43,297 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 105 treesize of output 62 [2022-01-10 11:57:43,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:57:43,315 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 31 [2022-01-10 11:57:43,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:57:43,327 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2022-01-10 11:57:43,512 INFO L353 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-01-10 11:57:43,512 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2022-01-10 11:57:43,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:57:43,777 INFO L353 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-01-10 11:57:43,777 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 150 treesize of output 124 [2022-01-10 11:57:43,786 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-01-10 11:57:43,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:57:43,792 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 133 [2022-01-10 11:57:44,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:57:44,481 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:57:44,481 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:57:44,516 INFO L353 Elim1Store]: treesize reduction 56, result has 21.1 percent of original size [2022-01-10 11:57:44,517 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 254 treesize of output 132 [2022-01-10 11:57:44,560 INFO L353 Elim1Store]: treesize reduction 98, result has 14.0 percent of original size [2022-01-10 11:57:44,561 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 308 treesize of output 224 [2022-01-10 11:57:44,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:57:44,574 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 0 case distinctions, treesize of input 77 treesize of output 75 [2022-01-10 11:57:44,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:57:44,606 INFO L353 Elim1Store]: treesize reduction 102, result has 16.4 percent of original size [2022-01-10 11:57:44,607 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 229 treesize of output 217 [2022-01-10 11:57:44,615 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 61 [2022-01-10 11:57:44,624 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 11:57:44,747 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:57:44,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:57:44,753 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-10 11:57:44,754 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 150 treesize of output 49 [2022-01-10 11:57:44,759 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 37 treesize of output 21 [2022-01-10 11:57:44,819 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-10 11:57:44,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:57:44,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 11:57:45,064 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_548 (Array Int Int)) (v_ArrVal_544 (Array Int Int))) (or (not (<= 0 (select (select (store (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.baseInt| v_ArrVal_544) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~new_node~0#1.baseInt| v_ArrVal_548) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~last~1#1.baseInt| v_ArrVal_546) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (and (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (v_ArrVal_552 Int) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int))) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1Int| (select (select (store (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.baseInt| (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offsetInt| v_ArrVal_552)) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~new_node~0#1.baseInt| v_ArrVal_541) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~last~1#1.baseInt| v_ArrVal_537) (select (select (store (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~new_node~0#1.baseInt|)) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~new_node~0#1.baseInt| v_ArrVal_545) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~last~1#1.baseInt| v_ArrVal_542) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|)) (let ((.cse0 (select (select (store (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.baseInt| v_ArrVal_544) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~new_node~0#1.baseInt| v_ArrVal_548) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~last~1#1.baseInt| v_ArrVal_546) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (+ 16 (* (div (+ 16 .cse0) 18446744073709551616) (- 18446744073709551616)) .cse0))))) (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (v_ArrVal_552 Int) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int))) (<= (select (select (store (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.baseInt| (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offsetInt| v_ArrVal_552)) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~new_node~0#1.baseInt| v_ArrVal_541) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~last~1#1.baseInt| v_ArrVal_537) (select (select (store (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~new_node~0#1.baseInt|)) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~new_node~0#1.baseInt| v_ArrVal_545) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~last~1#1.baseInt| v_ArrVal_542) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|)) (let ((.cse1 (select (select (store (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.baseInt| v_ArrVal_544) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~new_node~0#1.baseInt| v_ArrVal_548) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~last~1#1.baseInt| v_ArrVal_546) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (+ 16 (* (div (+ 16 .cse1) 18446744073709551616) (- 18446744073709551616)) .cse1))) |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1Int|))))) is different from false [2022-01-10 11:57:45,746 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_548 (Array Int Int)) (v_ArrVal_536 (Array Int Int)) (v_ArrVal_544 (Array Int Int)) (v_ArrVal_532 (Array Int Int))) (let ((.cse17 (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_536))) (let ((.cse16 (select (select .cse17 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~head#1.offsetInt|))) (or (and (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_545 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (v_ArrVal_552 Int) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int))) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1Int| (let ((.cse4 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_532))) (let ((.cse7 (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_536)) (.cse1 (select (select .cse4 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~head#1.offsetInt|))) (let ((.cse5 (select .cse4 .cse1)) (.cse2 (select (select .cse7 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~head#1.offsetInt|))) (let ((.cse3 (select .cse5 .cse2))) (select (select (store (store (let ((.cse0 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_535))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_552))) |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_541) .cse3 v_ArrVal_537) (select (select (store (store (store .cse4 .cse1 (store .cse5 .cse2 |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|)) |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_545) .cse3 v_ArrVal_542) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|)) (let ((.cse6 (select (select (store (store (store .cse7 .cse1 v_ArrVal_544) |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_548) .cse3 v_ArrVal_546) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (+ .cse6 16 (* (- 18446744073709551616) (div (+ .cse6 16) 18446744073709551616))))))))))) (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_545 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (v_ArrVal_552 Int) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int))) (<= (let ((.cse12 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_532))) (let ((.cse15 (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_536)) (.cse9 (select (select .cse12 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~head#1.offsetInt|))) (let ((.cse13 (select .cse12 .cse9)) (.cse10 (select (select .cse15 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~head#1.offsetInt|))) (let ((.cse11 (select .cse13 .cse10))) (select (select (store (store (let ((.cse8 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_535))) (store .cse8 .cse9 (store (select .cse8 .cse9) .cse10 v_ArrVal_552))) |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_541) .cse11 v_ArrVal_537) (select (select (store (store (store .cse12 .cse9 (store .cse13 .cse10 |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|)) |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_545) .cse11 v_ArrVal_542) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|)) (let ((.cse14 (select (select (store (store (store .cse15 .cse9 v_ArrVal_544) |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_548) .cse11 v_ArrVal_546) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (+ .cse14 16 (* (- 18446744073709551616) (div (+ .cse14 16) 18446744073709551616))))))))) |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1Int|))) (not (<= 0 .cse16)) (not (<= 0 (select (select (let ((.cse19 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_532))) (let ((.cse18 (select (select .cse19 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~head#1.offsetInt|))) (store (store (store .cse17 .cse18 v_ArrVal_544) |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_548) (select (select .cse19 .cse18) .cse16) v_ArrVal_546))) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))))))) is different from false [2022-01-10 11:57:46,070 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 1347008 treesize of output 1271616 [2022-01-10 11:57:47,103 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 1271616 treesize of output 1266496 [2022-01-10 11:57:48,072 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 1266496 treesize of output 1224102 [2022-01-10 11:57:48,923 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 1224102 treesize of output 1213862 [2022-01-10 11:57:49,762 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 1213862 treesize of output 1193382 [2022-01-10 11:57:52,249 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2022-01-10 11:57:52,249 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-01-10 11:57:52,249 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2022-01-10 11:57:52,249 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583612310] [2022-01-10 11:57:52,250 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-01-10 11:57:52,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-10 11:57:52,250 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:57:52,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-10 11:57:52,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1229, Unknown=2, NotChecked=142, Total=1482 [2022-01-10 11:57:52,251 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:57:55,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:57:55,969 INFO L93 Difference]: Finished difference Result 79 states and 103 transitions. [2022-01-10 11:57:55,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-10 11:57:55,970 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-01-10 11:57:55,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:57:55,970 INFO L225 Difference]: With dead ends: 79 [2022-01-10 11:57:55,970 INFO L226 Difference]: Without dead ends: 77 [2022-01-10 11:57:55,971 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=228, Invalid=2328, Unknown=2, NotChecked=198, Total=2756 [2022-01-10 11:57:55,972 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 115 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-10 11:57:55,972 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 173 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-01-10 11:57:55,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-01-10 11:57:55,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 54. [2022-01-10 11:57:55,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 53 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:57:55,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2022-01-10 11:57:55,979 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 24 [2022-01-10 11:57:55,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:57:55,979 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2022-01-10 11:57:55,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:57:55,980 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2022-01-10 11:57:55,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-10 11:57:55,980 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:57:55,980 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:57:56,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-10 11:57:56,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:57:56,200 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:57:56,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:57:56,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1028621888, now seen corresponding path program 1 times [2022-01-10 11:57:56,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:57:56,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880320868] [2022-01-10 11:57:56,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:57:56,201 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:57:56,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:57:56,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 11:57:56,555 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:57:56,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880320868] [2022-01-10 11:57:56,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880320868] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:57:56,555 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:57:56,556 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 11:57:56,556 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981955264] [2022-01-10 11:57:56,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:57:56,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 11:57:56,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:57:56,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 11:57:56,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 11:57:56,557 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:57:56,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:57:56,577 INFO L93 Difference]: Finished difference Result 70 states and 90 transitions. [2022-01-10 11:57:56,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 11:57:56,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-01-10 11:57:56,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:57:56,580 INFO L225 Difference]: With dead ends: 70 [2022-01-10 11:57:56,580 INFO L226 Difference]: Without dead ends: 53 [2022-01-10 11:57:56,580 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 11:57:56,582 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 30 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 11:57:56,582 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 77 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 11:57:56,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-01-10 11:57:56,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-01-10 11:57:56,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 52 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:57:56,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2022-01-10 11:57:56,595 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 25 [2022-01-10 11:57:56,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:57:56,596 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2022-01-10 11:57:56,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:57:56,596 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2022-01-10 11:57:56,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-10 11:57:56,596 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:57:56,597 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:57:56,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 11:57:56,597 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:57:56,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:57:56,597 INFO L85 PathProgramCache]: Analyzing trace with hash 846814459, now seen corresponding path program 2 times [2022-01-10 11:57:56,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:57:56,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664306740] [2022-01-10 11:57:56,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:57:56,597 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:57:56,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:57:56,746 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 11:57:56,747 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:57:56,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664306740] [2022-01-10 11:57:56,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664306740] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 11:57:56,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287967252] [2022-01-10 11:57:56,747 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 11:57:56,747 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:57:56,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:57:56,748 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 11:57:56,751 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 11:57:57,912 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 11:57:57,913 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 11:57:57,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 15 conjunts are in the unsatisfiable core [2022-01-10 11:57:57,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 11:57:58,087 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 11:57:58,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 11:58:20,936 WARN L228 SmtUtils]: Spent 5.07s on a formula simplification. DAG size of input: 11 DAG size of output: 1 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)