/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_NONE.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 21:01:59,617 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 21:01:59,619 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 21:01:59,673 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 21:01:59,676 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 21:01:59,679 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 21:01:59,681 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 21:01:59,683 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 21:01:59,685 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 21:01:59,689 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 21:01:59,689 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 21:01:59,690 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 21:01:59,691 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 21:01:59,692 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 21:01:59,694 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 21:01:59,697 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 21:01:59,697 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 21:01:59,698 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 21:01:59,700 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 21:01:59,705 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 21:01:59,706 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 21:01:59,707 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 21:01:59,708 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 21:01:59,709 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 21:01:59,715 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 21:01:59,715 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 21:01:59,716 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 21:01:59,717 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 21:01:59,717 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 21:01:59,718 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 21:01:59,718 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 21:01:59,719 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 21:01:59,720 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 21:01:59,721 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 21:01:59,722 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 21:01:59,722 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 21:01:59,723 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 21:01:59,723 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 21:01:59,723 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 21:01:59,724 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 21:01:59,725 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 21:01:59,726 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf [2022-01-10 21:01:59,754 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 21:01:59,755 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 21:01:59,756 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 21:01:59,756 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 21:01:59,757 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 21:01:59,757 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 21:01:59,757 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 21:01:59,757 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 21:01:59,758 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 21:01:59,758 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 21:01:59,759 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 21:01:59,759 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 21:01:59,759 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 21:01:59,759 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 21:01:59,759 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 21:01:59,759 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 21:01:59,760 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 21:01:59,760 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 21:01:59,760 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 21:01:59,760 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 21:01:59,760 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 21:01:59,761 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 21:01:59,762 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 21:01:59,762 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 21:01:59,762 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 21:01:59,762 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 21:01:59,762 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 21:01:59,762 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 21:01:59,763 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 21:01:59,763 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 21:01:59,763 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 21:01:59,763 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 21:01:59,764 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 21:01:59,764 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_NONE 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 21:01:59,977 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 21:02:00,004 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 21:02:00,008 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 21:02:00,009 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 21:02:00,010 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 21:02:00,011 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound1.c [2022-01-10 21:02:00,061 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9e16c1e4/685368a6d87d484696eacceeba3b43f6/FLAGf8f5fb393 [2022-01-10 21:02:00,427 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 21:02:00,428 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound1.c [2022-01-10 21:02:00,432 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9e16c1e4/685368a6d87d484696eacceeba3b43f6/FLAGf8f5fb393 [2022-01-10 21:02:00,440 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9e16c1e4/685368a6d87d484696eacceeba3b43f6 [2022-01-10 21:02:00,441 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 21:02:00,443 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 21:02:00,445 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 21:02:00,445 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 21:02:00,447 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 21:02:00,448 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 09:02:00" (1/1) ... [2022-01-10 21:02:00,449 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1be7f65b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:02:00, skipping insertion in model container [2022-01-10 21:02:00,449 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 09:02:00" (1/1) ... [2022-01-10 21:02:00,453 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 21:02:00,462 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 21:02:00,601 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound1.c[520,533] [2022-01-10 21:02:00,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 21:02:00,633 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 21:02:00,643 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound1.c[520,533] [2022-01-10 21:02:00,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 21:02:00,668 INFO L208 MainTranslator]: Completed translation [2022-01-10 21:02:00,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:02:00 WrapperNode [2022-01-10 21:02:00,668 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 21:02:00,669 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 21:02:00,669 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 21:02:00,669 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 21:02:00,674 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:02:00" (1/1) ... [2022-01-10 21:02:00,679 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:02:00" (1/1) ... [2022-01-10 21:02:00,693 INFO L137 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 71 [2022-01-10 21:02:00,693 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 21:02:00,694 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 21:02:00,694 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 21:02:00,694 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 21:02:00,699 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:02:00" (1/1) ... [2022-01-10 21:02:00,699 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:02:00" (1/1) ... [2022-01-10 21:02:00,707 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:02:00" (1/1) ... [2022-01-10 21:02:00,708 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:02:00" (1/1) ... [2022-01-10 21:02:00,718 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:02:00" (1/1) ... [2022-01-10 21:02:00,720 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:02:00" (1/1) ... [2022-01-10 21:02:00,721 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:02:00" (1/1) ... [2022-01-10 21:02:00,722 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 21:02:00,723 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 21:02:00,723 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 21:02:00,723 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 21:02:00,724 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:02:00" (1/1) ... [2022-01-10 21:02:00,730 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 21:02:00,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 21:02:00,750 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 21:02:00,774 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 21:02:00,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 21:02:00,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 21:02:00,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 21:02:00,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 21:02:00,839 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 21:02:00,841 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 21:02:01,258 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 21:02:01,262 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 21:02:01,262 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 21:02:01,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 09:02:01 BoogieIcfgContainer [2022-01-10 21:02:01,263 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 21:02:01,264 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 21:02:01,264 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 21:02:01,265 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 21:02:01,266 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 09:02:01" (1/1) ... [2022-01-10 21:02:01,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 09:02:01 BasicIcfg [2022-01-10 21:02:01,325 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 21:02:01,326 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 21:02:01,326 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 21:02:01,332 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 21:02:01,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 09:02:00" (1/4) ... [2022-01-10 21:02:01,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cf90112 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 09:02:01, skipping insertion in model container [2022-01-10 21:02:01,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:02:00" (2/4) ... [2022-01-10 21:02:01,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cf90112 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 09:02:01, skipping insertion in model container [2022-01-10 21:02:01,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 09:02:01" (3/4) ... [2022-01-10 21:02:01,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cf90112 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 09:02:01, skipping insertion in model container [2022-01-10 21:02:01,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 09:02:01" (4/4) ... [2022-01-10 21:02:01,334 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_unwindbound1.cTransformedIcfg [2022-01-10 21:02:01,338 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 21:02:01,338 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-01-10 21:02:01,379 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 21:02:01,390 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 21:02:01,390 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-01-10 21:02:01,399 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 32 states have internal predecessors, (41), 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 21:02:01,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-01-10 21:02:01,402 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:02:01,402 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-01-10 21:02:01,402 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-10 21:02:01,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:02:01,405 INFO L85 PathProgramCache]: Analyzing trace with hash -714381944, now seen corresponding path program 1 times [2022-01-10 21:02:01,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:02:01,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018084361] [2022-01-10 21:02:01,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:02:01,411 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:02:01,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:02:01,532 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 21:02:01,532 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:02:01,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018084361] [2022-01-10 21:02:01,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018084361] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:02:01,533 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:02:01,533 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 21:02:01,534 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610335896] [2022-01-10 21:02:01,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:02:01,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 21:02:01,538 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:02:01,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 21:02:01,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 21:02:01,559 INFO L87 Difference]: Start difference. First operand has 33 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 32 states have internal predecessors, (41), 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 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 21:02:01,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:02:01,574 INFO L93 Difference]: Finished difference Result 64 states and 80 transitions. [2022-01-10 21:02:01,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 21:02:01,576 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2022-01-10 21:02:01,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:02:01,580 INFO L225 Difference]: With dead ends: 64 [2022-01-10 21:02:01,580 INFO L226 Difference]: Without dead ends: 29 [2022-01-10 21:02:01,582 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 21:02:01,585 INFO L933 BasicCegarLoop]: 34 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, 34 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 21:02:01,585 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:02:01,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-01-10 21:02:01,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-01-10 21:02:01,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 28 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 21:02:01,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2022-01-10 21:02:01,610 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 6 [2022-01-10 21:02:01,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:02:01,610 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2022-01-10 21:02:01,610 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 21:02:01,611 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-01-10 21:02:01,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-01-10 21:02:01,612 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:02:01,612 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-01-10 21:02:01,612 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 21:02:01,612 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-10 21:02:01,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:02:01,614 INFO L85 PathProgramCache]: Analyzing trace with hash -714350166, now seen corresponding path program 1 times [2022-01-10 21:02:01,615 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:02:01,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511767282] [2022-01-10 21:02:01,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:02:01,615 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:02:01,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:02:01,816 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 21:02:01,817 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:02:01,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511767282] [2022-01-10 21:02:01,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511767282] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:02:01,818 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:02:01,818 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 21:02:01,818 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115780324] [2022-01-10 21:02:01,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:02:01,819 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:02:01,819 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:02:01,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:02:01,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:02:01,821 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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 21:02:02,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:02:02,095 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-01-10 21:02:02,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 21:02:02,095 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2022-01-10 21:02:02,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:02:02,096 INFO L225 Difference]: With dead ends: 32 [2022-01-10 21:02:02,096 INFO L226 Difference]: Without dead ends: 28 [2022-01-10 21:02:02,096 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 21:02:02,097 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 24 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 21:02:02,097 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 28 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 21:02:02,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-01-10 21:02:02,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-01-10 21:02:02,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 24 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 21:02:02,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2022-01-10 21:02:02,104 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 6 [2022-01-10 21:02:02,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:02:02,104 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-01-10 21:02:02,104 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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 21:02:02,104 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-01-10 21:02:02,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-01-10 21:02:02,104 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:02:02,104 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:02:02,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 21:02:02,105 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-10 21:02:02,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:02:02,105 INFO L85 PathProgramCache]: Analyzing trace with hash 704293072, now seen corresponding path program 1 times [2022-01-10 21:02:02,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:02:02,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128899499] [2022-01-10 21:02:02,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:02:02,106 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:02:02,116 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-10 21:02:02,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [965668894] [2022-01-10 21:02:02,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:02:02,116 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 21:02:02,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 21:02:02,140 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 21:02:02,144 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 21:02:02,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:02:02,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-10 21:02:02,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 21:02:02,321 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 21:02:02,321 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 21:02:02,321 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:02:02,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128899499] [2022-01-10 21:02:02,322 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-10 21:02:02,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965668894] [2022-01-10 21:02:02,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965668894] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:02:02,322 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:02:02,322 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 21:02:02,322 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666833945] [2022-01-10 21:02:02,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:02:02,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 21:02:02,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:02:02,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 21:02:02,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 21:02:02,323 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 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 21:02:04,401 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-10 21:02:06,516 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-10 21:02:07,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:02:07,072 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2022-01-10 21:02:07,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 21:02:07,072 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 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 8 [2022-01-10 21:02:07,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:02:07,073 INFO L225 Difference]: With dead ends: 49 [2022-01-10 21:02:07,073 INFO L226 Difference]: Without dead ends: 45 [2022-01-10 21:02:07,073 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-01-10 21:02:07,074 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 48 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 25 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-01-10 21:02:07,074 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 41 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 38 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2022-01-10 21:02:07,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-01-10 21:02:07,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2022-01-10 21:02:07,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 37 states have internal predecessors, (42), 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 21:02:07,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-01-10 21:02:07,083 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 8 [2022-01-10 21:02:07,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:02:07,083 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-01-10 21:02:07,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 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 21:02:07,083 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-01-10 21:02:07,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-01-10 21:02:07,084 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:02:07,084 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:02:07,117 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 21:02:07,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 21:02:07,295 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-10 21:02:07,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:02:07,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1779155018, now seen corresponding path program 1 times [2022-01-10 21:02:07,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:02:07,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402728547] [2022-01-10 21:02:07,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:02:07,296 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:02:07,305 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-10 21:02:07,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1577522058] [2022-01-10 21:02:07,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:02:07,306 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 21:02:07,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 21:02:07,308 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 21:02:07,309 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 21:02:07,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:02:07,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-10 21:02:07,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 21:02:07,406 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 21:02:07,406 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 21:02:07,406 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:02:07,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402728547] [2022-01-10 21:02:07,408 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-10 21:02:07,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577522058] [2022-01-10 21:02:07,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577522058] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:02:07,411 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:02:07,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 21:02:07,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323179307] [2022-01-10 21:02:07,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:02:07,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:02:07,412 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:02:07,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:02:07,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:02:07,413 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 21:02:07,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:02:07,521 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2022-01-10 21:02:07,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 21:02:07,521 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2022-01-10 21:02:07,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:02:07,522 INFO L225 Difference]: With dead ends: 45 [2022-01-10 21:02:07,522 INFO L226 Difference]: Without dead ends: 34 [2022-01-10 21:02:07,522 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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 21:02:07,523 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 15 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:02:07,523 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 45 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:02:07,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-01-10 21:02:07,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-01-10 21:02:07,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 33 states have internal predecessors, (35), 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 21:02:07,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2022-01-10 21:02:07,534 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 10 [2022-01-10 21:02:07,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:02:07,534 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2022-01-10 21:02:07,534 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 21:02:07,534 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-01-10 21:02:07,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-10 21:02:07,535 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:02:07,535 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:02:07,550 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 21:02:07,750 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,SelfDestructingSolverStorable3 [2022-01-10 21:02:07,752 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-10 21:02:07,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:02:07,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1165254023, now seen corresponding path program 1 times [2022-01-10 21:02:07,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:02:07,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472792978] [2022-01-10 21:02:07,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:02:07,753 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:02:07,812 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-10 21:02:07,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1356909890] [2022-01-10 21:02:07,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:02:07,812 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 21:02:07,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 21:02:07,814 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 21:02:07,863 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 21:02:07,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:02:07,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-10 21:02:07,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 21:02:08,120 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 21:02:08,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 21:02:08,206 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 21:02:08,206 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:02:08,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472792978] [2022-01-10 21:02:08,207 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-10 21:02:08,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356909890] [2022-01-10 21:02:08,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356909890] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 21:02:08,207 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 21:02:08,207 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-01-10 21:02:08,207 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108193420] [2022-01-10 21:02:08,207 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 21:02:08,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 21:02:08,207 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:02:08,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 21:02:08,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-10 21:02:08,208 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 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 21:02:08,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:02:08,285 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2022-01-10 21:02:08,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 21:02:08,285 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 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) Word has length 17 [2022-01-10 21:02:08,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:02:08,285 INFO L225 Difference]: With dead ends: 46 [2022-01-10 21:02:08,285 INFO L226 Difference]: Without dead ends: 23 [2022-01-10 21:02:08,286 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-01-10 21:02:08,286 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 26 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:02:08,286 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 64 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:02:08,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-01-10 21:02:08,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-01-10 21:02:08,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 22 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:02:08,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 22 transitions. [2022-01-10 21:02:08,291 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 22 transitions. Word has length 17 [2022-01-10 21:02:08,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:02:08,291 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 22 transitions. [2022-01-10 21:02:08,291 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 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 21:02:08,291 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 22 transitions. [2022-01-10 21:02:08,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 21:02:08,292 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:02:08,292 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:02:08,310 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 21:02:08,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 21:02:08,503 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-10 21:02:08,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:02:08,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1797550821, now seen corresponding path program 1 times [2022-01-10 21:02:08,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:02:08,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843791660] [2022-01-10 21:02:08,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:02:08,504 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:02:08,513 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-10 21:02:08,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [264312055] [2022-01-10 21:02:08,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:02:08,514 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 21:02:08,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 21:02:08,525 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 21:02:08,539 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 21:02:08,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:02:08,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 26 conjunts are in the unsatisfiable core [2022-01-10 21:02:08,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 21:02:08,898 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 21:02:08,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 21:02:26,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 21:02:26,837 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:02:26,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843791660] [2022-01-10 21:02:26,837 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-10 21:02:26,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264312055] [2022-01-10 21:02:26,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264312055] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-10 21:02:26,838 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 21:02:26,838 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 12 [2022-01-10 21:02:26,838 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349199481] [2022-01-10 21:02:26,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:02:26,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 21:02:26,838 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:02:26,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 21:02:26,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-01-10 21:02:26,839 INFO L87 Difference]: Start difference. First operand 23 states and 22 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 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 21:02:30,566 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-10 21:02:32,716 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-10 21:02:34,724 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-10 21:02:36,730 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-10 21:02:39,060 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-10 21:02:41,596 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-10 21:02:41,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:02:41,602 INFO L93 Difference]: Finished difference Result 23 states and 22 transitions. [2022-01-10 21:02:41,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 21:02:41,602 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-01-10 21:02:41,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:02:41,603 INFO L225 Difference]: With dead ends: 23 [2022-01-10 21:02:41,603 INFO L226 Difference]: Without dead ends: 21 [2022-01-10 21:02:41,603 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2022-01-10 21:02:41,603 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 48 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 31 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2022-01-10 21:02:41,604 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 22 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 13 Invalid, 6 Unknown, 0 Unchecked, 12.4s Time] [2022-01-10 21:02:41,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-01-10 21:02:41,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-01-10 21:02:41,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.0) internal successors, (20), 20 states have internal predecessors, (20), 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 21:02:41,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 20 transitions. [2022-01-10 21:02:41,609 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 20 transitions. Word has length 18 [2022-01-10 21:02:41,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:02:41,609 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 20 transitions. [2022-01-10 21:02:41,609 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 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 21:02:41,609 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2022-01-10 21:02:41,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-10 21:02:41,609 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:02:41,610 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:02:41,616 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 21:02:41,814 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 21:02:41,814 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-10 21:02:41,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:02:41,815 INFO L85 PathProgramCache]: Analyzing trace with hash -869450496, now seen corresponding path program 1 times [2022-01-10 21:02:41,815 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:02:41,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122724562] [2022-01-10 21:02:41,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:02:41,815 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:02:41,824 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-10 21:02:41,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [612231437] [2022-01-10 21:02:41,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:02:41,824 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 21:02:41,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 21:02:41,834 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 21:02:41,847 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 21:02:41,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:02:41,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-10 21:02:41,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 21:02:42,033 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 21:02:42,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 21:02:42,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 21:02:42,492 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:02:42,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122724562] [2022-01-10 21:02:42,493 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-10 21:02:42,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612231437] [2022-01-10 21:02:42,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612231437] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-10 21:02:42,493 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 21:02:42,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-01-10 21:02:42,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184445066] [2022-01-10 21:02:42,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:02:42,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:02:42,493 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:02:42,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:02:42,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 21:02:42,494 INFO L87 Difference]: Start difference. First operand 21 states and 20 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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 21:02:42,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:02:42,686 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2022-01-10 21:02:42,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 21:02:42,687 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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) Word has length 20 [2022-01-10 21:02:42,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:02:42,687 INFO L225 Difference]: With dead ends: 21 [2022-01-10 21:02:42,688 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 21:02:42,688 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-10 21:02:42,688 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 4 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:02:42,688 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 14 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:02:42,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 21:02:42,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 21:02:42,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:02:42,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 21:02:42,689 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2022-01-10 21:02:42,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:02:42,689 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 21:02:42,689 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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 21:02:42,689 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 21:02:42,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 21:02:42,693 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-01-10 21:02:42,694 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-01-10 21:02:42,694 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2022-01-10 21:02:42,694 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-01-10 21:02:42,694 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-01-10 21:02:42,694 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-01-10 21:02:42,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-10 21:02:42,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 21:02:42,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 21:02:58,536 WARN L228 SmtUtils]: Spent 15.45s on a formula simplification. DAG size of input: 73 DAG size of output: 64 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-01-10 21:03:09,678 WARN L228 SmtUtils]: Spent 11.14s on a formula simplification. DAG size of input: 77 DAG size of output: 63 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-01-10 21:03:20,075 WARN L228 SmtUtils]: Spent 10.34s on a formula simplification. DAG size of input: 71 DAG size of output: 58 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-01-10 21:03:20,078 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 21:03:20,078 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 21:03:20,078 INFO L854 garLoopResultBuilder]: At program point L30-3(lines 30 42) the Hoare annotation is: (let ((.cse6 (* 2 |ULTIMATE.start_ULTIMATE.start_main_~a~0#1Int|))) (let ((.cse7 (let ((.cse8 (div .cse6 18446744073709551616))) (+ |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| (* 18446744073709551616 (div (+ (* (- 18446744073709551616) .cse8) .cse6 1) 18446744073709551616)) (* 18446744073709551616 .cse8))))) (let ((.cse0 (<= 0 ~counter~0Int)) (.cse1 (<= .cse7 (+ .cse6 1))) (.cse2 (< .cse6 .cse7)) (.cse3 (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~a~0#1Int|)) (.cse4 (= (mod (let ((.cse5 (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~a~0#1Int| 1) 18446744073709551616))) (* .cse5 .cse5)) 18446744073709551616) |ULTIMATE.start_ULTIMATE.start_main_~s~0#1Int|))) (or (and .cse0 (= |ULTIMATE.start_ULTIMATE.start_main_~a~0#1Int| 0) .cse1 (<= ~counter~0Int 0) .cse2 .cse3 .cse4) (and .cse0 (< ~counter~0Int 4294967296) (<= 1 |ULTIMATE.start_ULTIMATE.start___VERIFIER_assert_~cond#1Int|) .cse1 (<= (div (+ (- 1) ~counter~0Int) (- 4294967296)) (div (+ (* (- 1) ~counter~0Int) 1) 4294967296)) (= (mod (+ (mod (* 18446744073709551615 (mod (* |ULTIMATE.start_ULTIMATE.start_main_~s~0#1Int| 4) 18446744073709551616)) 18446744073709551616) (mod (* |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| 2) 18446744073709551616) (mod (* |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int|) 18446744073709551616) 1) 18446744073709551616) 0) .cse2 .cse3 .cse4))))) [2022-01-10 21:03:20,079 INFO L858 garLoopResultBuilder]: For program point L30-4(lines 30 42) no Hoare annotation was computed. [2022-01-10 21:03:20,079 INFO L858 garLoopResultBuilder]: For program point L30-1(lines 30 42) no Hoare annotation was computed. [2022-01-10 21:03:20,079 INFO L858 garLoopResultBuilder]: For program point L12-9(lines 12 15) no Hoare annotation was computed. [2022-01-10 21:03:20,079 INFO L858 garLoopResultBuilder]: For program point L12(lines 12 15) no Hoare annotation was computed. [2022-01-10 21:03:20,079 INFO L858 garLoopResultBuilder]: For program point L13-3(lines 13 14) no Hoare annotation was computed. [2022-01-10 21:03:20,079 INFO L854 garLoopResultBuilder]: At program point L12-11(lines 11 17) the Hoare annotation is: (let ((.cse0 (<= 1 |ULTIMATE.start_ULTIMATE.start___VERIFIER_assert_~cond#1Int|))) (or (and .cse0 (= |ULTIMATE.start_ULTIMATE.start_main_~a~0#1Int| 0) (= |ULTIMATE.start_ULTIMATE.start_main_~s~0#1Int| 1) (<= |ULTIMATE.start_ULTIMATE.start___VERIFIER_assert_~cond#1Int| 1) (= |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| 1)) (let ((.cse2 (* 2 |ULTIMATE.start_ULTIMATE.start_main_~a~0#1Int|))) (let ((.cse1 (let ((.cse5 (div .cse2 18446744073709551616))) (+ |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| (* 18446744073709551616 (div (+ (* (- 18446744073709551616) .cse5) .cse2 1) 18446744073709551616)) (* 18446744073709551616 .cse5)))) (.cse3 (+ ~counter~0Int 1))) (and .cse0 (<= .cse1 (+ .cse2 1)) (= (mod (+ (mod (* 18446744073709551615 (mod (* |ULTIMATE.start_ULTIMATE.start_main_~s~0#1Int| 4) 18446744073709551616)) 18446744073709551616) (mod (* |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| 2) 18446744073709551616) (mod (* |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int|) 18446744073709551616) 1) 18446744073709551616) 0) (< .cse2 .cse1) (not (< (* (mod .cse3 2147483648) 2) (+ (mod .cse3 4294967296) 1))) (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~a~0#1Int|) (or (not (< ~counter~0Int 4294967296)) (not (< (* (mod ~counter~0Int 2147483648) 2) .cse3))) (= (mod (let ((.cse4 (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~a~0#1Int| 1) 18446744073709551616))) (* .cse4 .cse4)) 18446744073709551616) |ULTIMATE.start_ULTIMATE.start_main_~s~0#1Int|)))))) [2022-01-10 21:03:20,079 INFO L858 garLoopResultBuilder]: For program point L13(lines 13 14) no Hoare annotation was computed. [2022-01-10 21:03:20,079 INFO L854 garLoopResultBuilder]: At program point L12-2(lines 11 17) the Hoare annotation is: (and (<= 0 ~counter~0Int) (< ~counter~0Int 4294967296) (<= 1 |ULTIMATE.start_ULTIMATE.start___VERIFIER_assert_~cond#1Int|) (= |ULTIMATE.start_ULTIMATE.start_main_~a~0#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start___VERIFIER_assert_~cond#1Int| 1) (<= (div (+ (- 1) ~counter~0Int) (- 4294967296)) (div (+ (* (- 1) ~counter~0Int) 1) 4294967296)) (= |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| 1) (= (mod (let ((.cse0 (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~a~0#1Int| 1) 18446744073709551616))) (* .cse0 .cse0)) 18446744073709551616) |ULTIMATE.start_ULTIMATE.start_main_~s~0#1Int|)) [2022-01-10 21:03:20,079 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2022-01-10 21:03:20,079 INFO L858 garLoopResultBuilder]: For program point L12-12(lines 12 15) no Hoare annotation was computed. [2022-01-10 21:03:20,080 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2022-01-10 21:03:20,080 INFO L858 garLoopResultBuilder]: For program point L12-3(lines 12 15) no Hoare annotation was computed. [2022-01-10 21:03:20,080 INFO L858 garLoopResultBuilder]: For program point L13-4(lines 13 14) no Hoare annotation was computed. [2022-01-10 21:03:20,080 INFO L854 garLoopResultBuilder]: At program point L12-14(lines 11 17) the Hoare annotation is: (let ((.cse6 (* 2 |ULTIMATE.start_ULTIMATE.start_main_~a~0#1Int|))) (let ((.cse7 (let ((.cse8 (div .cse6 18446744073709551616))) (+ |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| (* 18446744073709551616 (div (+ (* (- 18446744073709551616) .cse8) .cse6 1) 18446744073709551616)) (* 18446744073709551616 .cse8))))) (let ((.cse0 (<= 1 |ULTIMATE.start_ULTIMATE.start___VERIFIER_assert_~cond#1Int|)) (.cse1 (<= .cse7 (+ .cse6 1))) (.cse2 (< .cse6 .cse7)) (.cse3 (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~a~0#1Int|))) (or (and .cse0 (= |ULTIMATE.start_ULTIMATE.start_main_~s~0#1Int| 1) .cse1 (= |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| 1) .cse2 .cse3) (let ((.cse4 (+ ~counter~0Int 1))) (and .cse0 .cse1 (= (mod (+ (mod (* 18446744073709551615 (mod (* |ULTIMATE.start_ULTIMATE.start_main_~s~0#1Int| 4) 18446744073709551616)) 18446744073709551616) (mod (* |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| 2) 18446744073709551616) (mod (* |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int|) 18446744073709551616) 1) 18446744073709551616) 0) .cse2 (not (< (* (mod .cse4 2147483648) 2) (+ (mod .cse4 4294967296) 1))) .cse3 (or (not (< ~counter~0Int 4294967296)) (not (< (* (mod ~counter~0Int 2147483648) 2) .cse4))) (= (mod (let ((.cse5 (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~a~0#1Int| 1) 18446744073709551616))) (* .cse5 .cse5)) 18446744073709551616) |ULTIMATE.start_ULTIMATE.start_main_~s~0#1Int|))))))) [2022-01-10 21:03:20,080 INFO L858 garLoopResultBuilder]: For program point L13-1(lines 13 14) no Hoare annotation was computed. [2022-01-10 21:03:20,080 INFO L854 garLoopResultBuilder]: At program point L12-5(lines 11 17) the Hoare annotation is: (and (<= 0 ~counter~0Int) (< ~counter~0Int 4294967296) (<= 1 |ULTIMATE.start_ULTIMATE.start___VERIFIER_assert_~cond#1Int|) (= |ULTIMATE.start_ULTIMATE.start_main_~a~0#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start___VERIFIER_assert_~cond#1Int| 1) (<= (div (+ (- 1) ~counter~0Int) (- 4294967296)) (div (+ (* (- 1) ~counter~0Int) 1) 4294967296)) (= |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| 1) (= (mod (let ((.cse0 (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~a~0#1Int| 1) 18446744073709551616))) (* .cse0 .cse0)) 18446744073709551616) |ULTIMATE.start_ULTIMATE.start_main_~s~0#1Int|)) [2022-01-10 21:03:20,080 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2022-01-10 21:03:20,080 INFO L858 garLoopResultBuilder]: For program point L12-15(lines 12 15) no Hoare annotation was computed. [2022-01-10 21:03:20,080 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2022-01-10 21:03:20,080 INFO L858 garLoopResultBuilder]: For program point L12-6(lines 12 15) no Hoare annotation was computed. [2022-01-10 21:03:20,080 INFO L858 garLoopResultBuilder]: For program point L13-5(lines 13 14) no Hoare annotation was computed. [2022-01-10 21:03:20,080 INFO L861 garLoopResultBuilder]: At program point L12-17(lines 11 17) the Hoare annotation is: true [2022-01-10 21:03:20,081 INFO L858 garLoopResultBuilder]: For program point L13-2(lines 13 14) no Hoare annotation was computed. [2022-01-10 21:03:20,081 INFO L854 garLoopResultBuilder]: At program point L12-8(lines 11 17) the Hoare annotation is: (and (<= 0 ~counter~0Int) (< ~counter~0Int 4294967296) (<= 1 |ULTIMATE.start_ULTIMATE.start___VERIFIER_assert_~cond#1Int|) (= |ULTIMATE.start_ULTIMATE.start_main_~a~0#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start___VERIFIER_assert_~cond#1Int| 1) (<= (div (+ (- 1) ~counter~0Int) (- 4294967296)) (div (+ (* (- 1) ~counter~0Int) 1) 4294967296)) (= |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| 1) (= (mod (let ((.cse0 (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~a~0#1Int| 1) 18446744073709551616))) (* .cse0 .cse0)) 18446744073709551616) |ULTIMATE.start_ULTIMATE.start_main_~s~0#1Int|)) [2022-01-10 21:03:20,081 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2022-01-10 21:03:20,081 INFO L861 garLoopResultBuilder]: At program point L48(lines 21 49) the Hoare annotation is: true [2022-01-10 21:03:20,081 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2022-01-10 21:03:20,081 INFO L858 garLoopResultBuilder]: For program point L36(lines 36 37) no Hoare annotation was computed. [2022-01-10 21:03:20,081 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 21:03:20,081 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 21:03:20,083 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:03:20,085 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 21:03:20,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 09:03:20 BasicIcfg [2022-01-10 21:03:20,158 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 21:03:20,159 INFO L158 Benchmark]: Toolchain (without parser) took 79716.05ms. Allocated memory was 191.9MB in the beginning and 230.7MB in the end (delta: 38.8MB). Free memory was 141.8MB in the beginning and 205.6MB in the end (delta: -63.8MB). Peak memory consumption was 103.3MB. Max. memory is 8.0GB. [2022-01-10 21:03:20,159 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 191.9MB. Free memory is still 158.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 21:03:20,159 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.28ms. Allocated memory is still 191.9MB. Free memory was 141.7MB in the beginning and 169.5MB in the end (delta: -27.8MB). Peak memory consumption was 7.6MB. Max. memory is 8.0GB. [2022-01-10 21:03:20,159 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.44ms. Allocated memory is still 191.9MB. Free memory was 169.0MB in the beginning and 167.9MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 21:03:20,159 INFO L158 Benchmark]: Boogie Preprocessor took 28.32ms. Allocated memory is still 191.9MB. Free memory was 167.4MB in the beginning and 166.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 21:03:20,160 INFO L158 Benchmark]: RCFGBuilder took 540.79ms. Allocated memory is still 191.9MB. Free memory was 166.4MB in the beginning and 155.4MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-01-10 21:03:20,160 INFO L158 Benchmark]: IcfgTransformer took 61.51ms. Allocated memory is still 191.9MB. Free memory was 155.4MB in the beginning and 151.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-01-10 21:03:20,160 INFO L158 Benchmark]: TraceAbstraction took 78831.97ms. Allocated memory was 191.9MB in the beginning and 230.7MB in the end (delta: 38.8MB). Free memory was 150.6MB in the beginning and 205.6MB in the end (delta: -55.0MB). Peak memory consumption was 112.3MB. Max. memory is 8.0GB. [2022-01-10 21:03:20,161 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 191.9MB. Free memory is still 158.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 223.28ms. Allocated memory is still 191.9MB. Free memory was 141.7MB in the beginning and 169.5MB in the end (delta: -27.8MB). Peak memory consumption was 7.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.44ms. Allocated memory is still 191.9MB. Free memory was 169.0MB in the beginning and 167.9MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.32ms. Allocated memory is still 191.9MB. Free memory was 167.4MB in the beginning and 166.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 540.79ms. Allocated memory is still 191.9MB. Free memory was 166.4MB in the beginning and 155.4MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 61.51ms. Allocated memory is still 191.9MB. Free memory was 155.4MB in the beginning and 151.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * TraceAbstraction took 78831.97ms. Allocated memory was 191.9MB in the beginning and 230.7MB in the end (delta: 38.8MB). Free memory was 150.6MB in the beginning and 205.6MB in the end (delta: -55.0MB). Peak memory consumption was 112.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 14]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 14]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 14]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 14]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 14]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 14]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 33 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 78.7s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 20.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 37.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 7 mSolverCounterUnknown, 165 SdHoareTripleChecker+Valid, 17.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 165 mSDsluCounter, 248 SdHoareTripleChecker+Invalid, 17.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 123 mSDsCounter, 93 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 126 IncrementalHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 93 mSolverCounterUnsat, 125 mSDtfsCounter, 126 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 96 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 10.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=3, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 19 NumberOfFragments, 725 HoareAnnotationTreeSize, 8 FomulaSimplifications, 57 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 841 FormulaSimplificationTreeSizeReductionInter, 37.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 19.4s InterpolantComputationTime, 85 NumberOfCodeBlocks, 85 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 130 ConstructedInterpolants, 0 QuantifiedInterpolants, 1945 SizeOfPredicates, 21 NumberOfNonLiveVariables, 760 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 10/18 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: ((((((~bvule32(1bv32, cond) && ~bvsle64((if !(0bv33 == ~bvurem33(~bvadd16(8589934591bv33, ~zero_extendFrom32To33(counter)), 4294967296bv33)) then (if ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(counter))[32:32] == 1bv1 then ~bvadd16(~bvsdiv33(~bvadd16(8589934591bv33, ~zero_extendFrom32To33(counter)), 4294967296bv33), 1bv33) else ~bvsdiv33(~bvadd16(8589934591bv33, ~zero_extendFrom32To33(counter)), 4294967296bv33)) else ~bvsdiv33(~bvadd16(8589934591bv33, ~zero_extendFrom32To33(counter)), 4294967296bv33)), ~bvadd16(~sign_extendFrom8To32(~bvmul64(18446744073709551615bv64, ~zero_extendFrom32To64(counter))), 1bv65)[64:32])) && a == 0bv64) && ~bvule32(0bv32, counter)) && s == ~bvmul64(~zero_extendFrom64To128(~bvadd16(~zero_extendFrom64To65(a), 1bv65)[63:0]), ~zero_extendFrom64To128(~bvadd16(~zero_extendFrom64To65(a), 1bv65)[63:0]))[63:0]) && t == 1bv64) && ~bvule32(cond, 1bv32)) && ~bvult64(~zero_extendFrom32To33(counter), 4294967296bv33) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: ((((((~bvule32(1bv32, cond) && ~bvsle64((if !(0bv33 == ~bvurem33(~bvadd16(8589934591bv33, ~zero_extendFrom32To33(counter)), 4294967296bv33)) then (if ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(counter))[32:32] == 1bv1 then ~bvadd16(~bvsdiv33(~bvadd16(8589934591bv33, ~zero_extendFrom32To33(counter)), 4294967296bv33), 1bv33) else ~bvsdiv33(~bvadd16(8589934591bv33, ~zero_extendFrom32To33(counter)), 4294967296bv33)) else ~bvsdiv33(~bvadd16(8589934591bv33, ~zero_extendFrom32To33(counter)), 4294967296bv33)), ~bvadd16(~sign_extendFrom8To32(~bvmul64(18446744073709551615bv64, ~zero_extendFrom32To64(counter))), 1bv65)[64:32])) && a == 0bv64) && ~bvule32(0bv32, counter)) && s == ~bvmul64(~zero_extendFrom64To128(~bvadd16(~zero_extendFrom64To65(a), 1bv65)[63:0]), ~zero_extendFrom64To128(~bvadd16(~zero_extendFrom64To65(a), 1bv65)[63:0]))[63:0]) && t == 1bv64) && ~bvule32(cond, 1bv32)) && ~bvult64(~zero_extendFrom32To33(counter), 4294967296bv33) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: (((((((~bvule32(1bv32, cond) && s == ~bvmul64(~zero_extendFrom64To128(~bvadd16(~zero_extendFrom64To65(a), 1bv65)[63:0]), ~zero_extendFrom64To128(~bvadd16(~zero_extendFrom64To65(a), 1bv65)[63:0]))[63:0]) && 0bv64 == ~bvadd16(~bvadd16(~bvadd16(~zero_extendFrom64To65(~bvmul64(~zero_extendFrom64To128((s ++ 0bv2)[63:0]), 18446744073709551615bv128)[63:0]), ~zero_extendFrom64To65((t ++ 0bv1)[63:0])), ~zero_extendFrom64To65(~bvmul64(~zero_extendFrom64To128(t), ~zero_extendFrom64To128(t))[63:0])), 1bv65)[63:0]) && ~bvule64(0bv64, a)) && !~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(counter), 1bv33)[30:0] ++ 0bv1), ~bvadd16(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(counter), 1bv33)[31:0]), 1bv33))) && (!~bvult64(~zero_extendFrom32To33(counter[30:0] ++ 0bv1), ~bvadd16(~zero_extendFrom32To33(counter), 1bv33)) || !~bvult64(~zero_extendFrom32To33(counter), 4294967296bv33))) && ~bvsle64(~bvadd16(~bvadd16(~zero_extendFrom64To132(t), ~sign_extendFrom8To32(~bvmul64(~sign_extendFrom8To32(~bvadd16(~bvadd16(~sign_extendFrom8To32(~bvmul64(1361129467683753853835051685653363294208bv130, ~zero_extendFrom1To130(~bvmul64(2bv65, ~zero_extendFrom64To65(a))[64:64]))), ~zero_extendFrom65To131(~bvmul64(2bv65, ~zero_extendFrom64To65(a)))), 1bv131)[130:64]), 18446744073709551616bv131))), ~zero_extendFrom65To132(~bvmul64(~zero_extendFrom1To65(~bvmul64(2bv65, ~zero_extendFrom64To65(a))[64:64]), 18446744073709551616bv65))), ~zero_extendFrom66To132(~bvadd16(~zero_extendFrom65To66(~bvmul64(2bv65, ~zero_extendFrom64To65(a))), 1bv66)))) && ~bvslt32(~zero_extendFrom65To132(~bvmul64(2bv65, ~zero_extendFrom64To65(a))), ~bvadd16(~bvadd16(~zero_extendFrom64To132(t), ~sign_extendFrom8To32(~bvmul64(~sign_extendFrom8To32(~bvadd16(~bvadd16(~sign_extendFrom8To32(~bvmul64(1361129467683753853835051685653363294208bv130, ~zero_extendFrom1To130(~bvmul64(2bv65, ~zero_extendFrom64To65(a))[64:64]))), ~zero_extendFrom65To131(~bvmul64(2bv65, ~zero_extendFrom64To65(a)))), 1bv131)[130:64]), 18446744073709551616bv131))), ~zero_extendFrom65To132(~bvmul64(~zero_extendFrom1To65(~bvmul64(2bv65, ~zero_extendFrom64To65(a))[64:64]), 18446744073709551616bv65))))) || ((((~bvule32(1bv32, cond) && a == 0bv64) && s == 1bv64) && t == 1bv64) && ~bvule32(cond, 1bv32)) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: (((((~bvule32(1bv32, cond) && s == 1bv64) && t == 1bv64) && ~bvule64(0bv64, a)) && ~bvsle64(~bvadd16(~bvadd16(~zero_extendFrom64To132(t), ~sign_extendFrom8To32(~bvmul64(~sign_extendFrom8To32(~bvadd16(~bvadd16(~sign_extendFrom8To32(~bvmul64(1361129467683753853835051685653363294208bv130, ~zero_extendFrom1To130(~bvmul64(2bv65, ~zero_extendFrom64To65(a))[64:64]))), ~zero_extendFrom65To131(~bvmul64(2bv65, ~zero_extendFrom64To65(a)))), 1bv131)[130:64]), 18446744073709551616bv131))), ~zero_extendFrom65To132(~bvmul64(~zero_extendFrom1To65(~bvmul64(2bv65, ~zero_extendFrom64To65(a))[64:64]), 18446744073709551616bv65))), ~zero_extendFrom66To132(~bvadd16(~zero_extendFrom65To66(~bvmul64(2bv65, ~zero_extendFrom64To65(a))), 1bv66)))) && ~bvslt32(~zero_extendFrom65To132(~bvmul64(2bv65, ~zero_extendFrom64To65(a))), ~bvadd16(~bvadd16(~zero_extendFrom64To132(t), ~sign_extendFrom8To32(~bvmul64(~sign_extendFrom8To32(~bvadd16(~bvadd16(~sign_extendFrom8To32(~bvmul64(1361129467683753853835051685653363294208bv130, ~zero_extendFrom1To130(~bvmul64(2bv65, ~zero_extendFrom64To65(a))[64:64]))), ~zero_extendFrom65To131(~bvmul64(2bv65, ~zero_extendFrom64To65(a)))), 1bv131)[130:64]), 18446744073709551616bv131))), ~zero_extendFrom65To132(~bvmul64(~zero_extendFrom1To65(~bvmul64(2bv65, ~zero_extendFrom64To65(a))[64:64]), 18446744073709551616bv65))))) || (((((((~bvule32(1bv32, cond) && s == ~bvmul64(~zero_extendFrom64To128(~bvadd16(~zero_extendFrom64To65(a), 1bv65)[63:0]), ~zero_extendFrom64To128(~bvadd16(~zero_extendFrom64To65(a), 1bv65)[63:0]))[63:0]) && 0bv64 == ~bvadd16(~bvadd16(~bvadd16(~zero_extendFrom64To65(~bvmul64(~zero_extendFrom64To128((s ++ 0bv2)[63:0]), 18446744073709551615bv128)[63:0]), ~zero_extendFrom64To65((t ++ 0bv1)[63:0])), ~zero_extendFrom64To65(~bvmul64(~zero_extendFrom64To128(t), ~zero_extendFrom64To128(t))[63:0])), 1bv65)[63:0]) && ~bvule64(0bv64, a)) && !~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(counter), 1bv33)[30:0] ++ 0bv1), ~bvadd16(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(counter), 1bv33)[31:0]), 1bv33))) && (!~bvult64(~zero_extendFrom32To33(counter[30:0] ++ 0bv1), ~bvadd16(~zero_extendFrom32To33(counter), 1bv33)) || !~bvult64(~zero_extendFrom32To33(counter), 4294967296bv33))) && ~bvsle64(~bvadd16(~bvadd16(~zero_extendFrom64To132(t), ~sign_extendFrom8To32(~bvmul64(~sign_extendFrom8To32(~bvadd16(~bvadd16(~sign_extendFrom8To32(~bvmul64(1361129467683753853835051685653363294208bv130, ~zero_extendFrom1To130(~bvmul64(2bv65, ~zero_extendFrom64To65(a))[64:64]))), ~zero_extendFrom65To131(~bvmul64(2bv65, ~zero_extendFrom64To65(a)))), 1bv131)[130:64]), 18446744073709551616bv131))), ~zero_extendFrom65To132(~bvmul64(~zero_extendFrom1To65(~bvmul64(2bv65, ~zero_extendFrom64To65(a))[64:64]), 18446744073709551616bv65))), ~zero_extendFrom66To132(~bvadd16(~zero_extendFrom65To66(~bvmul64(2bv65, ~zero_extendFrom64To65(a))), 1bv66)))) && ~bvslt32(~zero_extendFrom65To132(~bvmul64(2bv65, ~zero_extendFrom64To65(a))), ~bvadd16(~bvadd16(~zero_extendFrom64To132(t), ~sign_extendFrom8To32(~bvmul64(~sign_extendFrom8To32(~bvadd16(~bvadd16(~sign_extendFrom8To32(~bvmul64(1361129467683753853835051685653363294208bv130, ~zero_extendFrom1To130(~bvmul64(2bv65, ~zero_extendFrom64To65(a))[64:64]))), ~zero_extendFrom65To131(~bvmul64(2bv65, ~zero_extendFrom64To65(a)))), 1bv131)[130:64]), 18446744073709551616bv131))), ~zero_extendFrom65To132(~bvmul64(~zero_extendFrom1To65(~bvmul64(2bv65, ~zero_extendFrom64To65(a))[64:64]), 18446744073709551616bv65))))) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: ((((((~bvule32(1bv32, cond) && ~bvsle64((if !(0bv33 == ~bvurem33(~bvadd16(8589934591bv33, ~zero_extendFrom32To33(counter)), 4294967296bv33)) then (if ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(counter))[32:32] == 1bv1 then ~bvadd16(~bvsdiv33(~bvadd16(8589934591bv33, ~zero_extendFrom32To33(counter)), 4294967296bv33), 1bv33) else ~bvsdiv33(~bvadd16(8589934591bv33, ~zero_extendFrom32To33(counter)), 4294967296bv33)) else ~bvsdiv33(~bvadd16(8589934591bv33, ~zero_extendFrom32To33(counter)), 4294967296bv33)), ~bvadd16(~sign_extendFrom8To32(~bvmul64(18446744073709551615bv64, ~zero_extendFrom32To64(counter))), 1bv65)[64:32])) && a == 0bv64) && ~bvule32(0bv32, counter)) && s == ~bvmul64(~zero_extendFrom64To128(~bvadd16(~zero_extendFrom64To65(a), 1bv65)[63:0]), ~zero_extendFrom64To128(~bvadd16(~zero_extendFrom64To65(a), 1bv65)[63:0]))[63:0]) && t == 1bv64) && ~bvule32(cond, 1bv32)) && ~bvult64(~zero_extendFrom32To33(counter), 4294967296bv33) - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((a == 0bv64 && ~bvule32(0bv32, counter)) && s == ~bvmul64(~zero_extendFrom64To128(~bvadd16(~zero_extendFrom64To65(a), 1bv65)[63:0]), ~zero_extendFrom64To128(~bvadd16(~zero_extendFrom64To65(a), 1bv65)[63:0]))[63:0]) && ~bvule32(counter, 0bv32)) && ~bvule64(0bv64, a)) && ~bvsle64(~bvadd16(~bvadd16(~zero_extendFrom64To132(t), ~sign_extendFrom8To32(~bvmul64(~sign_extendFrom8To32(~bvadd16(~bvadd16(~sign_extendFrom8To32(~bvmul64(1361129467683753853835051685653363294208bv130, ~zero_extendFrom1To130(~bvmul64(2bv65, ~zero_extendFrom64To65(a))[64:64]))), ~zero_extendFrom65To131(~bvmul64(2bv65, ~zero_extendFrom64To65(a)))), 1bv131)[130:64]), 18446744073709551616bv131))), ~zero_extendFrom65To132(~bvmul64(~zero_extendFrom1To65(~bvmul64(2bv65, ~zero_extendFrom64To65(a))[64:64]), 18446744073709551616bv65))), ~zero_extendFrom66To132(~bvadd16(~zero_extendFrom65To66(~bvmul64(2bv65, ~zero_extendFrom64To65(a))), 1bv66)))) && ~bvslt32(~zero_extendFrom65To132(~bvmul64(2bv65, ~zero_extendFrom64To65(a))), ~bvadd16(~bvadd16(~zero_extendFrom64To132(t), ~sign_extendFrom8To32(~bvmul64(~sign_extendFrom8To32(~bvadd16(~bvadd16(~sign_extendFrom8To32(~bvmul64(1361129467683753853835051685653363294208bv130, ~zero_extendFrom1To130(~bvmul64(2bv65, ~zero_extendFrom64To65(a))[64:64]))), ~zero_extendFrom65To131(~bvmul64(2bv65, ~zero_extendFrom64To65(a)))), 1bv131)[130:64]), 18446744073709551616bv131))), ~zero_extendFrom65To132(~bvmul64(~zero_extendFrom1To65(~bvmul64(2bv65, ~zero_extendFrom64To65(a))[64:64]), 18446744073709551616bv65))))) || ((((((((~bvule32(1bv32, cond) && ~bvsle64((if !(0bv33 == ~bvurem33(~bvadd16(8589934591bv33, ~zero_extendFrom32To33(counter)), 4294967296bv33)) then (if ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(counter))[32:32] == 1bv1 then ~bvadd16(~bvsdiv33(~bvadd16(8589934591bv33, ~zero_extendFrom32To33(counter)), 4294967296bv33), 1bv33) else ~bvsdiv33(~bvadd16(8589934591bv33, ~zero_extendFrom32To33(counter)), 4294967296bv33)) else ~bvsdiv33(~bvadd16(8589934591bv33, ~zero_extendFrom32To33(counter)), 4294967296bv33)), ~bvadd16(~sign_extendFrom8To32(~bvmul64(18446744073709551615bv64, ~zero_extendFrom32To64(counter))), 1bv65)[64:32])) && ~bvule32(0bv32, counter)) && s == ~bvmul64(~zero_extendFrom64To128(~bvadd16(~zero_extendFrom64To65(a), 1bv65)[63:0]), ~zero_extendFrom64To128(~bvadd16(~zero_extendFrom64To65(a), 1bv65)[63:0]))[63:0]) && 0bv64 == ~bvadd16(~bvadd16(~bvadd16(~zero_extendFrom64To65(~bvmul64(~zero_extendFrom64To128((s ++ 0bv2)[63:0]), 18446744073709551615bv128)[63:0]), ~zero_extendFrom64To65((t ++ 0bv1)[63:0])), ~zero_extendFrom64To65(~bvmul64(~zero_extendFrom64To128(t), ~zero_extendFrom64To128(t))[63:0])), 1bv65)[63:0]) && ~bvule64(0bv64, a)) && ~bvsle64(~bvadd16(~bvadd16(~zero_extendFrom64To132(t), ~sign_extendFrom8To32(~bvmul64(~sign_extendFrom8To32(~bvadd16(~bvadd16(~sign_extendFrom8To32(~bvmul64(1361129467683753853835051685653363294208bv130, ~zero_extendFrom1To130(~bvmul64(2bv65, ~zero_extendFrom64To65(a))[64:64]))), ~zero_extendFrom65To131(~bvmul64(2bv65, ~zero_extendFrom64To65(a)))), 1bv131)[130:64]), 18446744073709551616bv131))), ~zero_extendFrom65To132(~bvmul64(~zero_extendFrom1To65(~bvmul64(2bv65, ~zero_extendFrom64To65(a))[64:64]), 18446744073709551616bv65))), ~zero_extendFrom66To132(~bvadd16(~zero_extendFrom65To66(~bvmul64(2bv65, ~zero_extendFrom64To65(a))), 1bv66)))) && ~bvult64(~zero_extendFrom32To33(counter), 4294967296bv33)) && ~bvslt32(~zero_extendFrom65To132(~bvmul64(2bv65, ~zero_extendFrom64To65(a))), ~bvadd16(~bvadd16(~zero_extendFrom64To132(t), ~sign_extendFrom8To32(~bvmul64(~sign_extendFrom8To32(~bvadd16(~bvadd16(~sign_extendFrom8To32(~bvmul64(1361129467683753853835051685653363294208bv130, ~zero_extendFrom1To130(~bvmul64(2bv65, ~zero_extendFrom64To65(a))[64:64]))), ~zero_extendFrom65To131(~bvmul64(2bv65, ~zero_extendFrom64To65(a)))), 1bv131)[130:64]), 18446744073709551616bv131))), ~zero_extendFrom65To132(~bvmul64(~zero_extendFrom1To65(~bvmul64(2bv65, ~zero_extendFrom64To65(a))[64:64]), 18446744073709551616bv65))))) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-01-10 21:03:20,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...