/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/array-fpi/eqn2f.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 09:53:39,541 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 09:53:39,542 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 09:53:39,602 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 09:53:39,603 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 09:53:39,603 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 09:53:39,604 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 09:53:39,606 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 09:53:39,607 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 09:53:39,608 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 09:53:39,608 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 09:53:39,609 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 09:53:39,609 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 09:53:39,610 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 09:53:39,610 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 09:53:39,611 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 09:53:39,611 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 09:53:39,612 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 09:53:39,613 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 09:53:39,614 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 09:53:39,614 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 09:53:39,615 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 09:53:39,616 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 09:53:39,616 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 09:53:39,618 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 09:53:39,618 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 09:53:39,618 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 09:53:39,619 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 09:53:39,619 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 09:53:39,620 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 09:53:39,620 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 09:53:39,620 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 09:53:39,621 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 09:53:39,621 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 09:53:39,622 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 09:53:39,622 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 09:53:39,622 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 09:53:39,622 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 09:53:39,622 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 09:53:39,623 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 09:53:39,623 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 09:53:39,624 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 09:53:39,637 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 09:53:39,637 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 09:53:39,637 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 09:53:39,637 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 09:53:39,638 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 09:53:39,638 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 09:53:39,638 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 09:53:39,638 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 09:53:39,639 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 09:53:39,639 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 09:53:39,639 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 09:53:39,639 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 09:53:39,639 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 09:53:39,639 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 09:53:39,639 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 09:53:39,639 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 09:53:39,640 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 09:53:39,640 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 09:53:39,640 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 09:53:39,640 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 09:53:39,640 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 09:53:39,640 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 09:53:39,640 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 09:53:39,640 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 09:53:39,641 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 09:53:39,641 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 09:53:39,641 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 09:53:39,641 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 09:53:39,641 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 09:53:39,641 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 09:53:39,641 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 09:53:39,641 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 09:53:39,642 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 09:53:39,642 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 09:53:39,832 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 09:53:39,847 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 09:53:39,849 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 09:53:39,850 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 09:53:39,850 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 09:53:39,851 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/eqn2f.c [2022-01-10 09:53:39,897 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bb600025/77fb59a169434177891882ac55dcdcd1/FLAGd544da95b [2022-01-10 09:53:40,240 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 09:53:40,240 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/eqn2f.c [2022-01-10 09:53:40,249 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bb600025/77fb59a169434177891882ac55dcdcd1/FLAGd544da95b [2022-01-10 09:53:40,653 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bb600025/77fb59a169434177891882ac55dcdcd1 [2022-01-10 09:53:40,656 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 09:53:40,657 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 09:53:40,659 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 09:53:40,659 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 09:53:40,673 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 09:53:40,674 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 09:53:40" (1/1) ... [2022-01-10 09:53:40,675 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ce9c2cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:53:40, skipping insertion in model container [2022-01-10 09:53:40,675 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 09:53:40" (1/1) ... [2022-01-10 09:53:40,682 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 09:53:40,693 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 09:53:40,865 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/eqn2f.c[588,601] [2022-01-10 09:53:40,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 09:53:40,911 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 09:53:40,921 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/eqn2f.c[588,601] [2022-01-10 09:53:40,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 09:53:40,956 INFO L208 MainTranslator]: Completed translation [2022-01-10 09:53:40,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:53:40 WrapperNode [2022-01-10 09:53:40,956 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 09:53:40,957 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 09:53:40,957 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 09:53:40,957 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 09:53:40,962 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:53:40" (1/1) ... [2022-01-10 09:53:40,974 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:53:40" (1/1) ... [2022-01-10 09:53:40,994 INFO L137 Inliner]: procedures = 18, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 71 [2022-01-10 09:53:40,994 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 09:53:40,995 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 09:53:40,995 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 09:53:40,995 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 09:53:41,001 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:53:40" (1/1) ... [2022-01-10 09:53:41,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:53:40" (1/1) ... [2022-01-10 09:53:41,007 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:53:40" (1/1) ... [2022-01-10 09:53:41,007 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:53:40" (1/1) ... [2022-01-10 09:53:41,019 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:53:40" (1/1) ... [2022-01-10 09:53:41,022 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:53:40" (1/1) ... [2022-01-10 09:53:41,028 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:53:40" (1/1) ... [2022-01-10 09:53:41,033 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 09:53:41,034 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 09:53:41,034 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 09:53:41,034 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 09:53:41,035 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:53:40" (1/1) ... [2022-01-10 09:53:41,040 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 09:53:41,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 09:53:41,058 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 09:53:41,076 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 09:53:41,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 09:53:41,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 09:53:41,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-01-10 09:53:41,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 09:53:41,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 09:53:41,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 09:53:41,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-01-10 09:53:41,148 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 09:53:41,149 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 09:53:41,380 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 09:53:41,384 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 09:53:41,384 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-10 09:53:41,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 09:53:41 BoogieIcfgContainer [2022-01-10 09:53:41,386 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 09:53:41,386 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 09:53:41,386 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 09:53:41,387 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 09:53:41,389 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 09:53:41" (1/1) ... [2022-01-10 09:53:41,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 09:53:41 BasicIcfg [2022-01-10 09:53:41,506 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 09:53:41,507 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 09:53:41,507 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 09:53:41,509 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 09:53:41,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 09:53:40" (1/4) ... [2022-01-10 09:53:41,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39eca69e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 09:53:41, skipping insertion in model container [2022-01-10 09:53:41,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:53:40" (2/4) ... [2022-01-10 09:53:41,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39eca69e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 09:53:41, skipping insertion in model container [2022-01-10 09:53:41,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 09:53:41" (3/4) ... [2022-01-10 09:53:41,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39eca69e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 09:53:41, skipping insertion in model container [2022-01-10 09:53:41,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 09:53:41" (4/4) ... [2022-01-10 09:53:41,511 INFO L111 eAbstractionObserver]: Analyzing ICFG eqn2f.cTransformedIcfg [2022-01-10 09:53:41,514 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 09:53:41,515 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 09:53:41,544 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 09:53:41,548 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 09:53:41,549 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 09:53:41,557 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 19 states have (on average 1.5263157894736843) 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 09:53:41,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-10 09:53:41,561 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 09:53:41,561 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 09:53:41,562 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 09:53:41,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 09:53:41,565 INFO L85 PathProgramCache]: Analyzing trace with hash 751161390, now seen corresponding path program 1 times [2022-01-10 09:53:41,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 09:53:41,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410082807] [2022-01-10 09:53:41,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 09:53:41,572 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 09:53:41,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 09:53:41,744 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 09:53:41,744 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 09:53:41,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410082807] [2022-01-10 09:53:41,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410082807] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 09:53:41,745 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 09:53:41,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 09:53:41,746 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221772106] [2022-01-10 09:53:41,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 09:53:41,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 09:53:41,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 09:53:41,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 09:53:41,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 09:53:41,778 INFO L87 Difference]: Start difference. First operand has 21 states, 19 states have (on average 1.5263157894736843) 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) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 09:53:41,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 09:53:41,788 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2022-01-10 09:53:41,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 09:53:41,790 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 12 [2022-01-10 09:53:41,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 09:53:41,796 INFO L225 Difference]: With dead ends: 38 [2022-01-10 09:53:41,796 INFO L226 Difference]: Without dead ends: 17 [2022-01-10 09:53:41,798 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 09:53:41,800 INFO L933 BasicCegarLoop]: 24 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, 24 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 09:53:41,802 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 09:53:41,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-01-10 09:53:41,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-01-10 09:53:41,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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 09:53:41,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-01-10 09:53:41,825 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2022-01-10 09:53:41,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 09:53:41,826 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-01-10 09:53:41,826 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 09:53:41,826 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-01-10 09:53:41,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-10 09:53:41,826 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 09:53:41,827 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 09:53:41,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 09:53:41,827 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 09:53:41,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 09:53:41,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1055369552, now seen corresponding path program 1 times [2022-01-10 09:53:41,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 09:53:41,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574538871] [2022-01-10 09:53:41,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 09:53:41,828 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 09:53:41,862 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-10 09:53:41,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [441779793] [2022-01-10 09:53:41,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 09:53:41,863 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 09:53:41,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 09:53:41,865 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 09:53:41,866 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 09:53:41,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 09:53:41,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 20 conjunts are in the unsatisfiable core [2022-01-10 09:53:41,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 09:53:42,132 INFO L353 Elim1Store]: treesize reduction 56, result has 25.3 percent of original size [2022-01-10 09:53:42,134 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 81 [2022-01-10 09:53:42,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 09:53:42,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 09:53:42,153 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2022-01-10 09:53:42,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 09:53:42,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 09:53:42,182 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2022-01-10 09:53:42,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 09:53:42,343 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-01-10 09:53:42,400 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2022-01-10 09:53:42,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 09:53:42,406 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 23 treesize of output 15 [2022-01-10 09:53:42,554 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 09:53:42,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 09:53:42,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 09:53:42,574 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 09:53:42,598 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 09:53:42,599 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 330 treesize of output 155 [2022-01-10 09:53:42,660 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 09:53:42,661 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 09:53:42,661 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 09:53:42,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574538871] [2022-01-10 09:53:42,661 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-10 09:53:42,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441779793] [2022-01-10 09:53:42,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441779793] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 09:53:42,662 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 09:53:42,662 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 09:53:42,662 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134639773] [2022-01-10 09:53:42,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 09:53:42,663 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 09:53:42,663 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 09:53:42,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 09:53:42,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-10 09:53:42,664 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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 09:53:44,803 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 09:53:45,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 09:53:45,367 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-01-10 09:53:45,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 09:53:45,368 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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 12 [2022-01-10 09:53:45,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 09:53:45,369 INFO L225 Difference]: With dead ends: 34 [2022-01-10 09:53:45,369 INFO L226 Difference]: Without dead ends: 32 [2022-01-10 09:53:45,369 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-01-10 09:53:45,370 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 34 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-01-10 09:53:45,370 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 37 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 34 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-01-10 09:53:45,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-01-10 09:53:45,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 23. [2022-01-10 09:53:45,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 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 09:53:45,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-01-10 09:53:45,375 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 12 [2022-01-10 09:53:45,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 09:53:45,375 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-01-10 09:53:45,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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 09:53:45,375 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-01-10 09:53:45,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-10 09:53:45,375 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 09:53:45,376 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 09:53:45,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-10 09:53:45,580 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 09:53:45,581 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 09:53:45,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 09:53:45,581 INFO L85 PathProgramCache]: Analyzing trace with hash 312554478, now seen corresponding path program 1 times [2022-01-10 09:53:45,581 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 09:53:45,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399957293] [2022-01-10 09:53:45,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 09:53:45,582 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 09:53:45,639 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-10 09:53:45,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1444523052] [2022-01-10 09:53:45,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 09:53:45,640 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 09:53:45,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 09:53:45,641 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 09:53:45,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-10 09:53:45,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 09:53:45,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 09:53:45,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 09:53:45,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 09:53:45,788 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 09:53:45,788 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 09:53:45,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399957293] [2022-01-10 09:53:45,789 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-10 09:53:45,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444523052] [2022-01-10 09:53:45,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444523052] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 09:53:45,789 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 09:53:45,789 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 09:53:45,789 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366997999] [2022-01-10 09:53:45,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 09:53:45,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 09:53:45,790 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 09:53:45,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 09:53:45,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 09:53:45,790 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 09:53:47,829 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 09:53:49,972 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 09:53:50,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 09:53:50,457 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2022-01-10 09:53:50,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 09:53:50,460 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 14 [2022-01-10 09:53:50,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 09:53:50,460 INFO L225 Difference]: With dead ends: 42 [2022-01-10 09:53:50,460 INFO L226 Difference]: Without dead ends: 33 [2022-01-10 09:53:50,461 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 09:53:50,461 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 15 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-01-10 09:53:50,462 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 27 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 26 Invalid, 2 Unknown, 0 Unchecked, 4.7s Time] [2022-01-10 09:53:50,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-01-10 09:53:50,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 23. [2022-01-10 09:53:50,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 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 09:53:50,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2022-01-10 09:53:50,467 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 14 [2022-01-10 09:53:50,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 09:53:50,467 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2022-01-10 09:53:50,467 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 09:53:50,468 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-01-10 09:53:50,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-10 09:53:50,468 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 09:53:50,468 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 09:53:50,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-10 09:53:50,668 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-01-10 09:53:50,669 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 09:53:50,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 09:53:50,669 INFO L85 PathProgramCache]: Analyzing trace with hash -953919346, now seen corresponding path program 1 times [2022-01-10 09:53:50,669 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 09:53:50,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334713489] [2022-01-10 09:53:50,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 09:53:50,670 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 09:53:50,714 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-10 09:53:50,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [329127004] [2022-01-10 09:53:50,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 09:53:50,715 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 09:53:50,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 09:53:50,720 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 09:53:50,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-10 09:53:50,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 09:53:50,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 09:53:50,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 09:53:50,832 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 09:53:50,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 09:53:50,913 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 09:53:50,913 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 09:53:50,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334713489] [2022-01-10 09:53:50,914 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-10 09:53:50,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329127004] [2022-01-10 09:53:50,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329127004] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 09:53:50,914 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 09:53:50,914 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2022-01-10 09:53:50,914 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127964562] [2022-01-10 09:53:50,914 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 09:53:50,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 09:53:50,915 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 09:53:50,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 09:53:50,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-01-10 09:53:50,918 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 09:53:52,944 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 09:53:55,110 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 09:53:55,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 09:53:55,486 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-01-10 09:53:55,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 09:53:55,487 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-01-10 09:53:55,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 09:53:55,487 INFO L225 Difference]: With dead ends: 42 [2022-01-10 09:53:55,487 INFO L226 Difference]: Without dead ends: 35 [2022-01-10 09:53:55,487 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-01-10 09:53:55,488 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 25 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 14 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-01-10 09:53:55,488 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 49 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 59 Invalid, 2 Unknown, 0 Unchecked, 4.5s Time] [2022-01-10 09:53:55,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-01-10 09:53:55,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 24. [2022-01-10 09:53:55,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 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 09:53:55,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-01-10 09:53:55,492 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 14 [2022-01-10 09:53:55,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 09:53:55,492 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-01-10 09:53:55,492 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 09:53:55,493 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-01-10 09:53:55,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 09:53:55,493 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 09:53:55,493 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 09:53:55,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-10 09:53:55,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 09:53:55,700 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 09:53:55,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 09:53:55,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1017934828, now seen corresponding path program 1 times [2022-01-10 09:53:55,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 09:53:55,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170057080] [2022-01-10 09:53:55,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 09:53:55,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 09:53:55,722 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-10 09:53:55,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [48899839] [2022-01-10 09:53:55,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 09:53:55,722 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 09:53:55,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 09:53:55,732 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 09:53:55,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-10 09:53:55,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 09:53:55,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-10 09:53:55,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 09:53:56,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 09:53:56,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 09:53:56,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 09:53:56,278 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 09:53:56,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170057080] [2022-01-10 09:53:56,278 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-10 09:53:56,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48899839] [2022-01-10 09:53:56,278 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48899839] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 09:53:56,278 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 09:53:56,278 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-01-10 09:53:56,279 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263886909] [2022-01-10 09:53:56,279 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 09:53:56,279 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 09:53:56,279 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 09:53:56,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 09:53:56,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-01-10 09:53:56,280 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 09:53:58,395 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 09:54:00,505 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 09:54:02,703 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 09:54:04,806 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 09:54:05,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 09:54:05,468 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2022-01-10 09:54:05,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 09:54:05,471 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-01-10 09:54:05,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 09:54:05,471 INFO L225 Difference]: With dead ends: 41 [2022-01-10 09:54:05,472 INFO L226 Difference]: Without dead ends: 27 [2022-01-10 09:54:05,472 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-01-10 09:54:05,472 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 19 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 16 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2022-01-10 09:54:05,473 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 42 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 67 Invalid, 4 Unknown, 0 Unchecked, 9.2s Time] [2022-01-10 09:54:05,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-01-10 09:54:05,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2022-01-10 09:54:05,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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 09:54:05,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-01-10 09:54:05,477 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 16 [2022-01-10 09:54:05,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 09:54:05,477 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-01-10 09:54:05,477 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 09:54:05,477 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-01-10 09:54:05,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 09:54:05,477 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 09:54:05,477 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 09:54:05,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-10 09:54:05,678 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 09:54:05,678 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 09:54:05,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 09:54:05,678 INFO L85 PathProgramCache]: Analyzing trace with hash -978045364, now seen corresponding path program 1 times [2022-01-10 09:54:05,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 09:54:05,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921867312] [2022-01-10 09:54:05,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 09:54:05,679 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 09:54:05,718 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-10 09:54:05,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1342075325] [2022-01-10 09:54:05,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 09:54:05,719 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 09:54:05,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 09:54:05,720 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 09:54:05,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-10 09:54:06,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 09:54:06,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 39 conjunts are in the unsatisfiable core [2022-01-10 09:54:06,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 09:54:06,368 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 09:54:06,369 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2022-01-10 09:54:06,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 09:54:06,378 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-01-10 09:54:06,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 09:54:06,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 09:54:06,384 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2022-01-10 09:54:06,461 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2022-01-10 09:54:06,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 09:54:06,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 09:54:06,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 09:54:06,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 09:54:06,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 09:54:06,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 09:54:06,542 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 55 [2022-01-10 09:54:06,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 09:54:06,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 09:54:06,624 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 09:54:06,625 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 09:54:06,626 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 246 treesize of output 130 [2022-01-10 09:54:06,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 09:54:06,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 09:54:14,080 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_194 Int) (v_ArrVal_193 Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_10| Int)) (let ((.cse0 (let ((.cse3 (let ((.cse5 (mod (+ (* 18446744039349813248 (mod (div |c_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 2147483648) 2)) (* |c_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 8)) 18446744073709551616))) (store (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| .cse5) 18446744073709551616) v_ArrVal_194) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| .cse5 4) 18446744073709551616) v_ArrVal_193))) (.cse4 (mod (+ (* 8 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_10|) (* 18446744039349813248 (mod (div |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_10| 2147483648) 2))) 18446744073709551616))) (+ (* 4294967296 (select .cse3 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| .cse4 4) 18446744073709551616))) (select .cse3 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| .cse4) 18446744073709551616)))))) (or (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_10| 0)) (< .cse0 0) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_10|)) (= .cse0 (let ((.cse1 (mod (let ((.cse2 (mod (* 2 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_10|) 4294967296))) (+ (mod (* .cse2 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_10|) 4294967296) .cse2 1)) 4294967296))) (+ (* 18446744069414584320 (mod (div .cse1 2147483648) 2)) .cse1)))))) is different from false [2022-01-10 09:54:22,660 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_194 Int) (v_ArrVal_193 Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_10| Int)) (let ((.cse0 (let ((.cse3 (store (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| 8) 18446744073709551616) v_ArrVal_194) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| 12) 18446744073709551616) v_ArrVal_193)) (.cse4 (mod (+ (* 8 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_10|) (* 18446744039349813248 (mod (div |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_10| 2147483648) 2))) 18446744073709551616))) (+ (* (select .cse3 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| .cse4 4) 18446744073709551616)) 4294967296) (select .cse3 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| .cse4) 18446744073709551616)))))) (or (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_10| 0)) (= .cse0 (let ((.cse1 (mod (let ((.cse2 (mod (* 2 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_10|) 4294967296))) (+ (mod (* .cse2 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_10|) 4294967296) .cse2 1)) 4294967296))) (+ (* 18446744069414584320 (mod (div .cse1 2147483648) 2)) .cse1))) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_10|)) (< .cse0 0)))) is different from false [2022-01-10 09:54:24,664 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_194 Int) (v_ArrVal_193 Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_10| Int)) (let ((.cse0 (let ((.cse3 (store (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| 8) 18446744073709551616) v_ArrVal_194) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| 12) 18446744073709551616) v_ArrVal_193)) (.cse4 (mod (+ (* 8 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_10|) (* 18446744039349813248 (mod (div |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_10| 2147483648) 2))) 18446744073709551616))) (+ (* (select .cse3 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| .cse4 4) 18446744073709551616)) 4294967296) (select .cse3 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| .cse4) 18446744073709551616)))))) (or (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_10| 0)) (= .cse0 (let ((.cse1 (mod (let ((.cse2 (mod (* 2 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_10|) 4294967296))) (+ (mod (* .cse2 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_10|) 4294967296) .cse2 1)) 4294967296))) (+ (* 18446744069414584320 (mod (div .cse1 2147483648) 2)) .cse1))) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_10|)) (< .cse0 0)))) is different from true [2022-01-10 09:54:43,316 WARN L838 $PredicateComparison]: unable to prove that (or (not (< (+ c_~N~0Int (* 2 (mod |c_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 2147483648))) (+ (* (mod c_~N~0Int 2147483648) 2) |c_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|))) (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_194 Int) (v_ArrVal_193 Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_10| Int)) (let ((.cse0 (let ((.cse3 (store (store (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt| v_ArrVal_191) |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| 8) 18446744073709551616) v_ArrVal_194) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| 12) 18446744073709551616) v_ArrVal_193)) (.cse4 (mod (+ (* 8 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_10|) (* 18446744039349813248 (mod (div |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_10| 2147483648) 2))) 18446744073709551616))) (+ (* (select .cse3 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| .cse4 4) 18446744073709551616)) 4294967296) (select .cse3 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| .cse4) 18446744073709551616)))))) (or (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_10| 0)) (< .cse0 0) (= (let ((.cse1 (mod (let ((.cse2 (mod (* 2 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_10|) 4294967296))) (+ (mod (* .cse2 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_10|) 4294967296) .cse2 1)) 4294967296))) (+ (* 18446744069414584320 (mod (div .cse1 2147483648) 2)) .cse1)) .cse0) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_10|)))))) is different from false [2022-01-10 09:54:45,320 WARN L860 $PredicateComparison]: unable to prove that (or (not (< (+ c_~N~0Int (* 2 (mod |c_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 2147483648))) (+ (* (mod c_~N~0Int 2147483648) 2) |c_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|))) (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_194 Int) (v_ArrVal_193 Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_10| Int)) (let ((.cse0 (let ((.cse3 (store (store (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt| v_ArrVal_191) |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| 8) 18446744073709551616) v_ArrVal_194) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| 12) 18446744073709551616) v_ArrVal_193)) (.cse4 (mod (+ (* 8 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_10|) (* 18446744039349813248 (mod (div |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_10| 2147483648) 2))) 18446744073709551616))) (+ (* (select .cse3 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| .cse4 4) 18446744073709551616)) 4294967296) (select .cse3 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| .cse4) 18446744073709551616)))))) (or (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_10| 0)) (< .cse0 0) (= (let ((.cse1 (mod (let ((.cse2 (mod (* 2 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_10|) 4294967296))) (+ (mod (* .cse2 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_10|) 4294967296) .cse2 1)) 4294967296))) (+ (* 18446744069414584320 (mod (div .cse1 2147483648) 2)) .cse1)) .cse0) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_10|)))))) is different from true [2022-01-10 09:54:45,370 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 09:54:45,373 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 209 treesize of output 201 [2022-01-10 09:54:45,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-01-10 09:54:45,425 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 09:54:45,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921867312] [2022-01-10 09:54:45,425 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-10 09:54:45,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342075325] [2022-01-10 09:54:45,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342075325] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 09:54:45,425 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 09:54:45,426 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2022-01-10 09:54:45,426 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981194473] [2022-01-10 09:54:45,426 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 09:54:45,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-10 09:54:45,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 09:54:45,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-10 09:54:45,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=101, Unknown=5, NotChecked=66, Total=210 [2022-01-10 09:54:45,427 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 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 09:54:52,016 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 09:54:54,124 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.baseInt|)) (.cse6 (<= (+ (* 18446744069414584320 (mod (div c_~N~0Int 2147483648) 2)) c_~N~0Int) 536870911))) (and (<= 0 c_~N~0Int) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_assume_abort_if_not_~cond#1Int|) (= (select .cse0 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| 4) 18446744073709551616)) (mod (div 1 4294967296) 4294967296)) (= |c_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 1) (not (= 3 |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.baseInt|)) (= 1 (select |c_#validInt| 3)) (= (mod (div 1 1) 4294967296) (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt|)) (forall ((v_ArrVal_194 Int) (v_ArrVal_193 Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_10| Int)) (let ((.cse1 (let ((.cse4 (store (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| 8) 18446744073709551616) v_ArrVal_194) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| 12) 18446744073709551616) v_ArrVal_193)) (.cse5 (mod (+ (* 8 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_10|) (* 18446744039349813248 (mod (div |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_10| 2147483648) 2))) 18446744073709551616))) (+ (* (select .cse4 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| .cse5 4) 18446744073709551616)) 4294967296) (select .cse4 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| .cse5) 18446744073709551616)))))) (or (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_10| 0)) (= .cse1 (let ((.cse2 (mod (let ((.cse3 (mod (* 2 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_10|) 4294967296))) (+ (mod (* .cse3 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_10|) 4294967296) .cse3 1)) 4294967296))) (+ (* 18446744069414584320 (mod (div .cse2 2147483648) 2)) .cse2))) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_10|)) (< .cse1 0)))) (< c_~N~0Int 4294967296) .cse6 (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.baseInt|)) (= |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| 0) (or (<= |c_ULTIMATE.start_ULTIMATE.start_assume_abort_if_not_~cond#1Int| 0) (and (<= |c_ULTIMATE.start_ULTIMATE.start_assume_abort_if_not_~cond#1Int| 1) .cse6)))) is different from false [2022-01-10 09:54:56,128 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.baseInt|))) (and (= (select .cse0 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| 4) 18446744073709551616)) (mod (div 1 4294967296) 4294967296)) (not (= 3 |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.baseInt|)) (= (mod (div 1 1) 4294967296) (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt|)) (forall ((v_ArrVal_194 Int) (v_ArrVal_193 Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_10| Int)) (let ((.cse1 (let ((.cse4 (store (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| 8) 18446744073709551616) v_ArrVal_194) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| 12) 18446744073709551616) v_ArrVal_193)) (.cse5 (mod (+ (* 8 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_10|) (* 18446744039349813248 (mod (div |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_10| 2147483648) 2))) 18446744073709551616))) (+ (* (select .cse4 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| .cse5 4) 18446744073709551616)) 4294967296) (select .cse4 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| .cse5) 18446744073709551616)))))) (or (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_10| 0)) (= .cse1 (let ((.cse2 (mod (let ((.cse3 (mod (* 2 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_10|) 4294967296))) (+ (mod (* .cse3 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_10|) 4294967296) .cse3 1)) 4294967296))) (+ (* 18446744069414584320 (mod (div .cse2 2147483648) 2)) .cse2))) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_10|)) (< .cse1 0)))) (= |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| 0))) is different from false [2022-01-10 09:54:58,133 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.baseInt|))) (and (= (select .cse0 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| 4) 18446744073709551616)) (mod (div 1 4294967296) 4294967296)) (= |c_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 1) (forall ((v_ArrVal_194 Int) (v_ArrVal_193 Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_10| Int)) (let ((.cse1 (let ((.cse4 (let ((.cse6 (mod (+ (* 18446744039349813248 (mod (div |c_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 2147483648) 2)) (* |c_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 8)) 18446744073709551616))) (store (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| .cse6) 18446744073709551616) v_ArrVal_194) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| .cse6 4) 18446744073709551616) v_ArrVal_193))) (.cse5 (mod (+ (* 8 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_10|) (* 18446744039349813248 (mod (div |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_10| 2147483648) 2))) 18446744073709551616))) (+ (* 4294967296 (select .cse4 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| .cse5 4) 18446744073709551616))) (select .cse4 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| .cse5) 18446744073709551616)))))) (or (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_10| 0)) (< .cse1 0) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_10|)) (= .cse1 (let ((.cse2 (mod (let ((.cse3 (mod (* 2 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_10|) 4294967296))) (+ (mod (* .cse3 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_10|) 4294967296) .cse3 1)) 4294967296))) (+ (* 18446744069414584320 (mod (div .cse2 2147483648) 2)) .cse2)))))) (not (= 3 |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.baseInt|)) (= (mod (div 1 1) 4294967296) (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt|)) (= |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| 0))) is different from false