/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/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/ps3-ll_unwindbound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 07:40:09,972 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 07:40:09,974 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 07:40:10,005 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 07:40:10,006 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 07:40:10,007 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 07:40:10,011 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 07:40:10,015 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 07:40:10,016 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 07:40:10,020 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 07:40:10,020 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 07:40:10,021 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 07:40:10,021 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 07:40:10,023 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 07:40:10,023 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 07:40:10,024 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 07:40:10,024 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 07:40:10,025 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 07:40:10,029 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 07:40:10,032 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 07:40:10,032 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 07:40:10,033 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 07:40:10,034 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 07:40:10,034 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 07:40:10,035 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 07:40:10,036 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 07:40:10,037 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 07:40:10,037 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 07:40:10,037 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 07:40:10,038 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 07:40:10,038 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 07:40:10,038 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 07:40:10,039 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 07:40:10,039 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 07:40:10,040 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 07:40:10,040 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 07:40:10,040 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 07:40:10,041 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 07:40:10,041 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 07:40:10,041 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 07:40:10,042 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 07:40:10,045 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 07:40:10,045 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 07:40:10,055 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 07:40:10,055 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 07:40:10,057 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 07:40:10,057 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 07:40:10,057 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 07:40:10,057 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 07:40:10,057 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 07:40:10,058 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 07:40:10,058 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 07:40:10,058 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 07:40:10,058 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 07:40:10,058 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 07:40:10,059 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 07:40:10,059 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 07:40:10,059 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 07:40:10,059 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 07:40:10,059 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 07:40:10,059 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 07:40:10,059 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 07:40:10,059 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 07:40:10,059 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 07:40:10,059 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 07:40:10,060 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 07:40:10,060 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 07:40:10,060 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 07:40:10,060 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-28 07:40:10,281 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 07:40:10,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 07:40:10,300 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 07:40:10,301 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 07:40:10,301 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 07:40:10,302 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps3-ll_unwindbound100.c [2022-04-28 07:40:10,346 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c0dac34d/f7aad42fc004459192fabbb2697c961d/FLAG00b46dbc6 [2022-04-28 07:40:10,713 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 07:40:10,713 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps3-ll_unwindbound100.c [2022-04-28 07:40:10,720 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c0dac34d/f7aad42fc004459192fabbb2697c961d/FLAG00b46dbc6 [2022-04-28 07:40:10,734 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c0dac34d/f7aad42fc004459192fabbb2697c961d [2022-04-28 07:40:10,736 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 07:40:10,737 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 07:40:10,739 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 07:40:10,739 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 07:40:10,742 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 07:40:10,746 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 07:40:10" (1/1) ... [2022-04-28 07:40:10,747 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bc73d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:40:10, skipping insertion in model container [2022-04-28 07:40:10,747 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 07:40:10" (1/1) ... [2022-04-28 07:40:10,751 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 07:40:10,762 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 07:40:10,910 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_unwindbound100.c[458,471] [2022-04-28 07:40:10,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 07:40:10,937 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 07:40:10,945 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_unwindbound100.c[458,471] [2022-04-28 07:40:10,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 07:40:10,963 INFO L208 MainTranslator]: Completed translation [2022-04-28 07:40:10,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:40:10 WrapperNode [2022-04-28 07:40:10,965 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 07:40:10,965 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 07:40:10,965 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 07:40:10,965 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 07:40:10,972 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:40:10" (1/1) ... [2022-04-28 07:40:10,972 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:40:10" (1/1) ... [2022-04-28 07:40:10,978 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:40:10" (1/1) ... [2022-04-28 07:40:10,978 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:40:10" (1/1) ... [2022-04-28 07:40:10,989 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:40:10" (1/1) ... [2022-04-28 07:40:10,993 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:40:10" (1/1) ... [2022-04-28 07:40:10,994 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:40:10" (1/1) ... [2022-04-28 07:40:10,998 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 07:40:10,999 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 07:40:10,999 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 07:40:10,999 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 07:40:11,000 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:40:10" (1/1) ... [2022-04-28 07:40:11,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 07:40:11,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:40:11,020 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-28 07:40:11,035 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-28 07:40:11,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 07:40:11,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 07:40:11,056 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 07:40:11,056 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 07:40:11,056 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 07:40:11,057 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 07:40:11,057 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 07:40:11,057 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 07:40:11,057 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 07:40:11,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 07:40:11,057 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-28 07:40:11,058 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 07:40:11,058 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 07:40:11,058 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 07:40:11,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 07:40:11,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 07:40:11,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 07:40:11,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 07:40:11,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 07:40:11,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 07:40:11,104 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 07:40:11,106 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 07:40:11,237 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 07:40:11,257 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 07:40:11,257 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 07:40:11,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 07:40:11 BoogieIcfgContainer [2022-04-28 07:40:11,258 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 07:40:11,260 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 07:40:11,260 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 07:40:11,262 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 07:40:11,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 07:40:10" (1/3) ... [2022-04-28 07:40:11,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b22843f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 07:40:11, skipping insertion in model container [2022-04-28 07:40:11,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:40:10" (2/3) ... [2022-04-28 07:40:11,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b22843f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 07:40:11, skipping insertion in model container [2022-04-28 07:40:11,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 07:40:11" (3/3) ... [2022-04-28 07:40:11,263 INFO L111 eAbstractionObserver]: Analyzing ICFG ps3-ll_unwindbound100.c [2022-04-28 07:40:11,285 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 07:40:11,285 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 07:40:11,315 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 07:40:11,319 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@a7ddf6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@478b322c [2022-04-28 07:40:11,319 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 07:40:11,324 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-28 07:40:11,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 07:40:11,328 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:40:11,328 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:40:11,328 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:40:11,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:40:11,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1665267581, now seen corresponding path program 1 times [2022-04-28 07:40:11,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:40:11,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1874280853] [2022-04-28 07:40:11,343 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:40:11,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1665267581, now seen corresponding path program 2 times [2022-04-28 07:40:11,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:40:11,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287473484] [2022-04-28 07:40:11,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:40:11,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:40:11,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:40:11,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 07:40:11,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:40:11,509 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-28 07:40:11,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-28 07:40:11,509 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #54#return; {25#true} is VALID [2022-04-28 07:40:11,511 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-28 07:40:11,511 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-28 07:40:11,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-28 07:40:11,512 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #54#return; {25#true} is VALID [2022-04-28 07:40:11,512 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret6 := main(); {25#true} is VALID [2022-04-28 07:40:11,512 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-28 07:40:11,513 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !true; {26#false} is VALID [2022-04-28 07:40:11,513 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-28 07:40:11,513 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-04-28 07:40:11,514 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2022-04-28 07:40:11,514 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-28 07:40:11,514 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-28 07:40:11,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:40:11,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287473484] [2022-04-28 07:40:11,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287473484] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:40:11,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:40:11,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 07:40:11,517 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:40:11,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1874280853] [2022-04-28 07:40:11,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1874280853] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:40:11,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:40:11,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 07:40:11,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123929138] [2022-04-28 07:40:11,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:40:11,522 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-28 07:40:11,523 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:40:11,525 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-28 07:40:11,541 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-28 07:40:11,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 07:40:11,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:40:11,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 07:40:11,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 07:40:11,560 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-28 07:40:11,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:40:11,661 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2022-04-28 07:40:11,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 07:40:11,661 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-28 07:40:11,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:40:11,662 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-28 07:40:11,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-04-28 07:40:11,670 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-28 07:40:11,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-04-28 07:40:11,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 50 transitions. [2022-04-28 07:40:11,741 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-28 07:40:11,746 INFO L225 Difference]: With dead ends: 39 [2022-04-28 07:40:11,746 INFO L226 Difference]: Without dead ends: 18 [2022-04-28 07:40:11,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 07:40:11,750 INFO L413 NwaCegarLoop]: 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-28 07:40:11,750 INFO L414 NwaCegarLoop]: 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-28 07:40:11,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-28 07:40:11,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-04-28 07:40:11,779 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:40:11,779 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-28 07:40:11,780 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-28 07:40:11,780 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-28 07:40:11,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:40:11,782 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-28 07:40:11,782 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-28 07:40:11,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:40:11,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:40:11,784 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-28 07:40:11,784 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-28 07:40:11,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:40:11,788 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-28 07:40:11,788 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-28 07:40:11,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:40:11,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:40:11,789 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:40:11,789 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:40:11,789 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-28 07:40:11,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-28 07:40:11,791 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-04-28 07:40:11,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:40:11,791 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-28 07:40:11,792 INFO L496 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-28 07:40:11,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-28 07:40:11,825 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-28 07:40:11,825 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 07:40:11,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 07:40:11,830 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:40:11,830 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:40:11,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 07:40:11,831 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:40:11,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:40:11,831 INFO L85 PathProgramCache]: Analyzing trace with hash -318583316, now seen corresponding path program 1 times [2022-04-28 07:40:11,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:40:11,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [157687040] [2022-04-28 07:40:11,834 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:40:11,834 INFO L85 PathProgramCache]: Analyzing trace with hash -318583316, now seen corresponding path program 2 times [2022-04-28 07:40:11,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:40:11,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901953097] [2022-04-28 07:40:11,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:40:11,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:40:11,854 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:40:11,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1351457245] [2022-04-28 07:40:11,854 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:40:11,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:40:11,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:40:11,857 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-28 07:40:11,858 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-28 07:40:11,908 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 07:40:11,908 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:40:11,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 07:40:11,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:40:11,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:40:12,060 INFO L272 TraceCheckUtils]: 0: Hoare triple {181#true} call ULTIMATE.init(); {181#true} is VALID [2022-04-28 07:40:12,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {181#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; {189#(<= ~counter~0 0)} is VALID [2022-04-28 07:40:12,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {189#(<= ~counter~0 0)} assume true; {189#(<= ~counter~0 0)} is VALID [2022-04-28 07:40:12,062 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {189#(<= ~counter~0 0)} {181#true} #54#return; {189#(<= ~counter~0 0)} is VALID [2022-04-28 07:40:12,067 INFO L272 TraceCheckUtils]: 4: Hoare triple {189#(<= ~counter~0 0)} call #t~ret6 := main(); {189#(<= ~counter~0 0)} is VALID [2022-04-28 07:40:12,068 INFO L290 TraceCheckUtils]: 5: Hoare triple {189#(<= ~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; {189#(<= ~counter~0 0)} is VALID [2022-04-28 07:40:12,069 INFO L290 TraceCheckUtils]: 6: Hoare triple {189#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {205#(<= |main_#t~post5| 0)} is VALID [2022-04-28 07:40:12,070 INFO L290 TraceCheckUtils]: 7: Hoare triple {205#(<= |main_#t~post5| 0)} assume !(#t~post5 < 100);havoc #t~post5; {182#false} is VALID [2022-04-28 07:40:12,070 INFO L272 TraceCheckUtils]: 8: Hoare triple {182#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)); {182#false} is VALID [2022-04-28 07:40:12,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {182#false} ~cond := #in~cond; {182#false} is VALID [2022-04-28 07:40:12,070 INFO L290 TraceCheckUtils]: 10: Hoare triple {182#false} assume 0 == ~cond; {182#false} is VALID [2022-04-28 07:40:12,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {182#false} assume !false; {182#false} is VALID [2022-04-28 07:40:12,071 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-28 07:40:12,071 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 07:40:12,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:40:12,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901953097] [2022-04-28 07:40:12,072 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:40:12,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351457245] [2022-04-28 07:40:12,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351457245] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:40:12,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:40:12,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 07:40:12,073 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:40:12,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [157687040] [2022-04-28 07:40:12,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [157687040] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:40:12,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:40:12,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 07:40:12,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67378998] [2022-04-28 07:40:12,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:40:12,075 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-28 07:40:12,075 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:40:12,075 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-28 07:40:12,083 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-28 07:40:12,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 07:40:12,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:40:12,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 07:40:12,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 07:40:12,084 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-28 07:40:12,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:40:12,125 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-28 07:40:12,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 07:40:12,126 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-28 07:40:12,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:40:12,126 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-28 07:40:12,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-28 07:40:12,127 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-28 07:40:12,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-28 07:40:12,128 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 28 transitions. [2022-04-28 07:40:12,147 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-28 07:40:12,148 INFO L225 Difference]: With dead ends: 26 [2022-04-28 07:40:12,149 INFO L226 Difference]: Without dead ends: 19 [2022-04-28 07:40:12,149 INFO L412 NwaCegarLoop]: 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-28 07:40:12,150 INFO L413 NwaCegarLoop]: 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-28 07:40:12,150 INFO L414 NwaCegarLoop]: 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-28 07:40:12,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-28 07:40:12,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-28 07:40:12,160 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:40:12,160 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-28 07:40:12,161 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-28 07:40:12,161 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-28 07:40:12,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:40:12,163 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-28 07:40:12,163 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-28 07:40:12,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:40:12,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:40:12,165 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-28 07:40:12,165 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-28 07:40:12,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:40:12,167 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-28 07:40:12,167 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-28 07:40:12,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:40:12,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:40:12,168 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:40:12,168 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:40:12,168 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-28 07:40:12,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-28 07:40:12,170 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2022-04-28 07:40:12,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:40:12,170 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-28 07:40:12,170 INFO L496 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-28 07:40:12,171 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 21 transitions. [2022-04-28 07:40:12,192 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:40:12,192 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-28 07:40:12,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 07:40:12,192 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:40:12,192 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:40:12,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 07:40:12,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:40:12,408 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:40:12,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:40:12,408 INFO L85 PathProgramCache]: Analyzing trace with hash -316795856, now seen corresponding path program 1 times [2022-04-28 07:40:12,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:40:12,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [109421453] [2022-04-28 07:40:12,409 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:40:12,409 INFO L85 PathProgramCache]: Analyzing trace with hash -316795856, now seen corresponding path program 2 times [2022-04-28 07:40:12,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:40:12,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512836187] [2022-04-28 07:40:12,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:40:12,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:40:12,420 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:40:12,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1969489039] [2022-04-28 07:40:12,420 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:40:12,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:40:12,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:40:12,421 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-28 07:40:12,422 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-28 07:40:12,455 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 07:40:12,456 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:40:12,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 07:40:12,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:40:12,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:40:12,545 INFO L272 TraceCheckUtils]: 0: Hoare triple {348#true} call ULTIMATE.init(); {348#true} is VALID [2022-04-28 07:40:12,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {348#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; {348#true} is VALID [2022-04-28 07:40:12,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {348#true} assume true; {348#true} is VALID [2022-04-28 07:40:12,545 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {348#true} {348#true} #54#return; {348#true} is VALID [2022-04-28 07:40:12,546 INFO L272 TraceCheckUtils]: 4: Hoare triple {348#true} call #t~ret6 := main(); {348#true} is VALID [2022-04-28 07:40:12,546 INFO L290 TraceCheckUtils]: 5: Hoare triple {348#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; {368#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:40:12,547 INFO L290 TraceCheckUtils]: 6: Hoare triple {368#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {368#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:40:12,547 INFO L290 TraceCheckUtils]: 7: Hoare triple {368#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {368#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:40:12,548 INFO L272 TraceCheckUtils]: 8: Hoare triple {368#(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)); {378#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:40:12,549 INFO L290 TraceCheckUtils]: 9: Hoare triple {378#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {382#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:40:12,549 INFO L290 TraceCheckUtils]: 10: Hoare triple {382#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {349#false} is VALID [2022-04-28 07:40:12,549 INFO L290 TraceCheckUtils]: 11: Hoare triple {349#false} assume !false; {349#false} is VALID [2022-04-28 07:40:12,549 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-28 07:40:12,549 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 07:40:12,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:40:12,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512836187] [2022-04-28 07:40:12,550 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:40:12,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969489039] [2022-04-28 07:40:12,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969489039] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:40:12,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:40:12,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:40:12,550 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:40:12,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [109421453] [2022-04-28 07:40:12,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [109421453] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:40:12,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:40:12,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:40:12,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223984721] [2022-04-28 07:40:12,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:40:12,551 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-28 07:40:12,552 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:40:12,552 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-28 07:40:12,560 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-28 07:40:12,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 07:40:12,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:40:12,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 07:40:12,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 07:40:12,561 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-28 07:40:12,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:40:12,638 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-04-28 07:40:12,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 07:40:12,638 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-28 07:40:12,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:40:12,638 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-28 07:40:12,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-28 07:40:12,639 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-28 07:40:12,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-28 07:40:12,640 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2022-04-28 07:40:12,664 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-28 07:40:12,665 INFO L225 Difference]: With dead ends: 28 [2022-04-28 07:40:12,665 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 07:40:12,665 INFO L412 NwaCegarLoop]: 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-28 07:40:12,666 INFO L413 NwaCegarLoop]: 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-28 07:40:12,666 INFO L414 NwaCegarLoop]: 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-28 07:40:12,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 07:40:12,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-28 07:40:12,677 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:40:12,677 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-28 07:40:12,677 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-28 07:40:12,677 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-28 07:40:12,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:40:12,678 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-28 07:40:12,678 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-28 07:40:12,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:40:12,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:40:12,679 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-28 07:40:12,679 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-28 07:40:12,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:40:12,680 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-28 07:40:12,680 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-28 07:40:12,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:40:12,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:40:12,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:40:12,681 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:40:12,681 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-28 07:40:12,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-28 07:40:12,682 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 12 [2022-04-28 07:40:12,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:40:12,682 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-28 07:40:12,682 INFO L496 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-28 07:40:12,682 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 27 transitions. [2022-04-28 07:40:12,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:40:12,700 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-28 07:40:12,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 07:40:12,701 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:40:12,701 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:40:12,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 07:40:12,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-28 07:40:12,919 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:40:12,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:40:12,919 INFO L85 PathProgramCache]: Analyzing trace with hash -2089867248, now seen corresponding path program 1 times [2022-04-28 07:40:12,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:40:12,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1514111290] [2022-04-28 07:40:13,061 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:40:13,062 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:40:13,062 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:40:13,062 INFO L85 PathProgramCache]: Analyzing trace with hash -2089867248, now seen corresponding path program 2 times [2022-04-28 07:40:13,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:40:13,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362936746] [2022-04-28 07:40:13,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:40:13,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:40:13,089 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:40:13,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1909718326] [2022-04-28 07:40:13,089 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:40:13,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:40:13,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:40:13,101 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-28 07:40:13,129 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-28 07:40:13,149 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:40:13,149 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:40:13,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 07:40:13,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:40:13,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:40:13,248 INFO L272 TraceCheckUtils]: 0: Hoare triple {546#true} call ULTIMATE.init(); {546#true} is VALID [2022-04-28 07:40:13,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {546#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; {554#(<= ~counter~0 0)} is VALID [2022-04-28 07:40:13,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {554#(<= ~counter~0 0)} assume true; {554#(<= ~counter~0 0)} is VALID [2022-04-28 07:40:13,250 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554#(<= ~counter~0 0)} {546#true} #54#return; {554#(<= ~counter~0 0)} is VALID [2022-04-28 07:40:13,250 INFO L272 TraceCheckUtils]: 4: Hoare triple {554#(<= ~counter~0 0)} call #t~ret6 := main(); {554#(<= ~counter~0 0)} is VALID [2022-04-28 07:40:13,250 INFO L290 TraceCheckUtils]: 5: Hoare triple {554#(<= ~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; {554#(<= ~counter~0 0)} is VALID [2022-04-28 07:40:13,251 INFO L290 TraceCheckUtils]: 6: Hoare triple {554#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {570#(<= ~counter~0 1)} is VALID [2022-04-28 07:40:13,251 INFO L290 TraceCheckUtils]: 7: Hoare triple {570#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {570#(<= ~counter~0 1)} is VALID [2022-04-28 07:40:13,252 INFO L272 TraceCheckUtils]: 8: Hoare triple {570#(<= ~counter~0 1)} 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)); {570#(<= ~counter~0 1)} is VALID [2022-04-28 07:40:13,252 INFO L290 TraceCheckUtils]: 9: Hoare triple {570#(<= ~counter~0 1)} ~cond := #in~cond; {570#(<= ~counter~0 1)} is VALID [2022-04-28 07:40:13,252 INFO L290 TraceCheckUtils]: 10: Hoare triple {570#(<= ~counter~0 1)} assume !(0 == ~cond); {570#(<= ~counter~0 1)} is VALID [2022-04-28 07:40:13,253 INFO L290 TraceCheckUtils]: 11: Hoare triple {570#(<= ~counter~0 1)} assume true; {570#(<= ~counter~0 1)} is VALID [2022-04-28 07:40:13,253 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {570#(<= ~counter~0 1)} {570#(<= ~counter~0 1)} #50#return; {570#(<= ~counter~0 1)} is VALID [2022-04-28 07:40:13,254 INFO L290 TraceCheckUtils]: 13: Hoare triple {570#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 + ~x~0; {570#(<= ~counter~0 1)} is VALID [2022-04-28 07:40:13,254 INFO L290 TraceCheckUtils]: 14: Hoare triple {570#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {595#(<= |main_#t~post5| 1)} is VALID [2022-04-28 07:40:13,254 INFO L290 TraceCheckUtils]: 15: Hoare triple {595#(<= |main_#t~post5| 1)} assume !(#t~post5 < 100);havoc #t~post5; {547#false} is VALID [2022-04-28 07:40:13,254 INFO L272 TraceCheckUtils]: 16: Hoare triple {547#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)); {547#false} is VALID [2022-04-28 07:40:13,255 INFO L290 TraceCheckUtils]: 17: Hoare triple {547#false} ~cond := #in~cond; {547#false} is VALID [2022-04-28 07:40:13,255 INFO L290 TraceCheckUtils]: 18: Hoare triple {547#false} assume 0 == ~cond; {547#false} is VALID [2022-04-28 07:40:13,255 INFO L290 TraceCheckUtils]: 19: Hoare triple {547#false} assume !false; {547#false} is VALID [2022-04-28 07:40:13,255 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-28 07:40:13,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:40:13,372 INFO L290 TraceCheckUtils]: 19: Hoare triple {547#false} assume !false; {547#false} is VALID [2022-04-28 07:40:13,372 INFO L290 TraceCheckUtils]: 18: Hoare triple {547#false} assume 0 == ~cond; {547#false} is VALID [2022-04-28 07:40:13,372 INFO L290 TraceCheckUtils]: 17: Hoare triple {547#false} ~cond := #in~cond; {547#false} is VALID [2022-04-28 07:40:13,372 INFO L272 TraceCheckUtils]: 16: Hoare triple {547#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)); {547#false} is VALID [2022-04-28 07:40:13,373 INFO L290 TraceCheckUtils]: 15: Hoare triple {623#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {547#false} is VALID [2022-04-28 07:40:13,373 INFO L290 TraceCheckUtils]: 14: Hoare triple {627#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {623#(< |main_#t~post5| 100)} is VALID [2022-04-28 07:40:13,373 INFO L290 TraceCheckUtils]: 13: Hoare triple {627#(< ~counter~0 100)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 + ~x~0; {627#(< ~counter~0 100)} is VALID [2022-04-28 07:40:13,374 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {546#true} {627#(< ~counter~0 100)} #50#return; {627#(< ~counter~0 100)} is VALID [2022-04-28 07:40:13,374 INFO L290 TraceCheckUtils]: 11: Hoare triple {546#true} assume true; {546#true} is VALID [2022-04-28 07:40:13,374 INFO L290 TraceCheckUtils]: 10: Hoare triple {546#true} assume !(0 == ~cond); {546#true} is VALID [2022-04-28 07:40:13,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {546#true} ~cond := #in~cond; {546#true} is VALID [2022-04-28 07:40:13,374 INFO L272 TraceCheckUtils]: 8: Hoare triple {627#(< ~counter~0 100)} 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)); {546#true} is VALID [2022-04-28 07:40:13,375 INFO L290 TraceCheckUtils]: 7: Hoare triple {627#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {627#(< ~counter~0 100)} is VALID [2022-04-28 07:40:13,376 INFO L290 TraceCheckUtils]: 6: Hoare triple {652#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {627#(< ~counter~0 100)} is VALID [2022-04-28 07:40:13,376 INFO L290 TraceCheckUtils]: 5: Hoare triple {652#(< ~counter~0 99)} 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; {652#(< ~counter~0 99)} is VALID [2022-04-28 07:40:13,376 INFO L272 TraceCheckUtils]: 4: Hoare triple {652#(< ~counter~0 99)} call #t~ret6 := main(); {652#(< ~counter~0 99)} is VALID [2022-04-28 07:40:13,379 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {652#(< ~counter~0 99)} {546#true} #54#return; {652#(< ~counter~0 99)} is VALID [2022-04-28 07:40:13,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {652#(< ~counter~0 99)} assume true; {652#(< ~counter~0 99)} is VALID [2022-04-28 07:40:13,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {546#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; {652#(< ~counter~0 99)} is VALID [2022-04-28 07:40:13,380 INFO L272 TraceCheckUtils]: 0: Hoare triple {546#true} call ULTIMATE.init(); {546#true} is VALID [2022-04-28 07:40:13,381 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-28 07:40:13,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:40:13,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362936746] [2022-04-28 07:40:13,381 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:40:13,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909718326] [2022-04-28 07:40:13,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909718326] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:40:13,382 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:40:13,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-28 07:40:13,382 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:40:13,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1514111290] [2022-04-28 07:40:13,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1514111290] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:40:13,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:40:13,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:40:13,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38761298] [2022-04-28 07:40:13,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:40:13,383 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-28 07:40:13,384 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:40:13,384 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 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-28 07:40:13,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:40:13,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 07:40:13,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:40:13,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 07:40:13,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-28 07:40:13,403 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 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-28 07:40:13,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:40:13,462 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-28 07:40:13,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 07:40:13,463 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-28 07:40:13,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:40:13,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 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-28 07:40:13,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-04-28 07:40:13,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 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-28 07:40:13,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-04-28 07:40:13,466 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 36 transitions. [2022-04-28 07:40:13,492 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:40:13,495 INFO L225 Difference]: With dead ends: 34 [2022-04-28 07:40:13,495 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 07:40:13,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-28 07:40:13,497 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 51 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-28 07:40:13,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 51 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:40:13,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 07:40:13,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-28 07:40:13,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:40:13,513 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 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-28 07:40:13,514 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 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-28 07:40:13,514 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 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-28 07:40:13,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:40:13,515 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-28 07:40:13,515 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-28 07:40:13,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:40:13,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:40:13,516 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 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 27 states. [2022-04-28 07:40:13,516 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 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 27 states. [2022-04-28 07:40:13,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:40:13,517 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-28 07:40:13,517 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-28 07:40:13,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:40:13,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:40:13,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:40:13,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:40:13,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 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-28 07:40:13,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-04-28 07:40:13,518 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 20 [2022-04-28 07:40:13,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:40:13,518 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-04-28 07:40:13,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 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-28 07:40:13,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 29 transitions. [2022-04-28 07:40:13,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:40:13,537 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-28 07:40:13,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 07:40:13,538 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:40:13,538 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:40:13,557 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-28 07:40:13,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:40:13,758 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:40:13,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:40:13,758 INFO L85 PathProgramCache]: Analyzing trace with hash -2088079788, now seen corresponding path program 1 times [2022-04-28 07:40:13,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:40:13,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [888442350] [2022-04-28 07:40:13,856 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:40:13,856 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:40:13,856 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:40:13,856 INFO L85 PathProgramCache]: Analyzing trace with hash -2088079788, now seen corresponding path program 2 times [2022-04-28 07:40:13,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:40:13,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305926366] [2022-04-28 07:40:13,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:40:13,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:40:13,864 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:40:13,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1000936249] [2022-04-28 07:40:13,864 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:40:13,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:40:13,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:40:13,865 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:40:13,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 07:40:13,896 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:40:13,896 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:40:13,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 07:40:13,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:40:13,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:40:14,003 INFO L272 TraceCheckUtils]: 0: Hoare triple {851#true} call ULTIMATE.init(); {851#true} is VALID [2022-04-28 07:40:14,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {851#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; {851#true} is VALID [2022-04-28 07:40:14,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {851#true} assume true; {851#true} is VALID [2022-04-28 07:40:14,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {851#true} {851#true} #54#return; {851#true} is VALID [2022-04-28 07:40:14,004 INFO L272 TraceCheckUtils]: 4: Hoare triple {851#true} call #t~ret6 := main(); {851#true} is VALID [2022-04-28 07:40:14,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {851#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; {871#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:40:14,005 INFO L290 TraceCheckUtils]: 6: Hoare triple {871#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {871#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:40:14,005 INFO L290 TraceCheckUtils]: 7: Hoare triple {871#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {871#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:40:14,005 INFO L272 TraceCheckUtils]: 8: Hoare triple {871#(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)); {851#true} is VALID [2022-04-28 07:40:14,005 INFO L290 TraceCheckUtils]: 9: Hoare triple {851#true} ~cond := #in~cond; {851#true} is VALID [2022-04-28 07:40:14,005 INFO L290 TraceCheckUtils]: 10: Hoare triple {851#true} assume !(0 == ~cond); {851#true} is VALID [2022-04-28 07:40:14,006 INFO L290 TraceCheckUtils]: 11: Hoare triple {851#true} assume true; {851#true} is VALID [2022-04-28 07:40:14,006 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {851#true} {871#(and (= main_~x~0 0) (= main_~y~0 0))} #50#return; {871#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:40:14,006 INFO L290 TraceCheckUtils]: 13: Hoare triple {871#(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; {896#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0)) 0))} is VALID [2022-04-28 07:40:14,007 INFO L290 TraceCheckUtils]: 14: Hoare triple {896#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {896#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0)) 0))} is VALID [2022-04-28 07:40:14,007 INFO L290 TraceCheckUtils]: 15: Hoare triple {896#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0)) 0))} assume !!(#t~post5 < 100);havoc #t~post5; {896#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0)) 0))} is VALID [2022-04-28 07:40:14,008 INFO L272 TraceCheckUtils]: 16: Hoare triple {896#(and (= (+ (- 1) main_~y~0) 0) (= (+ 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)); {906#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:40:14,008 INFO L290 TraceCheckUtils]: 17: Hoare triple {906#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {910#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:40:14,009 INFO L290 TraceCheckUtils]: 18: Hoare triple {910#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {852#false} is VALID [2022-04-28 07:40:14,009 INFO L290 TraceCheckUtils]: 19: Hoare triple {852#false} assume !false; {852#false} is VALID [2022-04-28 07:40:14,009 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 07:40:14,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:40:14,106 INFO L290 TraceCheckUtils]: 19: Hoare triple {852#false} assume !false; {852#false} is VALID [2022-04-28 07:40:14,106 INFO L290 TraceCheckUtils]: 18: Hoare triple {910#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {852#false} is VALID [2022-04-28 07:40:14,107 INFO L290 TraceCheckUtils]: 17: Hoare triple {906#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {910#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:40:14,107 INFO L272 TraceCheckUtils]: 16: Hoare triple {926#(= (+ (* 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)); {906#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:40:14,109 INFO L290 TraceCheckUtils]: 15: Hoare triple {926#(= (+ (* 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 < 100);havoc #t~post5; {926#(= (+ (* 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-28 07:40:14,110 INFO L290 TraceCheckUtils]: 14: Hoare triple {926#(= (+ (* 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; {926#(= (+ (* 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-28 07:40:14,125 INFO L290 TraceCheckUtils]: 13: Hoare triple {926#(= (+ (* 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; {926#(= (+ (* 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-28 07:40:14,126 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {851#true} {926#(= (+ (* 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; {926#(= (+ (* 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-28 07:40:14,126 INFO L290 TraceCheckUtils]: 11: Hoare triple {851#true} assume true; {851#true} is VALID [2022-04-28 07:40:14,126 INFO L290 TraceCheckUtils]: 10: Hoare triple {851#true} assume !(0 == ~cond); {851#true} is VALID [2022-04-28 07:40:14,126 INFO L290 TraceCheckUtils]: 9: Hoare triple {851#true} ~cond := #in~cond; {851#true} is VALID [2022-04-28 07:40:14,126 INFO L272 TraceCheckUtils]: 8: Hoare triple {926#(= (+ (* 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)); {851#true} is VALID [2022-04-28 07:40:14,127 INFO L290 TraceCheckUtils]: 7: Hoare triple {926#(= (+ (* 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 < 100);havoc #t~post5; {926#(= (+ (* 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-28 07:40:14,127 INFO L290 TraceCheckUtils]: 6: Hoare triple {926#(= (+ (* 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; {926#(= (+ (* 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-28 07:40:14,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {851#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; {926#(= (+ (* 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-28 07:40:14,128 INFO L272 TraceCheckUtils]: 4: Hoare triple {851#true} call #t~ret6 := main(); {851#true} is VALID [2022-04-28 07:40:14,128 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {851#true} {851#true} #54#return; {851#true} is VALID [2022-04-28 07:40:14,129 INFO L290 TraceCheckUtils]: 2: Hoare triple {851#true} assume true; {851#true} is VALID [2022-04-28 07:40:14,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {851#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; {851#true} is VALID [2022-04-28 07:40:14,129 INFO L272 TraceCheckUtils]: 0: Hoare triple {851#true} call ULTIMATE.init(); {851#true} is VALID [2022-04-28 07:40:14,129 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 07:40:14,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:40:14,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305926366] [2022-04-28 07:40:14,129 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:40:14,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000936249] [2022-04-28 07:40:14,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000936249] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 07:40:14,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:40:14,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-28 07:40:14,130 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:40:14,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [888442350] [2022-04-28 07:40:14,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [888442350] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:40:14,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:40:14,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:40:14,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137240198] [2022-04-28 07:40:14,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:40:14,131 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-28 07:40:14,131 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:40:14,131 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-28 07:40:14,375 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:40:14,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 07:40:14,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:40:14,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 07:40:14,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 07:40:14,376 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-28 07:40:14,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:40:14,467 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-28 07:40:14,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 07:40:14,467 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-28 07:40:14,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:40:14,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-28 07:40:14,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-04-28 07:40:14,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-28 07:40:14,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-04-28 07:40:14,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 19 transitions. [2022-04-28 07:40:16,525 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-28 07:40:16,526 INFO L225 Difference]: With dead ends: 27 [2022-04-28 07:40:16,526 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 07:40:16,526 INFO L412 NwaCegarLoop]: 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-28 07:40:16,526 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 7 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 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-28 07:40:16,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 39 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:40:16,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 07:40:16,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 07:40:16,527 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:40:16,527 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-28 07:40:16,527 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-28 07:40:16,527 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-28 07:40:16,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:40:16,528 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 07:40:16,528 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 07:40:16,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:40:16,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:40:16,528 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-28 07:40:16,528 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-28 07:40:16,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:40:16,528 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 07:40:16,528 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 07:40:16,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:40:16,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:40:16,528 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:40:16,528 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:40:16,528 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-28 07:40:16,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 07:40:16,529 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2022-04-28 07:40:16,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:40:16,529 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 07:40:16,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-28 07:40:16,529 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 07:40:16,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:40:16,529 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 07:40:16,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:40:16,531 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 07:40:16,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 07:40:16,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:40:16,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 07:40:16,862 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-28 07:40:16,863 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-28 07:40:16,863 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-28 07:40:16,863 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2022-04-28 07:40:16,863 INFO L899 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-04-28 07:40:16,863 INFO L899 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-04-28 07:40:16,863 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-04-28 07:40:16,863 INFO L895 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-28 07:40:16,863 INFO L895 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-28 07:40:16,863 INFO L895 garLoopResultBuilder]: At program point L28-1(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-28 07:40:16,863 INFO L895 garLoopResultBuilder]: At program point L27-1(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-28 07:40:16,864 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 18 39) the Hoare annotation is: true [2022-04-28 07:40:16,864 INFO L895 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-28 07:40:16,864 INFO L895 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-28 07:40:16,864 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 18 39) the Hoare annotation is: true [2022-04-28 07:40:16,864 INFO L902 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: true [2022-04-28 07:40:16,864 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (<= ~counter~0 0) [2022-04-28 07:40:16,864 INFO L895 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-28 07:40:16,864 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (<= ~counter~0 0) [2022-04-28 07:40:16,864 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 07:40:16,864 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (<= ~counter~0 0) [2022-04-28 07:40:16,864 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 07:40:16,864 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 07:40:16,864 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 9 15) the Hoare annotation is: true [2022-04-28 07:40:16,864 INFO L895 garLoopResultBuilder]: At program point L11(lines 11 12) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 07:40:16,864 INFO L895 garLoopResultBuilder]: At program point L10(lines 10 13) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-28 07:40:16,864 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 9 15) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-28 07:40:16,865 INFO L895 garLoopResultBuilder]: At program point L10-2(lines 9 15) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-28 07:40:16,865 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 07:40:16,867 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2] [2022-04-28 07:40:16,868 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 07:40:16,870 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 07:40:16,874 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 07:40:16,875 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 07:40:16,876 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-28 07:40:16,876 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-28 07:40:16,879 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-04-28 07:40:18,884 INFO L163 areAnnotationChecker]: CFG has 26 edges. 25 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 07:40:18,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 07:40:18 BoogieIcfgContainer [2022-04-28 07:40:18,890 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 07:40:18,891 INFO L158 Benchmark]: Toolchain (without parser) took 8154.67ms. Allocated memory was 200.3MB in the beginning and 248.5MB in the end (delta: 48.2MB). Free memory was 147.7MB in the beginning and 170.7MB in the end (delta: -23.0MB). Peak memory consumption was 26.0MB. Max. memory is 8.0GB. [2022-04-28 07:40:18,892 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 200.3MB. Free memory was 163.9MB in the beginning and 163.8MB in the end (delta: 75.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 07:40:18,892 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.84ms. Allocated memory is still 200.3MB. Free memory was 147.5MB in the beginning and 172.6MB in the end (delta: -25.1MB). Peak memory consumption was 11.0MB. Max. memory is 8.0GB. [2022-04-28 07:40:18,892 INFO L158 Benchmark]: Boogie Preprocessor took 33.40ms. Allocated memory is still 200.3MB. Free memory was 172.6MB in the beginning and 171.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 07:40:18,892 INFO L158 Benchmark]: RCFGBuilder took 259.33ms. Allocated memory is still 200.3MB. Free memory was 171.1MB in the beginning and 160.8MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 07:40:18,892 INFO L158 Benchmark]: TraceAbstraction took 7631.00ms. Allocated memory was 200.3MB in the beginning and 248.5MB in the end (delta: 48.2MB). Free memory was 160.3MB in the beginning and 170.7MB in the end (delta: -10.4MB). Peak memory consumption was 39.1MB. Max. memory is 8.0GB. [2022-04-28 07:40:18,893 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 200.3MB. Free memory was 163.9MB in the beginning and 163.8MB in the end (delta: 75.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 225.84ms. Allocated memory is still 200.3MB. Free memory was 147.5MB in the beginning and 172.6MB in the end (delta: -25.1MB). Peak memory consumption was 11.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.40ms. Allocated memory is still 200.3MB. Free memory was 172.6MB in the beginning and 171.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 259.33ms. Allocated memory is still 200.3MB. Free memory was 171.1MB in the beginning and 160.8MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 7631.00ms. Allocated memory was 200.3MB in the beginning and 248.5MB in the end (delta: 48.2MB). Free memory was 160.3MB in the beginning and 170.7MB in the end (delta: -10.4MB). Peak memory consumption was 39.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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: 5.6s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21 mSDsluCounter, 219 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 132 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 64 IncrementalHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 87 mSDtfsCounter, 64 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=4, InterpolantAutomatonStates: 23, 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, 5 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 64 PreInvPairs, 97 NumberOfFragments, 176 HoareAnnotationTreeSize, 64 FomulaSimplifications, 160 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 22 FomulaSimplificationsInter, 118 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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) - ProcedureContractResult [Line: 18]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 9]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: !(1 <= \old(cond)) || 1 <= cond RESULT: Ultimate proved your program to be correct! [2022-04-28 07:40:18,906 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...