/usr/bin/java -ea -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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loop-new/gauss_sum.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 16:25:36,713 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 16:25:36,719 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 16:25:36,762 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 16:25:36,762 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 16:25:36,763 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 16:25:36,766 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 16:25:36,769 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 16:25:36,770 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 16:25:36,773 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 16:25:36,774 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 16:25:36,775 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 16:25:36,775 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 16:25:36,777 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 16:25:36,777 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 16:25:36,779 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 16:25:36,780 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 16:25:36,780 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 16:25:36,782 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 16:25:36,785 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 16:25:36,785 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 16:25:36,787 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 16:25:36,787 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 16:25:36,788 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 16:25:36,788 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 16:25:36,793 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 16:25:36,793 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 16:25:36,793 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 16:25:36,794 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 16:25:36,794 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 16:25:36,794 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 16:25:36,795 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 16:25:36,795 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 16:25:36,795 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 16:25:36,796 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 16:25:36,796 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 16:25:36,796 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 16:25:36,797 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 16:25:36,797 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 16:25:36,797 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 16:25:36,797 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 16:25:36,800 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 16:25:36,801 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 16:25:36,809 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 16:25:36,809 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 16:25:36,810 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 16:25:36,810 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 16:25:36,810 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 16:25:36,810 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 16:25:36,810 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 16:25:36,810 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 16:25:36,810 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 16:25:36,811 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 16:25:36,811 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 16:25:36,811 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 16:25:36,811 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 16:25:36,811 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 16:25:36,811 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 16:25:36,811 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 16:25:36,812 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 16:25:36,812 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 16:25:36,812 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:25:36,812 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 16:25:36,812 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 16:25:36,812 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 16:25:36,812 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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-04-27 16:25:36,987 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 16:25:37,010 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 16:25:37,011 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 16:25:37,012 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 16:25:37,012 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 16:25:37,013 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/gauss_sum.i [2022-04-27 16:25:37,053 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aad1662cb/cbe5a8c893424282a6207cb07d8c6a37/FLAGfe064ad96 [2022-04-27 16:25:37,442 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 16:25:37,442 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/gauss_sum.i [2022-04-27 16:25:37,447 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aad1662cb/cbe5a8c893424282a6207cb07d8c6a37/FLAGfe064ad96 [2022-04-27 16:25:37,457 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aad1662cb/cbe5a8c893424282a6207cb07d8c6a37 [2022-04-27 16:25:37,459 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 16:25:37,460 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 16:25:37,462 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 16:25:37,463 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 16:25:37,465 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 16:25:37,466 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:25:37" (1/1) ... [2022-04-27 16:25:37,467 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63362c4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:25:37, skipping insertion in model container [2022-04-27 16:25:37,467 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:25:37" (1/1) ... [2022-04-27 16:25:37,472 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 16:25:37,482 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 16:25:37,642 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-new/gauss_sum.i[891,904] [2022-04-27 16:25:37,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:25:37,679 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 16:25:37,687 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-new/gauss_sum.i[891,904] [2022-04-27 16:25:37,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:25:37,700 INFO L208 MainTranslator]: Completed translation [2022-04-27 16:25:37,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:25:37 WrapperNode [2022-04-27 16:25:37,700 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 16:25:37,701 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 16:25:37,701 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 16:25:37,701 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 16:25:37,709 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:25:37" (1/1) ... [2022-04-27 16:25:37,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:25:37" (1/1) ... [2022-04-27 16:25:37,714 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:25:37" (1/1) ... [2022-04-27 16:25:37,714 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:25:37" (1/1) ... [2022-04-27 16:25:37,721 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:25:37" (1/1) ... [2022-04-27 16:25:37,726 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:25:37" (1/1) ... [2022-04-27 16:25:37,728 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:25:37" (1/1) ... [2022-04-27 16:25:37,733 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 16:25:37,734 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 16:25:37,734 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 16:25:37,734 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 16:25:37,735 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:25:37" (1/1) ... [2022-04-27 16:25:37,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:25:37,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:25:37,756 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-04-27 16:25:37,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 16:25:37,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 16:25:37,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 16:25:37,783 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 16:25:37,783 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 16:25:37,783 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 16:25:37,784 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 16:25:37,784 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 16:25:37,784 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 16:25:37,784 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 16:25:37,784 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 16:25:37,784 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 16:25:37,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 16:25:37,784 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 16:25:37,784 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 16:25:37,784 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 16:25:37,784 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 16:25:37,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 16:25:37,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 16:25:37,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 16:25:37,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 16:25:37,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 16:25:37,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 16:25:37,826 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 16:25:37,827 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 16:25:37,925 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 16:25:37,930 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 16:25:37,930 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 16:25:37,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:25:37 BoogieIcfgContainer [2022-04-27 16:25:37,931 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 16:25:37,932 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 16:25:37,932 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 16:25:37,945 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 16:25:37,947 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:25:37" (1/1) ... [2022-04-27 16:25:37,948 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 16:25:37,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:25:37 BasicIcfg [2022-04-27 16:25:37,978 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 16:25:37,979 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 16:25:37,980 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 16:25:37,981 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 16:25:37,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 04:25:37" (1/4) ... [2022-04-27 16:25:37,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16469aee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:25:37, skipping insertion in model container [2022-04-27 16:25:37,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:25:37" (2/4) ... [2022-04-27 16:25:37,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16469aee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:25:37, skipping insertion in model container [2022-04-27 16:25:37,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:25:37" (3/4) ... [2022-04-27 16:25:37,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16469aee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:25:37, skipping insertion in model container [2022-04-27 16:25:37,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:25:37" (4/4) ... [2022-04-27 16:25:37,983 INFO L111 eAbstractionObserver]: Analyzing ICFG gauss_sum.iJordan [2022-04-27 16:25:38,005 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 16:25:38,006 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 16:25:38,031 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 16:25:38,036 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@20886854, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7d9f4c78 [2022-04-27 16:25:38,036 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 16:25:38,041 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 16:25:38,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 16:25:38,045 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:25:38,045 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:25:38,046 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:25:38,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:25:38,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1527693123, now seen corresponding path program 1 times [2022-04-27 16:25:38,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:25:38,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829720224] [2022-04-27 16:25:38,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:25:38,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:25:38,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:25:38,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:25:38,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:25:38,180 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [60] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {24#true} is VALID [2022-04-27 16:25:38,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} [63] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 16:25:38,180 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 16:25:38,186 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} [58] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:25:38,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [60] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {24#true} is VALID [2022-04-27 16:25:38,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} [63] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 16:25:38,187 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 16:25:38,187 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} [59] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 16:25:38,187 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} [62] mainENTRY-->L27: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_6 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_6, main_~sum~0=v_main_~sum~0_5} AuxVars[] AssignedVars[main_#t~nondet1, main_~sum~0, main_~i~0, main_~n~0] {24#true} is VALID [2022-04-27 16:25:38,187 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} [65] L27-->L29-3: Formula: (and (<= 1 v_main_~n~0_3) (= 0 v_main_~sum~0_2) (<= v_main_~n~0_3 1000) (= v_main_~i~0_1 1)) InVars {main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3, main_~sum~0=v_main_~sum~0_2} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {24#true} is VALID [2022-04-27 16:25:38,189 INFO L290 TraceCheckUtils]: 7: Hoare triple {24#true} [67] L29-3-->L29-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-27 16:25:38,189 INFO L272 TraceCheckUtils]: 8: Hoare triple {25#false} [70] L29-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~n~0_9 (+ v_main_~n~0_9 1)) (* 2 v_main_~sum~0_6)) 1 0)) InVars {main_~sum~0=v_main_~sum~0_6, main_~n~0=v_main_~n~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sum~0, main_~n~0] {25#false} is VALID [2022-04-27 16:25:38,189 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} [73] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {25#false} is VALID [2022-04-27 16:25:38,190 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} [74] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-27 16:25:38,190 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} [76] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-27 16:25:38,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:25:38,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:25:38,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829720224] [2022-04-27 16:25:38,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829720224] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:25:38,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:25:38,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 16:25:38,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426178224] [2022-04-27 16:25:38,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:25:38,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 16:25:38,199 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:25:38,201 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:38,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:25:38,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 16:25:38,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:25:38,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 16:25:38,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 16:25:38,241 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:38,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:25:38,296 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-04-27 16:25:38,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 16:25:38,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 16:25:38,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:25:38,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:38,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-04-27 16:25:38,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:38,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-04-27 16:25:38,310 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 24 transitions. [2022-04-27 16:25:38,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:25:38,351 INFO L225 Difference]: With dead ends: 21 [2022-04-27 16:25:38,351 INFO L226 Difference]: Without dead ends: 14 [2022-04-27 16:25:38,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 16:25:38,356 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:25:38,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 24 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 16:25:38,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-27 16:25:38,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-27 16:25:38,376 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:25:38,377 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:38,377 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:38,379 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:38,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:25:38,383 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-27 16:25:38,384 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 16:25:38,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:25:38,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:25:38,385 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-27 16:25:38,385 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-27 16:25:38,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:25:38,388 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-27 16:25:38,389 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 16:25:38,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:25:38,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:25:38,389 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:25:38,389 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:25:38,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:38,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-27 16:25:38,391 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-27 16:25:38,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:25:38,392 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-27 16:25:38,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:38,393 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 16:25:38,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 16:25:38,395 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:25:38,399 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:25:38,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 16:25:38,399 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:25:38,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:25:38,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1526769602, now seen corresponding path program 1 times [2022-04-27 16:25:38,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:25:38,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401891531] [2022-04-27 16:25:38,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:25:38,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:25:38,428 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 16:25:38,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [573758497] [2022-04-27 16:25:38,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:25:38,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:25:38,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:25:38,432 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-04-27 16:25:38,435 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-04-27 16:25:38,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:25:38,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-27 16:25:38,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:25:38,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:25:38,584 INFO L272 TraceCheckUtils]: 0: Hoare triple {95#true} [58] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {95#true} is VALID [2022-04-27 16:25:38,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {95#true} [60] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {95#true} is VALID [2022-04-27 16:25:38,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {95#true} [63] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {95#true} is VALID [2022-04-27 16:25:38,587 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95#true} {95#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {95#true} is VALID [2022-04-27 16:25:38,587 INFO L272 TraceCheckUtils]: 4: Hoare triple {95#true} [59] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {95#true} is VALID [2022-04-27 16:25:38,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {95#true} [62] mainENTRY-->L27: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_6 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_6, main_~sum~0=v_main_~sum~0_5} AuxVars[] AssignedVars[main_#t~nondet1, main_~sum~0, main_~i~0, main_~n~0] {95#true} is VALID [2022-04-27 16:25:38,589 INFO L290 TraceCheckUtils]: 6: Hoare triple {95#true} [65] L27-->L29-3: Formula: (and (<= 1 v_main_~n~0_3) (= 0 v_main_~sum~0_2) (<= v_main_~n~0_3 1000) (= v_main_~i~0_1 1)) InVars {main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3, main_~sum~0=v_main_~sum~0_2} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {118#(and (<= 1 main_~n~0) (<= main_~i~0 1))} is VALID [2022-04-27 16:25:38,589 INFO L290 TraceCheckUtils]: 7: Hoare triple {118#(and (<= 1 main_~n~0) (<= main_~i~0 1))} [68] L29-3-->L29-4: Formula: (not (<= v_main_~i~0_2 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {96#false} is VALID [2022-04-27 16:25:38,589 INFO L272 TraceCheckUtils]: 8: Hoare triple {96#false} [70] L29-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~n~0_9 (+ v_main_~n~0_9 1)) (* 2 v_main_~sum~0_6)) 1 0)) InVars {main_~sum~0=v_main_~sum~0_6, main_~n~0=v_main_~n~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sum~0, main_~n~0] {96#false} is VALID [2022-04-27 16:25:38,590 INFO L290 TraceCheckUtils]: 9: Hoare triple {96#false} [73] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {96#false} is VALID [2022-04-27 16:25:38,590 INFO L290 TraceCheckUtils]: 10: Hoare triple {96#false} [74] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {96#false} is VALID [2022-04-27 16:25:38,590 INFO L290 TraceCheckUtils]: 11: Hoare triple {96#false} [76] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {96#false} is VALID [2022-04-27 16:25:38,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:25:38,590 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 16:25:38,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:25:38,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401891531] [2022-04-27 16:25:38,591 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 16:25:38,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573758497] [2022-04-27 16:25:38,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573758497] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:25:38,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:25:38,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 16:25:38,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122378027] [2022-04-27 16:25:38,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:25:38,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 16:25:38,595 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:25:38,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:38,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:25:38,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 16:25:38,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:25:38,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 16:25:38,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 16:25:38,606 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:38,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:25:38,627 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-27 16:25:38,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 16:25:38,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 16:25:38,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:25:38,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:38,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2022-04-27 16:25:38,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:38,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2022-04-27 16:25:38,630 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 17 transitions. [2022-04-27 16:25:38,642 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:25:38,644 INFO L225 Difference]: With dead ends: 16 [2022-04-27 16:25:38,644 INFO L226 Difference]: Without dead ends: 16 [2022-04-27 16:25:38,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 16:25:38,645 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:25:38,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 20 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 16:25:38,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-27 16:25:38,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2022-04-27 16:25:38,647 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:25:38,647 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:38,648 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:38,648 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:38,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:25:38,650 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-27 16:25:38,650 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-27 16:25:38,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:25:38,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:25:38,650 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-27 16:25:38,650 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-27 16:25:38,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:25:38,651 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-27 16:25:38,651 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-27 16:25:38,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:25:38,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:25:38,652 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:25:38,652 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:25:38,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:38,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-27 16:25:38,652 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2022-04-27 16:25:38,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:25:38,653 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-27 16:25:38,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:38,653 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 16:25:38,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 16:25:38,653 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:25:38,653 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:25:38,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 16:25:38,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:25:38,860 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:25:38,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:25:38,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1730344036, now seen corresponding path program 1 times [2022-04-27 16:25:38,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:25:38,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483278046] [2022-04-27 16:25:38,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:25:38,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:25:38,881 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 16:25:38,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1080732453] [2022-04-27 16:25:38,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:25:38,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:25:38,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:25:38,885 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-04-27 16:25:38,886 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-04-27 16:25:38,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:25:38,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 16:25:38,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:25:38,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:25:39,163 INFO L272 TraceCheckUtils]: 0: Hoare triple {196#true} [58] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-27 16:25:39,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {196#true} [60] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {196#true} is VALID [2022-04-27 16:25:39,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {196#true} [63] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-27 16:25:39,164 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {196#true} {196#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-27 16:25:39,164 INFO L272 TraceCheckUtils]: 4: Hoare triple {196#true} [59] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-27 16:25:39,164 INFO L290 TraceCheckUtils]: 5: Hoare triple {196#true} [62] mainENTRY-->L27: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_6 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_6, main_~sum~0=v_main_~sum~0_5} AuxVars[] AssignedVars[main_#t~nondet1, main_~sum~0, main_~i~0, main_~n~0] {196#true} is VALID [2022-04-27 16:25:39,165 INFO L290 TraceCheckUtils]: 6: Hoare triple {196#true} [65] L27-->L29-3: Formula: (and (<= 1 v_main_~n~0_3) (= 0 v_main_~sum~0_2) (<= v_main_~n~0_3 1000) (= v_main_~i~0_1 1)) InVars {main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3, main_~sum~0=v_main_~sum~0_2} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {219#(and (<= 1 main_~n~0) (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-27 16:25:39,167 INFO L290 TraceCheckUtils]: 7: Hoare triple {219#(and (<= 1 main_~n~0) (= main_~sum~0 0) (= main_~i~0 1))} [69] L29-3-->L29-2: Formula: (and (= (+ v_main_~i~0_3 v_main_~sum~0_4) v_main_~sum~0_3) (<= v_main_~i~0_3 v_main_~n~0_5)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_5, main_~sum~0=v_main_~sum~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_5, main_~sum~0=v_main_~sum~0_3} AuxVars[] AssignedVars[main_~sum~0] {223#(and (<= 1 main_~n~0) (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} is VALID [2022-04-27 16:25:39,168 INFO L290 TraceCheckUtils]: 8: Hoare triple {223#(and (<= 1 main_~n~0) (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} [71] L29-2-->L29-3: Formula: (= v_main_~i~0_4 (+ v_main_~i~0_5 1)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {227#(and (<= 1 main_~n~0) (= (+ (- 1) main_~sum~0) 0) (<= main_~i~0 2))} is VALID [2022-04-27 16:25:39,169 INFO L290 TraceCheckUtils]: 9: Hoare triple {227#(and (<= 1 main_~n~0) (= (+ (- 1) main_~sum~0) 0) (<= main_~i~0 2))} [68] L29-3-->L29-4: Formula: (not (<= v_main_~i~0_2 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {231#(and (<= 1 main_~n~0) (= (+ (- 1) main_~sum~0) 0) (< main_~n~0 2))} is VALID [2022-04-27 16:25:39,170 INFO L272 TraceCheckUtils]: 10: Hoare triple {231#(and (<= 1 main_~n~0) (= (+ (- 1) main_~sum~0) 0) (< main_~n~0 2))} [70] L29-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~n~0_9 (+ v_main_~n~0_9 1)) (* 2 v_main_~sum~0_6)) 1 0)) InVars {main_~sum~0=v_main_~sum~0_6, main_~n~0=v_main_~n~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sum~0, main_~n~0] {235#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:25:39,171 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#(<= 1 |__VERIFIER_assert_#in~cond|)} [73] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {239#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:25:39,172 INFO L290 TraceCheckUtils]: 12: Hoare triple {239#(<= 1 __VERIFIER_assert_~cond)} [74] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {197#false} is VALID [2022-04-27 16:25:39,172 INFO L290 TraceCheckUtils]: 13: Hoare triple {197#false} [76] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {197#false} is VALID [2022-04-27 16:25:39,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:25:39,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:25:39,377 INFO L290 TraceCheckUtils]: 13: Hoare triple {197#false} [76] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {197#false} is VALID [2022-04-27 16:25:39,378 INFO L290 TraceCheckUtils]: 12: Hoare triple {239#(<= 1 __VERIFIER_assert_~cond)} [74] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {197#false} is VALID [2022-04-27 16:25:39,378 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#(<= 1 |__VERIFIER_assert_#in~cond|)} [73] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {239#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:25:39,379 INFO L272 TraceCheckUtils]: 10: Hoare triple {255#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} [70] L29-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~n~0_9 (+ v_main_~n~0_9 1)) (* 2 v_main_~sum~0_6)) 1 0)) InVars {main_~sum~0=v_main_~sum~0_6, main_~n~0=v_main_~n~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sum~0, main_~n~0] {235#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:25:39,380 INFO L290 TraceCheckUtils]: 9: Hoare triple {259#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} [68] L29-3-->L29-4: Formula: (not (<= v_main_~i~0_2 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {255#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-27 16:25:39,380 INFO L290 TraceCheckUtils]: 8: Hoare triple {263#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} [71] L29-2-->L29-3: Formula: (= v_main_~i~0_4 (+ v_main_~i~0_5 1)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {259#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-27 16:25:39,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {267#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))))} [69] L29-3-->L29-2: Formula: (and (= (+ v_main_~i~0_3 v_main_~sum~0_4) v_main_~sum~0_3) (<= v_main_~i~0_3 v_main_~n~0_5)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_5, main_~sum~0=v_main_~sum~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_5, main_~sum~0=v_main_~sum~0_3} AuxVars[] AssignedVars[main_~sum~0] {263#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-27 16:25:39,382 INFO L290 TraceCheckUtils]: 6: Hoare triple {196#true} [65] L27-->L29-3: Formula: (and (<= 1 v_main_~n~0_3) (= 0 v_main_~sum~0_2) (<= v_main_~n~0_3 1000) (= v_main_~i~0_1 1)) InVars {main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3, main_~sum~0=v_main_~sum~0_2} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {267#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))))} is VALID [2022-04-27 16:25:39,384 INFO L290 TraceCheckUtils]: 5: Hoare triple {196#true} [62] mainENTRY-->L27: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_6 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_6, main_~sum~0=v_main_~sum~0_5} AuxVars[] AssignedVars[main_#t~nondet1, main_~sum~0, main_~i~0, main_~n~0] {196#true} is VALID [2022-04-27 16:25:39,384 INFO L272 TraceCheckUtils]: 4: Hoare triple {196#true} [59] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-27 16:25:39,385 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {196#true} {196#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-27 16:25:39,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {196#true} [63] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-27 16:25:39,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {196#true} [60] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {196#true} is VALID [2022-04-27 16:25:39,385 INFO L272 TraceCheckUtils]: 0: Hoare triple {196#true} [58] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-27 16:25:39,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:25:39,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:25:39,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483278046] [2022-04-27 16:25:39,386 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 16:25:39,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080732453] [2022-04-27 16:25:39,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080732453] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:25:39,386 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 16:25:39,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2022-04-27 16:25:39,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027173594] [2022-04-27 16:25:39,387 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 16:25:39,387 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 16:25:39,388 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:25:39,388 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:39,400 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:25:39,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 16:25:39,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:25:39,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 16:25:39,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-04-27 16:25:39,401 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:39,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:25:39,536 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-27 16:25:39,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 16:25:39,536 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 16:25:39,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:25:39,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:39,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 21 transitions. [2022-04-27 16:25:39,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:39,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 21 transitions. [2022-04-27 16:25:39,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 21 transitions. [2022-04-27 16:25:39,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:25:39,554 INFO L225 Difference]: With dead ends: 20 [2022-04-27 16:25:39,555 INFO L226 Difference]: Without dead ends: 17 [2022-04-27 16:25:39,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-04-27 16:25:39,557 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:25:39,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 62 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 16:25:39,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-27 16:25:39,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-27 16:25:39,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:25:39,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:39,562 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:39,562 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:39,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:25:39,563 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-27 16:25:39,563 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-27 16:25:39,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:25:39,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:25:39,564 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-27 16:25:39,564 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-27 16:25:39,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:25:39,566 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-27 16:25:39,566 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-27 16:25:39,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:25:39,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:25:39,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:25:39,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:25:39,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:39,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-27 16:25:39,567 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2022-04-27 16:25:39,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:25:39,567 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-27 16:25:39,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:39,567 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-27 16:25:39,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 16:25:39,568 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:25:39,568 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:25:39,586 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-04-27 16:25:39,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 16:25:39,784 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:25:39,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:25:39,785 INFO L85 PathProgramCache]: Analyzing trace with hash 203120506, now seen corresponding path program 2 times [2022-04-27 16:25:39,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:25:39,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102501585] [2022-04-27 16:25:39,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:25:39,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:25:39,795 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 16:25:39,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1279084465] [2022-04-27 16:25:39,795 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 16:25:39,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:25:39,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:25:39,796 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-04-27 16:25:39,797 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-04-27 16:25:39,824 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 16:25:39,824 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 16:25:39,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-27 16:25:39,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:25:39,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:25:40,046 INFO L272 TraceCheckUtils]: 0: Hoare triple {366#true} [58] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {366#true} is VALID [2022-04-27 16:25:40,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {366#true} [60] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {366#true} is VALID [2022-04-27 16:25:40,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {366#true} [63] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {366#true} is VALID [2022-04-27 16:25:40,047 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {366#true} {366#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {366#true} is VALID [2022-04-27 16:25:40,047 INFO L272 TraceCheckUtils]: 4: Hoare triple {366#true} [59] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {366#true} is VALID [2022-04-27 16:25:40,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {366#true} [62] mainENTRY-->L27: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_6 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_6, main_~sum~0=v_main_~sum~0_5} AuxVars[] AssignedVars[main_#t~nondet1, main_~sum~0, main_~i~0, main_~n~0] {366#true} is VALID [2022-04-27 16:25:40,048 INFO L290 TraceCheckUtils]: 6: Hoare triple {366#true} [65] L27-->L29-3: Formula: (and (<= 1 v_main_~n~0_3) (= 0 v_main_~sum~0_2) (<= v_main_~n~0_3 1000) (= v_main_~i~0_1 1)) InVars {main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3, main_~sum~0=v_main_~sum~0_2} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {389#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-27 16:25:40,048 INFO L290 TraceCheckUtils]: 7: Hoare triple {389#(and (= main_~sum~0 0) (= main_~i~0 1))} [69] L29-3-->L29-2: Formula: (and (= (+ v_main_~i~0_3 v_main_~sum~0_4) v_main_~sum~0_3) (<= v_main_~i~0_3 v_main_~n~0_5)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_5, main_~sum~0=v_main_~sum~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_5, main_~sum~0=v_main_~sum~0_3} AuxVars[] AssignedVars[main_~sum~0] {393#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} is VALID [2022-04-27 16:25:40,049 INFO L290 TraceCheckUtils]: 8: Hoare triple {393#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} [71] L29-2-->L29-3: Formula: (= v_main_~i~0_4 (+ v_main_~i~0_5 1)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {397#(and (= (+ (- 1) main_~sum~0) 0) (= main_~i~0 2))} is VALID [2022-04-27 16:25:40,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {397#(and (= (+ (- 1) main_~sum~0) 0) (= main_~i~0 2))} [69] L29-3-->L29-2: Formula: (and (= (+ v_main_~i~0_3 v_main_~sum~0_4) v_main_~sum~0_3) (<= v_main_~i~0_3 v_main_~n~0_5)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_5, main_~sum~0=v_main_~sum~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_5, main_~sum~0=v_main_~sum~0_3} AuxVars[] AssignedVars[main_~sum~0] {401#(and (= main_~sum~0 (+ main_~i~0 1)) (<= main_~i~0 main_~n~0) (= main_~i~0 2))} is VALID [2022-04-27 16:25:40,050 INFO L290 TraceCheckUtils]: 10: Hoare triple {401#(and (= main_~sum~0 (+ main_~i~0 1)) (<= main_~i~0 main_~n~0) (= main_~i~0 2))} [71] L29-2-->L29-3: Formula: (= v_main_~i~0_4 (+ v_main_~i~0_5 1)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {405#(and (<= 2 main_~n~0) (= main_~sum~0 3) (<= main_~i~0 3))} is VALID [2022-04-27 16:25:40,051 INFO L290 TraceCheckUtils]: 11: Hoare triple {405#(and (<= 2 main_~n~0) (= main_~sum~0 3) (<= main_~i~0 3))} [68] L29-3-->L29-4: Formula: (not (<= v_main_~i~0_2 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {409#(and (< main_~n~0 3) (<= 2 main_~n~0) (= main_~sum~0 3))} is VALID [2022-04-27 16:25:40,051 INFO L272 TraceCheckUtils]: 12: Hoare triple {409#(and (< main_~n~0 3) (<= 2 main_~n~0) (= main_~sum~0 3))} [70] L29-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~n~0_9 (+ v_main_~n~0_9 1)) (* 2 v_main_~sum~0_6)) 1 0)) InVars {main_~sum~0=v_main_~sum~0_6, main_~n~0=v_main_~n~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sum~0, main_~n~0] {413#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:25:40,052 INFO L290 TraceCheckUtils]: 13: Hoare triple {413#(<= 1 |__VERIFIER_assert_#in~cond|)} [73] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {417#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:25:40,052 INFO L290 TraceCheckUtils]: 14: Hoare triple {417#(<= 1 __VERIFIER_assert_~cond)} [74] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {367#false} is VALID [2022-04-27 16:25:40,052 INFO L290 TraceCheckUtils]: 15: Hoare triple {367#false} [76] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {367#false} is VALID [2022-04-27 16:25:40,052 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:25:40,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:25:40,552 INFO L290 TraceCheckUtils]: 15: Hoare triple {367#false} [76] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {367#false} is VALID [2022-04-27 16:25:40,552 INFO L290 TraceCheckUtils]: 14: Hoare triple {417#(<= 1 __VERIFIER_assert_~cond)} [74] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {367#false} is VALID [2022-04-27 16:25:40,553 INFO L290 TraceCheckUtils]: 13: Hoare triple {413#(<= 1 |__VERIFIER_assert_#in~cond|)} [73] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {417#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:25:40,553 INFO L272 TraceCheckUtils]: 12: Hoare triple {433#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} [70] L29-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~n~0_9 (+ v_main_~n~0_9 1)) (* 2 v_main_~sum~0_6)) 1 0)) InVars {main_~sum~0=v_main_~sum~0_6, main_~n~0=v_main_~n~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sum~0, main_~n~0] {413#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:25:40,554 INFO L290 TraceCheckUtils]: 11: Hoare triple {437#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} [68] L29-3-->L29-4: Formula: (not (<= v_main_~i~0_2 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {433#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-27 16:25:40,554 INFO L290 TraceCheckUtils]: 10: Hoare triple {441#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} [71] L29-2-->L29-3: Formula: (= v_main_~i~0_4 (+ v_main_~i~0_5 1)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {437#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-27 16:25:40,558 INFO L290 TraceCheckUtils]: 9: Hoare triple {445#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} [69] L29-3-->L29-2: Formula: (and (= (+ v_main_~i~0_3 v_main_~sum~0_4) v_main_~sum~0_3) (<= v_main_~i~0_3 v_main_~n~0_5)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_5, main_~sum~0=v_main_~sum~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_5, main_~sum~0=v_main_~sum~0_3} AuxVars[] AssignedVars[main_~sum~0] {441#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-27 16:25:40,559 INFO L290 TraceCheckUtils]: 8: Hoare triple {449#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} [71] L29-2-->L29-3: Formula: (= v_main_~i~0_4 (+ v_main_~i~0_5 1)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {445#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-27 16:25:40,565 INFO L290 TraceCheckUtils]: 7: Hoare triple {445#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} [69] L29-3-->L29-2: Formula: (and (= (+ v_main_~i~0_3 v_main_~sum~0_4) v_main_~sum~0_3) (<= v_main_~i~0_3 v_main_~n~0_5)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_5, main_~sum~0=v_main_~sum~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_5, main_~sum~0=v_main_~sum~0_3} AuxVars[] AssignedVars[main_~sum~0] {449#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-27 16:25:40,567 INFO L290 TraceCheckUtils]: 6: Hoare triple {366#true} [65] L27-->L29-3: Formula: (and (<= 1 v_main_~n~0_3) (= 0 v_main_~sum~0_2) (<= v_main_~n~0_3 1000) (= v_main_~i~0_1 1)) InVars {main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3, main_~sum~0=v_main_~sum~0_2} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {445#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-27 16:25:40,567 INFO L290 TraceCheckUtils]: 5: Hoare triple {366#true} [62] mainENTRY-->L27: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_6 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_6, main_~sum~0=v_main_~sum~0_5} AuxVars[] AssignedVars[main_#t~nondet1, main_~sum~0, main_~i~0, main_~n~0] {366#true} is VALID [2022-04-27 16:25:40,567 INFO L272 TraceCheckUtils]: 4: Hoare triple {366#true} [59] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {366#true} is VALID [2022-04-27 16:25:40,567 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {366#true} {366#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {366#true} is VALID [2022-04-27 16:25:40,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {366#true} [63] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {366#true} is VALID [2022-04-27 16:25:40,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {366#true} [60] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {366#true} is VALID [2022-04-27 16:25:40,568 INFO L272 TraceCheckUtils]: 0: Hoare triple {366#true} [58] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {366#true} is VALID [2022-04-27 16:25:40,568 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 16:25:40,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:25:40,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102501585] [2022-04-27 16:25:40,568 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 16:25:40,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279084465] [2022-04-27 16:25:40,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279084465] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:25:40,568 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 16:25:40,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2022-04-27 16:25:40,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176615720] [2022-04-27 16:25:40,569 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 16:25:40,569 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-27 16:25:40,569 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:25:40,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:40,589 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:25:40,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 16:25:40,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:25:40,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 16:25:40,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-04-27 16:25:40,590 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 15 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:43,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:25:43,055 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-04-27 16:25:43,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 16:25:43,056 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-27 16:25:43,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:25:43,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:43,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 20 transitions. [2022-04-27 16:25:43,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:43,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 20 transitions. [2022-04-27 16:25:43,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 20 transitions. [2022-04-27 16:25:43,088 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:25:43,088 INFO L225 Difference]: With dead ends: 18 [2022-04-27 16:25:43,088 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 16:25:43,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=80, Invalid=381, Unknown=1, NotChecked=0, Total=462 [2022-04-27 16:25:43,089 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:25:43,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 47 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 14 Unchecked, 0.0s Time] [2022-04-27 16:25:43,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 16:25:43,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 16:25:43,090 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:25:43,090 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second 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-04-27 16:25:43,090 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second 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-04-27 16:25:43,090 INFO L87 Difference]: Start difference. First operand 0 states. Second 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-04-27 16:25:43,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:25:43,090 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 16:25:43,090 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:25:43,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:25:43,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:25:43,090 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 0 states. [2022-04-27 16:25:43,091 INFO L87 Difference]: Start difference. First 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) Second operand 0 states. [2022-04-27 16:25:43,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:25:43,091 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 16:25:43,091 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:25:43,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:25:43,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:25:43,091 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:25:43,091 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:25:43,091 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-04-27 16:25:43,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 16:25:43,091 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2022-04-27 16:25:43,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:25:43,091 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 16:25:43,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:43,092 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:25:43,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:25:43,093 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 16:25:43,110 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-04-27 16:25:43,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:25:43,297 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2022-04-27 16:25:43,299 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 16:25:43,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:25:43 BasicIcfg [2022-04-27 16:25:43,301 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 16:25:43,302 INFO L158 Benchmark]: Toolchain (without parser) took 5841.72ms. Allocated memory was 186.6MB in the beginning and 240.1MB in the end (delta: 53.5MB). Free memory was 130.8MB in the beginning and 95.0MB in the end (delta: 35.8MB). Peak memory consumption was 90.1MB. Max. memory is 8.0GB. [2022-04-27 16:25:43,302 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 186.6MB. Free memory is still 147.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 16:25:43,304 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.98ms. Allocated memory was 186.6MB in the beginning and 240.1MB in the end (delta: 53.5MB). Free memory was 130.6MB in the beginning and 211.9MB in the end (delta: -81.3MB). Peak memory consumption was 8.5MB. Max. memory is 8.0GB. [2022-04-27 16:25:43,304 INFO L158 Benchmark]: Boogie Preprocessor took 32.43ms. Allocated memory is still 240.1MB. Free memory was 211.9MB in the beginning and 210.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 16:25:43,304 INFO L158 Benchmark]: RCFGBuilder took 197.63ms. Allocated memory is still 240.1MB. Free memory was 210.3MB in the beginning and 197.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 16:25:43,304 INFO L158 Benchmark]: IcfgTransformer took 46.40ms. Allocated memory is still 240.1MB. Free memory was 197.7MB in the beginning and 196.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 16:25:43,305 INFO L158 Benchmark]: TraceAbstraction took 5321.92ms. Allocated memory is still 240.1MB. Free memory was 196.1MB in the beginning and 95.0MB in the end (delta: 101.1MB). Peak memory consumption was 102.7MB. Max. memory is 8.0GB. [2022-04-27 16:25:43,308 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 186.6MB. Free memory is still 147.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 237.98ms. Allocated memory was 186.6MB in the beginning and 240.1MB in the end (delta: 53.5MB). Free memory was 130.6MB in the beginning and 211.9MB in the end (delta: -81.3MB). Peak memory consumption was 8.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.43ms. Allocated memory is still 240.1MB. Free memory was 211.9MB in the beginning and 210.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 197.63ms. Allocated memory is still 240.1MB. Free memory was 210.3MB in the beginning and 197.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 46.40ms. Allocated memory is still 240.1MB. Free memory was 197.7MB in the beginning and 196.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 5321.92ms. Allocated memory is still 240.1MB. Free memory was 196.1MB in the beginning and 95.0MB in the end (delta: 101.1MB). Peak memory consumption was 102.7MB. 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: 19]: 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 4 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 17 mSDsluCounter, 153 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 14 IncrementalHoareTripleChecker+Unchecked, 102 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 114 IncrementalHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 51 mSDtfsCounter, 114 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 28, 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, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 78 ConstructedInterpolants, 3 QuantifiedInterpolants, 361 SizeOfPredicates, 8 NumberOfNonLiveVariables, 180 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 1/10 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-27 16:25:43,325 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...