/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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_valuebound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 14:55:49,715 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 14:55:49,716 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 14:55:49,736 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 14:55:49,736 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 14:55:49,737 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 14:55:49,738 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 14:55:49,739 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 14:55:49,743 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 14:55:49,747 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 14:55:49,747 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 14:55:49,749 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 14:55:49,749 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 14:55:49,750 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 14:55:49,751 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 14:55:49,752 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 14:55:49,753 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 14:55:49,754 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 14:55:49,757 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 14:55:49,761 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 14:55:49,762 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 14:55:49,763 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 14:55:49,764 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 14:55:49,766 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 14:55:49,767 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 14:55:49,771 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 14:55:49,771 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 14:55:49,771 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 14:55:49,771 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 14:55:49,772 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 14:55:49,772 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 14:55:49,772 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 14:55:49,772 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 14:55:49,773 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 14:55:49,773 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 14:55:49,774 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 14:55:49,774 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 14:55:49,774 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 14:55:49,774 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 14:55:49,774 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 14:55:49,775 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 14:55:49,778 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 14:55:49,779 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 14:55:49,799 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 14:55:49,799 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 14:55:49,800 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 14:55:49,800 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 14:55:49,800 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 14:55:49,800 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 14:55:49,801 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 14:55:49,801 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 14:55:49,801 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 14:55:49,801 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 14:55:49,802 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 14:55:49,802 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 14:55:49,802 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 14:55:49,802 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 14:55:49,802 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 14:55:49,802 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 14:55:49,802 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 14:55:49,802 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 14:55:49,802 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 14:55:49,802 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 14:55:49,802 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 14:55:49,802 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 14:55:49,802 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 14:55:49,803 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 14:55:49,803 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:55:49,803 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 14:55:49,803 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 14:55:49,803 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 14:55:49,803 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 14:55:49,803 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 14:55:49,803 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 14:55:49,803 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 14:55:49,803 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 14:55:49,804 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 14:55:49,943 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 14:55:49,955 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 14:55:49,956 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 14:55:49,957 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 14:55:49,957 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 14:55:49,958 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_valuebound10.c [2022-04-27 14:55:49,999 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2da3786f/504ba6f9a32c4eeda8cfae559976d0c4/FLAG7b4a7bcfa [2022-04-27 14:55:50,369 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 14:55:50,369 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_valuebound10.c [2022-04-27 14:55:50,374 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2da3786f/504ba6f9a32c4eeda8cfae559976d0c4/FLAG7b4a7bcfa [2022-04-27 14:55:50,384 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2da3786f/504ba6f9a32c4eeda8cfae559976d0c4 [2022-04-27 14:55:50,386 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 14:55:50,388 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 14:55:50,390 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 14:55:50,390 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 14:55:50,392 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 14:55:50,395 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:55:50" (1/1) ... [2022-04-27 14:55:50,396 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e9f14cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:55:50, skipping insertion in model container [2022-04-27 14:55:50,396 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:55:50" (1/1) ... [2022-04-27 14:55:50,401 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 14:55:50,412 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 14:55:50,546 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_valuebound10.c[520,533] [2022-04-27 14:55:50,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:55:50,586 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 14:55:50,596 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_valuebound10.c[520,533] [2022-04-27 14:55:50,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:55:50,619 INFO L208 MainTranslator]: Completed translation [2022-04-27 14:55:50,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:55:50 WrapperNode [2022-04-27 14:55:50,619 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 14:55:50,620 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 14:55:50,620 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 14:55:50,620 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 14:55:50,627 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:55:50" (1/1) ... [2022-04-27 14:55:50,628 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:55:50" (1/1) ... [2022-04-27 14:55:50,632 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:55:50" (1/1) ... [2022-04-27 14:55:50,632 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:55:50" (1/1) ... [2022-04-27 14:55:50,641 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:55:50" (1/1) ... [2022-04-27 14:55:50,643 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:55:50" (1/1) ... [2022-04-27 14:55:50,644 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:55:50" (1/1) ... [2022-04-27 14:55:50,648 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 14:55:50,649 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 14:55:50,649 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 14:55:50,649 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 14:55:50,649 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:55:50" (1/1) ... [2022-04-27 14:55:50,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:55:50,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:55:50,669 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 14:55:50,674 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 14:55:50,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 14:55:50,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 14:55:50,699 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 14:55:50,699 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 14:55:50,700 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 14:55:50,700 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 14:55:50,700 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 14:55:50,700 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 14:55:50,700 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 14:55:50,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 14:55:50,700 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 14:55:50,700 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 14:55:50,700 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 14:55:50,700 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 14:55:50,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 14:55:50,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 14:55:50,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 14:55:50,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 14:55:50,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 14:55:50,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 14:55:50,744 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 14:55:50,745 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 14:55:50,839 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 14:55:50,843 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 14:55:50,843 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 14:55:50,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:55:50 BoogieIcfgContainer [2022-04-27 14:55:50,844 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 14:55:50,845 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 14:55:50,846 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 14:55:50,860 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 14:55:50,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 02:55:50" (1/3) ... [2022-04-27 14:55:50,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18469c00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:55:50, skipping insertion in model container [2022-04-27 14:55:50,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:55:50" (2/3) ... [2022-04-27 14:55:50,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18469c00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:55:50, skipping insertion in model container [2022-04-27 14:55:50,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:55:50" (3/3) ... [2022-04-27 14:55:50,862 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_valuebound10.c [2022-04-27 14:55:50,871 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 14:55:50,871 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 14:55:50,905 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 14:55:50,909 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@531a5871, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7c1f46cb [2022-04-27 14:55:50,909 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 14:55:50,918 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:55:50,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 14:55:50,926 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:55:50,927 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:55:50,927 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:55:50,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:55:50,930 INFO L85 PathProgramCache]: Analyzing trace with hash 326851384, now seen corresponding path program 1 times [2022-04-27 14:55:50,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:55:50,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072689371] [2022-04-27 14:55:50,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:55:50,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:55:51,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:51,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 14:55:51,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:51,116 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {34#true} is VALID [2022-04-27 14:55:51,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-27 14:55:51,117 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #69#return; {34#true} is VALID [2022-04-27 14:55:51,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 14:55:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:51,127 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-27 14:55:51,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-27 14:55:51,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-27 14:55:51,128 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {34#true} #55#return; {35#false} is VALID [2022-04-27 14:55:51,129 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 14:55:51,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {34#true} is VALID [2022-04-27 14:55:51,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-27 14:55:51,130 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #69#return; {34#true} is VALID [2022-04-27 14:55:51,130 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret5 := main(); {34#true} is VALID [2022-04-27 14:55:51,130 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {34#true} is VALID [2022-04-27 14:55:51,130 INFO L272 TraceCheckUtils]: 6: Hoare triple {34#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 10 then 1 else 0)); {34#true} is VALID [2022-04-27 14:55:51,130 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-27 14:55:51,131 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-27 14:55:51,131 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-27 14:55:51,131 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35#false} {34#true} #55#return; {35#false} is VALID [2022-04-27 14:55:51,131 INFO L290 TraceCheckUtils]: 11: Hoare triple {35#false} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {35#false} is VALID [2022-04-27 14:55:51,132 INFO L290 TraceCheckUtils]: 12: Hoare triple {35#false} assume false; {35#false} is VALID [2022-04-27 14:55:51,132 INFO L272 TraceCheckUtils]: 13: Hoare triple {35#false} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {35#false} is VALID [2022-04-27 14:55:51,132 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-27 14:55:51,132 INFO L290 TraceCheckUtils]: 15: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-27 14:55:51,133 INFO L290 TraceCheckUtils]: 16: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-27 14:55:51,133 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 14:55:51,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:55:51,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072689371] [2022-04-27 14:55:51,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072689371] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:55:51,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:55:51,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 14:55:51,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330161012] [2022-04-27 14:55:51,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:55:51,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 14:55:51,141 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:55:51,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:55:51,166 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 14:55:51,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 14:55:51,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:55:51,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 14:55:51,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:55:51,200 INFO L87 Difference]: Start difference. First operand has 31 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:55:51,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:51,325 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2022-04-27 14:55:51,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 14:55:51,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 14:55:51,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:55:51,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:55:51,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2022-04-27 14:55:51,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:55:51,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2022-04-27 14:55:51,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 76 transitions. [2022-04-27 14:55:51,426 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:55:51,433 INFO L225 Difference]: With dead ends: 53 [2022-04-27 14:55:51,433 INFO L226 Difference]: Without dead ends: 26 [2022-04-27 14:55:51,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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 14:55:51,439 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:55:51,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 32 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:55:51,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-27 14:55:51,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-27 14:55:51,462 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:55:51,463 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:55:51,464 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:55:51,464 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:55:51,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:51,467 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-27 14:55:51,467 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-27 14:55:51,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:51,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:51,468 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 26 states. [2022-04-27 14:55:51,468 INFO L87 Difference]: Start difference. First operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 26 states. [2022-04-27 14:55:51,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:51,470 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-27 14:55:51,470 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-27 14:55:51,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:51,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:51,471 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:55:51,471 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:55:51,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:55:51,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-04-27 14:55:51,486 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 17 [2022-04-27 14:55:51,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:55:51,486 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-04-27 14:55:51,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:55:51,486 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-27 14:55:51,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 14:55:51,487 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:55:51,487 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:55:51,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 14:55:51,488 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:55:51,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:55:51,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1008578050, now seen corresponding path program 1 times [2022-04-27 14:55:51,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:55:51,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282219380] [2022-04-27 14:55:51,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:55:51,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:55:51,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:51,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 14:55:51,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:51,615 INFO L290 TraceCheckUtils]: 0: Hoare triple {225#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {213#true} is VALID [2022-04-27 14:55:51,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {213#true} assume true; {213#true} is VALID [2022-04-27 14:55:51,615 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {213#true} {213#true} #69#return; {213#true} is VALID [2022-04-27 14:55:51,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 14:55:51,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:51,623 INFO L290 TraceCheckUtils]: 0: Hoare triple {213#true} ~cond := #in~cond; {213#true} is VALID [2022-04-27 14:55:51,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {213#true} assume !(0 == ~cond); {213#true} is VALID [2022-04-27 14:55:51,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {213#true} assume true; {213#true} is VALID [2022-04-27 14:55:51,623 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {213#true} {213#true} #55#return; {213#true} is VALID [2022-04-27 14:55:51,624 INFO L272 TraceCheckUtils]: 0: Hoare triple {213#true} call ULTIMATE.init(); {225#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 14:55:51,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {225#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {213#true} is VALID [2022-04-27 14:55:51,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {213#true} assume true; {213#true} is VALID [2022-04-27 14:55:51,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {213#true} {213#true} #69#return; {213#true} is VALID [2022-04-27 14:55:51,625 INFO L272 TraceCheckUtils]: 4: Hoare triple {213#true} call #t~ret5 := main(); {213#true} is VALID [2022-04-27 14:55:51,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {213#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {213#true} is VALID [2022-04-27 14:55:51,625 INFO L272 TraceCheckUtils]: 6: Hoare triple {213#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 10 then 1 else 0)); {213#true} is VALID [2022-04-27 14:55:51,625 INFO L290 TraceCheckUtils]: 7: Hoare triple {213#true} ~cond := #in~cond; {213#true} is VALID [2022-04-27 14:55:51,625 INFO L290 TraceCheckUtils]: 8: Hoare triple {213#true} assume !(0 == ~cond); {213#true} is VALID [2022-04-27 14:55:51,625 INFO L290 TraceCheckUtils]: 9: Hoare triple {213#true} assume true; {213#true} is VALID [2022-04-27 14:55:51,625 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {213#true} {213#true} #55#return; {213#true} is VALID [2022-04-27 14:55:51,626 INFO L290 TraceCheckUtils]: 11: Hoare triple {213#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {222#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-27 14:55:51,627 INFO L290 TraceCheckUtils]: 12: Hoare triple {222#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} assume !false; {222#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-27 14:55:51,627 INFO L272 TraceCheckUtils]: 13: Hoare triple {222#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {223#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:55:51,629 INFO L290 TraceCheckUtils]: 14: Hoare triple {223#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {224#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 14:55:51,629 INFO L290 TraceCheckUtils]: 15: Hoare triple {224#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {214#false} is VALID [2022-04-27 14:55:51,629 INFO L290 TraceCheckUtils]: 16: Hoare triple {214#false} assume !false; {214#false} is VALID [2022-04-27 14:55:51,630 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 14:55:51,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:55:51,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282219380] [2022-04-27 14:55:51,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282219380] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:55:51,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:55:51,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 14:55:51,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492418915] [2022-04-27 14:55:51,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:55:51,632 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 14:55:51,633 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:55:51,633 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:55:51,645 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 14:55:51,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 14:55:51,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:55:51,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 14:55:51,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 14:55:51,646 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:55:51,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:51,978 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-27 14:55:51,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 14:55:51,979 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 14:55:51,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:55:51,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:55:51,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-04-27 14:55:51,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:55:51,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-04-27 14:55:51,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 50 transitions. [2022-04-27 14:55:52,028 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:55:52,029 INFO L225 Difference]: With dead ends: 40 [2022-04-27 14:55:52,029 INFO L226 Difference]: Without dead ends: 38 [2022-04-27 14:55:52,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 14:55:52,030 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 25 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:55:52,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 39 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:55:52,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-27 14:55:52,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2022-04-27 14:55:52,036 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:55:52,037 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:55:52,037 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:55:52,037 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:55:52,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:52,039 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-27 14:55:52,039 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-27 14:55:52,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:52,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:52,040 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 38 states. [2022-04-27 14:55:52,041 INFO L87 Difference]: Start difference. First operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 38 states. [2022-04-27 14:55:52,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:52,043 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-27 14:55:52,043 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-27 14:55:52,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:52,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:52,044 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:55:52,044 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:55:52,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:55:52,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2022-04-27 14:55:52,045 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 17 [2022-04-27 14:55:52,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:55:52,046 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-04-27 14:55:52,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:55:52,046 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-27 14:55:52,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 14:55:52,046 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:55:52,047 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:55:52,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 14:55:52,047 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:55:52,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:55:52,047 INFO L85 PathProgramCache]: Analyzing trace with hash -789682422, now seen corresponding path program 1 times [2022-04-27 14:55:52,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:55:52,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586707137] [2022-04-27 14:55:52,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:55:52,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:55:52,057 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:55:52,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1282835238] [2022-04-27 14:55:52,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:55:52,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:55:52,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:55:52,063 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 14:55:52,066 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 14:55:52,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:52,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:55:52,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:52,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:55:52,251 INFO L272 TraceCheckUtils]: 0: Hoare triple {430#true} call ULTIMATE.init(); {430#true} is VALID [2022-04-27 14:55:52,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {430#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {430#true} is VALID [2022-04-27 14:55:52,251 INFO L290 TraceCheckUtils]: 2: Hoare triple {430#true} assume true; {430#true} is VALID [2022-04-27 14:55:52,251 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {430#true} {430#true} #69#return; {430#true} is VALID [2022-04-27 14:55:52,251 INFO L272 TraceCheckUtils]: 4: Hoare triple {430#true} call #t~ret5 := main(); {430#true} is VALID [2022-04-27 14:55:52,252 INFO L290 TraceCheckUtils]: 5: Hoare triple {430#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {430#true} is VALID [2022-04-27 14:55:52,252 INFO L272 TraceCheckUtils]: 6: Hoare triple {430#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 10 then 1 else 0)); {430#true} is VALID [2022-04-27 14:55:52,253 INFO L290 TraceCheckUtils]: 7: Hoare triple {430#true} ~cond := #in~cond; {430#true} is VALID [2022-04-27 14:55:52,254 INFO L290 TraceCheckUtils]: 8: Hoare triple {430#true} assume !(0 == ~cond); {430#true} is VALID [2022-04-27 14:55:52,254 INFO L290 TraceCheckUtils]: 9: Hoare triple {430#true} assume true; {430#true} is VALID [2022-04-27 14:55:52,254 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {430#true} {430#true} #55#return; {430#true} is VALID [2022-04-27 14:55:52,255 INFO L290 TraceCheckUtils]: 11: Hoare triple {430#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {468#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-27 14:55:52,255 INFO L290 TraceCheckUtils]: 12: Hoare triple {468#(and (= main_~a~0 0) (= main_~s~0 1))} assume !false; {468#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-27 14:55:52,256 INFO L272 TraceCheckUtils]: 13: Hoare triple {468#(and (= main_~a~0 0) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {430#true} is VALID [2022-04-27 14:55:52,256 INFO L290 TraceCheckUtils]: 14: Hoare triple {430#true} ~cond := #in~cond; {430#true} is VALID [2022-04-27 14:55:52,256 INFO L290 TraceCheckUtils]: 15: Hoare triple {430#true} assume !(0 == ~cond); {430#true} is VALID [2022-04-27 14:55:52,256 INFO L290 TraceCheckUtils]: 16: Hoare triple {430#true} assume true; {430#true} is VALID [2022-04-27 14:55:52,257 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {430#true} {468#(and (= main_~a~0 0) (= main_~s~0 1))} #57#return; {468#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-27 14:55:52,257 INFO L272 TraceCheckUtils]: 18: Hoare triple {468#(and (= main_~a~0 0) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {490#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:55:52,258 INFO L290 TraceCheckUtils]: 19: Hoare triple {490#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {494#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:55:52,258 INFO L290 TraceCheckUtils]: 20: Hoare triple {494#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {431#false} is VALID [2022-04-27 14:55:52,258 INFO L290 TraceCheckUtils]: 21: Hoare triple {431#false} assume !false; {431#false} is VALID [2022-04-27 14:55:52,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:55:52,259 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:55:52,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:55:52,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586707137] [2022-04-27 14:55:52,259 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:55:52,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282835238] [2022-04-27 14:55:52,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282835238] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:55:52,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:55:52,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 14:55:52,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183206168] [2022-04-27 14:55:52,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:55:52,263 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 14:55:52,263 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:55:52,263 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:55:52,291 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:55:52,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:55:52,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:55:52,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:55:52,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 14:55:52,293 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:55:52,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:52,436 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-04-27 14:55:52,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:55:52,436 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 14:55:52,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:55:52,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:55:52,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-27 14:55:52,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:55:52,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-27 14:55:52,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2022-04-27 14:55:52,473 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:55:52,474 INFO L225 Difference]: With dead ends: 44 [2022-04-27 14:55:52,474 INFO L226 Difference]: Without dead ends: 42 [2022-04-27 14:55:52,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 14:55:52,475 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 6 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:55:52,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 103 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:55:52,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-27 14:55:52,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2022-04-27 14:55:52,481 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:55:52,481 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:55:52,482 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:55:52,482 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:55:52,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:52,484 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-27 14:55:52,484 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2022-04-27 14:55:52,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:52,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:52,485 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 42 states. [2022-04-27 14:55:52,485 INFO L87 Difference]: Start difference. First operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 42 states. [2022-04-27 14:55:52,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:52,487 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-27 14:55:52,487 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2022-04-27 14:55:52,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:52,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:52,488 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:55:52,488 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:55:52,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:55:52,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2022-04-27 14:55:52,489 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 22 [2022-04-27 14:55:52,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:55:52,490 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2022-04-27 14:55:52,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:55:52,490 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2022-04-27 14:55:52,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 14:55:52,490 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:55:52,491 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:55:52,509 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 14:55:52,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:55:52,707 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:55:52,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:55:52,707 INFO L85 PathProgramCache]: Analyzing trace with hash 2087529154, now seen corresponding path program 1 times [2022-04-27 14:55:52,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:55:52,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907136455] [2022-04-27 14:55:52,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:55:52,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:55:52,720 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:55:52,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [269452729] [2022-04-27 14:55:52,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:55:52,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:55:52,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:55:52,721 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 14:55:52,722 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 14:55:52,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:52,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:55:52,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:52,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:55:52,847 INFO L272 TraceCheckUtils]: 0: Hoare triple {716#true} call ULTIMATE.init(); {716#true} is VALID [2022-04-27 14:55:52,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {716#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {716#true} is VALID [2022-04-27 14:55:52,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {716#true} assume true; {716#true} is VALID [2022-04-27 14:55:52,848 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {716#true} {716#true} #69#return; {716#true} is VALID [2022-04-27 14:55:52,848 INFO L272 TraceCheckUtils]: 4: Hoare triple {716#true} call #t~ret5 := main(); {716#true} is VALID [2022-04-27 14:55:52,848 INFO L290 TraceCheckUtils]: 5: Hoare triple {716#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {716#true} is VALID [2022-04-27 14:55:52,848 INFO L272 TraceCheckUtils]: 6: Hoare triple {716#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 10 then 1 else 0)); {716#true} is VALID [2022-04-27 14:55:52,848 INFO L290 TraceCheckUtils]: 7: Hoare triple {716#true} ~cond := #in~cond; {716#true} is VALID [2022-04-27 14:55:52,848 INFO L290 TraceCheckUtils]: 8: Hoare triple {716#true} assume !(0 == ~cond); {716#true} is VALID [2022-04-27 14:55:52,849 INFO L290 TraceCheckUtils]: 9: Hoare triple {716#true} assume true; {716#true} is VALID [2022-04-27 14:55:52,849 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {716#true} {716#true} #55#return; {716#true} is VALID [2022-04-27 14:55:52,849 INFO L290 TraceCheckUtils]: 11: Hoare triple {716#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {754#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 14:55:52,850 INFO L290 TraceCheckUtils]: 12: Hoare triple {754#(and (= main_~t~0 1) (= main_~s~0 1))} assume !false; {754#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 14:55:52,850 INFO L272 TraceCheckUtils]: 13: Hoare triple {754#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {716#true} is VALID [2022-04-27 14:55:52,850 INFO L290 TraceCheckUtils]: 14: Hoare triple {716#true} ~cond := #in~cond; {716#true} is VALID [2022-04-27 14:55:52,850 INFO L290 TraceCheckUtils]: 15: Hoare triple {716#true} assume !(0 == ~cond); {716#true} is VALID [2022-04-27 14:55:52,850 INFO L290 TraceCheckUtils]: 16: Hoare triple {716#true} assume true; {716#true} is VALID [2022-04-27 14:55:52,851 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {716#true} {754#(and (= main_~t~0 1) (= main_~s~0 1))} #57#return; {754#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 14:55:52,851 INFO L272 TraceCheckUtils]: 18: Hoare triple {754#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {716#true} is VALID [2022-04-27 14:55:52,851 INFO L290 TraceCheckUtils]: 19: Hoare triple {716#true} ~cond := #in~cond; {716#true} is VALID [2022-04-27 14:55:52,851 INFO L290 TraceCheckUtils]: 20: Hoare triple {716#true} assume !(0 == ~cond); {716#true} is VALID [2022-04-27 14:55:52,851 INFO L290 TraceCheckUtils]: 21: Hoare triple {716#true} assume true; {716#true} is VALID [2022-04-27 14:55:52,852 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {716#true} {754#(and (= main_~t~0 1) (= main_~s~0 1))} #59#return; {754#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 14:55:52,852 INFO L272 TraceCheckUtils]: 23: Hoare triple {754#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {791#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:55:52,853 INFO L290 TraceCheckUtils]: 24: Hoare triple {791#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {795#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:55:52,853 INFO L290 TraceCheckUtils]: 25: Hoare triple {795#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {717#false} is VALID [2022-04-27 14:55:52,853 INFO L290 TraceCheckUtils]: 26: Hoare triple {717#false} assume !false; {717#false} is VALID [2022-04-27 14:55:52,853 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 14:55:52,854 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:55:52,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:55:52,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907136455] [2022-04-27 14:55:52,854 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:55:52,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269452729] [2022-04-27 14:55:52,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269452729] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:55:52,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:55:52,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 14:55:52,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419358577] [2022-04-27 14:55:52,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:55:52,855 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-27 14:55:52,855 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:55:52,855 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:55:52,869 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 14:55:52,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:55:52,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:55:52,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:55:52,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 14:55:52,871 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:55:52,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:52,989 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2022-04-27 14:55:52,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:55:52,990 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-27 14:55:52,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:55:52,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:55:52,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-27 14:55:52,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:55:52,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-27 14:55:52,992 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2022-04-27 14:55:53,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:55:53,022 INFO L225 Difference]: With dead ends: 48 [2022-04-27 14:55:53,022 INFO L226 Difference]: Without dead ends: 43 [2022-04-27 14:55:53,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 14:55:53,023 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 6 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:55:53,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 106 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:55:53,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-27 14:55:53,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-27 14:55:53,028 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:55:53,028 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:55:53,028 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:55:53,029 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:55:53,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:53,030 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-27 14:55:53,030 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-27 14:55:53,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:53,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:53,031 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 43 states. [2022-04-27 14:55:53,031 INFO L87 Difference]: Start difference. First operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 43 states. [2022-04-27 14:55:53,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:53,032 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-27 14:55:53,032 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-27 14:55:53,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:53,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:53,033 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:55:53,033 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:55:53,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:55:53,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2022-04-27 14:55:53,034 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 27 [2022-04-27 14:55:53,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:55:53,034 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2022-04-27 14:55:53,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:55:53,034 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-27 14:55:53,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 14:55:53,035 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:55:53,035 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:55:53,053 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 14:55:53,251 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,SelfDestructingSolverStorable3 [2022-04-27 14:55:53,251 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:55:53,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:55:53,252 INFO L85 PathProgramCache]: Analyzing trace with hash -2092280728, now seen corresponding path program 1 times [2022-04-27 14:55:53,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:55:53,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756351075] [2022-04-27 14:55:53,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:55:53,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:55:53,261 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:55:53,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [172613342] [2022-04-27 14:55:53,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:55:53,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:55:53,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:55:53,262 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 14:55:53,263 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 14:55:53,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:53,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 14:55:53,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:53,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:55:53,431 INFO L272 TraceCheckUtils]: 0: Hoare triple {1025#true} call ULTIMATE.init(); {1025#true} is VALID [2022-04-27 14:55:53,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {1025#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1025#true} is VALID [2022-04-27 14:55:53,431 INFO L290 TraceCheckUtils]: 2: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-27 14:55:53,431 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1025#true} {1025#true} #69#return; {1025#true} is VALID [2022-04-27 14:55:53,431 INFO L272 TraceCheckUtils]: 4: Hoare triple {1025#true} call #t~ret5 := main(); {1025#true} is VALID [2022-04-27 14:55:53,431 INFO L290 TraceCheckUtils]: 5: Hoare triple {1025#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1025#true} is VALID [2022-04-27 14:55:53,431 INFO L272 TraceCheckUtils]: 6: Hoare triple {1025#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 10 then 1 else 0)); {1025#true} is VALID [2022-04-27 14:55:53,432 INFO L290 TraceCheckUtils]: 7: Hoare triple {1025#true} ~cond := #in~cond; {1025#true} is VALID [2022-04-27 14:55:53,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {1025#true} assume !(0 == ~cond); {1025#true} is VALID [2022-04-27 14:55:53,432 INFO L290 TraceCheckUtils]: 9: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-27 14:55:53,432 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1025#true} {1025#true} #55#return; {1025#true} is VALID [2022-04-27 14:55:53,433 INFO L290 TraceCheckUtils]: 11: Hoare triple {1025#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {1063#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-27 14:55:53,434 INFO L290 TraceCheckUtils]: 12: Hoare triple {1063#(and (= main_~a~0 0) (= main_~t~0 1))} assume !false; {1063#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-27 14:55:53,434 INFO L272 TraceCheckUtils]: 13: Hoare triple {1063#(and (= main_~a~0 0) (= main_~t~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1025#true} is VALID [2022-04-27 14:55:53,434 INFO L290 TraceCheckUtils]: 14: Hoare triple {1025#true} ~cond := #in~cond; {1025#true} is VALID [2022-04-27 14:55:53,434 INFO L290 TraceCheckUtils]: 15: Hoare triple {1025#true} assume !(0 == ~cond); {1025#true} is VALID [2022-04-27 14:55:53,434 INFO L290 TraceCheckUtils]: 16: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-27 14:55:53,435 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1025#true} {1063#(and (= main_~a~0 0) (= main_~t~0 1))} #57#return; {1063#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-27 14:55:53,435 INFO L272 TraceCheckUtils]: 18: Hoare triple {1063#(and (= main_~a~0 0) (= main_~t~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1025#true} is VALID [2022-04-27 14:55:53,435 INFO L290 TraceCheckUtils]: 19: Hoare triple {1025#true} ~cond := #in~cond; {1025#true} is VALID [2022-04-27 14:55:53,435 INFO L290 TraceCheckUtils]: 20: Hoare triple {1025#true} assume !(0 == ~cond); {1025#true} is VALID [2022-04-27 14:55:53,435 INFO L290 TraceCheckUtils]: 21: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-27 14:55:53,436 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1025#true} {1063#(and (= main_~a~0 0) (= main_~t~0 1))} #59#return; {1063#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-27 14:55:53,436 INFO L272 TraceCheckUtils]: 23: Hoare triple {1063#(and (= main_~a~0 0) (= main_~t~0 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {1025#true} is VALID [2022-04-27 14:55:53,436 INFO L290 TraceCheckUtils]: 24: Hoare triple {1025#true} ~cond := #in~cond; {1025#true} is VALID [2022-04-27 14:55:53,436 INFO L290 TraceCheckUtils]: 25: Hoare triple {1025#true} assume !(0 == ~cond); {1025#true} is VALID [2022-04-27 14:55:53,437 INFO L290 TraceCheckUtils]: 26: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-27 14:55:53,451 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1025#true} {1063#(and (= main_~a~0 0) (= main_~t~0 1))} #61#return; {1063#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-27 14:55:53,452 INFO L290 TraceCheckUtils]: 28: Hoare triple {1063#(and (= main_~a~0 0) (= main_~t~0 1))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1115#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-27 14:55:53,452 INFO L290 TraceCheckUtils]: 29: Hoare triple {1115#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} assume !false; {1115#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-27 14:55:53,453 INFO L272 TraceCheckUtils]: 30: Hoare triple {1115#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1122#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:55:53,453 INFO L290 TraceCheckUtils]: 31: Hoare triple {1122#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1126#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:55:53,454 INFO L290 TraceCheckUtils]: 32: Hoare triple {1126#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1026#false} is VALID [2022-04-27 14:55:53,454 INFO L290 TraceCheckUtils]: 33: Hoare triple {1026#false} assume !false; {1026#false} is VALID [2022-04-27 14:55:53,454 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 14:55:53,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:55:53,575 INFO L290 TraceCheckUtils]: 33: Hoare triple {1026#false} assume !false; {1026#false} is VALID [2022-04-27 14:55:53,575 INFO L290 TraceCheckUtils]: 32: Hoare triple {1126#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1026#false} is VALID [2022-04-27 14:55:53,575 INFO L290 TraceCheckUtils]: 31: Hoare triple {1122#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1126#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:55:53,576 INFO L272 TraceCheckUtils]: 30: Hoare triple {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1122#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:55:53,577 INFO L290 TraceCheckUtils]: 29: Hoare triple {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} assume !false; {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-27 14:55:53,577 INFO L290 TraceCheckUtils]: 28: Hoare triple {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-27 14:55:53,578 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1025#true} {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} #61#return; {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-27 14:55:53,578 INFO L290 TraceCheckUtils]: 26: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-27 14:55:53,578 INFO L290 TraceCheckUtils]: 25: Hoare triple {1025#true} assume !(0 == ~cond); {1025#true} is VALID [2022-04-27 14:55:53,578 INFO L290 TraceCheckUtils]: 24: Hoare triple {1025#true} ~cond := #in~cond; {1025#true} is VALID [2022-04-27 14:55:53,578 INFO L272 TraceCheckUtils]: 23: Hoare triple {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {1025#true} is VALID [2022-04-27 14:55:53,578 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1025#true} {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} #59#return; {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-27 14:55:53,579 INFO L290 TraceCheckUtils]: 21: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-27 14:55:53,579 INFO L290 TraceCheckUtils]: 20: Hoare triple {1025#true} assume !(0 == ~cond); {1025#true} is VALID [2022-04-27 14:55:53,579 INFO L290 TraceCheckUtils]: 19: Hoare triple {1025#true} ~cond := #in~cond; {1025#true} is VALID [2022-04-27 14:55:53,579 INFO L272 TraceCheckUtils]: 18: Hoare triple {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1025#true} is VALID [2022-04-27 14:55:53,579 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1025#true} {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} #57#return; {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-27 14:55:53,579 INFO L290 TraceCheckUtils]: 16: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-27 14:55:53,579 INFO L290 TraceCheckUtils]: 15: Hoare triple {1025#true} assume !(0 == ~cond); {1025#true} is VALID [2022-04-27 14:55:53,580 INFO L290 TraceCheckUtils]: 14: Hoare triple {1025#true} ~cond := #in~cond; {1025#true} is VALID [2022-04-27 14:55:53,580 INFO L272 TraceCheckUtils]: 13: Hoare triple {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1025#true} is VALID [2022-04-27 14:55:53,580 INFO L290 TraceCheckUtils]: 12: Hoare triple {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} assume !false; {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-27 14:55:53,580 INFO L290 TraceCheckUtils]: 11: Hoare triple {1025#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-27 14:55:53,580 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1025#true} {1025#true} #55#return; {1025#true} is VALID [2022-04-27 14:55:53,580 INFO L290 TraceCheckUtils]: 9: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-27 14:55:53,581 INFO L290 TraceCheckUtils]: 8: Hoare triple {1025#true} assume !(0 == ~cond); {1025#true} is VALID [2022-04-27 14:55:53,581 INFO L290 TraceCheckUtils]: 7: Hoare triple {1025#true} ~cond := #in~cond; {1025#true} is VALID [2022-04-27 14:55:53,581 INFO L272 TraceCheckUtils]: 6: Hoare triple {1025#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 10 then 1 else 0)); {1025#true} is VALID [2022-04-27 14:55:53,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {1025#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1025#true} is VALID [2022-04-27 14:55:53,581 INFO L272 TraceCheckUtils]: 4: Hoare triple {1025#true} call #t~ret5 := main(); {1025#true} is VALID [2022-04-27 14:55:53,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1025#true} {1025#true} #69#return; {1025#true} is VALID [2022-04-27 14:55:53,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-27 14:55:53,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {1025#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1025#true} is VALID [2022-04-27 14:55:53,581 INFO L272 TraceCheckUtils]: 0: Hoare triple {1025#true} call ULTIMATE.init(); {1025#true} is VALID [2022-04-27 14:55:53,581 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-27 14:55:53,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:55:53,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756351075] [2022-04-27 14:55:53,582 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:55:53,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172613342] [2022-04-27 14:55:53,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172613342] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 14:55:53,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:55:53,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-27 14:55:53,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965459234] [2022-04-27 14:55:53,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:55:53,583 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-27 14:55:53,583 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:55:53,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 14:55:53,599 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:55:53,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:55:53,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:55:53,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:55:53,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 14:55:53,600 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 14:55:53,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:53,708 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-04-27 14:55:53,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:55:53,708 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-27 14:55:53,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:55:53,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 14:55:53,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-27 14:55:53,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 14:55:53,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-27 14:55:53,710 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2022-04-27 14:55:53,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:55:53,736 INFO L225 Difference]: With dead ends: 49 [2022-04-27 14:55:53,736 INFO L226 Difference]: Without dead ends: 47 [2022-04-27 14:55:53,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 14:55:53,736 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:55:53,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 79 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:55:53,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-27 14:55:53,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-27 14:55:53,742 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:55:53,743 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:55:53,743 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:55:53,743 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:55:53,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:53,744 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-27 14:55:53,745 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-27 14:55:53,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:53,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:53,745 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 47 states. [2022-04-27 14:55:53,745 INFO L87 Difference]: Start difference. First operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 47 states. [2022-04-27 14:55:53,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:53,746 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-27 14:55:53,746 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-27 14:55:53,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:53,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:53,747 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:55:53,747 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:55:53,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:55:53,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2022-04-27 14:55:53,748 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 34 [2022-04-27 14:55:53,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:55:53,748 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2022-04-27 14:55:53,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 14:55:53,749 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-27 14:55:53,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-27 14:55:53,749 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:55:53,749 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:55:53,767 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 14:55:53,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:55:53,950 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:55:53,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:55:53,950 INFO L85 PathProgramCache]: Analyzing trace with hash 398970980, now seen corresponding path program 2 times [2022-04-27 14:55:53,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:55:53,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083441527] [2022-04-27 14:55:53,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:55:53,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:55:53,959 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:55:53,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1255491520] [2022-04-27 14:55:53,959 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:55:53,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:55:53,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:55:53,962 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:55:53,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 14:55:53,998 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:55:53,998 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:55:53,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 14:55:54,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:54,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:55:54,172 INFO L272 TraceCheckUtils]: 0: Hoare triple {1471#true} call ULTIMATE.init(); {1471#true} is VALID [2022-04-27 14:55:54,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {1471#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1471#true} is VALID [2022-04-27 14:55:54,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-04-27 14:55:54,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1471#true} {1471#true} #69#return; {1471#true} is VALID [2022-04-27 14:55:54,172 INFO L272 TraceCheckUtils]: 4: Hoare triple {1471#true} call #t~ret5 := main(); {1471#true} is VALID [2022-04-27 14:55:54,172 INFO L290 TraceCheckUtils]: 5: Hoare triple {1471#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1471#true} is VALID [2022-04-27 14:55:54,172 INFO L272 TraceCheckUtils]: 6: Hoare triple {1471#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 10 then 1 else 0)); {1471#true} is VALID [2022-04-27 14:55:54,173 INFO L290 TraceCheckUtils]: 7: Hoare triple {1471#true} ~cond := #in~cond; {1471#true} is VALID [2022-04-27 14:55:54,173 INFO L290 TraceCheckUtils]: 8: Hoare triple {1471#true} assume !(0 == ~cond); {1471#true} is VALID [2022-04-27 14:55:54,173 INFO L290 TraceCheckUtils]: 9: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-04-27 14:55:54,173 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1471#true} {1471#true} #55#return; {1471#true} is VALID [2022-04-27 14:55:54,174 INFO L290 TraceCheckUtils]: 11: Hoare triple {1471#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 14:55:54,174 INFO L290 TraceCheckUtils]: 12: Hoare triple {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} assume !false; {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 14:55:54,175 INFO L272 TraceCheckUtils]: 13: Hoare triple {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1471#true} is VALID [2022-04-27 14:55:54,175 INFO L290 TraceCheckUtils]: 14: Hoare triple {1471#true} ~cond := #in~cond; {1471#true} is VALID [2022-04-27 14:55:54,175 INFO L290 TraceCheckUtils]: 15: Hoare triple {1471#true} assume !(0 == ~cond); {1471#true} is VALID [2022-04-27 14:55:54,176 INFO L290 TraceCheckUtils]: 16: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-04-27 14:55:54,176 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1471#true} {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #57#return; {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 14:55:54,177 INFO L272 TraceCheckUtils]: 18: Hoare triple {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1471#true} is VALID [2022-04-27 14:55:54,177 INFO L290 TraceCheckUtils]: 19: Hoare triple {1471#true} ~cond := #in~cond; {1471#true} is VALID [2022-04-27 14:55:54,177 INFO L290 TraceCheckUtils]: 20: Hoare triple {1471#true} assume !(0 == ~cond); {1471#true} is VALID [2022-04-27 14:55:54,177 INFO L290 TraceCheckUtils]: 21: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-04-27 14:55:54,177 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1471#true} {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #59#return; {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 14:55:54,177 INFO L272 TraceCheckUtils]: 23: Hoare triple {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {1471#true} is VALID [2022-04-27 14:55:54,177 INFO L290 TraceCheckUtils]: 24: Hoare triple {1471#true} ~cond := #in~cond; {1471#true} is VALID [2022-04-27 14:55:54,177 INFO L290 TraceCheckUtils]: 25: Hoare triple {1471#true} assume !(0 == ~cond); {1471#true} is VALID [2022-04-27 14:55:54,177 INFO L290 TraceCheckUtils]: 26: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-04-27 14:55:54,178 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1471#true} {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #61#return; {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 14:55:54,178 INFO L290 TraceCheckUtils]: 28: Hoare triple {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1561#(and (= (+ main_~s~0 (- 3)) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-27 14:55:54,179 INFO L290 TraceCheckUtils]: 29: Hoare triple {1561#(and (= (+ main_~s~0 (- 3)) 1) (= (+ (- 1) main_~a~0) 0))} assume !false; {1561#(and (= (+ main_~s~0 (- 3)) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-27 14:55:54,179 INFO L272 TraceCheckUtils]: 30: Hoare triple {1561#(and (= (+ main_~s~0 (- 3)) 1) (= (+ (- 1) main_~a~0) 0))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1471#true} is VALID [2022-04-27 14:55:54,179 INFO L290 TraceCheckUtils]: 31: Hoare triple {1471#true} ~cond := #in~cond; {1471#true} is VALID [2022-04-27 14:55:54,179 INFO L290 TraceCheckUtils]: 32: Hoare triple {1471#true} assume !(0 == ~cond); {1471#true} is VALID [2022-04-27 14:55:54,182 INFO L290 TraceCheckUtils]: 33: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-04-27 14:55:54,182 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1471#true} {1561#(and (= (+ main_~s~0 (- 3)) 1) (= (+ (- 1) main_~a~0) 0))} #57#return; {1561#(and (= (+ main_~s~0 (- 3)) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-27 14:55:54,183 INFO L272 TraceCheckUtils]: 35: Hoare triple {1561#(and (= (+ main_~s~0 (- 3)) 1) (= (+ (- 1) main_~a~0) 0))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1583#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:55:54,183 INFO L290 TraceCheckUtils]: 36: Hoare triple {1583#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1587#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:55:54,183 INFO L290 TraceCheckUtils]: 37: Hoare triple {1587#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1472#false} is VALID [2022-04-27 14:55:54,183 INFO L290 TraceCheckUtils]: 38: Hoare triple {1472#false} assume !false; {1472#false} is VALID [2022-04-27 14:55:54,184 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 14:55:54,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:55:54,310 INFO L290 TraceCheckUtils]: 38: Hoare triple {1472#false} assume !false; {1472#false} is VALID [2022-04-27 14:55:54,311 INFO L290 TraceCheckUtils]: 37: Hoare triple {1587#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1472#false} is VALID [2022-04-27 14:55:54,311 INFO L290 TraceCheckUtils]: 36: Hoare triple {1583#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1587#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:55:54,311 INFO L272 TraceCheckUtils]: 35: Hoare triple {1603#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1583#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:55:54,312 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1471#true} {1603#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} #57#return; {1603#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-27 14:55:54,312 INFO L290 TraceCheckUtils]: 33: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-04-27 14:55:54,312 INFO L290 TraceCheckUtils]: 32: Hoare triple {1471#true} assume !(0 == ~cond); {1471#true} is VALID [2022-04-27 14:55:54,312 INFO L290 TraceCheckUtils]: 31: Hoare triple {1471#true} ~cond := #in~cond; {1471#true} is VALID [2022-04-27 14:55:54,312 INFO L272 TraceCheckUtils]: 30: Hoare triple {1603#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1471#true} is VALID [2022-04-27 14:55:54,312 INFO L290 TraceCheckUtils]: 29: Hoare triple {1603#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} assume !false; {1603#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-27 14:55:54,375 INFO L290 TraceCheckUtils]: 28: Hoare triple {1625#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1603#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-27 14:55:54,375 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1471#true} {1625#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #61#return; {1625#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-27 14:55:54,376 INFO L290 TraceCheckUtils]: 26: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-04-27 14:55:54,376 INFO L290 TraceCheckUtils]: 25: Hoare triple {1471#true} assume !(0 == ~cond); {1471#true} is VALID [2022-04-27 14:55:54,376 INFO L290 TraceCheckUtils]: 24: Hoare triple {1471#true} ~cond := #in~cond; {1471#true} is VALID [2022-04-27 14:55:54,376 INFO L272 TraceCheckUtils]: 23: Hoare triple {1625#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {1471#true} is VALID [2022-04-27 14:55:54,377 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1471#true} {1625#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #59#return; {1625#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-27 14:55:54,377 INFO L290 TraceCheckUtils]: 21: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-04-27 14:55:54,377 INFO L290 TraceCheckUtils]: 20: Hoare triple {1471#true} assume !(0 == ~cond); {1471#true} is VALID [2022-04-27 14:55:54,377 INFO L290 TraceCheckUtils]: 19: Hoare triple {1471#true} ~cond := #in~cond; {1471#true} is VALID [2022-04-27 14:55:54,377 INFO L272 TraceCheckUtils]: 18: Hoare triple {1625#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1471#true} is VALID [2022-04-27 14:55:54,378 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1471#true} {1625#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #57#return; {1625#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-27 14:55:54,378 INFO L290 TraceCheckUtils]: 16: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-04-27 14:55:54,378 INFO L290 TraceCheckUtils]: 15: Hoare triple {1471#true} assume !(0 == ~cond); {1471#true} is VALID [2022-04-27 14:55:54,378 INFO L290 TraceCheckUtils]: 14: Hoare triple {1471#true} ~cond := #in~cond; {1471#true} is VALID [2022-04-27 14:55:54,378 INFO L272 TraceCheckUtils]: 13: Hoare triple {1625#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1471#true} is VALID [2022-04-27 14:55:54,380 INFO L290 TraceCheckUtils]: 12: Hoare triple {1625#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} assume !false; {1625#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-27 14:55:54,380 INFO L290 TraceCheckUtils]: 11: Hoare triple {1471#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {1625#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-27 14:55:54,380 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1471#true} {1471#true} #55#return; {1471#true} is VALID [2022-04-27 14:55:54,381 INFO L290 TraceCheckUtils]: 9: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-04-27 14:55:54,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {1471#true} assume !(0 == ~cond); {1471#true} is VALID [2022-04-27 14:55:54,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {1471#true} ~cond := #in~cond; {1471#true} is VALID [2022-04-27 14:55:54,381 INFO L272 TraceCheckUtils]: 6: Hoare triple {1471#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 10 then 1 else 0)); {1471#true} is VALID [2022-04-27 14:55:54,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {1471#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1471#true} is VALID [2022-04-27 14:55:54,381 INFO L272 TraceCheckUtils]: 4: Hoare triple {1471#true} call #t~ret5 := main(); {1471#true} is VALID [2022-04-27 14:55:54,381 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1471#true} {1471#true} #69#return; {1471#true} is VALID [2022-04-27 14:55:54,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-04-27 14:55:54,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {1471#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1471#true} is VALID [2022-04-27 14:55:54,381 INFO L272 TraceCheckUtils]: 0: Hoare triple {1471#true} call ULTIMATE.init(); {1471#true} is VALID [2022-04-27 14:55:54,381 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 14:55:54,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:55:54,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083441527] [2022-04-27 14:55:54,382 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:55:54,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255491520] [2022-04-27 14:55:54,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255491520] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:55:54,382 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:55:54,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-27 14:55:54,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972051532] [2022-04-27 14:55:54,382 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:55:54,383 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 39 [2022-04-27 14:55:54,383 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:55:54,383 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 14:55:54,416 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:55:54,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 14:55:54,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:55:54,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 14:55:54,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-27 14:55:54,417 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 14:55:54,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:54,841 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2022-04-27 14:55:54,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 14:55:54,841 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 39 [2022-04-27 14:55:54,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:55:54,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 14:55:54,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 53 transitions. [2022-04-27 14:55:54,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 14:55:54,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 53 transitions. [2022-04-27 14:55:54,843 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 53 transitions. [2022-04-27 14:55:54,893 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:55:54,894 INFO L225 Difference]: With dead ends: 55 [2022-04-27 14:55:54,894 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 14:55:54,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-04-27 14:55:54,895 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 9 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:55:54,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 98 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 14:55:54,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 14:55:54,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 14:55:54,896 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:55:54,896 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 14:55:54,896 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 14:55:54,896 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 14:55:54,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:54,896 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 14:55:54,896 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:55:54,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:54,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:54,896 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 14:55:54,896 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 14:55:54,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:54,897 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 14:55:54,897 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:55:54,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:54,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:54,897 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:55:54,897 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:55:54,897 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 14:55:54,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 14:55:54,897 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2022-04-27 14:55:54,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:55:54,897 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 14:55:54,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 14:55:54,897 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:55:54,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:54,899 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 14:55:54,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 14:55:55,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:55:55,117 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 14:55:55,254 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 5) no Hoare annotation was computed. [2022-04-27 14:55:55,254 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 5) no Hoare annotation was computed. [2022-04-27 14:55:55,254 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 5) no Hoare annotation was computed. [2022-04-27 14:55:55,254 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 8 10) the Hoare annotation is: true [2022-04-27 14:55:55,254 INFO L899 garLoopResultBuilder]: For program point L9(line 9) no Hoare annotation was computed. [2022-04-27 14:55:55,254 INFO L899 garLoopResultBuilder]: For program point L9-2(lines 8 10) no Hoare annotation was computed. [2022-04-27 14:55:55,255 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 8 10) no Hoare annotation was computed. [2022-04-27 14:55:55,255 INFO L899 garLoopResultBuilder]: For program point L33(lines 30 42) no Hoare annotation was computed. [2022-04-27 14:55:55,255 INFO L895 garLoopResultBuilder]: At program point L31(line 31) the Hoare annotation is: (and (= (+ main_~t~0 main_~s~0) (+ (* main_~a~0 4) 2 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) [2022-04-27 14:55:55,255 INFO L895 garLoopResultBuilder]: At program point L31-1(line 31) the Hoare annotation is: (and (= (+ main_~t~0 main_~s~0) (+ (* main_~a~0 4) 2 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) [2022-04-27 14:55:55,255 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 20 49) no Hoare annotation was computed. [2022-04-27 14:55:55,255 INFO L899 garLoopResultBuilder]: For program point L46(line 46) no Hoare annotation was computed. [2022-04-27 14:55:55,255 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 20 49) no Hoare annotation was computed. [2022-04-27 14:55:55,255 INFO L895 garLoopResultBuilder]: At program point L44(line 44) the Hoare annotation is: (and (= (+ main_~t~0 main_~s~0) (+ (* main_~a~0 4) 2 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) [2022-04-27 14:55:55,255 INFO L895 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: (and (= (+ main_~t~0 main_~s~0) (+ (* main_~a~0 4) 2 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) [2022-04-27 14:55:55,255 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 20 49) the Hoare annotation is: true [2022-04-27 14:55:55,255 INFO L895 garLoopResultBuilder]: At program point L30-2(lines 30 42) the Hoare annotation is: (and (= (+ main_~t~0 main_~s~0) (+ (* main_~a~0 4) 2 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) [2022-04-27 14:55:55,255 INFO L895 garLoopResultBuilder]: At program point L30-3(lines 30 42) the Hoare annotation is: (and (= (+ main_~t~0 main_~s~0) (+ (* main_~a~0 4) 2 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) [2022-04-27 14:55:55,255 INFO L902 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: true [2022-04-27 14:55:55,255 INFO L899 garLoopResultBuilder]: For program point L24-1(line 24) no Hoare annotation was computed. [2022-04-27 14:55:55,256 INFO L895 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (or (and (= (+ main_~t~0 main_~s~0) (+ (* main_~a~0 4) 2 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (and (= main_~t~0 1) (= main_~s~0 1))) [2022-04-27 14:55:55,256 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 14:55:55,256 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 14:55:55,256 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 14:55:55,256 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 14:55:55,256 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 14:55:55,256 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 14:55:55,256 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 14:55:55,256 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-04-27 14:55:55,256 INFO L899 garLoopResultBuilder]: For program point L13(lines 13 14) no Hoare annotation was computed. [2022-04-27 14:55:55,256 INFO L899 garLoopResultBuilder]: For program point L12(lines 12 15) no Hoare annotation was computed. [2022-04-27 14:55:55,256 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 11 17) no Hoare annotation was computed. [2022-04-27 14:55:55,256 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 11 17) no Hoare annotation was computed. [2022-04-27 14:55:55,256 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2022-04-27 14:55:55,258 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2022-04-27 14:55:55,259 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 14:55:55,261 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 14:55:55,262 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 14:55:55,262 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 14:55:55,262 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 14:55:55,262 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 14:55:55,262 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 14:55:55,262 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 14:55:55,262 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 14:55:55,262 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 14:55:55,262 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-27 14:55:55,263 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 14:55:55,263 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 14:55:55,263 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 14:55:55,263 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 14:55:55,263 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-27 14:55:55,263 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-27 14:55:55,263 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 14:55:55,263 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 14:55:55,263 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-27 14:55:55,263 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 14:55:55,264 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:55:55,264 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:55:55,264 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:55:55,264 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:55:55,264 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:55:55,264 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:55:55,264 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-27 14:55:55,264 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-27 14:55:55,264 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-27 14:55:55,264 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-27 14:55:55,264 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-27 14:55:55,264 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 14:55:55,264 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 14:55:55,264 INFO L163 areAnnotationChecker]: CFG has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 14:55:55,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 02:55:55 BoogieIcfgContainer [2022-04-27 14:55:55,269 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 14:55:55,270 INFO L158 Benchmark]: Toolchain (without parser) took 4882.39ms. Allocated memory was 198.2MB in the beginning and 296.7MB in the end (delta: 98.6MB). Free memory was 145.7MB in the beginning and 171.3MB in the end (delta: -25.6MB). Peak memory consumption was 73.9MB. Max. memory is 8.0GB. [2022-04-27 14:55:55,270 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 198.2MB. Free memory was 162.0MB in the beginning and 161.9MB in the end (delta: 77.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 14:55:55,270 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.07ms. Allocated memory is still 198.2MB. Free memory was 145.5MB in the beginning and 170.1MB in the end (delta: -24.6MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. [2022-04-27 14:55:55,271 INFO L158 Benchmark]: Boogie Preprocessor took 27.98ms. Allocated memory is still 198.2MB. Free memory was 170.1MB in the beginning and 168.6MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 14:55:55,271 INFO L158 Benchmark]: RCFGBuilder took 195.77ms. Allocated memory is still 198.2MB. Free memory was 168.6MB in the beginning and 157.9MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 14:55:55,271 INFO L158 Benchmark]: TraceAbstraction took 4423.83ms. Allocated memory was 198.2MB in the beginning and 296.7MB in the end (delta: 98.6MB). Free memory was 157.1MB in the beginning and 171.3MB in the end (delta: -14.2MB). Peak memory consumption was 85.6MB. Max. memory is 8.0GB. [2022-04-27 14:55:55,272 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.08ms. Allocated memory is still 198.2MB. Free memory was 162.0MB in the beginning and 161.9MB in the end (delta: 77.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 230.07ms. Allocated memory is still 198.2MB. Free memory was 145.5MB in the beginning and 170.1MB in the end (delta: -24.6MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.98ms. Allocated memory is still 198.2MB. Free memory was 170.1MB in the beginning and 168.6MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 195.77ms. Allocated memory is still 198.2MB. Free memory was 168.6MB in the beginning and 157.9MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 4423.83ms. Allocated memory was 198.2MB in the beginning and 296.7MB in the end (delta: 98.6MB). Free memory was 157.1MB in the beginning and 171.3MB in the end (delta: -14.2MB). Peak memory consumption was 85.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 14]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.4s, OverallIterations: 6, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 89 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 67 mSDsluCounter, 457 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 289 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 353 IncrementalHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 168 mSDtfsCounter, 353 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 217 GetRequests, 182 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=5, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 37 PreInvPairs, 58 NumberOfFragments, 161 HoareAnnotationTreeSize, 37 FomulaSimplifications, 4 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 14 FomulaSimplificationsInter, 476 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 156 NumberOfCodeBlocks, 156 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 221 ConstructedInterpolants, 0 QuantifiedInterpolants, 603 SizeOfPredicates, 5 NumberOfNonLiveVariables, 378 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 112/120 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 - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: t + s == a * 4 + 2 + a * a && t == a * 2 + 1 RESULT: Ultimate proved your program to be correct! [2022-04-27 14:55:55,284 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...