/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/ps3-ll_unwindbound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 17:29:37,785 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 17:29:37,787 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 17:29:37,834 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 17:29:37,834 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 17:29:37,835 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 17:29:37,838 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 17:29:37,840 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 17:29:37,842 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 17:29:37,846 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 17:29:37,847 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 17:29:37,848 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 17:29:37,848 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 17:29:37,850 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 17:29:37,851 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 17:29:37,854 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 17:29:37,854 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 17:29:37,855 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 17:29:37,857 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 17:29:37,866 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 17:29:37,868 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 17:29:37,869 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 17:29:37,869 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 17:29:37,870 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 17:29:37,872 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 17:29:37,878 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 17:29:37,878 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 17:29:37,878 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 17:29:37,879 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 17:29:37,879 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 17:29:37,881 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 17:29:37,881 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 17:29:37,882 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 17:29:37,883 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 17:29:37,883 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 17:29:37,884 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 17:29:37,884 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 17:29:37,885 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 17:29:37,885 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 17:29:37,885 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 17:29:37,886 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 17:29:37,887 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 17:29:37,888 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-14 17:29:37,918 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 17:29:37,919 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 17:29:37,919 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-14 17:29:37,919 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-14 17:29:37,920 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-14 17:29:37,920 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-14 17:29:37,920 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-14 17:29:37,921 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-14 17:29:37,921 INFO L138 SettingsManager]: * Use SBE=true [2022-04-14 17:29:37,922 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 17:29:37,922 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 17:29:37,922 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 17:29:37,922 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 17:29:37,922 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 17:29:37,922 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 17:29:37,922 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 17:29:37,923 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 17:29:37,923 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 17:29:37,923 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 17:29:37,923 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 17:29:37,923 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 17:29:37,923 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 17:29:37,923 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 17:29:37,923 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 17:29:37,924 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 17:29:37,924 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 17:29:37,924 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-14 17:29:37,924 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-14 17:29:37,924 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 17:29:37,924 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-14 17:29:37,925 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-14 17:29:37,925 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-14 17:29:37,925 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-14 17:29:37,925 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-14 17:29:38,164 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 17:29:38,183 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 17:29:38,185 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 17:29:38,186 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 17:29:38,187 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 17:29:38,188 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps3-ll_unwindbound1.c [2022-04-14 17:29:38,234 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bfadd785/0c11884c4444453088f647b1800bd9aa/FLAG7892b5bde [2022-04-14 17:29:38,642 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 17:29:38,643 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps3-ll_unwindbound1.c [2022-04-14 17:29:38,649 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bfadd785/0c11884c4444453088f647b1800bd9aa/FLAG7892b5bde [2022-04-14 17:29:39,040 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bfadd785/0c11884c4444453088f647b1800bd9aa [2022-04-14 17:29:39,042 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 17:29:39,044 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-14 17:29:39,046 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 17:29:39,046 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 17:29:39,048 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 17:29:39,049 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 05:29:39" (1/1) ... [2022-04-14 17:29:39,050 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d6fad8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:29:39, skipping insertion in model container [2022-04-14 17:29:39,050 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 05:29:39" (1/1) ... [2022-04-14 17:29:39,056 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 17:29:39,070 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 17:29:39,229 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/ps3-ll_unwindbound1.c[458,471] [2022-04-14 17:29:39,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 17:29:39,270 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 17:29:39,286 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/ps3-ll_unwindbound1.c[458,471] [2022-04-14 17:29:39,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 17:29:39,311 INFO L208 MainTranslator]: Completed translation [2022-04-14 17:29:39,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:29:39 WrapperNode [2022-04-14 17:29:39,311 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 17:29:39,312 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 17:29:39,312 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 17:29:39,312 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 17:29:39,319 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:29:39" (1/1) ... [2022-04-14 17:29:39,319 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:29:39" (1/1) ... [2022-04-14 17:29:39,325 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:29:39" (1/1) ... [2022-04-14 17:29:39,325 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:29:39" (1/1) ... [2022-04-14 17:29:39,331 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:29:39" (1/1) ... [2022-04-14 17:29:39,334 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:29:39" (1/1) ... [2022-04-14 17:29:39,335 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:29:39" (1/1) ... [2022-04-14 17:29:39,336 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 17:29:39,337 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 17:29:39,337 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 17:29:39,337 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 17:29:39,338 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:29:39" (1/1) ... [2022-04-14 17:29:39,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 17:29:39,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:29:39,365 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-14 17:29:39,375 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-14 17:29:39,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 17:29:39,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 17:29:39,402 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 17:29:39,402 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 17:29:39,404 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 17:29:39,404 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 17:29:39,404 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 17:29:39,404 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 17:29:39,404 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 17:29:39,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 17:29:39,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-14 17:29:39,404 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 17:29:39,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 17:29:39,405 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 17:29:39,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 17:29:39,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 17:29:39,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 17:29:39,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 17:29:39,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 17:29:39,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 17:29:39,459 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 17:29:39,461 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 17:29:39,617 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 17:29:39,623 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 17:29:39,623 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-14 17:29:39,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 05:29:39 BoogieIcfgContainer [2022-04-14 17:29:39,624 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 17:29:39,626 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 17:29:39,626 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 17:29:39,645 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 17:29:39,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 05:29:39" (1/3) ... [2022-04-14 17:29:39,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4038fcbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 05:29:39, skipping insertion in model container [2022-04-14 17:29:39,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:29:39" (2/3) ... [2022-04-14 17:29:39,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4038fcbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 05:29:39, skipping insertion in model container [2022-04-14 17:29:39,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 05:29:39" (3/3) ... [2022-04-14 17:29:39,648 INFO L111 eAbstractionObserver]: Analyzing ICFG ps3-ll_unwindbound1.c [2022-04-14 17:29:39,652 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-14 17:29:39,652 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 17:29:39,717 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 17:29:39,739 INFO L340 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 [2022-04-14 17:29:39,739 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 17:29:39,771 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-14 17:29:39,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-14 17:29:39,786 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:29:39,787 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 17:29:39,787 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:29:39,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:29:39,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1665267581, now seen corresponding path program 1 times [2022-04-14 17:29:39,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:29:39,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079732878] [2022-04-14 17:29:39,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:29:39,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:29:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:29:39,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 17:29:39,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:29:40,001 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= ~counter~0 |old(~counter~0)|) (= |#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {25#true} is VALID [2022-04-14 17:29:40,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-14 17:29:40,002 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #54#return; {25#true} is VALID [2022-04-14 17:29:40,006 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {30#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 17:29:40,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= ~counter~0 |old(~counter~0)|) (= |#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {25#true} is VALID [2022-04-14 17:29:40,007 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-14 17:29:40,008 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #54#return; {25#true} is VALID [2022-04-14 17:29:40,008 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret6 := main(); {25#true} is VALID [2022-04-14 17:29:40,009 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {25#true} is VALID [2022-04-14 17:29:40,009 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !true; {26#false} is VALID [2022-04-14 17:29:40,010 INFO L272 TraceCheckUtils]: 7: Hoare triple {26#false} call __VERIFIER_assert((if 0 == 6 * ~x~0 - 2 * ~y~0 * ~y~0 * ~y~0 - 3 * ~y~0 * ~y~0 - ~y~0 then 1 else 0)); {26#false} is VALID [2022-04-14 17:29:40,010 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-04-14 17:29:40,010 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2022-04-14 17:29:40,010 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-14 17:29:40,011 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-14 17:29:40,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:29:40,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079732878] [2022-04-14 17:29:40,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079732878] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 17:29:40,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 17:29:40,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 17:29:40,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766574294] [2022-04-14 17:29:40,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 17:29:40,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-14 17:29:40,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:29:40,025 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 17:29:40,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:29:40,044 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 17:29:40,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:29:40,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 17:29:40,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 17:29:40,070 INFO L87 Difference]: Start difference. First operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 17:29:40,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:29:40,196 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2022-04-14 17:29:40,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 17:29:40,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-14 17:29:40,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:29:40,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 17:29:40,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-04-14 17:29:40,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 17:29:40,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-04-14 17:29:40,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 50 transitions. [2022-04-14 17:29:40,288 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-14 17:29:40,299 INFO L225 Difference]: With dead ends: 39 [2022-04-14 17:29:40,299 INFO L226 Difference]: Without dead ends: 18 [2022-04-14 17:29:40,302 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 17:29:40,307 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 17:29:40,308 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 27 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 17:29:40,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-14 17:29:40,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-04-14 17:29:40,340 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:29:40,341 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 17:29:40,341 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 17:29:40,342 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 17:29:40,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:29:40,346 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-14 17:29:40,346 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-14 17:29:40,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:29:40,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:29:40,347 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 18 states. [2022-04-14 17:29:40,348 INFO L87 Difference]: Start difference. First operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 18 states. [2022-04-14 17:29:40,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:29:40,354 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-14 17:29:40,354 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-14 17:29:40,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:29:40,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:29:40,355 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:29:40,355 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:29:40,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 17:29:40,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-14 17:29:40,359 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-04-14 17:29:40,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:29:40,359 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-14 17:29:40,359 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 17:29:40,360 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-14 17:29:40,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-14 17:29:40,364 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:29:40,365 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 17:29:40,370 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 17:29:40,370 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:29:40,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:29:40,374 INFO L85 PathProgramCache]: Analyzing trace with hash -318583316, now seen corresponding path program 1 times [2022-04-14 17:29:40,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:29:40,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513945185] [2022-04-14 17:29:40,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:29:40,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:29:40,402 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:29:40,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [272044244] [2022-04-14 17:29:40,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:29:40,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:29:40,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:29:40,405 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-14 17:29:40,454 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-14 17:29:40,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:29:40,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-14 17:29:40,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:29:40,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 17:29:40,625 INFO L272 TraceCheckUtils]: 0: Hoare triple {146#true} call ULTIMATE.init(); {146#true} is VALID [2022-04-14 17:29:40,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {146#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {154#(<= ~counter~0 0)} is VALID [2022-04-14 17:29:40,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {154#(<= ~counter~0 0)} assume true; {154#(<= ~counter~0 0)} is VALID [2022-04-14 17:29:40,627 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {154#(<= ~counter~0 0)} {146#true} #54#return; {154#(<= ~counter~0 0)} is VALID [2022-04-14 17:29:40,628 INFO L272 TraceCheckUtils]: 4: Hoare triple {154#(<= ~counter~0 0)} call #t~ret6 := main(); {154#(<= ~counter~0 0)} is VALID [2022-04-14 17:29:40,628 INFO L290 TraceCheckUtils]: 5: Hoare triple {154#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {154#(<= ~counter~0 0)} is VALID [2022-04-14 17:29:40,629 INFO L290 TraceCheckUtils]: 6: Hoare triple {154#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {170#(<= |main_#t~post5| 0)} is VALID [2022-04-14 17:29:40,630 INFO L290 TraceCheckUtils]: 7: Hoare triple {170#(<= |main_#t~post5| 0)} assume !(#t~post5 < 1);havoc #t~post5; {147#false} is VALID [2022-04-14 17:29:40,630 INFO L272 TraceCheckUtils]: 8: Hoare triple {147#false} call __VERIFIER_assert((if 0 == 6 * ~x~0 - 2 * ~y~0 * ~y~0 * ~y~0 - 3 * ~y~0 * ~y~0 - ~y~0 then 1 else 0)); {147#false} is VALID [2022-04-14 17:29:40,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {147#false} ~cond := #in~cond; {147#false} is VALID [2022-04-14 17:29:40,630 INFO L290 TraceCheckUtils]: 10: Hoare triple {147#false} assume 0 == ~cond; {147#false} is VALID [2022-04-14 17:29:40,631 INFO L290 TraceCheckUtils]: 11: Hoare triple {147#false} assume !false; {147#false} is VALID [2022-04-14 17:29:40,631 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-14 17:29:40,631 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 17:29:40,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:29:40,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513945185] [2022-04-14 17:29:40,632 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 17:29:40,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272044244] [2022-04-14 17:29:40,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272044244] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 17:29:40,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 17:29:40,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 17:29:40,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113028179] [2022-04-14 17:29:40,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 17:29:40,637 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-14 17:29:40,637 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:29:40,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 17:29:40,650 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:29:40,650 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 17:29:40,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:29:40,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 17:29:40,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 17:29:40,652 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 17:29:40,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:29:40,822 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-14 17:29:40,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 17:29:40,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-14 17:29:40,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:29:40,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 17:29:40,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-14 17:29:40,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 17:29:40,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-14 17:29:40,825 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 28 transitions. [2022-04-14 17:29:40,855 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:29:40,856 INFO L225 Difference]: With dead ends: 26 [2022-04-14 17:29:40,857 INFO L226 Difference]: Without dead ends: 19 [2022-04-14 17:29:40,857 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 17:29:40,860 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 17:29:40,861 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 17:29:40,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-14 17:29:40,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-14 17:29:40,870 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:29:40,870 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 17:29:40,871 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 17:29:40,871 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 17:29:40,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:29:40,874 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-14 17:29:40,874 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-14 17:29:40,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:29:40,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:29:40,875 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-14 17:29:40,876 INFO L87 Difference]: Start difference. First operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-14 17:29:40,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:29:40,878 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-14 17:29:40,878 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-14 17:29:40,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:29:40,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:29:40,879 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:29:40,879 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:29:40,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 17:29:40,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-14 17:29:40,881 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2022-04-14 17:29:40,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:29:40,881 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-14 17:29:40,882 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 17:29:40,882 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-14 17:29:40,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-14 17:29:40,882 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:29:40,882 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 17:29:40,909 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-14 17:29:41,109 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:29:41,109 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:29:41,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:29:41,115 INFO L85 PathProgramCache]: Analyzing trace with hash -316795856, now seen corresponding path program 1 times [2022-04-14 17:29:41,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:29:41,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769451942] [2022-04-14 17:29:41,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:29:41,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:29:41,130 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:29:41,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [921699422] [2022-04-14 17:29:41,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:29:41,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:29:41,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:29:41,132 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-14 17:29:41,166 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-14 17:29:41,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:29:41,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 17:29:41,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:29:41,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 17:29:41,299 INFO L272 TraceCheckUtils]: 0: Hoare triple {288#true} call ULTIMATE.init(); {288#true} is VALID [2022-04-14 17:29:41,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {288#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {288#true} is VALID [2022-04-14 17:29:41,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {288#true} assume true; {288#true} is VALID [2022-04-14 17:29:41,300 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {288#true} {288#true} #54#return; {288#true} is VALID [2022-04-14 17:29:41,300 INFO L272 TraceCheckUtils]: 4: Hoare triple {288#true} call #t~ret6 := main(); {288#true} is VALID [2022-04-14 17:29:41,301 INFO L290 TraceCheckUtils]: 5: Hoare triple {288#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {308#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:29:41,302 INFO L290 TraceCheckUtils]: 6: Hoare triple {308#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {308#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:29:41,302 INFO L290 TraceCheckUtils]: 7: Hoare triple {308#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 1);havoc #t~post5; {308#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:29:41,307 INFO L272 TraceCheckUtils]: 8: Hoare triple {308#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~x~0 - 2 * ~y~0 * ~y~0 * ~y~0 - 3 * ~y~0 * ~y~0 - ~y~0 then 1 else 0)); {318#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:29:41,308 INFO L290 TraceCheckUtils]: 9: Hoare triple {318#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {322#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:29:41,309 INFO L290 TraceCheckUtils]: 10: Hoare triple {322#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {289#false} is VALID [2022-04-14 17:29:41,310 INFO L290 TraceCheckUtils]: 11: Hoare triple {289#false} assume !false; {289#false} is VALID [2022-04-14 17:29:41,310 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-14 17:29:41,310 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 17:29:41,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:29:41,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769451942] [2022-04-14 17:29:41,311 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 17:29:41,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921699422] [2022-04-14 17:29:41,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921699422] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 17:29:41,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 17:29:41,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 17:29:41,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278016454] [2022-04-14 17:29:41,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 17:29:41,312 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-14 17:29:41,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:29:41,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 17:29:41,324 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:29:41,324 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 17:29:41,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:29:41,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 17:29:41,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 17:29:41,325 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 17:29:41,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:29:41,434 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-04-14 17:29:41,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 17:29:41,434 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-14 17:29:41,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:29:41,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 17:29:41,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-14 17:29:41,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 17:29:41,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-14 17:29:41,438 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2022-04-14 17:29:41,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:29:41,467 INFO L225 Difference]: With dead ends: 28 [2022-04-14 17:29:41,467 INFO L226 Difference]: Without dead ends: 25 [2022-04-14 17:29:41,468 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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-14 17:29:41,471 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 17:29:41,473 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 57 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 17:29:41,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-14 17:29:41,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-14 17:29:41,483 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:29:41,484 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 17:29:41,486 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 17:29:41,486 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 17:29:41,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:29:41,488 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-14 17:29:41,489 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-14 17:29:41,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:29:41,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:29:41,490 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-14 17:29:41,490 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-14 17:29:41,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:29:41,496 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-14 17:29:41,496 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-14 17:29:41,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:29:41,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:29:41,497 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:29:41,497 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:29:41,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 17:29:41,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-14 17:29:41,498 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 12 [2022-04-14 17:29:41,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:29:41,499 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-14 17:29:41,499 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 17:29:41,499 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-14 17:29:41,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-14 17:29:41,500 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:29:41,500 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 17:29:41,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-14 17:29:41,703 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-14 17:29:41,704 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:29:41,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:29:41,704 INFO L85 PathProgramCache]: Analyzing trace with hash -2089867248, now seen corresponding path program 1 times [2022-04-14 17:29:41,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:29:41,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471147164] [2022-04-14 17:29:41,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:29:41,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:29:41,721 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:29:41,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2081871270] [2022-04-14 17:29:41,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:29:41,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:29:41,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:29:41,723 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-14 17:29:41,735 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-14 17:29:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:29:41,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-14 17:29:41,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:29:41,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 17:29:41,957 INFO L272 TraceCheckUtils]: 0: Hoare triple {456#true} call ULTIMATE.init(); {456#true} is VALID [2022-04-14 17:29:41,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {456#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {456#true} is VALID [2022-04-14 17:29:41,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {456#true} assume true; {456#true} is VALID [2022-04-14 17:29:41,958 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {456#true} {456#true} #54#return; {456#true} is VALID [2022-04-14 17:29:41,958 INFO L272 TraceCheckUtils]: 4: Hoare triple {456#true} call #t~ret6 := main(); {456#true} is VALID [2022-04-14 17:29:41,959 INFO L290 TraceCheckUtils]: 5: Hoare triple {456#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {476#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:29:41,959 INFO L290 TraceCheckUtils]: 6: Hoare triple {476#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {476#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:29:41,960 INFO L290 TraceCheckUtils]: 7: Hoare triple {476#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 1);havoc #t~post5; {476#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:29:41,960 INFO L272 TraceCheckUtils]: 8: Hoare triple {476#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~x~0 - 2 * ~y~0 * ~y~0 * ~y~0 - 3 * ~y~0 * ~y~0 - ~y~0 then 1 else 0)); {456#true} is VALID [2022-04-14 17:29:41,960 INFO L290 TraceCheckUtils]: 9: Hoare triple {456#true} ~cond := #in~cond; {456#true} is VALID [2022-04-14 17:29:41,960 INFO L290 TraceCheckUtils]: 10: Hoare triple {456#true} assume !(0 == ~cond); {456#true} is VALID [2022-04-14 17:29:41,965 INFO L290 TraceCheckUtils]: 11: Hoare triple {456#true} assume true; {456#true} is VALID [2022-04-14 17:29:41,966 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {456#true} {476#(and (= main_~x~0 0) (= main_~y~0 0))} #50#return; {476#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:29:41,967 INFO L290 TraceCheckUtils]: 13: Hoare triple {476#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 + ~x~0; {501#(and (= main_~y~0 1) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0)) 0))} is VALID [2022-04-14 17:29:41,968 INFO L290 TraceCheckUtils]: 14: Hoare triple {501#(and (= main_~y~0 1) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {501#(and (= main_~y~0 1) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0)) 0))} is VALID [2022-04-14 17:29:41,968 INFO L290 TraceCheckUtils]: 15: Hoare triple {501#(and (= main_~y~0 1) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0)) 0))} assume !(#t~post5 < 1);havoc #t~post5; {501#(and (= main_~y~0 1) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0)) 0))} is VALID [2022-04-14 17:29:41,969 INFO L272 TraceCheckUtils]: 16: Hoare triple {501#(and (= main_~y~0 1) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0)) 0))} call __VERIFIER_assert((if 0 == 6 * ~x~0 - 2 * ~y~0 * ~y~0 * ~y~0 - 3 * ~y~0 * ~y~0 - ~y~0 then 1 else 0)); {511#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:29:41,970 INFO L290 TraceCheckUtils]: 17: Hoare triple {511#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {515#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:29:41,970 INFO L290 TraceCheckUtils]: 18: Hoare triple {515#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {457#false} is VALID [2022-04-14 17:29:41,970 INFO L290 TraceCheckUtils]: 19: Hoare triple {457#false} assume !false; {457#false} is VALID [2022-04-14 17:29:41,971 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 17:29:41,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 17:29:42,119 INFO L290 TraceCheckUtils]: 19: Hoare triple {457#false} assume !false; {457#false} is VALID [2022-04-14 17:29:42,121 INFO L290 TraceCheckUtils]: 18: Hoare triple {515#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {457#false} is VALID [2022-04-14 17:29:42,122 INFO L290 TraceCheckUtils]: 17: Hoare triple {511#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {515#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:29:42,123 INFO L272 TraceCheckUtils]: 16: Hoare triple {531#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} call __VERIFIER_assert((if 0 == 6 * ~x~0 - 2 * ~y~0 * ~y~0 * ~y~0 - 3 * ~y~0 * ~y~0 - ~y~0 then 1 else 0)); {511#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:29:42,123 INFO L290 TraceCheckUtils]: 15: Hoare triple {531#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} assume !(#t~post5 < 1);havoc #t~post5; {531#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} is VALID [2022-04-14 17:29:42,124 INFO L290 TraceCheckUtils]: 14: Hoare triple {531#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {531#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} is VALID [2022-04-14 17:29:55,601 WARN L290 TraceCheckUtils]: 13: Hoare triple {531#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 + ~x~0; {531#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} is UNKNOWN [2022-04-14 17:29:55,602 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {456#true} {531#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} #50#return; {531#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} is VALID [2022-04-14 17:29:55,602 INFO L290 TraceCheckUtils]: 11: Hoare triple {456#true} assume true; {456#true} is VALID [2022-04-14 17:29:55,603 INFO L290 TraceCheckUtils]: 10: Hoare triple {456#true} assume !(0 == ~cond); {456#true} is VALID [2022-04-14 17:29:55,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {456#true} ~cond := #in~cond; {456#true} is VALID [2022-04-14 17:29:55,603 INFO L272 TraceCheckUtils]: 8: Hoare triple {531#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} call __VERIFIER_assert((if 0 == 6 * ~x~0 - 2 * ~y~0 * ~y~0 * ~y~0 - 3 * ~y~0 * ~y~0 - ~y~0 then 1 else 0)); {456#true} is VALID [2022-04-14 17:29:55,603 INFO L290 TraceCheckUtils]: 7: Hoare triple {531#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} assume !!(#t~post5 < 1);havoc #t~post5; {531#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} is VALID [2022-04-14 17:29:55,613 INFO L290 TraceCheckUtils]: 6: Hoare triple {531#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {531#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} is VALID [2022-04-14 17:29:55,614 INFO L290 TraceCheckUtils]: 5: Hoare triple {456#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {531#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} is VALID [2022-04-14 17:29:55,614 INFO L272 TraceCheckUtils]: 4: Hoare triple {456#true} call #t~ret6 := main(); {456#true} is VALID [2022-04-14 17:29:55,614 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {456#true} {456#true} #54#return; {456#true} is VALID [2022-04-14 17:29:55,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {456#true} assume true; {456#true} is VALID [2022-04-14 17:29:55,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {456#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {456#true} is VALID [2022-04-14 17:29:55,614 INFO L272 TraceCheckUtils]: 0: Hoare triple {456#true} call ULTIMATE.init(); {456#true} is VALID [2022-04-14 17:29:55,615 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-14 17:29:55,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:29:55,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471147164] [2022-04-14 17:29:55,615 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 17:29:55,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081871270] [2022-04-14 17:29:55,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081871270] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 17:29:55,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-14 17:29:55,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-14 17:29:55,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039575705] [2022-04-14 17:29:55,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 17:29:55,616 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-14 17:29:55,616 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:29:55,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 17:29:55,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:29:55,952 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 17:29:55,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:29:55,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 17:29:55,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-14 17:29:55,953 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 17:29:56,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:29:56,039 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-14 17:29:56,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 17:29:56,039 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-14 17:29:56,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:29:56,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 17:29:56,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-04-14 17:29:56,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 17:29:56,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-04-14 17:29:56,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 19 transitions. [2022-04-14 17:29:58,065 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 18 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 17:29:58,065 INFO L225 Difference]: With dead ends: 25 [2022-04-14 17:29:58,065 INFO L226 Difference]: Without dead ends: 0 [2022-04-14 17:29:58,066 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 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-14 17:29:58,066 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 6 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 17:29:58,067 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 39 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 17:29:58,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-14 17:29:58,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-14 17:29:58,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:29:58,068 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-14 17:29:58,068 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-14 17:29:58,068 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-14 17:29:58,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:29:58,068 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 17:29:58,068 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 17:29:58,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:29:58,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:29:58,068 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-14 17:29:58,069 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-14 17:29:58,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:29:58,069 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 17:29:58,069 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 17:29:58,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:29:58,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:29:58,069 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:29:58,069 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:29:58,069 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-14 17:29:58,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-14 17:29:58,070 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2022-04-14 17:29:58,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:29:58,070 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-14 17:29:58,070 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 17:29:58,070 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 17:29:58,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:29:58,075 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-14 17:29:58,098 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-14 17:29:58,288 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:29:58,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-14 17:29:58,360 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-14 17:29:58,360 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-14 17:29:58,360 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-14 17:29:58,360 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2022-04-14 17:29:58,360 INFO L882 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-04-14 17:29:58,360 INFO L882 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-04-14 17:29:58,360 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-04-14 17:29:58,360 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 18 39) the Hoare annotation is: (or (= ~counter~0 |old(~counter~0)|) (not (<= |old(~counter~0)| 0))) [2022-04-14 17:29:58,360 INFO L878 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (or (= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6)) (not (<= |old(~counter~0)| 0))) [2022-04-14 17:29:58,360 INFO L882 garLoopResultBuilder]: For program point L28-1(lines 27 36) no Hoare annotation was computed. [2022-04-14 17:29:58,361 INFO L882 garLoopResultBuilder]: For program point L27-1(lines 27 36) no Hoare annotation was computed. [2022-04-14 17:29:58,361 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 18 39) no Hoare annotation was computed. [2022-04-14 17:29:58,361 INFO L878 garLoopResultBuilder]: At program point L27-3(lines 27 36) the Hoare annotation is: (or (= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6)) (not (<= |old(~counter~0)| 0))) [2022-04-14 17:29:58,361 INFO L878 garLoopResultBuilder]: At program point L27-4(lines 27 36) the Hoare annotation is: (or (= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6)) (not (<= |old(~counter~0)| 0))) [2022-04-14 17:29:58,361 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 18 39) no Hoare annotation was computed. [2022-04-14 17:29:58,361 INFO L882 garLoopResultBuilder]: For program point L37(line 37) no Hoare annotation was computed. [2022-04-14 17:29:58,361 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-14 17:29:58,361 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-14 17:29:58,361 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-14 17:29:58,361 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-14 17:29:58,361 INFO L878 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (<= ~counter~0 0) [2022-04-14 17:29:58,362 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-14 17:29:58,362 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-14 17:29:58,362 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 9 15) the Hoare annotation is: true [2022-04-14 17:29:58,362 INFO L882 garLoopResultBuilder]: For program point L11(lines 11 12) no Hoare annotation was computed. [2022-04-14 17:29:58,362 INFO L882 garLoopResultBuilder]: For program point L10(lines 10 13) no Hoare annotation was computed. [2022-04-14 17:29:58,362 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 9 15) no Hoare annotation was computed. [2022-04-14 17:29:58,362 INFO L882 garLoopResultBuilder]: For program point L10-2(lines 9 15) no Hoare annotation was computed. [2022-04-14 17:29:58,362 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2022-04-14 17:29:58,364 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-04-14 17:29:58,365 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-14 17:29:58,368 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-14 17:29:58,368 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-14 17:29:58,368 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-14 17:29:58,370 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-14 17:29:58,370 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-14 17:29:58,370 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-14 17:29:58,370 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-14 17:29:58,370 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-14 17:29:58,370 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-14 17:29:58,371 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-04-14 17:29:58,371 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-14 17:29:58,371 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-14 17:29:58,371 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-14 17:29:58,371 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-14 17:29:58,371 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-04-14 17:29:58,371 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-14 17:29:58,371 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-04-14 17:29:58,372 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-04-14 17:29:58,372 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-14 17:29:58,372 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-14 17:29:58,372 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2022-04-14 17:29:58,372 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-14 17:29:58,372 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-14 17:29:58,372 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 17:29:58,372 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 17:29:58,372 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-14 17:29:58,372 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-14 17:29:58,372 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-14 17:29:58,372 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-14 17:29:58,372 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-14 17:29:58,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 05:29:58 BoogieIcfgContainer [2022-04-14 17:29:58,379 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-14 17:29:58,380 INFO L158 Benchmark]: Toolchain (without parser) took 19336.82ms. Allocated memory was 173.0MB in the beginning and 207.6MB in the end (delta: 34.6MB). Free memory was 123.1MB in the beginning and 110.4MB in the end (delta: 12.7MB). Peak memory consumption was 46.5MB. Max. memory is 8.0GB. [2022-04-14 17:29:58,381 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 173.0MB. Free memory was 139.7MB in the beginning and 139.6MB in the end (delta: 86.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 17:29:58,381 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.85ms. Allocated memory is still 173.0MB. Free memory was 122.9MB in the beginning and 151.6MB in the end (delta: -28.8MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. [2022-04-14 17:29:58,381 INFO L158 Benchmark]: Boogie Preprocessor took 24.35ms. Allocated memory is still 173.0MB. Free memory was 151.6MB in the beginning and 150.3MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-14 17:29:58,382 INFO L158 Benchmark]: RCFGBuilder took 287.72ms. Allocated memory is still 173.0MB. Free memory was 150.3MB in the beginning and 138.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-14 17:29:58,382 INFO L158 Benchmark]: TraceAbstraction took 18753.61ms. Allocated memory was 173.0MB in the beginning and 207.6MB in the end (delta: 34.6MB). Free memory was 138.0MB in the beginning and 110.4MB in the end (delta: 27.6MB). Peak memory consumption was 62.5MB. Max. memory is 8.0GB. [2022-04-14 17:29:58,383 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.12ms. Allocated memory is still 173.0MB. Free memory was 139.7MB in the beginning and 139.6MB in the end (delta: 86.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 265.85ms. Allocated memory is still 173.0MB. Free memory was 122.9MB in the beginning and 151.6MB in the end (delta: -28.8MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.35ms. Allocated memory is still 173.0MB. Free memory was 151.6MB in the beginning and 150.3MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 287.72ms. Allocated memory is still 173.0MB. Free memory was 150.3MB in the beginning and 138.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 18753.61ms. Allocated memory was 173.0MB in the beginning and 207.6MB in the end (delta: 34.6MB). Free memory was 138.0MB in the beginning and 110.4MB in the end (delta: 27.6MB). Peak memory consumption was 62.5MB. 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: 12]: 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, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.6s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18 mSDsluCounter, 168 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 99 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 53 IncrementalHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 69 mSDtfsCounter, 53 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=3, InterpolantAutomatonStates: 17, 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, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 14 PreInvPairs, 20 NumberOfFragments, 89 HoareAnnotationTreeSize, 14 FomulaSimplifications, 53 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 11 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 14.2s InterpolantComputationTime, 55 NumberOfCodeBlocks, 55 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 290 SizeOfPredicates, 3 NumberOfNonLiveVariables, 234 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 6/8 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: 27]: Loop Invariant Derived loop invariant: 3 * (y * y) + y + y * y * y * 2 == x * 6 || !(\old(counter) <= 0) RESULT: Ultimate proved your program to be correct! [2022-04-14 17:29:58,398 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...