/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_BITWISE.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-optional-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 11:55:27,706 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 11:55:27,707 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 11:55:27,735 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 11:55:27,735 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 11:55:27,738 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 11:55:27,740 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 11:55:27,744 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 11:55:27,745 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 11:55:27,745 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 11:55:27,746 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 11:55:27,746 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 11:55:27,747 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 11:55:27,747 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 11:55:27,748 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 11:55:27,748 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 11:55:27,749 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 11:55:27,749 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 11:55:27,750 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 11:55:27,751 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 11:55:27,752 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 11:55:27,782 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 11:55:27,783 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 11:55:27,783 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 11:55:27,785 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 11:55:27,785 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 11:55:27,785 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 11:55:27,793 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 11:55:27,794 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 11:55:27,795 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 11:55:27,795 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 11:55:27,795 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 11:55:27,797 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 11:55:27,797 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 11:55:27,800 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 11:55:27,801 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 11:55:27,801 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 11:55:27,801 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 11:55:27,801 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 11:55:27,802 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 11:55:27,803 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 11:55:27,803 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_BITWISE.epf [2022-01-10 11:55:27,829 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 11:55:27,829 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 11:55:27,829 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 11:55:27,829 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 11:55:27,830 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 11:55:27,830 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 11:55:27,830 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 11:55:27,830 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 11:55:27,830 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 11:55:27,831 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 11:55:27,831 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 11:55:27,831 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 11:55:27,831 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 11:55:27,831 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 11:55:27,831 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 11:55:27,831 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 11:55:27,831 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 11:55:27,831 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 11:55:27,831 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 11:55:27,831 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 11:55:27,832 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 11:55:27,832 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 11:55:27,832 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 11:55:27,832 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 11:55:27,832 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 11:55:27,832 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 11:55:27,832 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 11:55:27,832 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 11:55:27,832 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 11:55:27,832 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 11:55:27,832 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 11:55:27,832 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 11:55:27,833 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 11:55:27,833 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_BITWISE WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 11:55:28,037 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 11:55:28,065 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 11:55:28,067 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 11:55:28,068 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 11:55:28,075 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 11:55:28,077 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-optional-1.i [2022-01-10 11:55:28,111 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaec51d15/12acec5dde8848a09a2c2a30ed3f0ce1/FLAG751a3d240 [2022-01-10 11:55:28,492 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 11:55:28,493 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-optional-1.i [2022-01-10 11:55:28,508 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaec51d15/12acec5dde8848a09a2c2a30ed3f0ce1/FLAG751a3d240 [2022-01-10 11:55:28,520 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaec51d15/12acec5dde8848a09a2c2a30ed3f0ce1 [2022-01-10 11:55:28,522 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 11:55:28,525 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 11:55:28,526 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 11:55:28,527 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 11:55:28,529 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 11:55:28,530 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 11:55:28" (1/1) ... [2022-01-10 11:55:28,530 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2577e8a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:55:28, skipping insertion in model container [2022-01-10 11:55:28,531 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 11:55:28" (1/1) ... [2022-01-10 11:55:28,536 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 11:55:28,573 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 11:55:28,891 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-optional-1.i[22688,22701] [2022-01-10 11:55:28,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 11:55:28,911 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 11:55:28,947 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-optional-1.i[22688,22701] [2022-01-10 11:55:28,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 11:55:28,978 INFO L208 MainTranslator]: Completed translation [2022-01-10 11:55:28,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:55:28 WrapperNode [2022-01-10 11:55:28,978 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 11:55:28,979 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 11:55:28,980 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 11:55:28,980 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 11:55:28,985 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:55:28" (1/1) ... [2022-01-10 11:55:29,016 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:55:28" (1/1) ... [2022-01-10 11:55:29,042 INFO L137 Inliner]: procedures = 122, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 126 [2022-01-10 11:55:29,042 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 11:55:29,043 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 11:55:29,043 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 11:55:29,043 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 11:55:29,049 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:55:28" (1/1) ... [2022-01-10 11:55:29,049 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:55:28" (1/1) ... [2022-01-10 11:55:29,063 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:55:28" (1/1) ... [2022-01-10 11:55:29,063 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:55:28" (1/1) ... [2022-01-10 11:55:29,070 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:55:28" (1/1) ... [2022-01-10 11:55:29,072 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:55:28" (1/1) ... [2022-01-10 11:55:29,074 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:55:28" (1/1) ... [2022-01-10 11:55:29,076 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 11:55:29,077 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 11:55:29,077 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 11:55:29,077 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 11:55:29,078 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:55:28" (1/1) ... [2022-01-10 11:55:29,083 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 11:55:29,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:55:29,103 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 11:55:29,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 11:55:29,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 11:55:29,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 11:55:29,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 11:55:29,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 11:55:29,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 11:55:29,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 11:55:29,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 11:55:29,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 11:55:29,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 11:55:29,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 11:55:29,279 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 11:55:29,281 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 11:55:29,686 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 11:55:29,690 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 11:55:29,690 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-01-10 11:55:29,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:55:29 BoogieIcfgContainer [2022-01-10 11:55:29,692 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 11:55:29,692 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 11:55:29,693 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 11:55:29,694 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 11:55:29,696 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:55:29" (1/1) ... [2022-01-10 11:55:29,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 11:55:29 BasicIcfg [2022-01-10 11:55:29,751 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 11:55:29,752 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 11:55:29,752 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 11:55:29,754 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 11:55:29,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 11:55:28" (1/4) ... [2022-01-10 11:55:29,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d3928f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 11:55:29, skipping insertion in model container [2022-01-10 11:55:29,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:55:28" (2/4) ... [2022-01-10 11:55:29,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d3928f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 11:55:29, skipping insertion in model container [2022-01-10 11:55:29,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:55:29" (3/4) ... [2022-01-10 11:55:29,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d3928f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 11:55:29, skipping insertion in model container [2022-01-10 11:55:29,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 11:55:29" (4/4) ... [2022-01-10 11:55:29,756 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-optional-1.iTransformedIcfg [2022-01-10 11:55:29,760 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 11:55:29,760 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 11:55:29,789 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 11:55:29,793 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 11:55:29,793 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 11:55:29,802 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 28 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:55:29,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 11:55:29,806 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:55:29,806 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:55:29,807 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:55:29,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:55:29,811 INFO L85 PathProgramCache]: Analyzing trace with hash -848528538, now seen corresponding path program 1 times [2022-01-10 11:55:29,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:55:29,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462830181] [2022-01-10 11:55:29,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:55:29,818 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:55:29,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:55:30,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:55:30,008 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:55:30,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462830181] [2022-01-10 11:55:30,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462830181] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:55:30,008 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:55:30,009 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 11:55:30,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574041978] [2022-01-10 11:55:30,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:55:30,015 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 11:55:30,015 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:55:30,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 11:55:30,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 11:55:30,044 INFO L87 Difference]: Start difference. First operand has 29 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 28 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:55:30,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:55:30,057 INFO L93 Difference]: Finished difference Result 50 states and 76 transitions. [2022-01-10 11:55:30,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 11:55:30,059 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-01-10 11:55:30,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:55:30,064 INFO L225 Difference]: With dead ends: 50 [2022-01-10 11:55:30,065 INFO L226 Difference]: Without dead ends: 21 [2022-01-10 11:55:30,067 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 11:55:30,071 INFO L933 BasicCegarLoop]: 39 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, 39 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 11:55:30,072 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 11:55:30,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-01-10 11:55:30,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-01-10 11:55:30,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.45) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:55:30,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2022-01-10 11:55:30,098 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 29 transitions. Word has length 15 [2022-01-10 11:55:30,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:55:30,099 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 29 transitions. [2022-01-10 11:55:30,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:55:30,100 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 29 transitions. [2022-01-10 11:55:30,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 11:55:30,101 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:55:30,101 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:55:30,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 11:55:30,101 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:55:30,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:55:30,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1649487399, now seen corresponding path program 1 times [2022-01-10 11:55:30,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:55:30,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992758773] [2022-01-10 11:55:30,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:55:30,103 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:55:30,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:55:30,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:55:30,245 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:55:30,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992758773] [2022-01-10 11:55:30,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992758773] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:55:30,246 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:55:30,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 11:55:30,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125770363] [2022-01-10 11:55:30,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:55:30,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 11:55:30,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:55:30,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 11:55:30,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 11:55:30,248 INFO L87 Difference]: Start difference. First operand 21 states and 29 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:55:30,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:55:30,267 INFO L93 Difference]: Finished difference Result 24 states and 32 transitions. [2022-01-10 11:55:30,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 11:55:30,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-01-10 11:55:30,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:55:30,269 INFO L225 Difference]: With dead ends: 24 [2022-01-10 11:55:30,269 INFO L226 Difference]: Without dead ends: 22 [2022-01-10 11:55:30,273 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 11:55:30,274 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 11:55:30,275 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 11:55:30,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-01-10 11:55:30,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-01-10 11:55:30,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:55:30,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2022-01-10 11:55:30,283 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 15 [2022-01-10 11:55:30,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:55:30,285 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2022-01-10 11:55:30,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:55:30,288 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2022-01-10 11:55:30,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 11:55:30,289 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:55:30,289 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:55:30,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 11:55:30,289 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:55:30,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:55:30,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1649488360, now seen corresponding path program 1 times [2022-01-10 11:55:30,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:55:30,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64134227] [2022-01-10 11:55:30,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:55:30,290 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:55:30,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:55:30,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:55:30,593 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:55:30,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64134227] [2022-01-10 11:55:30,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64134227] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:55:30,594 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:55:30,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 11:55:30,594 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83557323] [2022-01-10 11:55:30,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:55:30,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 11:55:30,595 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:55:30,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 11:55:30,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 11:55:30,596 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:55:30,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:55:30,975 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2022-01-10 11:55:30,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 11:55:30,976 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-01-10 11:55:30,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:55:30,977 INFO L225 Difference]: With dead ends: 67 [2022-01-10 11:55:30,977 INFO L226 Difference]: Without dead ends: 54 [2022-01-10 11:55:30,978 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-01-10 11:55:30,979 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 89 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 11:55:30,979 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 67 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 11:55:30,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-01-10 11:55:30,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 32. [2022-01-10 11:55:30,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 31 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:55:30,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2022-01-10 11:55:30,986 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 15 [2022-01-10 11:55:30,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:55:30,987 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2022-01-10 11:55:30,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:55:30,987 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2022-01-10 11:55:30,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 11:55:30,988 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:55:30,988 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:55:30,988 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 11:55:30,988 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:55:30,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:55:30,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1650411881, now seen corresponding path program 1 times [2022-01-10 11:55:30,989 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:55:30,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014824475] [2022-01-10 11:55:30,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:55:30,989 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:55:31,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:55:31,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:55:31,143 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:55:31,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014824475] [2022-01-10 11:55:31,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014824475] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:55:31,143 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:55:31,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 11:55:31,144 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671820118] [2022-01-10 11:55:31,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:55:31,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 11:55:31,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:55:31,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 11:55:31,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-10 11:55:31,146 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:55:31,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:55:31,500 INFO L93 Difference]: Finished difference Result 65 states and 85 transitions. [2022-01-10 11:55:31,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 11:55:31,501 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-01-10 11:55:31,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:55:31,502 INFO L225 Difference]: With dead ends: 65 [2022-01-10 11:55:31,502 INFO L226 Difference]: Without dead ends: 63 [2022-01-10 11:55:31,502 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2022-01-10 11:55:31,503 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 71 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 11:55:31,503 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 65 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 11:55:31,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-01-10 11:55:31,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 41. [2022-01-10 11:55:31,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.4) internal successors, (56), 40 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:55:31,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 56 transitions. [2022-01-10 11:55:31,508 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 56 transitions. Word has length 15 [2022-01-10 11:55:31,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:55:31,508 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 56 transitions. [2022-01-10 11:55:31,508 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:55:31,509 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 56 transitions. [2022-01-10 11:55:31,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 11:55:31,509 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:55:31,509 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:55:31,509 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 11:55:31,509 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:55:31,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:55:31,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1757051734, now seen corresponding path program 1 times [2022-01-10 11:55:31,510 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:55:31,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074603761] [2022-01-10 11:55:31,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:55:31,510 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:55:31,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:55:31,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:55:31,600 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:55:31,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074603761] [2022-01-10 11:55:31,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074603761] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:55:31,601 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:55:31,601 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 11:55:31,601 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958366256] [2022-01-10 11:55:31,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:55:31,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 11:55:31,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:55:31,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 11:55:31,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 11:55:31,602 INFO L87 Difference]: Start difference. First operand 41 states and 56 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:55:31,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:55:31,795 INFO L93 Difference]: Finished difference Result 76 states and 100 transitions. [2022-01-10 11:55:31,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 11:55:31,796 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-01-10 11:55:31,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:55:31,798 INFO L225 Difference]: With dead ends: 76 [2022-01-10 11:55:31,798 INFO L226 Difference]: Without dead ends: 59 [2022-01-10 11:55:31,798 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-10 11:55:31,799 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 73 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 11:55:31,799 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 65 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 11:55:31,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-01-10 11:55:31,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 39. [2022-01-10 11:55:31,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.368421052631579) internal successors, (52), 38 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:55:31,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2022-01-10 11:55:31,805 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 52 transitions. Word has length 15 [2022-01-10 11:55:31,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:55:31,806 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 52 transitions. [2022-01-10 11:55:31,806 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:55:31,806 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2022-01-10 11:55:31,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 11:55:31,806 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:55:31,806 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:55:31,806 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 11:55:31,807 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:55:31,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:55:31,807 INFO L85 PathProgramCache]: Analyzing trace with hash 252702265, now seen corresponding path program 1 times [2022-01-10 11:55:31,807 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:55:31,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359299018] [2022-01-10 11:55:31,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:55:31,807 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:55:31,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:55:31,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:55:31,994 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:55:31,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359299018] [2022-01-10 11:55:31,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359299018] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:55:31,995 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:55:31,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 11:55:31,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458305041] [2022-01-10 11:55:31,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:55:31,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 11:55:31,996 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:55:31,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 11:55:31,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 11:55:31,996 INFO L87 Difference]: Start difference. First operand 39 states and 52 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:55:32,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:55:32,283 INFO L93 Difference]: Finished difference Result 86 states and 113 transitions. [2022-01-10 11:55:32,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 11:55:32,284 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-01-10 11:55:32,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:55:32,284 INFO L225 Difference]: With dead ends: 86 [2022-01-10 11:55:32,284 INFO L226 Difference]: Without dead ends: 73 [2022-01-10 11:55:32,285 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-01-10 11:55:32,285 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 75 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 11:55:32,286 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 95 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 11:55:32,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-01-10 11:55:32,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 48. [2022-01-10 11:55:32,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 47 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:55:32,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2022-01-10 11:55:32,295 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 16 [2022-01-10 11:55:32,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:55:32,295 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2022-01-10 11:55:32,295 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:55:32,295 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2022-01-10 11:55:32,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 11:55:32,296 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:55:32,296 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:55:32,296 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 11:55:32,296 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:55:32,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:55:32,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1141129467, now seen corresponding path program 1 times [2022-01-10 11:55:32,297 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:55:32,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992596633] [2022-01-10 11:55:32,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:55:32,297 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:55:32,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:55:32,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:55:32,373 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:55:32,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992596633] [2022-01-10 11:55:32,373 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992596633] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:55:32,373 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:55:32,373 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 11:55:32,373 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447276676] [2022-01-10 11:55:32,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:55:32,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 11:55:32,374 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:55:32,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 11:55:32,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-10 11:55:32,374 INFO L87 Difference]: Start difference. First operand 48 states and 63 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:55:32,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:55:32,570 INFO L93 Difference]: Finished difference Result 74 states and 96 transitions. [2022-01-10 11:55:32,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 11:55:32,570 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-01-10 11:55:32,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:55:32,571 INFO L225 Difference]: With dead ends: 74 [2022-01-10 11:55:32,571 INFO L226 Difference]: Without dead ends: 72 [2022-01-10 11:55:32,571 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-01-10 11:55:32,572 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 58 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 11:55:32,572 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 91 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 11:55:32,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-01-10 11:55:32,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 46. [2022-01-10 11:55:32,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 45 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:55:32,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 61 transitions. [2022-01-10 11:55:32,578 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 61 transitions. Word has length 16 [2022-01-10 11:55:32,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:55:32,578 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 61 transitions. [2022-01-10 11:55:32,578 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:55:32,579 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 61 transitions. [2022-01-10 11:55:32,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-10 11:55:32,579 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:55:32,579 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:55:32,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 11:55:32,579 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:55:32,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:55:32,580 INFO L85 PathProgramCache]: Analyzing trace with hash -864461274, now seen corresponding path program 1 times [2022-01-10 11:55:32,580 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:55:32,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844459176] [2022-01-10 11:55:32,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:55:32,580 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:55:32,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:55:32,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:55:32,962 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:55:32,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844459176] [2022-01-10 11:55:32,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844459176] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 11:55:32,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284370647] [2022-01-10 11:55:32,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:55:32,963 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:55:32,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:55:32,964 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 11:55:32,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 11:55:33,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:55:33,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 84 conjunts are in the unsatisfiable core [2022-01-10 11:55:33,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 11:55:33,322 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 11:55:33,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:55:33,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:55:33,366 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2022-01-10 11:55:33,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:55:33,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:55:33,390 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2022-01-10 11:55:33,397 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 12 treesize of output 11 [2022-01-10 11:55:33,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:55:33,403 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 44 [2022-01-10 11:55:33,419 INFO L353 Elim1Store]: treesize reduction 34, result has 34.6 percent of original size [2022-01-10 11:55:33,420 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 37 [2022-01-10 11:55:33,425 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2022-01-10 11:55:33,430 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 16 treesize of output 15 [2022-01-10 11:55:33,435 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 12 treesize of output 11 [2022-01-10 11:55:33,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:55:33,559 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 56 [2022-01-10 11:55:33,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:55:33,595 INFO L353 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-01-10 11:55:33,596 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 59 [2022-01-10 11:55:33,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:55:33,615 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-10 11:55:33,616 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 89 [2022-01-10 11:55:33,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:55:33,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:55:33,626 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 53 [2022-01-10 11:55:33,653 INFO L353 Elim1Store]: treesize reduction 75, result has 37.5 percent of original size [2022-01-10 11:55:33,654 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 61 [2022-01-10 11:55:33,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:55:33,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:55:33,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:55:33,775 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2022-01-10 11:55:33,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:55:33,804 INFO L353 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-01-10 11:55:33,805 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 147 treesize of output 142 [2022-01-10 11:55:33,812 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 20 treesize of output 19 [2022-01-10 11:55:33,831 INFO L353 Elim1Store]: treesize reduction 12, result has 71.4 percent of original size [2022-01-10 11:55:33,832 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 42 [2022-01-10 11:55:34,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:55:34,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 11:55:34,594 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:55:34,594 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 129 [2022-01-10 11:55:43,018 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_352 Int) (|v_v_ULTIMATE.start_main_#t~malloc10#1.base_4Int_4| Int) (v_ArrVal_361 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt_2| Int) (v_ArrVal_368 (Array Int Int)) (v_ArrVal_367 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt| 0)) v_ArrVal_352 v_arrayElimArr_5) |v_v_ULTIMATE.start_main_#t~malloc10#1.base_4Int_4| v_ArrVal_368)) (.cse2 (store (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt| v_ArrVal_352)) v_ArrVal_352 v_ArrVal_367) |v_v_ULTIMATE.start_main_#t~malloc10#1.base_4Int_4| v_ArrVal_361)) (.cse4 (mod (+ 8 |v_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt_2|) 18446744073709551616))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) .cse4)) (.cse0 (select (select .cse3 |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) .cse4))) (or (not (= (select (store |c_#validInt| v_ArrVal_352 1) |v_v_ULTIMATE.start_main_#t~malloc10#1.base_4Int_4|) 0)) (and (= .cse0 |v_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt_2|) (= |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt| .cse1)) (not (<= (mod (select |c_#validInt| v_ArrVal_352) 2) 0)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt_2| |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|)) (not (= (select v_arrayElimArr_5 8) 0)) (and (= (select (select .cse2 .cse1) .cse0) 0) (= (select (select .cse3 .cse1) .cse0) 0)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt_2|)))))) is different from false [2022-01-10 11:55:49,585 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_352 Int) (|v_v_ULTIMATE.start_main_#t~malloc10#1.base_4Int_4| Int) (v_ArrVal_361 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt_2| Int) (v_ArrVal_368 (Array Int Int)) (v_ArrVal_367 (Array Int Int))) (let ((.cse2 (store (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt| 0)) v_ArrVal_352 v_arrayElimArr_5) |v_v_ULTIMATE.start_main_#t~malloc10#1.base_4Int_4| v_ArrVal_368)) (.cse3 (store (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt| v_ArrVal_352)) v_ArrVal_352 v_ArrVal_367) |v_v_ULTIMATE.start_main_#t~malloc10#1.base_4Int_4| v_ArrVal_361)) (.cse4 (mod (+ 8 |v_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt_2|) 18446744073709551616))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) .cse4)) (.cse1 (select (select .cse2 |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) .cse4))) (or (not (= (select (store |c_#validInt| v_ArrVal_352 1) |v_v_ULTIMATE.start_main_#t~malloc10#1.base_4Int_4|) 0)) (and (= .cse0 |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) (= .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt_2|)) (not (<= (mod (select |c_#validInt| v_ArrVal_352) 2) 0)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt_2| |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|)) (not (= (select v_arrayElimArr_5 8) 0)) (and (= (select (select .cse2 .cse0) .cse1) 0) (= (select (select .cse3 .cse0) .cse1) 0)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt_2|)))))) is different from false [2022-01-10 11:55:49,742 INFO L353 Elim1Store]: treesize reduction 17, result has 66.0 percent of original size [2022-01-10 11:55:49,742 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 994 treesize of output 818 [2022-01-10 11:55:49,877 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:55:49,879 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1090812 treesize of output 1060296 [2022-01-10 11:55:51,069 INFO L353 Elim1Store]: treesize reduction 17, result has 66.0 percent of original size [2022-01-10 11:55:51,072 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1930894 treesize of output 1238546 [2022-01-10 11:55:53,219 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:55:53,229 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 13983048 treesize of output 13682425 [2022-01-10 11:56:19,118 WARN L228 SmtUtils]: Spent 25.88s on a formula simplification that was a NOOP. DAG size: 8712 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)