/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_BITWISE.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_valuebound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 09:23:20,707 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 09:23:20,709 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 09:23:20,762 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 09:23:20,762 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 09:23:20,763 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 09:23:20,770 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 09:23:20,771 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 09:23:20,777 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 09:23:20,783 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 09:23:20,783 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 09:23:20,785 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 09:23:20,785 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 09:23:20,787 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 09:23:20,788 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 09:23:20,788 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 09:23:20,789 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 09:23:20,789 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 09:23:20,790 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 09:23:20,791 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 09:23:20,792 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 09:23:20,792 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 09:23:20,793 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 09:23:20,793 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 09:23:20,795 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 09:23:20,795 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 09:23:20,795 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 09:23:20,795 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 09:23:20,796 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 09:23:20,796 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 09:23:20,796 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 09:23:20,797 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 09:23:20,797 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 09:23:20,798 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 09:23:20,798 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 09:23:20,798 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 09:23:20,799 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 09:23:20,799 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 09:23:20,799 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 09:23:20,799 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 09:23:20,800 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 09:23:20,801 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_BITWISE.epf [2022-01-10 09:23:20,817 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 09:23:20,817 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 09:23:20,817 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 09:23:20,818 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 09:23:20,818 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 09:23:20,819 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 09:23:20,819 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 09:23:20,819 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 09:23:20,819 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 09:23:20,819 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 09:23:20,819 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 09:23:20,819 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 09:23:20,819 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 09:23:20,819 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 09:23:20,820 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 09:23:20,820 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 09:23:20,820 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 09:23:20,820 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 09:23:20,820 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 09:23:20,820 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 09:23:20,820 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 09:23:20,820 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 09:23:20,820 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 09:23:20,820 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 09:23:20,821 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 09:23:20,821 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 09:23:20,821 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 09:23:20,821 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 09:23:20,821 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 09:23:20,821 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 09:23:20,821 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 09:23:20,821 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 09:23:20,822 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 09:23:20,822 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_BITWISE WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 09:23:21,011 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 09:23:21,037 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 09:23:21,039 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 09:23:21,039 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 09:23:21,040 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 09:23:21,040 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_valuebound2.c [2022-01-10 09:23:21,084 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7034cb34/aafb108d1acc4eafbd489d65eeed87a4/FLAG0e7ee5f61 [2022-01-10 09:23:21,435 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 09:23:21,435 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_valuebound2.c [2022-01-10 09:23:21,442 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7034cb34/aafb108d1acc4eafbd489d65eeed87a4/FLAG0e7ee5f61 [2022-01-10 09:23:21,871 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7034cb34/aafb108d1acc4eafbd489d65eeed87a4 [2022-01-10 09:23:21,873 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 09:23:21,874 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 09:23:21,877 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 09:23:21,877 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 09:23:21,879 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 09:23:21,879 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 09:23:21" (1/1) ... [2022-01-10 09:23:21,880 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@207c1e33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:23:21, skipping insertion in model container [2022-01-10 09:23:21,880 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 09:23:21" (1/1) ... [2022-01-10 09:23:21,884 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 09:23:21,891 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 09:23:22,009 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_valuebound2.c[520,533] [2022-01-10 09:23:22,024 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 09:23:22,036 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 09:23:22,043 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_valuebound2.c[520,533] [2022-01-10 09:23:22,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 09:23:22,071 INFO L208 MainTranslator]: Completed translation [2022-01-10 09:23:22,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:23:22 WrapperNode [2022-01-10 09:23:22,072 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 09:23:22,072 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 09:23:22,073 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 09:23:22,073 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 09:23:22,079 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:23:22" (1/1) ... [2022-01-10 09:23:22,084 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:23:22" (1/1) ... [2022-01-10 09:23:22,100 INFO L137 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 70 [2022-01-10 09:23:22,100 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 09:23:22,100 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 09:23:22,100 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 09:23:22,100 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 09:23:22,106 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:23:22" (1/1) ... [2022-01-10 09:23:22,106 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:23:22" (1/1) ... [2022-01-10 09:23:22,114 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:23:22" (1/1) ... [2022-01-10 09:23:22,114 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:23:22" (1/1) ... [2022-01-10 09:23:22,124 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:23:22" (1/1) ... [2022-01-10 09:23:22,126 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:23:22" (1/1) ... [2022-01-10 09:23:22,127 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:23:22" (1/1) ... [2022-01-10 09:23:22,128 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 09:23:22,128 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 09:23:22,128 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 09:23:22,128 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 09:23:22,130 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:23:22" (1/1) ... [2022-01-10 09:23:22,134 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 09:23:22,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 09:23:22,152 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 09:23:22,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 09:23:22,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 09:23:22,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 09:23:22,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 09:23:22,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 09:23:22,215 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 09:23:22,216 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 09:23:22,517 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 09:23:22,521 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 09:23:22,522 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 09:23:22,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 09:23:22 BoogieIcfgContainer [2022-01-10 09:23:22,523 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 09:23:22,523 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 09:23:22,523 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 09:23:22,524 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 09:23:22,526 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 09:23:22" (1/1) ... [2022-01-10 09:23:22,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 09:23:22 BasicIcfg [2022-01-10 09:23:22,574 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 09:23:22,574 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 09:23:22,575 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 09:23:22,576 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 09:23:22,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 09:23:21" (1/4) ... [2022-01-10 09:23:22,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15790e56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 09:23:22, skipping insertion in model container [2022-01-10 09:23:22,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:23:22" (2/4) ... [2022-01-10 09:23:22,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15790e56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 09:23:22, skipping insertion in model container [2022-01-10 09:23:22,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 09:23:22" (3/4) ... [2022-01-10 09:23:22,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15790e56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 09:23:22, skipping insertion in model container [2022-01-10 09:23:22,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 09:23:22" (4/4) ... [2022-01-10 09:23:22,579 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_valuebound2.cTransformedIcfg [2022-01-10 09:23:22,582 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 09:23:22,582 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-01-10 09:23:22,616 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 09:23:22,621 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 09:23:22,621 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-01-10 09:23:22,635 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 33 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 09:23:22,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-01-10 09:23:22,639 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 09:23:22,639 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-01-10 09:23:22,640 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-10 09:23:22,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 09:23:22,643 INFO L85 PathProgramCache]: Analyzing trace with hash 536551784, now seen corresponding path program 1 times [2022-01-10 09:23:22,650 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 09:23:22,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087963051] [2022-01-10 09:23:22,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 09:23:22,652 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 09:23:22,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 09:23:22,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 09:23:22,761 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 09:23:22,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087963051] [2022-01-10 09:23:22,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087963051] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 09:23:22,762 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 09:23:22,763 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 09:23:22,764 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658110162] [2022-01-10 09:23:22,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 09:23:22,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 09:23:22,767 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 09:23:22,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 09:23:22,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 09:23:22,794 INFO L87 Difference]: Start difference. First operand has 34 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 33 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 09:23:22,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 09:23:22,810 INFO L93 Difference]: Finished difference Result 65 states and 82 transitions. [2022-01-10 09:23:22,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 09:23:22,813 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2022-01-10 09:23:22,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 09:23:22,817 INFO L225 Difference]: With dead ends: 65 [2022-01-10 09:23:22,817 INFO L226 Difference]: Without dead ends: 30 [2022-01-10 09:23:22,820 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 09:23:22,824 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 09:23:22,824 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 09:23:22,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-01-10 09:23:22,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-01-10 09:23:22,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.25) internal successors, (30), 29 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 09:23:22,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2022-01-10 09:23:22,853 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 7 [2022-01-10 09:23:22,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 09:23:22,853 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2022-01-10 09:23:22,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 09:23:22,854 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-01-10 09:23:22,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-01-10 09:23:22,854 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 09:23:22,855 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-01-10 09:23:22,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 09:23:22,855 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-10 09:23:22,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 09:23:22,858 INFO L85 PathProgramCache]: Analyzing trace with hash 537475305, now seen corresponding path program 1 times [2022-01-10 09:23:22,858 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 09:23:22,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387873370] [2022-01-10 09:23:22,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 09:23:22,858 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 09:23:22,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 09:23:23,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 09:23:23,071 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 09:23:23,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387873370] [2022-01-10 09:23:23,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387873370] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 09:23:23,071 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 09:23:23,071 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 09:23:23,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858906359] [2022-01-10 09:23:23,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 09:23:23,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 09:23:23,072 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 09:23:23,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 09:23:23,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 09:23:23,073 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 09:23:23,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 09:23:23,273 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-01-10 09:23:23,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 09:23:23,274 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2022-01-10 09:23:23,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 09:23:23,274 INFO L225 Difference]: With dead ends: 31 [2022-01-10 09:23:23,274 INFO L226 Difference]: Without dead ends: 27 [2022-01-10 09:23:23,275 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 09:23:23,276 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 20 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 09:23:23,276 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 27 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 09:23:23,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-01-10 09:23:23,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-01-10 09:23:23,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 25 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 09:23:23,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2022-01-10 09:23:23,285 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 7 [2022-01-10 09:23:23,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 09:23:23,285 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2022-01-10 09:23:23,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 09:23:23,286 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-01-10 09:23:23,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-01-10 09:23:23,286 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 09:23:23,286 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 09:23:23,286 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 09:23:23,287 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-10 09:23:23,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 09:23:23,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1117728014, now seen corresponding path program 1 times [2022-01-10 09:23:23,287 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 09:23:23,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792178337] [2022-01-10 09:23:23,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 09:23:23,288 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 09:23:23,305 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-10 09:23:23,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [162501799] [2022-01-10 09:23:23,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 09:23:23,306 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 09:23:23,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 09:23:23,310 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 09:23:23,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 09:23:23,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 09:23:23,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-10 09:23:23,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 09:23:23,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 09:23:23,446 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 09:23:23,446 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 09:23:23,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792178337] [2022-01-10 09:23:23,446 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-10 09:23:23,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162501799] [2022-01-10 09:23:23,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162501799] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 09:23:23,449 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 09:23:23,449 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 09:23:23,449 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373346642] [2022-01-10 09:23:23,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 09:23:23,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 09:23:23,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 09:23:23,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 09:23:23,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 09:23:23,451 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 09:23:24,781 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-10 09:23:25,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 09:23:25,923 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-01-10 09:23:25,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 09:23:25,925 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2022-01-10 09:23:25,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 09:23:25,926 INFO L225 Difference]: With dead ends: 48 [2022-01-10 09:23:25,926 INFO L226 Difference]: Without dead ends: 44 [2022-01-10 09:23:25,926 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 09:23:25,927 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 17 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-01-10 09:23:25,927 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 41 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-01-10 09:23:25,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-01-10 09:23:25,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2022-01-10 09:23:25,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 37 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 09:23:25,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2022-01-10 09:23:25,935 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 9 [2022-01-10 09:23:25,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 09:23:25,936 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2022-01-10 09:23:25,936 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 09:23:25,936 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2022-01-10 09:23:25,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-01-10 09:23:25,936 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 09:23:25,936 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 09:23:25,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-10 09:23:26,136 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 09:23:26,137 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-10 09:23:26,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 09:23:26,137 INFO L85 PathProgramCache]: Analyzing trace with hash 394833203, now seen corresponding path program 1 times [2022-01-10 09:23:26,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 09:23:26,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240938695] [2022-01-10 09:23:26,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 09:23:26,138 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 09:23:26,146 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-10 09:23:26,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1832769554] [2022-01-10 09:23:26,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 09:23:26,147 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 09:23:26,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 09:23:26,150 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 09:23:26,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-10 09:23:26,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 09:23:26,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-10 09:23:26,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 09:23:26,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 09:23:26,241 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 09:23:26,241 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 09:23:26,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240938695] [2022-01-10 09:23:26,241 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-10 09:23:26,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832769554] [2022-01-10 09:23:26,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832769554] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 09:23:26,246 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 09:23:26,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 09:23:26,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132480295] [2022-01-10 09:23:26,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 09:23:26,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 09:23:26,246 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 09:23:26,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 09:23:26,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 09:23:26,247 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 09:23:28,283 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-10 09:23:30,330 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 09:23:30,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 09:23:30,370 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-01-10 09:23:30,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 09:23:30,370 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2022-01-10 09:23:30,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 09:23:30,371 INFO L225 Difference]: With dead ends: 44 [2022-01-10 09:23:30,371 INFO L226 Difference]: Without dead ends: 34 [2022-01-10 09:23:30,371 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 09:23:30,372 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 11 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 16 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-01-10 09:23:30,372 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 42 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 29 Invalid, 2 Unknown, 0 Unchecked, 4.1s Time] [2022-01-10 09:23:30,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-01-10 09:23:30,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-01-10 09:23:30,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 33 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 09:23:30,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2022-01-10 09:23:30,380 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 11 [2022-01-10 09:23:30,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 09:23:30,380 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2022-01-10 09:23:30,380 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 09:23:30,380 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-01-10 09:23:30,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-10 09:23:30,380 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 09:23:30,380 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 09:23:30,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-10 09:23:30,581 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 09:23:30,581 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-10 09:23:30,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 09:23:30,582 INFO L85 PathProgramCache]: Analyzing trace with hash 852635260, now seen corresponding path program 1 times [2022-01-10 09:23:30,582 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 09:23:30,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743418997] [2022-01-10 09:23:30,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 09:23:30,582 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 09:23:30,592 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-10 09:23:30,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1323491977] [2022-01-10 09:23:30,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 09:23:30,592 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 09:23:30,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 09:23:30,597 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 09:23:30,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-10 09:23:30,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 09:23:30,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 25 conjunts are in the unsatisfiable core [2022-01-10 09:23:30,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 09:23:30,946 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 09:23:30,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 09:23:47,824 WARN L228 SmtUtils]: Spent 14.99s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-10 09:24:08,690 WARN L228 SmtUtils]: Spent 5.62s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-10 09:24:08,696 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 09:24:08,697 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 09:24:08,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743418997] [2022-01-10 09:24:08,697 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-10 09:24:08,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323491977] [2022-01-10 09:24:08,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323491977] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 09:24:08,697 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 09:24:08,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 12 [2022-01-10 09:24:08,697 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222365149] [2022-01-10 09:24:08,697 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 09:24:08,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-10 09:24:08,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 09:24:08,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-10 09:24:08,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=87, Unknown=1, NotChecked=0, Total=132 [2022-01-10 09:24:08,698 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 09:24:13,326 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 09:24:15,336 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1Int| 1) 18446744073709551616))) (and (= |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1Int| (mod (* .cse0 .cse0) 18446744073709551616)) (= (mod (let ((.cse1 (mod (+ .cse0 1) 18446744073709551616))) (* .cse1 .cse1)) 18446744073709551616) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1Int| (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| 2) 18446744073709551616)) 18446744073709551616)))) is different from false [2022-01-10 09:24:18,014 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 09:24:20,024 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 09:24:24,748 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 09:24:27,024 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 09:24:27,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 09:24:27,033 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2022-01-10 09:24:27,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 09:24:27,033 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-01-10 09:24:27,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 09:24:27,034 INFO L225 Difference]: With dead ends: 56 [2022-01-10 09:24:27,034 INFO L226 Difference]: Without dead ends: 42 [2022-01-10 09:24:27,034 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 36.3s TimeCoverageRelationStatistics Valid=100, Invalid=173, Unknown=3, NotChecked=30, Total=306 [2022-01-10 09:24:27,035 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 96 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 82 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2022-01-10 09:24:27,035 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 41 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 74 Invalid, 5 Unknown, 2 Unchecked, 12.1s Time] [2022-01-10 09:24:27,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-01-10 09:24:27,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2022-01-10 09:24:27,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 39 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 09:24:27,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2022-01-10 09:24:27,042 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 17 [2022-01-10 09:24:27,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 09:24:27,042 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2022-01-10 09:24:27,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 09:24:27,042 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-01-10 09:24:27,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-10 09:24:27,043 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 09:24:27,043 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-01-10 09:24:27,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-10 09:24:27,246 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 09:24:27,247 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-10 09:24:27,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 09:24:27,247 INFO L85 PathProgramCache]: Analyzing trace with hash 845912847, now seen corresponding path program 1 times [2022-01-10 09:24:27,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 09:24:27,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34242264] [2022-01-10 09:24:27,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 09:24:27,248 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 09:24:27,258 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-10 09:24:27,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [136516876] [2022-01-10 09:24:27,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 09:24:27,258 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 09:24:27,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 09:24:27,262 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 09:24:27,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-10 09:24:27,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 09:24:27,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-10 09:24:27,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 09:24:27,921 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 09:24:27,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 09:24:29,557 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 09:24:29,557 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 09:24:29,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34242264] [2022-01-10 09:24:29,558 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-10 09:24:29,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136516876] [2022-01-10 09:24:29,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136516876] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 09:24:29,558 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 09:24:29,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-01-10 09:24:29,558 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229339332] [2022-01-10 09:24:29,558 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 09:24:29,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 09:24:29,559 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 09:24:29,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 09:24:29,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-01-10 09:24:29,559 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 09:24:30,936 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-10 09:24:32,943 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 09:24:32,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 09:24:32,973 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-01-10 09:24:32,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 09:24:32,974 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 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 27 [2022-01-10 09:24:32,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 09:24:32,974 INFO L225 Difference]: With dead ends: 40 [2022-01-10 09:24:32,974 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 09:24:32,975 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-01-10 09:24:32,975 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 32 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-01-10 09:24:32,976 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 27 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 1 Unknown, 0 Unchecked, 3.2s Time] [2022-01-10 09:24:32,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 09:24:32,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 09:24:32,976 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 09:24:32,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 09:24:32,976 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2022-01-10 09:24:32,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 09:24:32,976 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 09:24:32,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 09:24:32,977 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 09:24:32,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 09:24:32,978 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-01-10 09:24:32,979 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-01-10 09:24:32,979 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2022-01-10 09:24:32,979 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-01-10 09:24:32,979 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-01-10 09:24:32,979 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-01-10 09:24:32,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-01-10 09:24:33,180 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 09:24:33,181 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 09:24:38,650 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 09:24:38,651 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 09:24:38,651 INFO L858 garLoopResultBuilder]: For program point L9(line 9) no Hoare annotation was computed. [2022-01-10 09:24:38,651 INFO L858 garLoopResultBuilder]: For program point L8(lines 8 10) no Hoare annotation was computed. [2022-01-10 09:24:38,651 INFO L854 garLoopResultBuilder]: At program point L30-2(lines 30 42) the Hoare annotation is: (let ((.cse7 (* (mod |ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| 2147483648) 2))) (let ((.cse0 (<= .cse7 (+ 2 |ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int|))) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| .cse7)) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_assume_abort_if_not_~cond#1Int| 1)) (.cse3 (<= 0 |ULTIMATE.start_ULTIMATE.start_assume_abort_if_not_~cond#1Int|))) (or (and .cse0 (= |ULTIMATE.start_ULTIMATE.start_main_~a~0#1Int| 0) (= |ULTIMATE.start_ULTIMATE.start_main_~s~0#1Int| 1) .cse1 (= |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| 1) .cse2 .cse3) (let ((.cse4 (* 2 |ULTIMATE.start_ULTIMATE.start_main_~a~0#1Int|))) (let ((.cse5 (let ((.cse6 (div .cse4 18446744073709551616))) (+ |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| (* 18446744073709551616 (div (+ (* (- 18446744073709551616) .cse6) .cse4 1) 18446744073709551616)) (* 18446744073709551616 .cse6))))) (and .cse0 (<= 1 |ULTIMATE.start_ULTIMATE.start___VERIFIER_assert_~cond#1Int|) (not (<= (+ 2 .cse4) .cse5)) .cse1 (= |ULTIMATE.start_ULTIMATE.start_main_~a~0#1Int| 1) .cse2 .cse3 (<= (+ .cse4 1) .cse5) (= |ULTIMATE.start_ULTIMATE.start_main_~s~0#1Int| 4))))))) [2022-01-10 09:24:38,651 INFO L858 garLoopResultBuilder]: For program point L30-3(lines 30 42) no Hoare annotation was computed. [2022-01-10 09:24:38,651 INFO L858 garLoopResultBuilder]: For program point L12(lines 12 15) no Hoare annotation was computed. [2022-01-10 09:24:38,651 INFO L858 garLoopResultBuilder]: For program point L12-9(lines 12 15) no Hoare annotation was computed. [2022-01-10 09:24:38,651 INFO L858 garLoopResultBuilder]: For program point L13(lines 13 14) no Hoare annotation was computed. [2022-01-10 09:24:38,652 INFO L854 garLoopResultBuilder]: At program point L12-2(lines 11 17) the Hoare annotation is: (let ((.cse8 (* 2 |ULTIMATE.start_ULTIMATE.start_main_~a~0#1Int|))) (let ((.cse7 (let ((.cse10 (div .cse8 18446744073709551616))) (+ |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| (* 18446744073709551616 (div (+ (* (- 18446744073709551616) .cse10) .cse8 1) 18446744073709551616)) (* 18446744073709551616 .cse10)))) (.cse9 (* (mod |ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| 2147483648) 2))) (let ((.cse0 (<= .cse9 (+ 2 |ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int|))) (.cse1 (<= 1 |ULTIMATE.start_ULTIMATE.start___VERIFIER_assert_~cond#1Int|)) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| .cse9)) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_assume_abort_if_not_~cond#1Int| 1)) (.cse4 (<= 0 |ULTIMATE.start_ULTIMATE.start_assume_abort_if_not_~cond#1Int|)) (.cse5 (<= (+ .cse8 1) .cse7)) (.cse6 (< .cse7 (+ 2 .cse8)))) (or (and .cse0 .cse1 (= |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) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_ULTIMATE.start_main_~a~0#1Int| 1) .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_ULTIMATE.start_main_~s~0#1Int| 4)))))) [2022-01-10 09:24:38,652 INFO L858 garLoopResultBuilder]: For program point L13-3(lines 13 14) no Hoare annotation was computed. [2022-01-10 09:24:38,652 INFO L854 garLoopResultBuilder]: At program point L12-11(lines 11 17) the Hoare annotation is: (let ((.cse4 (* 2 |ULTIMATE.start_ULTIMATE.start_main_~a~0#1Int|))) (let ((.cse3 (let ((.cse5 (div .cse4 18446744073709551616))) (+ |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| (* 18446744073709551616 (div (+ (* (- 18446744073709551616) .cse5) .cse4 1) 18446744073709551616)) (* 18446744073709551616 .cse5))))) (let ((.cse0 (<= 1 |ULTIMATE.start_ULTIMATE.start___VERIFIER_assert_~cond#1Int|)) (.cse1 (<= (+ .cse4 1) .cse3)) (.cse2 (< .cse3 (+ 2 .cse4)))) (or (and .cse0 (= |ULTIMATE.start_ULTIMATE.start_main_~a~0#1Int| 1) .cse1 .cse2 (= |ULTIMATE.start_ULTIMATE.start_main_~s~0#1Int| 4)) (and .cse0 (= |ULTIMATE.start_ULTIMATE.start_main_~a~0#1Int| 0) (= |ULTIMATE.start_ULTIMATE.start_main_~s~0#1Int| 1) .cse1 .cse2))))) [2022-01-10 09:24:38,652 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2022-01-10 09:24:38,652 INFO L858 garLoopResultBuilder]: For program point L12-3(lines 12 15) no Hoare annotation was computed. [2022-01-10 09:24:38,652 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2022-01-10 09:24:38,652 INFO L858 garLoopResultBuilder]: For program point L12-12(lines 12 15) no Hoare annotation was computed. [2022-01-10 09:24:38,652 INFO L858 garLoopResultBuilder]: For program point L13-1(lines 13 14) no Hoare annotation was computed. [2022-01-10 09:24:38,652 INFO L854 garLoopResultBuilder]: At program point L12-5(lines 11 17) the Hoare annotation is: (let ((.cse8 (* 2 |ULTIMATE.start_ULTIMATE.start_main_~a~0#1Int|))) (let ((.cse7 (let ((.cse10 (div .cse8 18446744073709551616))) (+ |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| (* 18446744073709551616 (div (+ (* (- 18446744073709551616) .cse10) .cse8 1) 18446744073709551616)) (* 18446744073709551616 .cse10)))) (.cse9 (* (mod |ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| 2147483648) 2))) (let ((.cse0 (<= .cse9 (+ 2 |ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int|))) (.cse1 (<= 1 |ULTIMATE.start_ULTIMATE.start___VERIFIER_assert_~cond#1Int|)) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| .cse9)) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_assume_abort_if_not_~cond#1Int| 1)) (.cse4 (<= 0 |ULTIMATE.start_ULTIMATE.start_assume_abort_if_not_~cond#1Int|)) (.cse5 (<= (+ .cse8 1) .cse7)) (.cse6 (< .cse7 (+ 2 .cse8)))) (or (and .cse0 .cse1 (= |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) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_ULTIMATE.start_main_~a~0#1Int| 1) .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_ULTIMATE.start_main_~s~0#1Int| 4)))))) [2022-01-10 09:24:38,652 INFO L858 garLoopResultBuilder]: For program point L13-4(lines 13 14) no Hoare annotation was computed. [2022-01-10 09:24:38,653 INFO L854 garLoopResultBuilder]: At program point L12-14(lines 11 17) the Hoare annotation is: (let ((.cse4 (* 2 |ULTIMATE.start_ULTIMATE.start_main_~a~0#1Int|))) (let ((.cse5 (let ((.cse6 (div .cse4 18446744073709551616))) (+ |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| (* 18446744073709551616 (div (+ (* (- 18446744073709551616) .cse6) .cse4 1) 18446744073709551616)) (* 18446744073709551616 .cse6))))) (let ((.cse0 (<= 1 |ULTIMATE.start_ULTIMATE.start___VERIFIER_assert_~cond#1Int|)) (.cse1 (not (<= (+ 2 .cse4) .cse5))) (.cse2 (<= (+ .cse4 1) .cse5)) (.cse3 (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~a~0#1Int|))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ULTIMATE.start_main_~a~0#1Int| 1) .cse2 (= |ULTIMATE.start_ULTIMATE.start_main_~s~0#1Int| 4) .cse3) (and .cse0 (= |ULTIMATE.start_ULTIMATE.start_main_~s~0#1Int| 1) .cse1 (= |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| 1) .cse2 .cse3))))) [2022-01-10 09:24:38,653 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2022-01-10 09:24:38,653 INFO L858 garLoopResultBuilder]: For program point L12-6(lines 12 15) no Hoare annotation was computed. [2022-01-10 09:24:38,653 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2022-01-10 09:24:38,653 INFO L858 garLoopResultBuilder]: For program point L12-15(lines 12 15) no Hoare annotation was computed. [2022-01-10 09:24:38,653 INFO L858 garLoopResultBuilder]: For program point L13-2(lines 13 14) no Hoare annotation was computed. [2022-01-10 09:24:38,653 INFO L854 garLoopResultBuilder]: At program point L12-8(lines 11 17) the Hoare annotation is: (let ((.cse8 (* 2 |ULTIMATE.start_ULTIMATE.start_main_~a~0#1Int|))) (let ((.cse7 (let ((.cse10 (div .cse8 18446744073709551616))) (+ |ULTIMATE.start_ULTIMATE.start_main_~t~0#1Int| (* 18446744073709551616 (div (+ (* (- 18446744073709551616) .cse10) .cse8 1) 18446744073709551616)) (* 18446744073709551616 .cse10)))) (.cse9 (* (mod |ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| 2147483648) 2))) (let ((.cse0 (<= .cse9 (+ 2 |ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int|))) (.cse1 (<= 1 |ULTIMATE.start_ULTIMATE.start___VERIFIER_assert_~cond#1Int|)) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| .cse9)) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_assume_abort_if_not_~cond#1Int| 1)) (.cse4 (<= 0 |ULTIMATE.start_ULTIMATE.start_assume_abort_if_not_~cond#1Int|)) (.cse5 (<= (+ .cse8 1) .cse7)) (.cse6 (< .cse7 (+ 2 .cse8)))) (or (and .cse0 .cse1 (= |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) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_ULTIMATE.start_main_~a~0#1Int| 1) .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_ULTIMATE.start_main_~s~0#1Int| 4)))))) [2022-01-10 09:24:38,653 INFO L858 garLoopResultBuilder]: For program point L13-5(lines 13 14) no Hoare annotation was computed. [2022-01-10 09:24:38,653 INFO L861 garLoopResultBuilder]: At program point L12-17(lines 11 17) the Hoare annotation is: true [2022-01-10 09:24:38,653 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2022-01-10 09:24:38,653 INFO L858 garLoopResultBuilder]: For program point L36(lines 36 37) no Hoare annotation was computed. [2022-01-10 09:24:38,653 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2022-01-10 09:24:38,654 INFO L861 garLoopResultBuilder]: At program point L48(lines 20 49) the Hoare annotation is: true [2022-01-10 09:24:38,654 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 09:24:38,654 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 09:24:38,656 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-01-10 09:24:38,656 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 09:24:38,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 09:24:38 BasicIcfg [2022-01-10 09:24:38,718 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 09:24:38,718 INFO L158 Benchmark]: Toolchain (without parser) took 76844.07ms. Allocated memory was 197.1MB in the beginning and 241.2MB in the end (delta: 44.0MB). Free memory was 146.6MB in the beginning and 89.9MB in the end (delta: 56.7MB). Peak memory consumption was 102.3MB. Max. memory is 8.0GB. [2022-01-10 09:24:38,719 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 197.1MB. Free memory was 162.9MB in the beginning and 162.7MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 09:24:38,719 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.11ms. Allocated memory is still 197.1MB. Free memory was 146.3MB in the beginning and 173.3MB in the end (delta: -27.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-01-10 09:24:38,719 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.36ms. Allocated memory is still 197.1MB. Free memory was 173.3MB in the beginning and 171.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 09:24:38,719 INFO L158 Benchmark]: Boogie Preprocessor took 27.37ms. Allocated memory is still 197.1MB. Free memory was 171.2MB in the beginning and 170.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 09:24:38,720 INFO L158 Benchmark]: RCFGBuilder took 394.73ms. Allocated memory is still 197.1MB. Free memory was 170.1MB in the beginning and 159.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-01-10 09:24:38,720 INFO L158 Benchmark]: IcfgTransformer took 50.29ms. Allocated memory is still 197.1MB. Free memory was 159.7MB in the beginning and 154.9MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-01-10 09:24:38,720 INFO L158 Benchmark]: TraceAbstraction took 76143.50ms. Allocated memory was 197.1MB in the beginning and 241.2MB in the end (delta: 44.0MB). Free memory was 154.4MB in the beginning and 89.9MB in the end (delta: 64.5MB). Peak memory consumption was 110.1MB. Max. memory is 8.0GB. [2022-01-10 09:24:38,721 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.10ms. Allocated memory is still 197.1MB. Free memory was 162.9MB in the beginning and 162.7MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 195.11ms. Allocated memory is still 197.1MB. Free memory was 146.3MB in the beginning and 173.3MB in the end (delta: -27.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.36ms. Allocated memory is still 197.1MB. Free memory was 173.3MB in the beginning and 171.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.37ms. Allocated memory is still 197.1MB. Free memory was 171.2MB in the beginning and 170.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 394.73ms. Allocated memory is still 197.1MB. Free memory was 170.1MB in the beginning and 159.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 50.29ms. Allocated memory is still 197.1MB. Free memory was 159.7MB in the beginning and 154.9MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * TraceAbstraction took 76143.50ms. Allocated memory was 197.1MB in the beginning and 241.2MB in the end (delta: 44.0MB). Free memory was 154.4MB in the beginning and 89.9MB in the end (delta: 64.5MB). Peak memory consumption was 110.1MB. 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, 34 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 76.0s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 28.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.5s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 8 mSolverCounterUnknown, 176 SdHoareTripleChecker+Valid, 22.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 176 mSDsluCounter, 212 SdHoareTripleChecker+Invalid, 21.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2 IncrementalHoareTripleChecker+Unchecked, 104 mSDsCounter, 129 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 179 IncrementalHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 129 mSolverCounterUnsat, 108 mSDtfsCounter, 179 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 36.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=5, 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, 6 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 22 NumberOfFragments, 1004 HoareAnnotationTreeSize, 8 FomulaSimplifications, 43 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 742 FormulaSimplificationTreeSizeReductionInter, 5.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 40.5s InterpolantComputationTime, 78 NumberOfCodeBlocks, 78 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 114 ConstructedInterpolants, 0 QuantifiedInterpolants, 1806 SizeOfPredicates, 18 NumberOfNonLiveVariables, 607 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 25/48 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) && s == 4bv64) && ~bvsle64(~zero_extendFrom66To132(~bvadd32(~zero_extendFrom65To66(~bvmul64(2bv65, ~zero_extendFrom64To65(a))), 1bv66)), ~bvadd32(~bvadd32(~zero_extendFrom64To132(t), ~sign_extendFrom8To32(~bvmul64(~sign_extendFrom8To32(~bvadd32(~bvadd32(~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))))) && a == 1bv64) && ~bvule33(~zero_extendFrom32To33(n[30:0] ++ 0bv1), ~bvadd32(2bv33, ~zero_extendFrom32To33(n)))) && ~bvslt132(~bvadd32(~bvadd32(~zero_extendFrom64To132(t), ~sign_extendFrom8To32(~bvmul64(~sign_extendFrom8To32(~bvadd32(~bvadd32(~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(~bvadd32(2bv66, ~zero_extendFrom65To66(~bvmul64(2bv65, ~zero_extendFrom64To65(a))))))) && ~bvule32(0bv32, cond)) && ~bvule32(n, n[30:0] ++ 0bv1)) && ~bvule32(cond, 1bv32)) || (((((((((~bvule32(1bv32, cond) && a == 0bv64) && ~bvsle64(~zero_extendFrom66To132(~bvadd32(~zero_extendFrom65To66(~bvmul64(2bv65, ~zero_extendFrom64To65(a))), 1bv66)), ~bvadd32(~bvadd32(~zero_extendFrom64To132(t), ~sign_extendFrom8To32(~bvmul64(~sign_extendFrom8To32(~bvadd32(~bvadd32(~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))))) && ~bvule33(~zero_extendFrom32To33(n[30:0] ++ 0bv1), ~bvadd32(2bv33, ~zero_extendFrom32To33(n)))) && ~bvslt132(~bvadd32(~bvadd32(~zero_extendFrom64To132(t), ~sign_extendFrom8To32(~bvmul64(~sign_extendFrom8To32(~bvadd32(~bvadd32(~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(~bvadd32(2bv66, ~zero_extendFrom65To66(~bvmul64(2bv65, ~zero_extendFrom64To65(a))))))) && s == 1bv64) && ~bvule32(0bv32, cond)) && ~bvule32(cond, 1bv32)) && ~bvule32(n, n[30:0] ++ 0bv1)) && ~bvule32(cond, 1bv32)) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((~bvule32(1bv32, cond) && s == 4bv64) && ~bvsle64(~zero_extendFrom66To132(~bvadd32(~zero_extendFrom65To66(~bvmul64(2bv65, ~zero_extendFrom64To65(a))), 1bv66)), ~bvadd32(~bvadd32(~zero_extendFrom64To132(t), ~sign_extendFrom8To32(~bvmul64(~sign_extendFrom8To32(~bvadd32(~bvadd32(~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))))) && a == 1bv64) && ~bvule33(~zero_extendFrom32To33(n[30:0] ++ 0bv1), ~bvadd32(2bv33, ~zero_extendFrom32To33(n)))) && !~bvsle64(~zero_extendFrom66To132(~bvadd32(2bv66, ~zero_extendFrom65To66(~bvmul64(2bv65, ~zero_extendFrom64To65(a))))), ~bvadd32(~bvadd32(~zero_extendFrom64To132(t), ~sign_extendFrom8To32(~bvmul64(~sign_extendFrom8To32(~bvadd32(~bvadd32(~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(0bv32, cond)) && ~bvule32(n, n[30:0] ++ 0bv1)) && ~bvule32(cond, 1bv32)) || ((((((a == 0bv64 && ~bvule33(~zero_extendFrom32To33(n[30:0] ++ 0bv1), ~bvadd32(2bv33, ~zero_extendFrom32To33(n)))) && s == 1bv64) && t == 1bv64) && ~bvule32(0bv32, cond)) && ~bvule32(n, n[30:0] ++ 0bv1)) && ~bvule32(cond, 1bv32)) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: ((((((((~bvule32(1bv32, cond) && s == 4bv64) && ~bvsle64(~zero_extendFrom66To132(~bvadd32(~zero_extendFrom65To66(~bvmul64(2bv65, ~zero_extendFrom64To65(a))), 1bv66)), ~bvadd32(~bvadd32(~zero_extendFrom64To132(t), ~sign_extendFrom8To32(~bvmul64(~sign_extendFrom8To32(~bvadd32(~bvadd32(~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))))) && a == 1bv64) && ~bvule33(~zero_extendFrom32To33(n[30:0] ++ 0bv1), ~bvadd32(2bv33, ~zero_extendFrom32To33(n)))) && ~bvslt132(~bvadd32(~bvadd32(~zero_extendFrom64To132(t), ~sign_extendFrom8To32(~bvmul64(~sign_extendFrom8To32(~bvadd32(~bvadd32(~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(~bvadd32(2bv66, ~zero_extendFrom65To66(~bvmul64(2bv65, ~zero_extendFrom64To65(a))))))) && ~bvule32(0bv32, cond)) && ~bvule32(n, n[30:0] ++ 0bv1)) && ~bvule32(cond, 1bv32)) || (((((((((~bvule32(1bv32, cond) && a == 0bv64) && ~bvsle64(~zero_extendFrom66To132(~bvadd32(~zero_extendFrom65To66(~bvmul64(2bv65, ~zero_extendFrom64To65(a))), 1bv66)), ~bvadd32(~bvadd32(~zero_extendFrom64To132(t), ~sign_extendFrom8To32(~bvmul64(~sign_extendFrom8To32(~bvadd32(~bvadd32(~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))))) && ~bvule33(~zero_extendFrom32To33(n[30:0] ++ 0bv1), ~bvadd32(2bv33, ~zero_extendFrom32To33(n)))) && ~bvslt132(~bvadd32(~bvadd32(~zero_extendFrom64To132(t), ~sign_extendFrom8To32(~bvmul64(~sign_extendFrom8To32(~bvadd32(~bvadd32(~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(~bvadd32(2bv66, ~zero_extendFrom65To66(~bvmul64(2bv65, ~zero_extendFrom64To65(a))))))) && s == 1bv64) && ~bvule32(0bv32, cond)) && ~bvule32(cond, 1bv32)) && ~bvule32(n, n[30:0] ++ 0bv1)) && ~bvule32(cond, 1bv32)) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: ((((~bvule32(1bv32, cond) && s == 4bv64) && ~bvsle64(~zero_extendFrom66To132(~bvadd32(~zero_extendFrom65To66(~bvmul64(2bv65, ~zero_extendFrom64To65(a))), 1bv66)), ~bvadd32(~bvadd32(~zero_extendFrom64To132(t), ~sign_extendFrom8To32(~bvmul64(~sign_extendFrom8To32(~bvadd32(~bvadd32(~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))))) && a == 1bv64) && ~bvslt132(~bvadd32(~bvadd32(~zero_extendFrom64To132(t), ~sign_extendFrom8To32(~bvmul64(~sign_extendFrom8To32(~bvadd32(~bvadd32(~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(~bvadd32(2bv66, ~zero_extendFrom65To66(~bvmul64(2bv65, ~zero_extendFrom64To65(a))))))) || ((((~bvule32(1bv32, cond) && a == 0bv64) && ~bvsle64(~zero_extendFrom66To132(~bvadd32(~zero_extendFrom65To66(~bvmul64(2bv65, ~zero_extendFrom64To65(a))), 1bv66)), ~bvadd32(~bvadd32(~zero_extendFrom64To132(t), ~sign_extendFrom8To32(~bvmul64(~sign_extendFrom8To32(~bvadd32(~bvadd32(~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))))) && ~bvslt132(~bvadd32(~bvadd32(~zero_extendFrom64To132(t), ~sign_extendFrom8To32(~bvmul64(~sign_extendFrom8To32(~bvadd32(~bvadd32(~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(~bvadd32(2bv66, ~zero_extendFrom65To66(~bvmul64(2bv65, ~zero_extendFrom64To65(a))))))) && s == 1bv64) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: (((((~bvule32(1bv32, cond) && s == 4bv64) && ~bvsle64(~zero_extendFrom66To132(~bvadd32(~zero_extendFrom65To66(~bvmul64(2bv65, ~zero_extendFrom64To65(a))), 1bv66)), ~bvadd32(~bvadd32(~zero_extendFrom64To132(t), ~sign_extendFrom8To32(~bvmul64(~sign_extendFrom8To32(~bvadd32(~bvadd32(~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))))) && a == 1bv64) && !~bvsle64(~zero_extendFrom66To132(~bvadd32(2bv66, ~zero_extendFrom65To66(~bvmul64(2bv65, ~zero_extendFrom64To65(a))))), ~bvadd32(~bvadd32(~zero_extendFrom64To132(t), ~sign_extendFrom8To32(~bvmul64(~sign_extendFrom8To32(~bvadd32(~bvadd32(~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))))) && ~bvule64(0bv64, a)) || (((((~bvule32(1bv32, cond) && ~bvsle64(~zero_extendFrom66To132(~bvadd32(~zero_extendFrom65To66(~bvmul64(2bv65, ~zero_extendFrom64To65(a))), 1bv66)), ~bvadd32(~bvadd32(~zero_extendFrom64To132(t), ~sign_extendFrom8To32(~bvmul64(~sign_extendFrom8To32(~bvadd32(~bvadd32(~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))))) && !~bvsle64(~zero_extendFrom66To132(~bvadd32(2bv66, ~zero_extendFrom65To66(~bvmul64(2bv65, ~zero_extendFrom64To65(a))))), ~bvadd32(~bvadd32(~zero_extendFrom64To132(t), ~sign_extendFrom8To32(~bvmul64(~sign_extendFrom8To32(~bvadd32(~bvadd32(~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))))) && s == 1bv64) && t == 1bv64) && ~bvule64(0bv64, a)) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: ((((((((~bvule32(1bv32, cond) && s == 4bv64) && ~bvsle64(~zero_extendFrom66To132(~bvadd32(~zero_extendFrom65To66(~bvmul64(2bv65, ~zero_extendFrom64To65(a))), 1bv66)), ~bvadd32(~bvadd32(~zero_extendFrom64To132(t), ~sign_extendFrom8To32(~bvmul64(~sign_extendFrom8To32(~bvadd32(~bvadd32(~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))))) && a == 1bv64) && ~bvule33(~zero_extendFrom32To33(n[30:0] ++ 0bv1), ~bvadd32(2bv33, ~zero_extendFrom32To33(n)))) && ~bvslt132(~bvadd32(~bvadd32(~zero_extendFrom64To132(t), ~sign_extendFrom8To32(~bvmul64(~sign_extendFrom8To32(~bvadd32(~bvadd32(~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(~bvadd32(2bv66, ~zero_extendFrom65To66(~bvmul64(2bv65, ~zero_extendFrom64To65(a))))))) && ~bvule32(0bv32, cond)) && ~bvule32(n, n[30:0] ++ 0bv1)) && ~bvule32(cond, 1bv32)) || (((((((((~bvule32(1bv32, cond) && a == 0bv64) && ~bvsle64(~zero_extendFrom66To132(~bvadd32(~zero_extendFrom65To66(~bvmul64(2bv65, ~zero_extendFrom64To65(a))), 1bv66)), ~bvadd32(~bvadd32(~zero_extendFrom64To132(t), ~sign_extendFrom8To32(~bvmul64(~sign_extendFrom8To32(~bvadd32(~bvadd32(~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))))) && ~bvule33(~zero_extendFrom32To33(n[30:0] ++ 0bv1), ~bvadd32(2bv33, ~zero_extendFrom32To33(n)))) && ~bvslt132(~bvadd32(~bvadd32(~zero_extendFrom64To132(t), ~sign_extendFrom8To32(~bvmul64(~sign_extendFrom8To32(~bvadd32(~bvadd32(~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(~bvadd32(2bv66, ~zero_extendFrom65To66(~bvmul64(2bv65, ~zero_extendFrom64To65(a))))))) && s == 1bv64) && ~bvule32(0bv32, cond)) && ~bvule32(cond, 1bv32)) && ~bvule32(n, n[30:0] ++ 0bv1)) && ~bvule32(cond, 1bv32)) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-01-10 09:24:38,801 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...