/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/list-simple/sll2c_update_all_reverse.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 06:09:10,670 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 06:09:10,678 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 06:09:10,708 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 06:09:10,708 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 06:09:10,709 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 06:09:10,710 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 06:09:10,711 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 06:09:10,713 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 06:09:10,713 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 06:09:10,714 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 06:09:10,715 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 06:09:10,715 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 06:09:10,716 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 06:09:10,716 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 06:09:10,717 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 06:09:10,718 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 06:09:10,719 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 06:09:10,720 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 06:09:10,722 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 06:09:10,723 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 06:09:10,730 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 06:09:10,730 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 06:09:10,731 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 06:09:10,733 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 06:09:10,733 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 06:09:10,733 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 06:09:10,734 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 06:09:10,734 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 06:09:10,735 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 06:09:10,735 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 06:09:10,735 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 06:09:10,736 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 06:09:10,736 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 06:09:10,737 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 06:09:10,737 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 06:09:10,738 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 06:09:10,738 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 06:09:10,738 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 06:09:10,739 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 06:09:10,739 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 06:09:10,740 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-01-10 06:09:10,764 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 06:09:10,764 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 06:09:10,765 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 06:09:10,765 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 06:09:10,765 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 06:09:10,765 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 06:09:10,766 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 06:09:10,766 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 06:09:10,766 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 06:09:10,766 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 06:09:10,766 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 06:09:10,766 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 06:09:10,767 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 06:09:10,767 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 06:09:10,767 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 06:09:10,767 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 06:09:10,767 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 06:09:10,767 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 06:09:10,767 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 06:09:10,767 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 06:09:10,768 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 06:09:10,768 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 06:09:10,768 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 06:09:10,768 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 06:09:10,768 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 06:09:10,768 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 06:09:10,768 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 06:09:10,768 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 06:09:10,769 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 06:09:10,769 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 06:09:10,769 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 06:09:10,769 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 06:09:10,769 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 06:09:10,769 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 06:09:10,999 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 06:09:11,020 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 06:09:11,023 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 06:09:11,024 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 06:09:11,024 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 06:09:11,025 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2c_update_all_reverse.i [2022-01-10 06:09:11,092 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d58e8f67/2c772a2ee48b475db5efbf01192b235e/FLAGc341e34b3 [2022-01-10 06:09:11,508 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 06:09:11,508 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_update_all_reverse.i [2022-01-10 06:09:11,517 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d58e8f67/2c772a2ee48b475db5efbf01192b235e/FLAGc341e34b3 [2022-01-10 06:09:11,531 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d58e8f67/2c772a2ee48b475db5efbf01192b235e [2022-01-10 06:09:11,533 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 06:09:11,534 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 06:09:11,536 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 06:09:11,536 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 06:09:11,538 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 06:09:11,539 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:09:11" (1/1) ... [2022-01-10 06:09:11,539 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@561901b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:09:11, skipping insertion in model container [2022-01-10 06:09:11,540 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:09:11" (1/1) ... [2022-01-10 06:09:11,544 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 06:09:11,573 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 06:09:11,779 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_update_all_reverse.i[24436,24449] [2022-01-10 06:09:11,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 06:09:11,795 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 06:09:11,834 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_update_all_reverse.i[24436,24449] [2022-01-10 06:09:11,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 06:09:11,851 INFO L208 MainTranslator]: Completed translation [2022-01-10 06:09:11,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:09:11 WrapperNode [2022-01-10 06:09:11,852 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 06:09:11,852 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 06:09:11,852 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 06:09:11,853 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 06:09:11,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:09:11" (1/1) ... [2022-01-10 06:09:11,868 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:09:11" (1/1) ... [2022-01-10 06:09:11,883 INFO L137 Inliner]: procedures = 129, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 127 [2022-01-10 06:09:11,884 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 06:09:11,884 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 06:09:11,884 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 06:09:11,884 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 06:09:11,889 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:09:11" (1/1) ... [2022-01-10 06:09:11,889 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:09:11" (1/1) ... [2022-01-10 06:09:11,893 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:09:11" (1/1) ... [2022-01-10 06:09:11,893 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:09:11" (1/1) ... [2022-01-10 06:09:11,898 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:09:11" (1/1) ... [2022-01-10 06:09:11,901 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:09:11" (1/1) ... [2022-01-10 06:09:11,904 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:09:11" (1/1) ... [2022-01-10 06:09:11,906 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 06:09:11,908 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 06:09:11,908 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 06:09:11,908 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 06:09:11,909 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:09:11" (1/1) ... [2022-01-10 06:09:11,918 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 06:09:11,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 06:09:11,938 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 06:09:11,940 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 06:09:11,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 06:09:11,966 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-01-10 06:09:11,966 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-01-10 06:09:11,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 06:09:11,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 06:09:11,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 06:09:11,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 06:09:11,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 06:09:11,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 06:09:11,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 06:09:11,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 06:09:11,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 06:09:12,068 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 06:09:12,069 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 06:09:12,286 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 06:09:12,291 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 06:09:12,292 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-01-10 06:09:12,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:09:12 BoogieIcfgContainer [2022-01-10 06:09:12,293 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 06:09:12,294 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 06:09:12,295 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 06:09:12,297 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 06:09:12,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:09:11" (1/3) ... [2022-01-10 06:09:12,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cf680e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:09:12, skipping insertion in model container [2022-01-10 06:09:12,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:09:11" (2/3) ... [2022-01-10 06:09:12,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cf680e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:09:12, skipping insertion in model container [2022-01-10 06:09:12,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:09:12" (3/3) ... [2022-01-10 06:09:12,300 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_update_all_reverse.i [2022-01-10 06:09:12,308 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 06:09:12,309 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 06:09:12,363 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 06:09:12,373 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 06:09:12,374 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 06:09:12,397 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 32 states have (on average 1.5) internal successors, (48), 33 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 06:09:12,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-10 06:09:12,402 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:09:12,403 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] [2022-01-10 06:09:12,404 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:09:12,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:09:12,408 INFO L85 PathProgramCache]: Analyzing trace with hash 663980757, now seen corresponding path program 1 times [2022-01-10 06:09:12,419 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:09:12,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1700936481] [2022-01-10 06:09:12,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:09:12,420 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:09:12,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:09:12,423 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:09:12,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-01-10 06:09:12,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:09:12,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 1 conjunts are in the unsatisfiable core [2022-01-10 06:09:12,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:12,580 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 06:09:12,580 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:09:12,581 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:09:12,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1700936481] [2022-01-10 06:09:12,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1700936481] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:09:12,582 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:09:12,582 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 06:09:12,583 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969071503] [2022-01-10 06:09:12,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:09:12,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 06:09:12,588 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:09:12,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 06:09:12,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 06:09:12,618 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.5) internal successors, (48), 33 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 06:09:12,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:09:12,633 INFO L93 Difference]: Finished difference Result 61 states and 87 transitions. [2022-01-10 06:09:12,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 06:09:12,634 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-01-10 06:09:12,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:09:12,638 INFO L225 Difference]: With dead ends: 61 [2022-01-10 06:09:12,639 INFO L226 Difference]: Without dead ends: 28 [2022-01-10 06:09:12,641 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 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 06:09:12,643 INFO L933 BasicCegarLoop]: 45 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, 45 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 06:09:12,644 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:09:12,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-01-10 06:09:12,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-01-10 06:09:12,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 06:09:12,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2022-01-10 06:09:12,672 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 20 [2022-01-10 06:09:12,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:09:12,673 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-01-10 06:09:12,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 06:09:12,673 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-01-10 06:09:12,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-10 06:09:12,675 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:09:12,675 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] [2022-01-10 06:09:12,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-01-10 06:09:12,876 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:09:12,876 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:09:12,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:09:12,877 INFO L85 PathProgramCache]: Analyzing trace with hash 616475652, now seen corresponding path program 1 times [2022-01-10 06:09:12,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:09:12,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [737051507] [2022-01-10 06:09:12,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:09:12,879 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:09:12,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:09:12,880 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:09:12,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-01-10 06:09:12,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:09:12,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 06:09:12,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:13,050 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 06:09:13,050 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:09:13,050 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:09:13,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [737051507] [2022-01-10 06:09:13,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [737051507] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:09:13,051 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:09:13,051 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 06:09:13,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100165250] [2022-01-10 06:09:13,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:09:13,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 06:09:13,055 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:09:13,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 06:09:13,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:09:13,056 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 06:09:13,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:09:13,071 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-01-10 06:09:13,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 06:09:13,073 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-01-10 06:09:13,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:09:13,074 INFO L225 Difference]: With dead ends: 47 [2022-01-10 06:09:13,074 INFO L226 Difference]: Without dead ends: 31 [2022-01-10 06:09:13,074 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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 06:09:13,075 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:09:13,075 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 59 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:09:13,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-01-10 06:09:13,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2022-01-10 06:09:13,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 06:09:13,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2022-01-10 06:09:13,081 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 20 [2022-01-10 06:09:13,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:09:13,081 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2022-01-10 06:09:13,081 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 06:09:13,081 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-01-10 06:09:13,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-10 06:09:13,082 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:09:13,082 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:09:13,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-01-10 06:09:13,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:09:13,292 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:09:13,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:09:13,293 INFO L85 PathProgramCache]: Analyzing trace with hash -600691076, now seen corresponding path program 1 times [2022-01-10 06:09:13,293 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:09:13,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [618265033] [2022-01-10 06:09:13,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:09:13,293 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:09:13,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:09:13,294 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:09:13,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-01-10 06:09:13,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:09:13,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 06:09:13,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:13,464 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 06:09:13,464 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:09:13,464 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:09:13,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [618265033] [2022-01-10 06:09:13,464 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [618265033] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:09:13,465 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:09:13,465 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 06:09:13,465 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498627569] [2022-01-10 06:09:13,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:09:13,465 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 06:09:13,466 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:09:13,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 06:09:13,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 06:09:13,466 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 06:09:13,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:09:13,501 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2022-01-10 06:09:13,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 06:09:13,501 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2022-01-10 06:09:13,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:09:13,503 INFO L225 Difference]: With dead ends: 51 [2022-01-10 06:09:13,503 INFO L226 Difference]: Without dead ends: 42 [2022-01-10 06:09:13,504 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 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 06:09:13,506 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 44 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:09:13,507 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 59 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:09:13,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-01-10 06:09:13,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2022-01-10 06:09:13,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 06:09:13,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-01-10 06:09:13,518 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 28 [2022-01-10 06:09:13,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:09:13,518 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-01-10 06:09:13,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 06:09:13,519 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-01-10 06:09:13,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-10 06:09:13,519 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:09:13,519 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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 06:09:13,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-01-10 06:09:13,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:09:13,733 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:09:13,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:09:13,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1948852891, now seen corresponding path program 1 times [2022-01-10 06:09:13,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:09:13,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2043425550] [2022-01-10 06:09:13,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:09:13,734 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:09:13,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:09:13,736 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:09:13,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-01-10 06:09:13,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:09:13,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 06:09:13,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:13,958 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 06:09:13,958 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:09:13,958 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:09:13,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2043425550] [2022-01-10 06:09:13,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2043425550] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:09:13,959 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:09:13,959 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 06:09:13,959 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250047577] [2022-01-10 06:09:13,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:09:13,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 06:09:13,960 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:09:13,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 06:09:13,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 06:09:13,961 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 06:09:14,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:09:14,017 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2022-01-10 06:09:14,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 06:09:14,017 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2022-01-10 06:09:14,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:09:14,018 INFO L225 Difference]: With dead ends: 57 [2022-01-10 06:09:14,018 INFO L226 Difference]: Without dead ends: 43 [2022-01-10 06:09:14,021 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 06:09:14,025 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 44 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:09:14,026 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 83 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:09:14,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-01-10 06:09:14,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2022-01-10 06:09:14,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 06:09:14,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2022-01-10 06:09:14,037 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 33 [2022-01-10 06:09:14,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:09:14,045 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-01-10 06:09:14,045 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 06:09:14,046 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-01-10 06:09:14,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-10 06:09:14,046 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:09:14,046 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1] [2022-01-10 06:09:14,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-01-10 06:09:14,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:09:14,255 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:09:14,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:09:14,255 INFO L85 PathProgramCache]: Analyzing trace with hash -2082169171, now seen corresponding path program 1 times [2022-01-10 06:09:14,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:09:14,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [765339065] [2022-01-10 06:09:14,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:09:14,256 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:09:14,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:09:14,257 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:09:14,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-01-10 06:09:14,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:09:14,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 06:09:14,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:14,479 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-10 06:09:14,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:09:14,612 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-10 06:09:14,613 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:09:14,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [765339065] [2022-01-10 06:09:14,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [765339065] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:09:14,613 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:09:14,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-01-10 06:09:14,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405733455] [2022-01-10 06:09:14,614 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:09:14,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 06:09:14,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:09:14,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 06:09:14,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-10 06:09:14,615 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 06:09:14,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:09:14,693 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2022-01-10 06:09:14,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 06:09:14,694 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-01-10 06:09:14,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:09:14,696 INFO L225 Difference]: With dead ends: 65 [2022-01-10 06:09:14,696 INFO L226 Difference]: Without dead ends: 56 [2022-01-10 06:09:14,697 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-01-10 06:09:14,697 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 150 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:09:14,698 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 95 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:09:14,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-01-10 06:09:14,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 36. [2022-01-10 06:09:14,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 06:09:14,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2022-01-10 06:09:14,708 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 34 [2022-01-10 06:09:14,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:09:14,709 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-01-10 06:09:14,709 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 06:09:14,709 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-01-10 06:09:14,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-10 06:09:14,712 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:09:14,712 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:09:14,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-01-10 06:09:14,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:09:14,923 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:09:14,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:09:14,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1439163348, now seen corresponding path program 2 times [2022-01-10 06:09:14,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:09:14,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [235904054] [2022-01-10 06:09:14,924 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 06:09:14,924 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:09:14,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:09:14,925 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:09:14,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-01-10 06:09:15,004 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-10 06:09:15,004 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:09:15,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 06:09:15,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:15,097 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-10 06:09:15,097 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:09:15,098 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:09:15,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [235904054] [2022-01-10 06:09:15,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [235904054] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:09:15,098 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:09:15,098 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 06:09:15,098 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372290187] [2022-01-10 06:09:15,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:09:15,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 06:09:15,098 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:09:15,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 06:09:15,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 06:09:15,099 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 06:09:15,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:09:15,142 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2022-01-10 06:09:15,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 06:09:15,142 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2022-01-10 06:09:15,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:09:15,145 INFO L225 Difference]: With dead ends: 53 [2022-01-10 06:09:15,145 INFO L226 Difference]: Without dead ends: 45 [2022-01-10 06:09:15,145 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 06:09:15,146 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 31 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:09:15,147 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 83 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:09:15,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-01-10 06:09:15,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2022-01-10 06:09:15,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 06:09:15,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2022-01-10 06:09:15,156 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 39 [2022-01-10 06:09:15,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:09:15,157 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2022-01-10 06:09:15,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 06:09:15,157 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-01-10 06:09:15,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-10 06:09:15,161 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:09:15,161 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:09:15,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-01-10 06:09:15,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:09:15,367 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:09:15,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:09:15,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1716044715, now seen corresponding path program 1 times [2022-01-10 06:09:15,368 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:09:15,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [188588764] [2022-01-10 06:09:15,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:09:15,369 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:09:15,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:09:15,370 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:09:15,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-01-10 06:09:15,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:09:15,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 68 conjunts are in the unsatisfiable core [2022-01-10 06:09:15,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:15,608 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 06:09:15,729 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 06:09:15,730 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-01-10 06:09:15,768 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 06:09:15,773 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 06:09:15,828 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 06:09:15,829 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 29 treesize of output 30 [2022-01-10 06:09:15,833 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 10 treesize of output 9 [2022-01-10 06:09:16,109 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 06:09:16,110 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 58 treesize of output 55 [2022-01-10 06:09:16,115 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2022-01-10 06:09:16,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:16,120 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 32 treesize of output 34 [2022-01-10 06:09:16,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:16,395 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2022-01-10 06:09:16,402 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-01-10 06:09:16,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:16,407 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 35 treesize of output 34 [2022-01-10 06:09:16,855 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 40 treesize of output 28 [2022-01-10 06:09:16,869 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2022-01-10 06:09:17,145 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 26 treesize of output 14 [2022-01-10 06:09:17,538 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 06:09:17,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:09:18,735 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_268 (_ BitVec 64)) (v_ArrVal_267 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_264 (_ BitVec 64))) (= (bvadd (_ bv4294967295 32) (bvmul (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|)) (let ((.cse0 (bvadd (_ bv8 64) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_267) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse0 v_ArrVal_268)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse0 v_ArrVal_264)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv8 64)))))) is different from false [2022-01-10 06:09:18,796 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_268 (_ BitVec 64)) (v_ArrVal_267 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_264 (_ BitVec 64))) (= (bvadd (_ bv4294967295 32) (bvmul (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|)) (let ((.cse0 (bvadd (_ bv8 64) |c_ULTIMATE.start_main_~s~0#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_267) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_268) |c_ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_264) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv8 64)))))) is different from false [2022-01-10 06:09:18,840 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:09:18,841 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 51 [2022-01-10 06:09:18,866 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:09:18,867 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 107 [2022-01-10 06:09:18,879 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 39 treesize of output 23 [2022-01-10 06:09:18,998 WARN L838 $PredicateComparison]: unable to prove that (and (= (bvadd (_ bv4294967295 32) (bvmul (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|)) |c_ULTIMATE.start_sll_circular_update_at_~data#1|) (forall ((v_ArrVal_268 (_ BitVec 64)) (v_ArrVal_263 (Array (_ BitVec 64) (_ BitVec 64)))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_268) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_261 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_264 (_ BitVec 64))) (= (bvadd (_ bv8 64) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (bvadd (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_261) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_264) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv8 64)))) (forall ((v_ArrVal_268 (_ BitVec 64)) (v_ArrVal_263 (Array (_ BitVec 64) (_ BitVec 64)))) (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_268) |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2022-01-10 06:09:19,074 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_268 (_ BitVec 64)) (v_ArrVal_263 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_263) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_268) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse0))) (forall ((v_ArrVal_261 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_264 (_ BitVec 64))) (= (bvadd (_ bv8 64) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (bvadd (_ bv8 64) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_261) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_264) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (= (bvadd (_ bv4294967295 32) (bvmul (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|)) |c_ULTIMATE.start_sll_circular_update_at_~data#1|) (forall ((v_ArrVal_268 (_ BitVec 64)) (v_ArrVal_263 (Array (_ BitVec 64) (_ BitVec 64)))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_263) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_268) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)))) is different from false [2022-01-10 06:09:19,114 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_268 (_ BitVec 64)) (v_ArrVal_263 (Array (_ BitVec 64) (_ BitVec 64)))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_263) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_268) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))) (= (bvadd (_ bv4294967295 32) (bvmul (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|)) (bvadd |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (forall ((v_ArrVal_268 (_ BitVec 64)) (v_ArrVal_263 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_263) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_268) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse0))) (forall ((v_ArrVal_261 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_264 (_ BitVec 64))) (= (bvadd (_ bv8 64) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_261) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_264) |c_ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 64) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2022-01-10 06:09:19,144 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_268 (_ BitVec 64)) (v_ArrVal_263 (Array (_ BitVec 64) (_ BitVec 64)))) (not (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_263) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_268) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)))) (forall ((v_ArrVal_268 (_ BitVec 64)) (v_ArrVal_263 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_263) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_268) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)))) (forall ((v_ArrVal_261 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_264 (_ BitVec 64))) (= (bvadd (_ bv8 64) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_261) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_264) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (bvadd (_ bv8 64) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))))) is different from false [2022-01-10 06:09:19,187 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_259 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_261 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_264 (_ BitVec 64)) (v_ArrVal_258 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_258))) (= (bvadd (select (store (select (store .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_261) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_264) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (_ bv8 64)) (bvadd (_ bv8 64) (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) (forall ((v_ArrVal_268 (_ BitVec 64)) (v_ArrVal_259 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_263 (Array (_ BitVec 64) (_ BitVec 64)))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (store (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_259))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_263)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_268) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_268 (_ BitVec 64)) (v_ArrVal_259 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_263 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_259))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= .cse2 (select (store (select (store .cse3 .cse2 v_ArrVal_263) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_268) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) is different from false [2022-01-10 06:09:19,251 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:09:19,252 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 41 [2022-01-10 06:09:19,257 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 262 treesize of output 240 [2022-01-10 06:09:19,262 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 06:09:19,265 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 214 treesize of output 206 [2022-01-10 06:09:19,271 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 06:09:19,274 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 188 treesize of output 172 [2022-01-10 06:09:19,282 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 191 treesize of output 171 [2022-01-10 06:09:19,516 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-10 06:09:19,517 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 1 [2022-01-10 06:09:19,529 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-10 06:09:19,530 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 1 [2022-01-10 06:09:20,289 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-01-10 06:09:20,289 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:09:20,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [188588764] [2022-01-10 06:09:20,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [188588764] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:09:20,290 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:09:20,290 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 40 [2022-01-10 06:09:20,290 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531525417] [2022-01-10 06:09:20,290 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:09:20,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-01-10 06:09:20,291 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:09:20,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-01-10 06:09:20,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=984, Unknown=7, NotChecked=476, Total=1560 [2022-01-10 06:09:20,292 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 40 states, 40 states have (on average 1.575) internal successors, (63), 35 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 06:09:22,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:09:22,809 INFO L93 Difference]: Finished difference Result 67 states and 81 transitions. [2022-01-10 06:09:22,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-10 06:09:22,810 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.575) internal successors, (63), 35 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 40 [2022-01-10 06:09:22,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:09:22,812 INFO L225 Difference]: With dead ends: 67 [2022-01-10 06:09:22,812 INFO L226 Difference]: Without dead ends: 65 [2022-01-10 06:09:22,813 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 36 SyntacticMatches, 9 SemanticMatches, 44 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=128, Invalid=1375, Unknown=7, NotChecked=560, Total=2070 [2022-01-10 06:09:22,814 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 244 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-10 06:09:22,814 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 515 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 346 Invalid, 0 Unknown, 244 Unchecked, 0.9s Time] [2022-01-10 06:09:22,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-01-10 06:09:22,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2022-01-10 06:09:22,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 57 states have (on average 1.1929824561403508) internal successors, (68), 57 states have internal predecessors, (68), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 06:09:22,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions. [2022-01-10 06:09:22,827 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 74 transitions. Word has length 40 [2022-01-10 06:09:22,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:09:22,827 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 74 transitions. [2022-01-10 06:09:22,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.575) internal successors, (63), 35 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 06:09:22,828 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. [2022-01-10 06:09:22,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-10 06:09:22,828 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:09:22,829 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:09:22,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-01-10 06:09:23,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:09:23,044 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:09:23,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:09:23,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1709432500, now seen corresponding path program 2 times [2022-01-10 06:09:23,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:09:23,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1627766624] [2022-01-10 06:09:23,046 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 06:09:23,046 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:09:23,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:09:23,048 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:09:23,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-01-10 06:09:23,237 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 06:09:23,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:09:23,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 06:09:23,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:23,345 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-10 06:09:23,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:09:23,500 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-10 06:09:23,500 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:09:23,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1627766624] [2022-01-10 06:09:23,501 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1627766624] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:09:23,501 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:09:23,501 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-01-10 06:09:23,501 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280997340] [2022-01-10 06:09:23,501 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:09:23,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 06:09:23,502 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:09:23,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 06:09:23,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-01-10 06:09:23,502 INFO L87 Difference]: Start difference. First operand 62 states and 74 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 06:09:23,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:09:23,780 INFO L93 Difference]: Finished difference Result 102 states and 120 transitions. [2022-01-10 06:09:23,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-10 06:09:23,780 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2022-01-10 06:09:23,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:09:23,781 INFO L225 Difference]: With dead ends: 102 [2022-01-10 06:09:23,781 INFO L226 Difference]: Without dead ends: 94 [2022-01-10 06:09:23,782 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2022-01-10 06:09:23,782 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 80 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:09:23,783 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 168 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 06:09:23,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-01-10 06:09:23,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 70. [2022-01-10 06:09:23,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 65 states have internal predecessors, (77), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 06:09:23,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2022-01-10 06:09:23,792 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 41 [2022-01-10 06:09:23,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:09:23,792 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2022-01-10 06:09:23,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 06:09:23,793 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-01-10 06:09:23,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-10 06:09:23,793 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:09:23,793 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:09:23,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-01-10 06:09:24,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:09:24,006 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:09:24,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:09:24,006 INFO L85 PathProgramCache]: Analyzing trace with hash 227314337, now seen corresponding path program 3 times [2022-01-10 06:09:24,007 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:09:24,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [421542188] [2022-01-10 06:09:24,007 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-10 06:09:24,007 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:09:24,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:09:24,009 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:09:24,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-01-10 06:09:24,304 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-01-10 06:09:24,305 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:09:24,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-10 06:09:24,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:24,426 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 06:09:24,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:09:24,722 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 06:09:24,722 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:09:24,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [421542188] [2022-01-10 06:09:24,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [421542188] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:09:24,723 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:09:24,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2022-01-10 06:09:24,723 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357991734] [2022-01-10 06:09:24,723 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:09:24,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-10 06:09:24,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:09:24,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-10 06:09:24,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-01-10 06:09:24,724 INFO L87 Difference]: Start difference. First operand 70 states and 83 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 06:09:25,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:09:25,330 INFO L93 Difference]: Finished difference Result 200 states and 237 transitions. [2022-01-10 06:09:25,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-10 06:09:25,331 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2022-01-10 06:09:25,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:09:25,332 INFO L225 Difference]: With dead ends: 200 [2022-01-10 06:09:25,332 INFO L226 Difference]: Without dead ends: 176 [2022-01-10 06:09:25,333 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=176, Invalid=526, Unknown=0, NotChecked=0, Total=702 [2022-01-10 06:09:25,333 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 458 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 06:09:25,334 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [458 Valid, 210 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 06:09:25,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-01-10 06:09:25,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 95. [2022-01-10 06:09:25,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 90 states have (on average 1.2333333333333334) internal successors, (111), 90 states have internal predecessors, (111), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 06:09:25,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 117 transitions. [2022-01-10 06:09:25,348 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 117 transitions. Word has length 41 [2022-01-10 06:09:25,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:09:25,348 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 117 transitions. [2022-01-10 06:09:25,348 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 06:09:25,349 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2022-01-10 06:09:25,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-10 06:09:25,349 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:09:25,349 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:09:25,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-01-10 06:09:25,562 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:09:25,563 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:09:25,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:09:25,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1346076317, now seen corresponding path program 4 times [2022-01-10 06:09:25,564 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:09:25,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1863424621] [2022-01-10 06:09:25,564 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-10 06:09:25,564 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:09:25,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:09:25,566 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:09:25,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-01-10 06:09:25,696 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-10 06:09:25,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:09:25,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 06:09:25,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:25,790 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-10 06:09:25,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:09:25,914 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-10 06:09:25,914 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:09:25,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1863424621] [2022-01-10 06:09:25,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1863424621] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:09:25,914 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:09:25,914 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-01-10 06:09:25,915 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882289883] [2022-01-10 06:09:25,915 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:09:25,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 06:09:25,915 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:09:25,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 06:09:25,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-01-10 06:09:25,916 INFO L87 Difference]: Start difference. First operand 95 states and 117 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 06:09:26,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:09:26,209 INFO L93 Difference]: Finished difference Result 180 states and 214 transitions. [2022-01-10 06:09:26,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 06:09:26,210 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2022-01-10 06:09:26,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:09:26,211 INFO L225 Difference]: With dead ends: 180 [2022-01-10 06:09:26,211 INFO L226 Difference]: Without dead ends: 137 [2022-01-10 06:09:26,212 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2022-01-10 06:09:26,212 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 276 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:09:26,213 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 135 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 06:09:26,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-01-10 06:09:26,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 95. [2022-01-10 06:09:26,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 90 states have (on average 1.211111111111111) internal successors, (109), 90 states have internal predecessors, (109), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 06:09:26,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 115 transitions. [2022-01-10 06:09:26,226 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 115 transitions. Word has length 41 [2022-01-10 06:09:26,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:09:26,226 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 115 transitions. [2022-01-10 06:09:26,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 06:09:26,227 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 115 transitions. [2022-01-10 06:09:26,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-10 06:09:26,227 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:09:26,227 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:09:26,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2022-01-10 06:09:26,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:09:26,434 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:09:26,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:09:26,434 INFO L85 PathProgramCache]: Analyzing trace with hash 474143318, now seen corresponding path program 1 times [2022-01-10 06:09:26,435 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:09:26,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [286591970] [2022-01-10 06:09:26,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:09:26,435 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:09:26,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:09:26,437 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:09:26,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-01-10 06:09:26,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:09:26,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 31 conjunts are in the unsatisfiable core [2022-01-10 06:09:26,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:26,907 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-01-10 06:09:27,241 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 06:09:27,287 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 06:09:27,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:09:27,648 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 46 treesize of output 40 [2022-01-10 06:09:27,880 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 06:09:27,880 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:09:27,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [286591970] [2022-01-10 06:09:27,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [286591970] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:09:27,880 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:09:27,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 26 [2022-01-10 06:09:27,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638988148] [2022-01-10 06:09:27,880 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:09:27,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-10 06:09:27,881 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:09:27,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-10 06:09:27,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2022-01-10 06:09:27,882 INFO L87 Difference]: Start difference. First operand 95 states and 115 transitions. Second operand has 26 states, 26 states have (on average 2.8461538461538463) internal successors, (74), 25 states have internal predecessors, (74), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 06:09:29,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:09:29,478 INFO L93 Difference]: Finished difference Result 144 states and 165 transitions. [2022-01-10 06:09:29,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-10 06:09:29,479 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.8461538461538463) internal successors, (74), 25 states have internal predecessors, (74), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2022-01-10 06:09:29,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:09:29,480 INFO L225 Difference]: With dead ends: 144 [2022-01-10 06:09:29,480 INFO L226 Difference]: Without dead ends: 142 [2022-01-10 06:09:29,481 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=282, Invalid=1440, Unknown=0, NotChecked=0, Total=1722 [2022-01-10 06:09:29,481 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 298 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-10 06:09:29,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [300 Valid, 482 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-10 06:09:29,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-01-10 06:09:29,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 115. [2022-01-10 06:09:29,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 110 states have (on average 1.190909090909091) internal successors, (131), 110 states have internal predecessors, (131), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 06:09:29,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 137 transitions. [2022-01-10 06:09:29,500 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 137 transitions. Word has length 46 [2022-01-10 06:09:29,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:09:29,500 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 137 transitions. [2022-01-10 06:09:29,500 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.8461538461538463) internal successors, (74), 25 states have internal predecessors, (74), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 06:09:29,500 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 137 transitions. [2022-01-10 06:09:29,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-10 06:09:29,501 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:09:29,501 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:09:29,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-01-10 06:09:29,713 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:09:29,714 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:09:29,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:09:29,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1865194857, now seen corresponding path program 2 times [2022-01-10 06:09:29,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:09:29,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1397123658] [2022-01-10 06:09:29,728 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 06:09:29,728 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:09:29,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:09:29,729 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:09:29,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-01-10 06:09:29,901 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 06:09:29,901 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:09:29,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-10 06:09:29,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:30,006 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 06:09:30,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:09:30,205 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 06:09:30,205 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:09:30,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1397123658] [2022-01-10 06:09:30,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1397123658] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:09:30,205 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:09:30,206 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-01-10 06:09:30,206 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192612266] [2022-01-10 06:09:30,206 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:09:30,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 06:09:30,206 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:09:30,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 06:09:30,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-01-10 06:09:30,207 INFO L87 Difference]: Start difference. First operand 115 states and 137 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 06:09:30,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:09:30,364 INFO L93 Difference]: Finished difference Result 125 states and 147 transitions. [2022-01-10 06:09:30,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 06:09:30,365 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2022-01-10 06:09:30,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:09:30,366 INFO L225 Difference]: With dead ends: 125 [2022-01-10 06:09:30,366 INFO L226 Difference]: Without dead ends: 116 [2022-01-10 06:09:30,367 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2022-01-10 06:09:30,368 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 45 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:09:30,368 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 187 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 06:09:30,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-01-10 06:09:30,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 103. [2022-01-10 06:09:30,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 98 states have (on average 1.1734693877551021) internal successors, (115), 98 states have internal predecessors, (115), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 06:09:30,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 121 transitions. [2022-01-10 06:09:30,389 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 121 transitions. Word has length 47 [2022-01-10 06:09:30,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:09:30,389 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 121 transitions. [2022-01-10 06:09:30,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 06:09:30,389 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 121 transitions. [2022-01-10 06:09:30,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-10 06:09:30,390 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:09:30,390 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:09:30,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-01-10 06:09:30,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:09:30,602 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:09:30,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:09:30,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1778593646, now seen corresponding path program 5 times [2022-01-10 06:09:30,603 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:09:30,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [309644519] [2022-01-10 06:09:30,604 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-10 06:09:30,604 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:09:30,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:09:30,616 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:09:30,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-01-10 06:09:30,742 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 06:09:30,743 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:09:30,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 06:09:30,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:30,856 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-10 06:09:30,856 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:09:30,856 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:09:30,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [309644519] [2022-01-10 06:09:30,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [309644519] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:09:30,856 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:09:30,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 06:09:30,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527593542] [2022-01-10 06:09:30,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:09:30,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 06:09:30,858 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:09:30,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 06:09:30,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 06:09:30,858 INFO L87 Difference]: Start difference. First operand 103 states and 121 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 06:09:30,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:09:30,931 INFO L93 Difference]: Finished difference Result 115 states and 133 transitions. [2022-01-10 06:09:30,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 06:09:30,932 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 47 [2022-01-10 06:09:30,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:09:30,932 INFO L225 Difference]: With dead ends: 115 [2022-01-10 06:09:30,932 INFO L226 Difference]: Without dead ends: 72 [2022-01-10 06:09:30,933 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 06:09:30,936 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:09:30,936 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 106 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:09:30,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-01-10 06:09:30,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-01-10 06:09:30,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 67 states have (on average 1.0597014925373134) internal successors, (71), 67 states have internal predecessors, (71), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 06:09:30,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2022-01-10 06:09:30,954 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 47 [2022-01-10 06:09:30,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:09:30,954 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2022-01-10 06:09:30,954 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 06:09:30,954 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2022-01-10 06:09:30,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-10 06:09:30,955 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:09:30,955 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:09:30,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-01-10 06:09:31,164 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:09:31,164 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:09:31,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:09:31,164 INFO L85 PathProgramCache]: Analyzing trace with hash 2056935971, now seen corresponding path program 6 times [2022-01-10 06:09:31,165 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:09:31,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1220189992] [2022-01-10 06:09:31,165 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-10 06:09:31,165 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:09:31,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:09:31,166 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:09:31,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-01-10 06:09:31,389 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-01-10 06:09:31,389 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:09:31,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 06:09:31,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:31,470 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-10 06:09:31,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:09:31,554 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-01-10 06:09:31,555 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:09:31,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1220189992] [2022-01-10 06:09:31,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1220189992] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:09:31,555 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:09:31,555 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-01-10 06:09:31,555 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159364847] [2022-01-10 06:09:31,555 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:09:31,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 06:09:31,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:09:31,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 06:09:31,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-10 06:09:31,556 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-01-10 06:09:31,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:09:31,598 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2022-01-10 06:09:31,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 06:09:31,599 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 48 [2022-01-10 06:09:31,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:09:31,599 INFO L225 Difference]: With dead ends: 91 [2022-01-10 06:09:31,599 INFO L226 Difference]: Without dead ends: 48 [2022-01-10 06:09:31,600 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-10 06:09:31,600 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 40 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:09:31,600 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 71 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:09:31,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-01-10 06:09:31,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-01-10 06:09:31,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 06:09:31,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2022-01-10 06:09:31,611 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 48 [2022-01-10 06:09:31,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:09:31,611 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2022-01-10 06:09:31,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-01-10 06:09:31,611 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2022-01-10 06:09:31,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-10 06:09:31,612 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:09:31,612 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:09:31,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-01-10 06:09:31,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:09:31,825 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:09:31,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:09:31,826 INFO L85 PathProgramCache]: Analyzing trace with hash 228459713, now seen corresponding path program 3 times [2022-01-10 06:09:31,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:09:31,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [810473551] [2022-01-10 06:09:31,827 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-10 06:09:31,827 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:09:31,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:09:31,828 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:09:31,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-01-10 06:09:32,101 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-10 06:09:32,102 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:09:32,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-10 06:09:32,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:32,223 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 06:09:32,224 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:09:32,523 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 06:09:32,523 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:09:32,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [810473551] [2022-01-10 06:09:32,523 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [810473551] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:09:32,523 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:09:32,523 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2022-01-10 06:09:32,523 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630045002] [2022-01-10 06:09:32,524 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:09:32,524 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-10 06:09:32,524 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:09:32,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-10 06:09:32,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-01-10 06:09:32,525 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 06:09:32,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:09:32,647 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2022-01-10 06:09:32,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 06:09:32,648 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 52 [2022-01-10 06:09:32,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:09:32,648 INFO L225 Difference]: With dead ends: 50 [2022-01-10 06:09:32,648 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 06:09:32,649 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2022-01-10 06:09:32,649 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 48 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:09:32,649 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 144 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 06:09:32,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 06:09:32,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 06:09:32,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 06:09:32,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 06:09:32,650 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2022-01-10 06:09:32,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:09:32,651 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 06:09:32,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 06:09:32,651 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 06:09:32,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 06:09:32,654 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 06:09:32,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-01-10 06:09:32,854 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:09:32,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 06:09:38,714 INFO L861 garLoopResultBuilder]: At program point L638(lines 620 639) the Hoare annotation is: true [2022-01-10 06:09:38,714 INFO L854 garLoopResultBuilder]: At program point L614-2(lines 614 617) the Hoare annotation is: (let ((.cse9 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse2 (bvmul (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))) (let ((.cse1 (= |ULTIMATE.start_sll_circular_update_at_~index#1| (_ bv0 32))) (.cse10 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (.cse0 (= (_ bv0 64) |ULTIMATE.start_sll_circular_create_#res#1.offset|)) (.cse12 (= |ULTIMATE.start_main_~len~0#1| (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)))) (.cse3 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (.cse4 (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)) (.cse13 (= (bvadd |ULTIMATE.start_sll_circular_update_at_~data#1| (_ bv1 32)) .cse2)) (.cse5 (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse6 (not (= (select .cse9 (_ bv0 64)) |ULTIMATE.start_main_~s~0#1.base|))) (.cse7 (= (_ bv0 64) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse8 (= |ULTIMATE.start_sll_circular_create_~len#1| (_ bv1 32))) (.cse11 (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 64)))) (or (and .cse0 .cse1 (= .cse2 (bvadd (_ bv2 32) |ULTIMATE.start_sll_circular_update_at_~data#1|)) .cse3 .cse4 (= |ULTIMATE.start_main_~len~0#1| (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32))) .cse5 .cse6 .cse7 .cse8 (= (bvadd (_ bv1 32) (select (select |#memory_int| (select .cse9 |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 64) .cse10))) .cse2) .cse11) (and .cse0 .cse12 (forall ((v_ArrVal_268 (_ BitVec 64)) (v_ArrVal_263 (Array (_ BitVec 64) (_ BitVec 64)))) (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| (select (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_263) |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 64)) v_ArrVal_268) |ULTIMATE.start_main_~s~0#1.offset|))) .cse1 .cse4 .cse13 (= |ULTIMATE.start_sll_circular_update_at_~head#1.offset| .cse10) .cse7 .cse8 (forall ((v_ArrVal_268 (_ BitVec 64)) (v_ArrVal_263 (Array (_ BitVec 64) (_ BitVec 64)))) (not (= (select (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_263) |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 64)) v_ArrVal_268) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|))) .cse11) (and .cse0 .cse12 (= |ULTIMATE.start_sll_circular_update_at_~index#1| |ULTIMATE.start_main_~i~0#1|) .cse3 .cse4 .cse13 .cse5 .cse6 .cse7 .cse8 .cse11)))) [2022-01-10 06:09:38,714 INFO L858 garLoopResultBuilder]: For program point L614-3(lines 614 617) no Hoare annotation was computed. [2022-01-10 06:09:38,714 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 06:09:38,714 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 06:09:38,714 INFO L858 garLoopResultBuilder]: For program point L631(lines 631 633) no Hoare annotation was computed. [2022-01-10 06:09:38,715 INFO L861 garLoopResultBuilder]: At program point L598-2(lines 598 602) the Hoare annotation is: true [2022-01-10 06:09:38,715 INFO L858 garLoopResultBuilder]: For program point L598-3(lines 598 602) no Hoare annotation was computed. [2022-01-10 06:09:38,715 INFO L854 garLoopResultBuilder]: At program point L607-2(lines 607 610) the Hoare annotation is: (let ((.cse15 (bvmul (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))) (let ((.cse10 (= |ULTIMATE.start_sll_circular_get_data_at_~index#1| (_ bv0 32))) (.cse0 (= (_ bv0 64) |ULTIMATE.start_sll_circular_create_#res#1.offset|)) (.cse1 (= (_ bv0 64) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|)) (.cse2 (not (bvsgt |ULTIMATE.start_sll_circular_update_at_~index#1| (_ bv0 32)))) (.cse3 (= .cse15 (bvadd (_ bv2 32) |ULTIMATE.start_sll_circular_update_at_~data#1|))) (.cse4 (= (bvadd (_ bv2 32) (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 64)))) .cse15)) (.cse5 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (.cse6 (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)) (.cse7 (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse8 (= (_ bv0 64) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse9 (= |ULTIMATE.start_sll_circular_create_~len#1| (_ bv1 32))) (.cse11 (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 64)))) (or (and .cse0 .cse1 (= (_ bv2 32) (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (_ bv8 64))) .cse2 (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~expected~0#1| (_ bv2 32)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) .cse2 (exists ((|ULTIMATE.start_main_~i~0#1| (_ BitVec 32))) (let ((.cse12 (bvmul |ULTIMATE.start_main_~i~0#1| (_ bv2 32)))) (and (= (bvmul |ULTIMATE.start_main_~expected~0#1| (_ bv2 32)) (bvadd .cse12 (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (bvadd |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| (_ bv8 64))) (_ bv1 32))) (= |ULTIMATE.start_main_~expected~0#1| (bvadd .cse12 (_ bv1 32)))))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (let ((.cse14 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|))) (and .cse0 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (_ bv0 64)) |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|)) .cse1 .cse2 (exists ((|ULTIMATE.start_main_~i~0#1| (_ BitVec 32))) (let ((.cse13 (bvmul |ULTIMATE.start_main_~i~0#1| (_ bv2 32)))) (and (= |ULTIMATE.start_main_~expected~0#1| (bvadd .cse13 (_ bv1 32))) (= (bvmul |ULTIMATE.start_main_~expected~0#1| (_ bv2 32)) (bvadd .cse13 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (_ bv0 64))) (bvadd (_ bv8 64) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (_ bv0 64)))) (_ bv1 32)))))) (= |ULTIMATE.start_main_~len~0#1| (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32))) (= |ULTIMATE.start_sll_circular_get_data_at_~index#1| (_ bv1 32)) .cse3 .cse4 .cse5 .cse6 .cse7 (not (= (select .cse14 (_ bv0 64)) |ULTIMATE.start_main_~s~0#1.base|)) .cse8 .cse9 (= (bvadd (_ bv1 32) (select (select |#memory_int| (select .cse14 |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 64) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))) .cse15) .cse11))))) [2022-01-10 06:09:38,715 INFO L858 garLoopResultBuilder]: For program point L607-3(lines 607 610) no Hoare annotation was computed. [2022-01-10 06:09:38,715 INFO L854 garLoopResultBuilder]: At program point L632(lines 620 639) the Hoare annotation is: false [2022-01-10 06:09:38,715 INFO L858 garLoopResultBuilder]: For program point L625-2(lines 625 628) no Hoare annotation was computed. [2022-01-10 06:09:38,715 INFO L854 garLoopResultBuilder]: At program point L625-3(lines 625 628) the Hoare annotation is: (let ((.cse2 (bvmul (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)) (.cse10 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse5 (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32))) (.cse0 (= (_ bv0 64) |ULTIMATE.start_sll_circular_create_#res#1.offset|)) (.cse1 (= |ULTIMATE.start_sll_circular_update_at_~index#1| (_ bv0 32))) (.cse3 (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)) (.cse4 (not (= (select .cse10 (_ bv0 64)) |ULTIMATE.start_main_~s~0#1.base|))) (.cse6 (= (_ bv0 64) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse7 (= |ULTIMATE.start_sll_circular_create_~len#1| (_ bv1 32))) (.cse8 (= (bvadd (_ bv1 32) (select (select |#memory_int| (select .cse10 |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 64) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))) .cse2)) (.cse9 (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 64)))) (or (and .cse0 .cse1 (= .cse2 (bvadd (_ bv2 32) |ULTIMATE.start_sll_circular_update_at_~data#1|)) (= (bvadd (_ bv2 32) (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 64)))) .cse2) (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) .cse3 (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) .cse4 (= .cse5 (_ bv0 32)) .cse6 .cse7 .cse8 .cse9) (and .cse0 (= |ULTIMATE.start_main_~len~0#1| .cse5) .cse3 .cse4 .cse6 .cse7 .cse9) (and .cse0 .cse1 .cse3 (= |ULTIMATE.start_main_~len~0#1| (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32))) .cse4 .cse6 .cse7 .cse8 .cse9)))) [2022-01-10 06:09:38,715 INFO L858 garLoopResultBuilder]: For program point L625-4(lines 625 628) no Hoare annotation was computed. [2022-01-10 06:09:38,715 INFO L854 garLoopResultBuilder]: At program point L584(line 584) the Hoare annotation is: (and (= (_ bv2 32) |ULTIMATE.start_sll_circular_create_~len#1|) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)) [2022-01-10 06:09:38,716 INFO L858 garLoopResultBuilder]: For program point L584-1(line 584) no Hoare annotation was computed. [2022-01-10 06:09:38,716 INFO L854 garLoopResultBuilder]: At program point L593(lines 583 594) the Hoare annotation is: (and (= (_ bv0 64) |ULTIMATE.start_sll_circular_create_#res#1.offset|) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) (_ bv0 64))) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (forall ((v_ArrVal_268 (_ BitVec 64)) (v_ArrVal_263 (Array (_ BitVec 64) (_ BitVec 64)))) (not (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (store (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_263) |ULTIMATE.start_sll_circular_create_#res#1.base|) (bvadd (_ bv8 64) |ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_268) |ULTIMATE.start_sll_circular_create_#res#1.offset|)))) (= (_ bv0 64) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (_ bv2 32) (bvadd |ULTIMATE.start_sll_circular_create_~len#1| (_ bv1 32)))) [2022-01-10 06:09:38,716 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 06:09:38,716 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 637) no Hoare annotation was computed. [2022-01-10 06:09:38,716 INFO L854 garLoopResultBuilder]: At program point L586-2(lines 586 591) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (.cse1 (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))) (or (and (not .cse0) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) (_ bv0 64))) .cse1 (= (_ bv0 64) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (_ bv2 32) (bvadd |ULTIMATE.start_sll_circular_create_~len#1| (_ bv1 32)))) (and .cse0 (= (bvadd (_ bv1 1) (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (_ bv0 1)) (= (_ bv2 32) |ULTIMATE.start_sll_circular_create_~len#1|) .cse1))) [2022-01-10 06:09:38,716 INFO L858 garLoopResultBuilder]: For program point L586-3(lines 586 591) no Hoare annotation was computed. [2022-01-10 06:09:38,716 INFO L854 garLoopResultBuilder]: At program point L611(lines 606 612) the Hoare annotation is: (let ((.cse12 (bvmul (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))) (let ((.cse0 (= (_ bv0 64) |ULTIMATE.start_sll_circular_create_#res#1.offset|)) (.cse1 (not (bvsgt |ULTIMATE.start_sll_circular_update_at_~index#1| (_ bv0 32)))) (.cse2 (= .cse12 (bvadd (_ bv2 32) |ULTIMATE.start_sll_circular_update_at_~data#1|))) (.cse3 (= (bvadd (_ bv2 32) (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 64)))) .cse12)) (.cse4 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (.cse6 (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)) (.cse7 (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse8 (= (_ bv0 64) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse9 (= |ULTIMATE.start_sll_circular_create_~len#1| (_ bv1 32))) (.cse10 (= |ULTIMATE.start_sll_circular_get_data_at_~index#1| (_ bv0 32))) (.cse11 (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 64)))) (or (and .cse0 .cse1 (= |ULTIMATE.start_main_~len~0#1| (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32))) .cse2 .cse3 .cse4 (exists ((|ULTIMATE.start_main_~i~0#1| (_ BitVec 32))) (let ((.cse5 (bvmul |ULTIMATE.start_main_~i~0#1| (_ bv2 32)))) (and (= |ULTIMATE.start_main_~expected~0#1| (bvadd .cse5 (_ bv1 32))) (= (bvmul |ULTIMATE.start_main_~expected~0#1| (_ bv2 32)) (bvadd .cse5 |ULTIMATE.start_sll_circular_get_data_at_#res#1| (_ bv1 32)))))) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 (= (_ bv0 64) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|) (= (_ bv2 32) (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (_ bv8 64))) .cse1 (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~expected~0#1| (_ bv2 32)) .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 (= (_ bv2 32) |ULTIMATE.start_sll_circular_get_data_at_#res#1|) .cse9 .cse10 .cse11)))) [2022-01-10 06:09:38,716 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 06:09:38,716 INFO L858 garLoopResultBuilder]: For program point L595(lines 595 605) no Hoare annotation was computed. [2022-01-10 06:09:38,717 INFO L854 garLoopResultBuilder]: At program point L587(line 587) the Hoare annotation is: (and (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (bvadd (_ bv1 1) (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (_ bv0 1)) (= (_ bv2 32) |ULTIMATE.start_sll_circular_create_~len#1|) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)) [2022-01-10 06:09:38,717 INFO L858 garLoopResultBuilder]: For program point L587-1(line 587) no Hoare annotation was computed. [2022-01-10 06:09:38,717 INFO L858 garLoopResultBuilder]: For program point L596(lines 596 604) no Hoare annotation was computed. [2022-01-10 06:09:38,717 INFO L858 garLoopResultBuilder]: For program point L629-2(lines 629 634) no Hoare annotation was computed. [2022-01-10 06:09:38,717 INFO L854 garLoopResultBuilder]: At program point L629-3(lines 629 634) the Hoare annotation is: (let ((.cse12 (bvmul (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))) (let ((.cse2 (= .cse12 (bvadd (_ bv2 32) |ULTIMATE.start_sll_circular_update_at_~data#1|))) (.cse3 (= (bvadd (_ bv2 32) (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 64)))) .cse12)) (.cse4 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (.cse6 (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse10 (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 64))) (.cse0 (= (_ bv0 64) |ULTIMATE.start_sll_circular_create_#res#1.offset|)) (.cse1 (not (bvsgt |ULTIMATE.start_sll_circular_update_at_~index#1| (_ bv0 32)))) (.cse5 (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)) (.cse7 (= (_ bv0 64) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse8 (= |ULTIMATE.start_sll_circular_create_~len#1| (_ bv1 32))) (.cse9 (= |ULTIMATE.start_sll_circular_get_data_at_~index#1| (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_main_~len~0#1| (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32))) .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|))) (and .cse0 (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= (select .cse11 (_ bv0 64)) |ULTIMATE.start_main_~s~0#1.base|)) .cse7 .cse8 (= (bvadd (_ bv1 32) (select (select |#memory_int| (select .cse11 |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 64) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))) .cse12) .cse10)) (and .cse0 .cse1 .cse5 (= (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (_ bv0 32)) .cse7 .cse8 .cse9)))) [2022-01-10 06:09:38,717 INFO L858 garLoopResultBuilder]: For program point L629-4(lines 629 634) no Hoare annotation was computed. [2022-01-10 06:09:38,717 INFO L858 garLoopResultBuilder]: For program point L613(lines 613 619) no Hoare annotation was computed. [2022-01-10 06:09:38,717 INFO L858 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2022-01-10 06:09:38,717 INFO L858 garLoopResultBuilder]: For program point L576-1(lines 576 578) no Hoare annotation was computed. [2022-01-10 06:09:38,717 INFO L861 garLoopResultBuilder]: At program point L572(line 572) the Hoare annotation is: true [2022-01-10 06:09:38,718 INFO L854 garLoopResultBuilder]: At program point node_createENTRY(lines 574 582) the Hoare annotation is: (= |#valid| |old(#valid)|) [2022-01-10 06:09:38,718 INFO L858 garLoopResultBuilder]: For program point node_createFINAL(lines 574 582) no Hoare annotation was computed. [2022-01-10 06:09:38,718 INFO L858 garLoopResultBuilder]: For program point node_createEXIT(lines 574 582) no Hoare annotation was computed. [2022-01-10 06:09:38,720 INFO L732 BasicCegarLoop]: Path program histogram: [6, 3, 2, 1, 1, 1, 1] [2022-01-10 06:09:38,722 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 06:09:38,729 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-01-10 06:09:38,730 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-01-10 06:09:38,736 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-01-10 06:09:38,736 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-01-10 06:09:38,738 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,739 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,740 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,740 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,740 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:09:38,741 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,742 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,742 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:09:38,743 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,743 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,744 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:09:38,744 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,744 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_263,QUANTIFIED] [2022-01-10 06:09:38,744 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_268,QUANTIFIED] [2022-01-10 06:09:38,744 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:09:38,744 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,745 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_263,QUANTIFIED] [2022-01-10 06:09:38,745 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_268,QUANTIFIED] [2022-01-10 06:09:38,745 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,746 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,746 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,747 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:09:38,747 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,747 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_263,QUANTIFIED] [2022-01-10 06:09:38,747 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_268,QUANTIFIED] [2022-01-10 06:09:38,747 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:09:38,748 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,748 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_263,QUANTIFIED] [2022-01-10 06:09:38,748 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_268,QUANTIFIED] [2022-01-10 06:09:38,748 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,749 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,749 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,750 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:09:38,750 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,750 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,750 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,750 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:09:38,751 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,751 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,752 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:09:38,752 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,752 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,752 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,752 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:09:38,753 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,754 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,754 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_263,QUANTIFIED] [2022-01-10 06:09:38,754 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,754 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_268,QUANTIFIED] [2022-01-10 06:09:38,755 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,755 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,755 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_263,QUANTIFIED] [2022-01-10 06:09:38,755 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,755 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_268,QUANTIFIED] [2022-01-10 06:09:38,756 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-01-10 06:09:38,756 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-01-10 06:09:38,757 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,757 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-01-10 06:09:38,757 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-01-10 06:09:38,757 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,757 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:09:38,758 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,758 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,758 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:09:38,760 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-01-10 06:09:38,760 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-01-10 06:09:38,760 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,761 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-01-10 06:09:38,761 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-01-10 06:09:38,761 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,761 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:09:38,761 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,762 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,762 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:09:38,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 06:09:38 BoogieIcfgContainer [2022-01-10 06:09:38,764 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 06:09:38,764 INFO L158 Benchmark]: Toolchain (without parser) took 27230.17ms. Allocated memory was 209.7MB in the beginning and 373.3MB in the end (delta: 163.6MB). Free memory was 165.1MB in the beginning and 337.7MB in the end (delta: -172.6MB). Peak memory consumption was 158.0MB. Max. memory is 8.0GB. [2022-01-10 06:09:38,764 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 209.7MB. Free memory is still 182.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 06:09:38,764 INFO L158 Benchmark]: CACSL2BoogieTranslator took 315.91ms. Allocated memory is still 209.7MB. Free memory was 164.8MB in the beginning and 179.4MB in the end (delta: -14.6MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. [2022-01-10 06:09:38,765 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.23ms. Allocated memory is still 209.7MB. Free memory was 179.4MB in the beginning and 177.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 06:09:38,765 INFO L158 Benchmark]: Boogie Preprocessor took 22.17ms. Allocated memory is still 209.7MB. Free memory was 177.3MB in the beginning and 175.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 06:09:38,765 INFO L158 Benchmark]: RCFGBuilder took 385.40ms. Allocated memory is still 209.7MB. Free memory was 175.8MB in the beginning and 161.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-01-10 06:09:38,765 INFO L158 Benchmark]: TraceAbstraction took 26469.21ms. Allocated memory was 209.7MB in the beginning and 373.3MB in the end (delta: 163.6MB). Free memory was 160.6MB in the beginning and 337.7MB in the end (delta: -177.1MB). Peak memory consumption was 154.2MB. Max. memory is 8.0GB. [2022-01-10 06:09:38,766 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 209.7MB. Free memory is still 182.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 315.91ms. Allocated memory is still 209.7MB. Free memory was 164.8MB in the beginning and 179.4MB in the end (delta: -14.6MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.23ms. Allocated memory is still 209.7MB. Free memory was 179.4MB in the beginning and 177.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.17ms. Allocated memory is still 209.7MB. Free memory was 177.3MB in the beginning and 175.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 385.40ms. Allocated memory is still 209.7MB. Free memory was 175.8MB in the beginning and 161.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 26469.21ms. Allocated memory was 209.7MB in the beginning and 373.3MB in the end (delta: 163.6MB). Free memory was 160.6MB in the beginning and 337.7MB in the end (delta: -177.1MB). Peak memory consumption was 154.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_263,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_268,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_263,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_268,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_263,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_268,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_263,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_268,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_263,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_268,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_263,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_268,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 637]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.4s, OverallIterations: 15, TraceHistogramMax: 3, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.9s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1539 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1536 mSDsluCounter, 2442 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 244 IncrementalHoareTripleChecker+Unchecked, 1977 mSDsCounter, 300 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1192 IncrementalHoareTripleChecker+Invalid, 1736 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 300 mSolverCounterUnsat, 465 mSDtfsCounter, 1192 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1028 GetRequests, 814 SyntacticMatches, 9 SemanticMatches, 205 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 671 ImplicationChecksByTransitivity, 7.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=11, InterpolantAutomatonStates: 139, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 243 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 18 PreInvPairs, 38 NumberOfFragments, 1036 HoareAnnotationTreeSize, 18 FomulaSimplifications, 47327 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 14 FomulaSimplificationsInter, 12532 FormulaSimplificationTreeSizeReductionInter, 4.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 577 NumberOfCodeBlocks, 522 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 943 ConstructedInterpolants, 18 QuantifiedInterpolants, 4798 SizeOfPredicates, 99 NumberOfNonLiveVariables, 2554 ConjunctsInSsa, 167 ConjunctsInUnsatCore, 24 InterpolantComputations, 6 PerfectInterpolantSequences, 348/447 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 620]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 620]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 598]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant [2022-01-10 06:09:38,773 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-01-10 06:09:38,773 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-01-10 06:09:38,774 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-01-10 06:09:38,774 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] Derived loop invariant: ((((((((((((0bv64 == \result && !~bvsgt32(index, 0bv32)) && len == ~bvadd16(i, 1bv32)) && ~bvmul32(2bv32, len) == ~bvadd16(2bv32, data)) && ~bvadd16(2bv32, unknown-#memory_int-unknown[s][~bvadd16(s, 8bv64)]) == ~bvmul32(2bv32, len)) && s == head) && (\exists ULTIMATE.start_main_~i~0#1 : bv32 :: expected == ~bvadd16(~bvmul32(ULTIMATE.start_main_~i~0#1, 2bv32), 1bv32) && ~bvmul32(expected, 2bv32) == ~bvadd16(~bvmul32(ULTIMATE.start_main_~i~0#1, 2bv32), \result, 1bv32))) && 2bv32 == len) && head == s) && 0bv64 == head) && len == 1bv32) && index == 0bv32) && s == 0bv64) || (((((((((((((((0bv64 == \result && 0bv64 == head) && 2bv32 == unknown-#memory_int-unknown[head][8bv64]) && !~bvsgt32(index, 0bv32)) && i == 0bv32) && expected == 2bv32) && ~bvmul32(2bv32, len) == ~bvadd16(2bv32, data)) && ~bvadd16(2bv32, unknown-#memory_int-unknown[s][~bvadd16(s, 8bv64)]) == ~bvmul32(2bv32, len)) && s == head) && 2bv32 == len) && head == s) && 0bv64 == head) && 2bv32 == \result) && len == 1bv32) && index == 0bv32) && s == 0bv64) - InvariantResult [Line: 572]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 586]: Loop Invariant [2022-01-10 06:09:38,775 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,775 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((!(head == last) && last == #memory_$Pointer$[head][0bv64]) && 2bv32 == len) && 0bv64 == head) && 2bv32 == ~bvadd16(len, 1bv32)) || (((head == last && ~bvadd16(1bv1, ~bvneg64(\valid[head])) == 0bv1) && 2bv32 == len) && 2bv32 == len) - InvariantResult [Line: 629]: Loop Invariant [2022-01-10 06:09:38,776 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,776 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,776 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:09:38,776 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,777 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,777 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((0bv64 == \result && !~bvsgt32(index, 0bv32)) && ~bvmul32(2bv32, len) == ~bvadd16(2bv32, data)) && ~bvadd16(2bv32, unknown-#memory_int-unknown[s][~bvadd16(s, 8bv64)]) == ~bvmul32(2bv32, len)) && s == head) && 2bv32 == len) && len == ~bvadd16(i, 2bv32)) && head == s) && 0bv64 == head) && len == 1bv32) && index == 0bv32) && s == 0bv64) || ((((((((((((0bv64 == \result && i == 1bv32) && !~bvsgt32(index, 0bv32)) && ~bvmul32(2bv32, len) == ~bvadd16(2bv32, data)) && ~bvadd16(2bv32, unknown-#memory_int-unknown[s][~bvadd16(s, 8bv64)]) == ~bvmul32(2bv32, len)) && s == head) && 2bv32 == len) && head == s) && !(#memory_$Pointer$[s][0bv64] == s)) && 0bv64 == head) && len == 1bv32) && ~bvadd16(1bv32, unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][~bvadd16(8bv64, #memory_$Pointer$[s][s])]) == ~bvmul32(2bv32, len)) && s == 0bv64)) || ((((((0bv64 == \result && !~bvsgt32(index, 0bv32)) && 2bv32 == len) && ~bvadd16(i, 1bv32) == 0bv32) && 0bv64 == head) && len == 1bv32) && index == 0bv32) - InvariantResult [Line: 614]: Loop Invariant [2022-01-10 06:09:38,777 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,777 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,778 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:09:38,778 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,778 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_263,QUANTIFIED] [2022-01-10 06:09:38,778 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_268,QUANTIFIED] [2022-01-10 06:09:38,778 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:09:38,778 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,778 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_263,QUANTIFIED] [2022-01-10 06:09:38,779 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_268,QUANTIFIED] [2022-01-10 06:09:38,779 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,779 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,779 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,780 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:09:38,780 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,780 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_263,QUANTIFIED] [2022-01-10 06:09:38,780 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_268,QUANTIFIED] [2022-01-10 06:09:38,780 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:09:38,780 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,780 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_263,QUANTIFIED] [2022-01-10 06:09:38,780 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_268,QUANTIFIED] [2022-01-10 06:09:38,780 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((0bv64 == \result && index == 0bv32) && ~bvmul32(2bv32, len) == ~bvadd16(2bv32, data)) && s == head) && 2bv32 == len) && len == ~bvadd16(i, 2bv32)) && head == s) && !(#memory_$Pointer$[s][0bv64] == s)) && 0bv64 == head) && len == 1bv32) && ~bvadd16(1bv32, unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][~bvadd16(8bv64, #memory_$Pointer$[s][s])]) == ~bvmul32(2bv32, len)) && s == 0bv64) || ((((((((((0bv64 == \result && len == ~bvadd16(i, 1bv32)) && (forall v_ArrVal_268 : bv64, v_ArrVal_263 : [bv64]bv64 :: head == #memory_$Pointer$[head := v_ArrVal_263][s][~bvadd16(s, 8bv64) := v_ArrVal_268][s])) && index == 0bv32) && 2bv32 == len) && ~bvadd16(data, 1bv32) == ~bvmul32(2bv32, len)) && head == #memory_$Pointer$[s][s]) && 0bv64 == head) && len == 1bv32) && (forall v_ArrVal_268 : bv64, v_ArrVal_263 : [bv64]bv64 :: !(#memory_$Pointer$[head := v_ArrVal_263][s][~bvadd16(s, 8bv64) := v_ArrVal_268][s] == s))) && s == 0bv64)) || ((((((((((0bv64 == \result && len == ~bvadd16(i, 1bv32)) && index == i) && s == head) && 2bv32 == len) && ~bvadd16(data, 1bv32) == ~bvmul32(2bv32, len)) && head == s) && !(#memory_$Pointer$[s][0bv64] == s)) && 0bv64 == head) && len == 1bv32) && s == 0bv64) - InvariantResult [Line: 625]: Loop Invariant [2022-01-10 06:09:38,781 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,781 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,781 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:09:38,782 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,782 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,782 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,782 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:09:38,782 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,783 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,783 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:09:38,783 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,783 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,783 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,783 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((0bv64 == \result && index == 0bv32) && ~bvmul32(2bv32, len) == ~bvadd16(2bv32, data)) && ~bvadd16(2bv32, unknown-#memory_int-unknown[s][~bvadd16(s, 8bv64)]) == ~bvmul32(2bv32, len)) && s == head) && 2bv32 == len) && head == s) && !(#memory_$Pointer$[s][0bv64] == s)) && ~bvadd16(i, 1bv32) == 0bv32) && 0bv64 == head) && len == 1bv32) && ~bvadd16(1bv32, unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][~bvadd16(8bv64, #memory_$Pointer$[s][s])]) == ~bvmul32(2bv32, len)) && s == 0bv64) || ((((((0bv64 == \result && len == ~bvadd16(i, 1bv32)) && 2bv32 == len) && !(#memory_$Pointer$[s][0bv64] == s)) && 0bv64 == head) && len == 1bv32) && s == 0bv64)) || ((((((((0bv64 == \result && index == 0bv32) && 2bv32 == len) && len == ~bvadd16(i, 2bv32)) && !(#memory_$Pointer$[s][0bv64] == s)) && 0bv64 == head) && len == 1bv32) && ~bvadd16(1bv32, unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][~bvadd16(8bv64, #memory_$Pointer$[s][s])]) == ~bvmul32(2bv32, len)) && s == 0bv64) - InvariantResult [Line: 583]: Loop Invariant [2022-01-10 06:09:38,784 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,784 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,784 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_263,QUANTIFIED] [2022-01-10 06:09:38,784 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,784 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_268,QUANTIFIED] [2022-01-10 06:09:38,785 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,785 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,785 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_263,QUANTIFIED] [2022-01-10 06:09:38,785 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,785 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_268,QUANTIFIED] Derived loop invariant: (((((0bv64 == \result && !(head == last)) && last == #memory_$Pointer$[head][0bv64]) && 2bv32 == len) && (forall v_ArrVal_268 : bv64, v_ArrVal_263 : [bv64]bv64 :: !(\result == #memory_$Pointer$[#memory_$Pointer$[\result][\result] := v_ArrVal_263][\result][~bvadd16(8bv64, \result) := v_ArrVal_268][\result]))) && 0bv64 == head) && 2bv32 == ~bvadd16(len, 1bv32) - InvariantResult [Line: 607]: Loop Invariant [2022-01-10 06:09:38,785 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-01-10 06:09:38,785 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-01-10 06:09:38,786 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,786 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-01-10 06:09:38,786 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-01-10 06:09:38,786 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,786 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:09:38,786 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,787 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,787 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:09:38,788 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-01-10 06:09:38,788 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-01-10 06:09:38,788 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,788 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-01-10 06:09:38,788 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-01-10 06:09:38,788 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,788 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:09:38,789 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,789 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:09:38,789 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((0bv64 == \result && 0bv64 == head) && 2bv32 == unknown-#memory_int-unknown[head][8bv64]) && !~bvsgt32(index, 0bv32)) && i == 0bv32) && expected == 2bv32) && ~bvmul32(2bv32, len) == ~bvadd16(2bv32, data)) && ~bvadd16(2bv32, unknown-#memory_int-unknown[s][~bvadd16(s, 8bv64)]) == ~bvmul32(2bv32, len)) && s == head) && 2bv32 == len) && head == s) && 0bv64 == head) && len == 1bv32) && index == 0bv32) && s == 0bv64) || ((((((((((((0bv64 == \result && i == 1bv32) && !~bvsgt32(index, 0bv32)) && (\exists ULTIMATE.start_main_~i~0#1 : bv32 :: ~bvmul32(expected, 2bv32) == ~bvadd16(~bvmul32(ULTIMATE.start_main_~i~0#1, 2bv32), unknown-#memory_int-unknown[head][~bvadd16(head, 8bv64)], 1bv32) && expected == ~bvadd16(~bvmul32(ULTIMATE.start_main_~i~0#1, 2bv32), 1bv32))) && ~bvmul32(2bv32, len) == ~bvadd16(2bv32, data)) && ~bvadd16(2bv32, unknown-#memory_int-unknown[s][~bvadd16(s, 8bv64)]) == ~bvmul32(2bv32, len)) && s == head) && 2bv32 == len) && head == s) && 0bv64 == head) && len == 1bv32) && index == 0bv32) && s == 0bv64)) || ((((((((((((((((0bv64 == \result && !(#memory_$Pointer$[head][0bv64] == head)) && 0bv64 == head) && !~bvsgt32(index, 0bv32)) && (\exists ULTIMATE.start_main_~i~0#1 : bv32 :: expected == ~bvadd16(~bvmul32(ULTIMATE.start_main_~i~0#1, 2bv32), 1bv32) && ~bvmul32(expected, 2bv32) == ~bvadd16(~bvmul32(ULTIMATE.start_main_~i~0#1, 2bv32), unknown-#memory_int-unknown[#memory_$Pointer$[head][0bv64]][~bvadd16(8bv64, #memory_$Pointer$[head][0bv64])], 1bv32))) && len == ~bvadd16(i, 1bv32)) && index == 1bv32) && ~bvmul32(2bv32, len) == ~bvadd16(2bv32, data)) && ~bvadd16(2bv32, unknown-#memory_int-unknown[s][~bvadd16(s, 8bv64)]) == ~bvmul32(2bv32, len)) && s == head) && 2bv32 == len) && head == s) && !(#memory_$Pointer$[s][0bv64] == s)) && 0bv64 == head) && len == 1bv32) && ~bvadd16(1bv32, unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][~bvadd16(8bv64, #memory_$Pointer$[s][s])]) == ~bvmul32(2bv32, len)) && s == 0bv64) RESULT: Ultimate proved your program to be correct! [2022-01-10 06:09:38,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...