/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_SUM.epf -i ../../../trunk/examples/svcomp/list-simple/sll2c_insert_unequal.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 05:26:59,734 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 05:26:59,735 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 05:26:59,768 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 05:26:59,768 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 05:26:59,771 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 05:26:59,774 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 05:26:59,779 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 05:26:59,781 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 05:26:59,839 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 05:26:59,840 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 05:26:59,841 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 05:26:59,841 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 05:26:59,842 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 05:26:59,843 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 05:26:59,844 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 05:26:59,844 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 05:26:59,845 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 05:26:59,846 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 05:26:59,847 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 05:26:59,848 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 05:26:59,849 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 05:26:59,850 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 05:26:59,851 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 05:26:59,856 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 05:26:59,856 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 05:26:59,856 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 05:26:59,857 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 05:26:59,857 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 05:26:59,858 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 05:26:59,858 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 05:26:59,859 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 05:26:59,859 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 05:26:59,860 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 05:26:59,860 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 05:26:59,861 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 05:26:59,861 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 05:26:59,861 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 05:26:59,861 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 05:26:59,862 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 05:26:59,863 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 05:26:59,872 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf [2022-01-11 05:26:59,902 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 05:26:59,902 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 05:26:59,903 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 05:26:59,903 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 05:26:59,904 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 05:26:59,904 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 05:26:59,904 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 05:26:59,905 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 05:26:59,905 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 05:26:59,905 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 05:26:59,905 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 05:26:59,906 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 05:26:59,906 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 05:26:59,906 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 05:26:59,906 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 05:26:59,906 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 05:26:59,906 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 05:26:59,906 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 05:26:59,907 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 05:26:59,907 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 05:26:59,907 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 05:26:59,907 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 05:26:59,907 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 05:26:59,907 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 05:26:59,907 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 05:26:59,907 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 05:26:59,908 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 05:26:59,908 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 05:26:59,908 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 05:26:59,908 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 05:26:59,908 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 05:26:59,908 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 05:26:59,909 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 05:26:59,910 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_SUM 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-11 05:27:00,130 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 05:27:00,152 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 05:27:00,154 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 05:27:00,155 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 05:27:00,155 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 05:27:00,156 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2c_insert_unequal.i [2022-01-11 05:27:00,204 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49e94fbf4/fea6834516dd406289de79931767c6b5/FLAGc32d8ee75 [2022-01-11 05:27:00,592 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 05:27:00,593 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_insert_unequal.i [2022-01-11 05:27:00,606 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49e94fbf4/fea6834516dd406289de79931767c6b5/FLAGc32d8ee75 [2022-01-11 05:27:00,990 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49e94fbf4/fea6834516dd406289de79931767c6b5 [2022-01-11 05:27:00,992 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 05:27:00,992 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 05:27:01,007 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 05:27:01,008 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 05:27:01,010 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 05:27:01,010 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 05:27:00" (1/1) ... [2022-01-11 05:27:01,011 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4872d17f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:27:01, skipping insertion in model container [2022-01-11 05:27:01,011 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 05:27:00" (1/1) ... [2022-01-11 05:27:01,015 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 05:27:01,055 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 05:27:01,302 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/sll2c_insert_unequal.i[24872,24885] [2022-01-11 05:27:01,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 05:27:01,320 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 05:27:01,368 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/sll2c_insert_unequal.i[24872,24885] [2022-01-11 05:27:01,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 05:27:01,393 INFO L208 MainTranslator]: Completed translation [2022-01-11 05:27:01,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:27:01 WrapperNode [2022-01-11 05:27:01,393 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 05:27:01,394 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 05:27:01,395 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 05:27:01,395 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 05:27:01,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:27:01" (1/1) ... [2022-01-11 05:27:01,427 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:27:01" (1/1) ... [2022-01-11 05:27:01,447 INFO L137 Inliner]: procedures = 130, calls = 48, calls flagged for inlining = 9, calls inlined = 11, statements flattened = 199 [2022-01-11 05:27:01,448 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 05:27:01,448 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 05:27:01,448 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 05:27:01,448 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 05:27:01,454 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:27:01" (1/1) ... [2022-01-11 05:27:01,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:27:01" (1/1) ... [2022-01-11 05:27:01,459 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:27:01" (1/1) ... [2022-01-11 05:27:01,460 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:27:01" (1/1) ... [2022-01-11 05:27:01,469 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:27:01" (1/1) ... [2022-01-11 05:27:01,472 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:27:01" (1/1) ... [2022-01-11 05:27:01,473 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:27:01" (1/1) ... [2022-01-11 05:27:01,475 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 05:27:01,476 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 05:27:01,476 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 05:27:01,476 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 05:27:01,477 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:27:01" (1/1) ... [2022-01-11 05:27:01,496 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 05:27:01,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:27:01,515 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-11 05:27:01,521 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-11 05:27:01,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-11 05:27:01,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-11 05:27:01,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 05:27:01,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-11 05:27:01,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-11 05:27:01,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-11 05:27:01,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-11 05:27:01,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-11 05:27:01,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-01-11 05:27:01,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 05:27:01,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 05:27:01,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 05:27:01,759 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 05:27:01,760 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 05:27:02,108 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 05:27:02,112 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 05:27:02,113 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-01-11 05:27:02,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:27:02 BoogieIcfgContainer [2022-01-11 05:27:02,114 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 05:27:02,114 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 05:27:02,114 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 05:27:02,115 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 05:27:02,117 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:27:02" (1/1) ... [2022-01-11 05:27:02,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 05:27:02 BasicIcfg [2022-01-11 05:27:02,186 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 05:27:02,187 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 05:27:02,187 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 05:27:02,188 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 05:27:02,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 05:27:00" (1/4) ... [2022-01-11 05:27:02,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a21455b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 05:27:02, skipping insertion in model container [2022-01-11 05:27:02,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:27:01" (2/4) ... [2022-01-11 05:27:02,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a21455b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 05:27:02, skipping insertion in model container [2022-01-11 05:27:02,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:27:02" (3/4) ... [2022-01-11 05:27:02,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a21455b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 05:27:02, skipping insertion in model container [2022-01-11 05:27:02,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 05:27:02" (4/4) ... [2022-01-11 05:27:02,190 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_insert_unequal.iTransformedIcfg [2022-01-11 05:27:02,194 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 05:27:02,194 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-11 05:27:02,220 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 05:27:02,225 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-11 05:27:02,225 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-11 05:27:02,234 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 40 states have (on average 1.525) internal successors, (61), 41 states have internal predecessors, (61), 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-11 05:27:02,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-11 05:27:02,237 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:27:02,237 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:27:02,237 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:27:02,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:27:02,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1250376598, now seen corresponding path program 1 times [2022-01-11 05:27:02,246 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:27:02,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103395096] [2022-01-11 05:27:02,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:27:02,247 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:27:02,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:27:02,500 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-11 05:27:02,501 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:27:02,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103395096] [2022-01-11 05:27:02,501 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103395096] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:27:02,501 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:27:02,501 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 05:27:02,504 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671661767] [2022-01-11 05:27:02,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:27:02,509 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-11 05:27:02,509 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:27:02,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-11 05:27:02,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-11 05:27:02,535 INFO L87 Difference]: Start difference. First operand has 42 states, 40 states have (on average 1.525) internal successors, (61), 41 states have internal predecessors, (61), 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-11 05:27:02,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:27:02,550 INFO L93 Difference]: Finished difference Result 73 states and 107 transitions. [2022-01-11 05:27:02,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-11 05:27:02,551 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-11 05:27:02,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:27:02,560 INFO L225 Difference]: With dead ends: 73 [2022-01-11 05:27:02,561 INFO L226 Difference]: Without dead ends: 32 [2022-01-11 05:27:02,563 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-11 05:27:02,566 INFO L933 BasicCegarLoop]: 55 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, 55 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-11 05:27:02,567 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:27:02,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-01-11 05:27:02,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-01-11 05:27:02,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 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-11 05:27:02,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2022-01-11 05:27:02,593 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 17 [2022-01-11 05:27:02,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:27:02,594 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2022-01-11 05:27:02,594 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-11 05:27:02,596 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-01-11 05:27:02,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-11 05:27:02,596 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:27:02,596 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:27:02,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 05:27:02,597 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:27:02,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:27:02,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1221747447, now seen corresponding path program 1 times [2022-01-11 05:27:02,598 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:27:02,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591840280] [2022-01-11 05:27:02,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:27:02,599 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:27:02,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:27:02,711 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-11 05:27:02,712 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:27:02,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591840280] [2022-01-11 05:27:02,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591840280] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:27:02,712 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:27:02,712 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 05:27:02,712 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077879312] [2022-01-11 05:27:02,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:27:02,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 05:27:02,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:27:02,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 05:27:02,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 05:27:02,714 INFO L87 Difference]: Start difference. First operand 32 states and 40 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-11 05:27:02,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:27:02,742 INFO L93 Difference]: Finished difference Result 62 states and 80 transitions. [2022-01-11 05:27:02,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 05:27:02,742 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-11 05:27:02,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:27:02,744 INFO L225 Difference]: With dead ends: 62 [2022-01-11 05:27:02,744 INFO L226 Difference]: Without dead ends: 48 [2022-01-11 05:27:02,747 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-11 05:27:02,749 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 22 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 89 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-11 05:27:02,750 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 89 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:27:02,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-01-11 05:27:02,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2022-01-11 05:27:02,754 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-11 05:27:02,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-01-11 05:27:02,754 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 17 [2022-01-11 05:27:02,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:27:02,754 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-01-11 05:27:02,755 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-11 05:27:02,755 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-01-11 05:27:02,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-11 05:27:02,755 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:27:02,755 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-11 05:27:02,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 05:27:02,755 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:27:02,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:27:02,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1608840983, now seen corresponding path program 1 times [2022-01-11 05:27:02,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:27:02,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741669271] [2022-01-11 05:27:02,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:27:02,756 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:27:02,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:27:02,925 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-11 05:27:02,926 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:27:02,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741669271] [2022-01-11 05:27:02,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741669271] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:27:02,926 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:27:02,927 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 05:27:02,927 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999687876] [2022-01-11 05:27:02,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:27:02,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 05:27:02,927 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:27:02,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 05:27:02,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 05:27:02,928 INFO L87 Difference]: Start difference. First operand 34 states and 43 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-11 05:27:02,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:27:02,959 INFO L93 Difference]: Finished difference Result 63 states and 81 transitions. [2022-01-11 05:27:02,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 05:27:02,960 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-11 05:27:02,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:27:02,962 INFO L225 Difference]: With dead ends: 63 [2022-01-11 05:27:02,962 INFO L226 Difference]: Without dead ends: 38 [2022-01-11 05:27:02,964 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-11 05:27:02,967 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 3 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 05:27:02,967 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 69 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:27:02,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-01-11 05:27:02,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2022-01-11 05:27:02,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 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-11 05:27:02,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2022-01-11 05:27:02,970 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 18 [2022-01-11 05:27:02,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:27:02,970 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2022-01-11 05:27:02,971 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-11 05:27:02,971 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-01-11 05:27:02,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-11 05:27:02,971 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:27:02,971 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] [2022-01-11 05:27:02,971 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 05:27:02,971 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:27:02,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:27:02,972 INFO L85 PathProgramCache]: Analyzing trace with hash -880076399, now seen corresponding path program 1 times [2022-01-11 05:27:02,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:27:02,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533180635] [2022-01-11 05:27:02,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:27:02,972 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:27:03,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:27:04,067 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-11 05:27:04,067 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:27:04,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533180635] [2022-01-11 05:27:04,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533180635] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:27:04,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688039703] [2022-01-11 05:27:04,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:27:04,068 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:27:04,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:27:04,069 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-11 05:27:04,086 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-11 05:27:04,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:27:04,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 111 conjunts are in the unsatisfiable core [2022-01-11 05:27:04,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:27:04,531 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-11 05:27:04,532 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2022-01-11 05:27:04,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:27:04,781 INFO L353 Elim1Store]: treesize reduction 26, result has 27.8 percent of original size [2022-01-11 05:27:04,782 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 29 [2022-01-11 05:27:04,900 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-11 05:27:04,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:27:04,970 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-11 05:27:05,086 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-11 05:27:05,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:27:05,229 INFO L353 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-01-11 05:27:05,229 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 27 treesize of output 27 [2022-01-11 05:27:05,383 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 43 treesize of output 41 [2022-01-11 05:27:05,388 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-11 05:27:05,394 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 40 treesize of output 38 [2022-01-11 05:27:05,749 INFO L353 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-01-11 05:27:05,750 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 2 case distinctions, treesize of input 102 treesize of output 95 [2022-01-11 05:27:05,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:27:05,763 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2022-01-11 05:27:05,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:27:05,770 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 49 [2022-01-11 05:27:05,778 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-11 05:27:05,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:27:05,784 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 54 [2022-01-11 05:27:05,894 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 51 treesize of output 35 [2022-01-11 05:27:05,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:27:05,903 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 27 [2022-01-11 05:27:05,968 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-11 05:27:06,008 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-11 05:27:06,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:27:06,158 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_296 Int) (v_ArrVal_298 (Array Int Int)) (v_ArrVal_300 (Array Int Int)) (v_ArrVal_299 (Array Int Int)) (v_ArrVal_302 (Array Int Int))) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1Int| (select (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.baseInt| (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offsetInt| v_ArrVal_296)) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~new_node~0#1.baseInt| v_ArrVal_298) (select (select (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.baseInt| v_ArrVal_300) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~new_node~0#1.baseInt| v_ArrVal_302) |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 |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offsetInt|)) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~new_node~0#1.baseInt| v_ArrVal_299) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (+ (* (- 18446744073709551616) (div (+ 8 .cse0) 18446744073709551616)) 8 .cse0))))) (forall ((v_ArrVal_296 Int) (v_ArrVal_298 (Array Int Int)) (v_ArrVal_300 (Array Int Int)) (v_ArrVal_299 (Array Int Int)) (v_ArrVal_302 (Array Int Int))) (<= (select (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.baseInt| (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offsetInt| v_ArrVal_296)) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~new_node~0#1.baseInt| v_ArrVal_298) (select (select (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.baseInt| v_ArrVal_300) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~new_node~0#1.baseInt| v_ArrVal_302) |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 |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offsetInt|)) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~new_node~0#1.baseInt| v_ArrVal_299) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (+ (* (- 18446744073709551616) (div (+ 8 .cse1) 18446744073709551616)) 8 .cse1))) |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1Int|))) is different from false [2022-01-11 05:27:06,187 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_296 Int) (v_ArrVal_298 (Array Int Int)) (v_ArrVal_300 (Array Int Int)) (v_ArrVal_299 (Array Int Int)) (v_ArrVal_302 (Array Int Int))) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1Int| (select (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~last~1#1.baseInt| (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~last~1#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~last~1#1.offsetInt| v_ArrVal_296)) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~new_node~0#1.baseInt| v_ArrVal_298) (select (select (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~last~1#1.baseInt| v_ArrVal_300) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~new_node~0#1.baseInt| v_ArrVal_302) |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 |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~last~1#1.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~last~1#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~last~1#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offsetInt|)) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~new_node~0#1.baseInt| v_ArrVal_299) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (+ (* (- 18446744073709551616) (div (+ 8 .cse0) 18446744073709551616)) 8 .cse0))))) (forall ((v_ArrVal_296 Int) (v_ArrVal_298 (Array Int Int)) (v_ArrVal_300 (Array Int Int)) (v_ArrVal_299 (Array Int Int)) (v_ArrVal_302 (Array Int Int))) (<= (select (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~last~1#1.baseInt| (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~last~1#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~last~1#1.offsetInt| v_ArrVal_296)) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~new_node~0#1.baseInt| v_ArrVal_298) (select (select (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~last~1#1.baseInt| v_ArrVal_300) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~new_node~0#1.baseInt| v_ArrVal_302) |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 |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~last~1#1.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~last~1#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~last~1#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offsetInt|)) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~new_node~0#1.baseInt| v_ArrVal_299) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (+ (* (- 18446744073709551616) (div (+ 8 .cse1) 18446744073709551616)) 8 .cse1))) |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1Int|))) is different from false [2022-01-11 05:27:06,224 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_296 Int) (v_ArrVal_298 (Array Int Int)) (v_ArrVal_300 (Array Int Int)) (v_ArrVal_299 (Array Int Int)) (v_ArrVal_302 (Array Int Int))) (<= (let ((.cse0 (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~head#1.offsetInt|)) (.cse1 (select (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~head#1.offsetInt|))) (select (select (store (store |c_#memory_intInt| .cse0 (store (select |c_#memory_intInt| .cse0) .cse1 v_ArrVal_296)) |c_ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt| v_ArrVal_298) (select (select (store (store |c_#memory_$Pointer$.baseInt| .cse0 v_ArrVal_300) |c_ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt| v_ArrVal_302) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|)) (let ((.cse2 (select (select (store (store |c_#memory_$Pointer$.offsetInt| .cse0 (store (select |c_#memory_$Pointer$.offsetInt| .cse0) .cse1 |c_ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt|)) |c_ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt| v_ArrVal_299) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (+ (* (- 18446744073709551616) (div (+ .cse2 8) 18446744073709551616)) .cse2 8)))) |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1Int|)) (forall ((v_ArrVal_296 Int) (v_ArrVal_298 (Array Int Int)) (v_ArrVal_300 (Array Int Int)) (v_ArrVal_299 (Array Int Int)) (v_ArrVal_302 (Array Int Int))) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1Int| (let ((.cse3 (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~head#1.offsetInt|)) (.cse4 (select (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~head#1.offsetInt|))) (select (select (store (store |c_#memory_intInt| .cse3 (store (select |c_#memory_intInt| .cse3) .cse4 v_ArrVal_296)) |c_ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt| v_ArrVal_298) (select (select (store (store |c_#memory_$Pointer$.baseInt| .cse3 v_ArrVal_300) |c_ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt| v_ArrVal_302) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|)) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.offsetInt| .cse3 (store (select |c_#memory_$Pointer$.offsetInt| .cse3) .cse4 |c_ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt|)) |c_ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt| v_ArrVal_299) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (+ (* (- 18446744073709551616) (div (+ .cse5 8) 18446744073709551616)) .cse5 8))))))) is different from false [2022-01-11 05:27:06,254 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (v_ArrVal_296 Int) (v_ArrVal_293 (Array Int Int)) (v_ArrVal_298 (Array Int Int)) (v_ArrVal_300 (Array Int Int)) (v_ArrVal_299 (Array Int Int)) (v_ArrVal_302 (Array Int Int))) (<= (let ((.cse5 (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_292)) (.cse3 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_293))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~head#1.offsetInt|)) (.cse2 (select (select .cse5 |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~head#1.offsetInt|))) (select (select (store (let ((.cse0 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_291))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_296))) |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_298) (select (select (store (store .cse3 .cse1 v_ArrVal_300) |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_302) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|)) (let ((.cse4 (select (select (store (store .cse5 .cse1 (store (select .cse5 .cse1) .cse2 |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt|)) |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_299) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (+ .cse4 8 (* (div (+ .cse4 8) 18446744073709551616) (- 18446744073709551616))))))) |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1Int|)) (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (v_ArrVal_296 Int) (v_ArrVal_293 (Array Int Int)) (v_ArrVal_298 (Array Int Int)) (v_ArrVal_300 (Array Int Int)) (v_ArrVal_299 (Array Int Int)) (v_ArrVal_302 (Array Int Int))) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1Int| (let ((.cse11 (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_292)) (.cse9 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_293))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~head#1.offsetInt|)) (.cse8 (select (select .cse11 |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~head#1.offsetInt|))) (select (select (store (let ((.cse6 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_291))) (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 v_ArrVal_296))) |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_298) (select (select (store (store .cse9 .cse7 v_ArrVal_300) |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_302) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|)) (let ((.cse10 (select (select (store (store .cse11 .cse7 (store (select .cse11 .cse7) .cse8 |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt|)) |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_299) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (+ .cse10 8 (* (div (+ .cse10 8) 18446744073709551616) (- 18446744073709551616)))))))))) is different from false [2022-01-11 05:27:06,304 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 6170 treesize of output 5486 [2022-01-11 05:27:09,749 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:27:09,755 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 521074 treesize of output 497836 [2022-01-11 05:27:12,381 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 497765 treesize of output 491621 [2022-01-11 05:27:13,472 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 520709 treesize of output 505605 [2022-01-11 05:27:14,740 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 505638 treesize of output 488224 [2022-01-11 05:27:15,706 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 488197 treesize of output 484677 [2022-01-11 05:27:17,017 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 484677 treesize of output 472389 [2022-01-11 05:27:18,184 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 487125 treesize of output 477525 [2022-01-11 05:27:19,430 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 477525 treesize of output 474261 [2022-01-11 05:27:20,713 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 474292 treesize of output 466406 [2022-01-11 05:27:22,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 466381 treesize of output 460749 [2022-01-11 05:27:23,388 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 460749 treesize of output 459117 [2022-01-11 05:27:25,164 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2022-01-11 05:27:25,164 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-01-11 05:27:25,164 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-01-11 05:27:25,164 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322592505] [2022-01-11 05:27:25,164 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-01-11 05:27:25,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-11 05:27:25,165 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:27:25,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-11 05:27:25,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=849, Unknown=4, NotChecked=244, Total=1190 [2022-01-11 05:27:25,166 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 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-11 05:27:27,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:27:27,102 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2022-01-11 05:27:27,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-11 05:27:27,103 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 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 22 [2022-01-11 05:27:27,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:27:27,104 INFO L225 Difference]: With dead ends: 62 [2022-01-11 05:27:27,104 INFO L226 Difference]: Without dead ends: 60 [2022-01-11 05:27:27,105 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=236, Invalid=1668, Unknown=4, NotChecked=348, Total=2256 [2022-01-11 05:27:27,106 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 249 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-11 05:27:27,106 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 113 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-11 05:27:27,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-01-11 05:27:27,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 40. [2022-01-11 05:27:27,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 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-11 05:27:27,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2022-01-11 05:27:27,112 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 22 [2022-01-11 05:27:27,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:27:27,113 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 51 transitions. [2022-01-11 05:27:27,113 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 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-11 05:27:27,113 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2022-01-11 05:27:27,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-11 05:27:27,113 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:27:27,113 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] [2022-01-11 05:27:27,134 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-11 05:27:27,328 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-11 05:27:27,328 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:27:27,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:27:27,329 INFO L85 PathProgramCache]: Analyzing trace with hash -684258417, now seen corresponding path program 2 times [2022-01-11 05:27:27,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:27:27,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963463891] [2022-01-11 05:27:27,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:27:27,329 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:27:27,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:27:27,535 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-11 05:27:27,535 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:27:27,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963463891] [2022-01-11 05:27:27,535 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963463891] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:27:27,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078413094] [2022-01-11 05:27:27,536 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-11 05:27:27,536 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:27:27,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:27:27,537 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-11 05:27:27,538 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-11 05:27:28,232 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-11 05:27:28,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-11 05:27:28,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-11 05:27:28,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:27:28,476 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:27:28,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:28:12,151 WARN L228 SmtUtils]: Spent 5.07s on a formula simplification. DAG size of input: 14 DAG size of output: 1 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)