/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/cohencu-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 04:12:33,567 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 04:12:33,568 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 04:12:33,618 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 04:12:33,618 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 04:12:33,619 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 04:12:33,636 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 04:12:33,637 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 04:12:33,638 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 04:12:33,638 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 04:12:33,639 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 04:12:33,639 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 04:12:33,640 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 04:12:33,640 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 04:12:33,641 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 04:12:33,641 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 04:12:33,642 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 04:12:33,642 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 04:12:33,643 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 04:12:33,644 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 04:12:33,645 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 04:12:33,646 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 04:12:33,646 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 04:12:33,647 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 04:12:33,647 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 04:12:33,649 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 04:12:33,649 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 04:12:33,649 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 04:12:33,649 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 04:12:33,650 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 04:12:33,650 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 04:12:33,650 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 04:12:33,651 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 04:12:33,651 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 04:12:33,652 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 04:12:33,652 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 04:12:33,652 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 04:12:33,653 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 04:12:33,653 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 04:12:33,653 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 04:12:33,653 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 04:12:33,654 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 04:12:33,654 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 04:12:33,660 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 04:12:33,660 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 04:12:33,661 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 04:12:33,661 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 04:12:33,661 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 04:12:33,661 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 04:12:33,661 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 04:12:33,661 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 04:12:33,662 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 04:12:33,662 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 04:12:33,662 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 04:12:33,662 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 04:12:33,662 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 04:12:33,662 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 04:12:33,662 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 04:12:33,662 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 04:12:33,662 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 04:12:33,663 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 04:12:33,663 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:12:33,663 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 04:12:33,663 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 04:12:33,663 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 04:12:33,663 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 04:12:33,663 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 04:12:33,663 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 04:12:33,664 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 04:12:33,836 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 04:12:33,860 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 04:12:33,861 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 04:12:33,862 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 04:12:33,862 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 04:12:33,863 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/cohencu-ll.c [2022-04-28 04:12:33,906 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fddcf4d95/686a3f9c0fb7475eb4c6fe302b5cb075/FLAG09d85cb7c [2022-04-28 04:12:34,279 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 04:12:34,280 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/cohencu-ll.c [2022-04-28 04:12:34,286 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fddcf4d95/686a3f9c0fb7475eb4c6fe302b5cb075/FLAG09d85cb7c [2022-04-28 04:12:34,297 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fddcf4d95/686a3f9c0fb7475eb4c6fe302b5cb075 [2022-04-28 04:12:34,298 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 04:12:34,299 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 04:12:34,301 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 04:12:34,302 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 04:12:34,306 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 04:12:34,307 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:12:34" (1/1) ... [2022-04-28 04:12:34,308 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4286e6e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:12:34, skipping insertion in model container [2022-04-28 04:12:34,308 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:12:34" (1/1) ... [2022-04-28 04:12:34,312 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 04:12:34,323 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 04:12:34,441 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/cohencu-ll.c[588,601] [2022-04-28 04:12:34,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:12:34,465 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 04:12:34,473 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/cohencu-ll.c[588,601] [2022-04-28 04:12:34,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:12:34,488 INFO L208 MainTranslator]: Completed translation [2022-04-28 04:12:34,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:12:34 WrapperNode [2022-04-28 04:12:34,489 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 04:12:34,489 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 04:12:34,490 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 04:12:34,490 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 04:12:34,496 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:12:34" (1/1) ... [2022-04-28 04:12:34,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:12:34" (1/1) ... [2022-04-28 04:12:34,499 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:12:34" (1/1) ... [2022-04-28 04:12:34,499 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:12:34" (1/1) ... [2022-04-28 04:12:34,509 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:12:34" (1/1) ... [2022-04-28 04:12:34,513 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:12:34" (1/1) ... [2022-04-28 04:12:34,516 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:12:34" (1/1) ... [2022-04-28 04:12:34,522 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 04:12:34,523 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 04:12:34,523 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 04:12:34,523 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 04:12:34,524 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:12:34" (1/1) ... [2022-04-28 04:12:34,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:12:34,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:12:34,544 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 04:12:34,556 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 04:12:34,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 04:12:34,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 04:12:34,573 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 04:12:34,573 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 04:12:34,573 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 04:12:34,573 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 04:12:34,573 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 04:12:34,574 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 04:12:34,574 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 04:12:34,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 04:12:34,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2022-04-28 04:12:34,575 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 04:12:34,576 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 04:12:34,576 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 04:12:34,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 04:12:34,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 04:12:34,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 04:12:34,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 04:12:34,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 04:12:34,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 04:12:34,616 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 04:12:34,617 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 04:12:34,731 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 04:12:34,735 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 04:12:34,735 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 04:12:34,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:12:34 BoogieIcfgContainer [2022-04-28 04:12:34,737 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 04:12:34,738 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 04:12:34,738 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 04:12:34,740 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 04:12:34,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 04:12:34" (1/3) ... [2022-04-28 04:12:34,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73f7a5ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:12:34, skipping insertion in model container [2022-04-28 04:12:34,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:12:34" (2/3) ... [2022-04-28 04:12:34,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73f7a5ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:12:34, skipping insertion in model container [2022-04-28 04:12:34,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:12:34" (3/3) ... [2022-04-28 04:12:34,741 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll.c [2022-04-28 04:12:34,750 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 04:12:34,750 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 04:12:34,792 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 04:12:34,797 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@993ab16, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@618d10b3 [2022-04-28 04:12:34,798 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 04:12:34,810 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 04:12:34,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 04:12:34,814 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:12:34,814 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:12:34,815 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:12:34,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:12:34,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1298655804, now seen corresponding path program 1 times [2022-04-28 04:12:34,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:12:34,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2025579207] [2022-04-28 04:12:34,832 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:12:34,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1298655804, now seen corresponding path program 2 times [2022-04-28 04:12:34,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:12:34,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747733846] [2022-04-28 04:12:34,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:12:34,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:12:34,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:12:35,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:12:35,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:12:35,023 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {33#true} is VALID [2022-04-28 04:12:35,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-28 04:12:35,023 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #80#return; {33#true} is VALID [2022-04-28 04:12:35,028 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {38#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:12:35,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {33#true} is VALID [2022-04-28 04:12:35,029 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-28 04:12:35,029 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #80#return; {33#true} is VALID [2022-04-28 04:12:35,029 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret5 := main(); {33#true} is VALID [2022-04-28 04:12:35,029 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {33#true} is VALID [2022-04-28 04:12:35,030 INFO L290 TraceCheckUtils]: 6: Hoare triple {33#true} assume false; {34#false} is VALID [2022-04-28 04:12:35,031 INFO L272 TraceCheckUtils]: 7: Hoare triple {34#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {34#false} is VALID [2022-04-28 04:12:35,031 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2022-04-28 04:12:35,031 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2022-04-28 04:12:35,031 INFO L290 TraceCheckUtils]: 10: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-04-28 04:12:35,031 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 04:12:35,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:12:35,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747733846] [2022-04-28 04:12:35,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747733846] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:12:35,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:12:35,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 04:12:35,034 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:12:35,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2025579207] [2022-04-28 04:12:35,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2025579207] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:12:35,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:12:35,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 04:12:35,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442179820] [2022-04-28 04:12:35,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:12:35,038 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 04:12:35,039 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:12:35,041 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 04:12:35,063 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 04:12:35,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 04:12:35,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:12:35,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 04:12:35,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 04:12:35,083 INFO L87 Difference]: Start difference. First operand has 30 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) 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 04:12:35,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:35,269 INFO L93 Difference]: Finished difference Result 54 states and 91 transitions. [2022-04-28 04:12:35,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 04:12:35,269 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 04:12:35,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:12:35,271 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 04:12:35,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-04-28 04:12:35,283 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 04:12:35,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-04-28 04:12:35,290 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 91 transitions. [2022-04-28 04:12:35,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:12:35,405 INFO L225 Difference]: With dead ends: 54 [2022-04-28 04:12:35,405 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 04:12:35,409 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 04:12:35,411 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:12:35,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 32 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:12:35,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 04:12:35,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-28 04:12:35,432 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:12:35,433 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 04:12:35,434 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 04:12:35,434 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 04:12:35,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:35,437 INFO L93 Difference]: Finished difference Result 25 states and 35 transitions. [2022-04-28 04:12:35,437 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2022-04-28 04:12:35,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:12:35,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:12:35,439 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 25 states. [2022-04-28 04:12:35,440 INFO L87 Difference]: Start difference. First operand has 25 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 25 states. [2022-04-28 04:12:35,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:35,442 INFO L93 Difference]: Finished difference Result 25 states and 35 transitions. [2022-04-28 04:12:35,442 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2022-04-28 04:12:35,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:12:35,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:12:35,443 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:12:35,443 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:12:35,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 04:12:35,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2022-04-28 04:12:35,446 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 11 [2022-04-28 04:12:35,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:12:35,446 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2022-04-28 04:12:35,446 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 04:12:35,447 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 35 transitions. [2022-04-28 04:12:35,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:12:35,491 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2022-04-28 04:12:35,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 04:12:35,491 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:12:35,492 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:12:35,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 04:12:35,492 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:12:35,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:12:35,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1297106672, now seen corresponding path program 1 times [2022-04-28 04:12:35,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:12:35,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [922579452] [2022-04-28 04:12:35,493 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:12:35,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1297106672, now seen corresponding path program 2 times [2022-04-28 04:12:35,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:12:35,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039152794] [2022-04-28 04:12:35,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:12:35,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:12:35,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:12:35,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:12:35,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:12:35,578 INFO L290 TraceCheckUtils]: 0: Hoare triple {257#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {249#true} is VALID [2022-04-28 04:12:35,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {249#true} assume true; {249#true} is VALID [2022-04-28 04:12:35,579 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {249#true} {249#true} #80#return; {249#true} is VALID [2022-04-28 04:12:35,579 INFO L272 TraceCheckUtils]: 0: Hoare triple {249#true} call ULTIMATE.init(); {257#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:12:35,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {257#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {249#true} is VALID [2022-04-28 04:12:35,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {249#true} assume true; {249#true} is VALID [2022-04-28 04:12:35,580 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {249#true} {249#true} #80#return; {249#true} is VALID [2022-04-28 04:12:35,580 INFO L272 TraceCheckUtils]: 4: Hoare triple {249#true} call #t~ret5 := main(); {249#true} is VALID [2022-04-28 04:12:35,580 INFO L290 TraceCheckUtils]: 5: Hoare triple {249#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {254#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-28 04:12:35,581 INFO L290 TraceCheckUtils]: 6: Hoare triple {254#(= (+ (* main_~n~0 6) 6) main_~z~0)} assume !false; {254#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-28 04:12:35,581 INFO L272 TraceCheckUtils]: 7: Hoare triple {254#(= (+ (* main_~n~0 6) 6) main_~z~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {255#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:12:35,582 INFO L290 TraceCheckUtils]: 8: Hoare triple {255#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {256#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:12:35,582 INFO L290 TraceCheckUtils]: 9: Hoare triple {256#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {250#false} is VALID [2022-04-28 04:12:35,582 INFO L290 TraceCheckUtils]: 10: Hoare triple {250#false} assume !false; {250#false} is VALID [2022-04-28 04:12:35,582 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 04:12:35,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:12:35,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039152794] [2022-04-28 04:12:35,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039152794] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:12:35,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:12:35,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 04:12:35,583 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:12:35,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [922579452] [2022-04-28 04:12:35,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [922579452] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:12:35,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:12:35,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 04:12:35,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457723984] [2022-04-28 04:12:35,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:12:35,584 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 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 04:12:35,585 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:12:35,585 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 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 04:12:35,592 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 04:12:35,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 04:12:35,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:12:35,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 04:12:35,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 04:12:35,593 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 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 04:12:35,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:35,962 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2022-04-28 04:12:35,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 04:12:35,962 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 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 04:12:35,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:12:35,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 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 04:12:35,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2022-04-28 04:12:35,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 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 04:12:35,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2022-04-28 04:12:35,965 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 40 transitions. [2022-04-28 04:12:36,025 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:12:36,027 INFO L225 Difference]: With dead ends: 31 [2022-04-28 04:12:36,027 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 04:12:36,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 04:12:36,030 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 18 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 04:12:36,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 38 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 04:12:36,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 04:12:36,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-28 04:12:36,047 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:12:36,047 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 04:12:36,047 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 04:12:36,048 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 04:12:36,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:36,049 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2022-04-28 04:12:36,050 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2022-04-28 04:12:36,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:12:36,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:12:36,051 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 29 states. [2022-04-28 04:12:36,051 INFO L87 Difference]: Start difference. First operand has 29 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 29 states. [2022-04-28 04:12:36,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:36,053 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2022-04-28 04:12:36,053 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2022-04-28 04:12:36,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:12:36,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:12:36,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:12:36,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:12:36,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 04:12:36,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2022-04-28 04:12:36,055 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 11 [2022-04-28 04:12:36,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:12:36,055 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2022-04-28 04:12:36,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 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 04:12:36,056 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 38 transitions. [2022-04-28 04:12:36,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:12:36,094 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2022-04-28 04:12:36,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 04:12:36,094 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:12:36,094 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:12:36,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 04:12:36,095 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:12:36,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:12:36,095 INFO L85 PathProgramCache]: Analyzing trace with hash -2099401665, now seen corresponding path program 1 times [2022-04-28 04:12:36,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:12:36,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1531602822] [2022-04-28 04:12:36,096 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:12:36,096 INFO L85 PathProgramCache]: Analyzing trace with hash -2099401665, now seen corresponding path program 2 times [2022-04-28 04:12:36,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:12:36,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895224777] [2022-04-28 04:12:36,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:12:36,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:12:36,107 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:12:36,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1289756085] [2022-04-28 04:12:36,108 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:12:36,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:12:36,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:12:36,119 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 04:12:36,139 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 04:12:36,155 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:12:36,155 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:12:36,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 04:12:36,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:12:36,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:12:36,262 INFO L272 TraceCheckUtils]: 0: Hoare triple {446#true} call ULTIMATE.init(); {446#true} is VALID [2022-04-28 04:12:36,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {446#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(13, 2);call #Ultimate.allocInit(12, 3); {446#true} is VALID [2022-04-28 04:12:36,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {446#true} assume true; {446#true} is VALID [2022-04-28 04:12:36,263 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {446#true} {446#true} #80#return; {446#true} is VALID [2022-04-28 04:12:36,263 INFO L272 TraceCheckUtils]: 4: Hoare triple {446#true} call #t~ret5 := main(); {446#true} is VALID [2022-04-28 04:12:36,263 INFO L290 TraceCheckUtils]: 5: Hoare triple {446#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {466#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 04:12:36,264 INFO L290 TraceCheckUtils]: 6: Hoare triple {466#(and (= main_~n~0 0) (= main_~y~0 1))} assume !false; {466#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 04:12:36,264 INFO L272 TraceCheckUtils]: 7: Hoare triple {466#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {446#true} is VALID [2022-04-28 04:12:36,264 INFO L290 TraceCheckUtils]: 8: Hoare triple {446#true} ~cond := #in~cond; {446#true} is VALID [2022-04-28 04:12:36,264 INFO L290 TraceCheckUtils]: 9: Hoare triple {446#true} assume !(0 == ~cond); {446#true} is VALID [2022-04-28 04:12:36,264 INFO L290 TraceCheckUtils]: 10: Hoare triple {446#true} assume true; {446#true} is VALID [2022-04-28 04:12:36,265 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {446#true} {466#(and (= main_~n~0 0) (= main_~y~0 1))} #58#return; {466#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 04:12:36,266 INFO L272 TraceCheckUtils]: 12: Hoare triple {466#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {488#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:12:36,266 INFO L290 TraceCheckUtils]: 13: Hoare triple {488#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {492#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:12:36,267 INFO L290 TraceCheckUtils]: 14: Hoare triple {492#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {447#false} is VALID [2022-04-28 04:12:36,267 INFO L290 TraceCheckUtils]: 15: Hoare triple {447#false} assume !false; {447#false} is VALID [2022-04-28 04:12:36,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:12:36,267 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:12:36,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:12:36,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895224777] [2022-04-28 04:12:36,267 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:12:36,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289756085] [2022-04-28 04:12:36,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289756085] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:12:36,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:12:36,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:12:36,268 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:12:36,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1531602822] [2022-04-28 04:12:36,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1531602822] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:12:36,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:12:36,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:12:36,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387634004] [2022-04-28 04:12:36,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:12:36,269 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 16 [2022-04-28 04:12:36,270 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:12:36,270 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 04:12:36,281 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:12:36,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 04:12:36,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:12:36,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 04:12:36,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 04:12:36,282 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 04:12:36,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:36,455 INFO L93 Difference]: Finished difference Result 48 states and 67 transitions. [2022-04-28 04:12:36,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 04:12:36,455 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 16 [2022-04-28 04:12:36,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:12:36,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 04:12:36,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-28 04:12:36,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 04:12:36,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-28 04:12:36,458 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-28 04:12:36,519 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:12:36,521 INFO L225 Difference]: With dead ends: 48 [2022-04-28 04:12:36,521 INFO L226 Difference]: Without dead ends: 46 [2022-04-28 04:12:36,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 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 04:12:36,527 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 6 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:12:36,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 125 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:12:36,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-28 04:12:36,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 36. [2022-04-28 04:12:36,547 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:12:36,549 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 36 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 04:12:36,550 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 36 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 04:12:36,550 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 36 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 04:12:36,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:36,556 INFO L93 Difference]: Finished difference Result 46 states and 65 transitions. [2022-04-28 04:12:36,557 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 65 transitions. [2022-04-28 04:12:36,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:12:36,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:12:36,559 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 46 states. [2022-04-28 04:12:36,560 INFO L87 Difference]: Start difference. First operand has 36 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 46 states. [2022-04-28 04:12:36,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:36,562 INFO L93 Difference]: Finished difference Result 46 states and 65 transitions. [2022-04-28 04:12:36,562 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 65 transitions. [2022-04-28 04:12:36,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:12:36,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:12:36,563 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:12:36,563 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:12:36,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 04:12:36,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2022-04-28 04:12:36,564 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 16 [2022-04-28 04:12:36,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:12:36,565 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 46 transitions. [2022-04-28 04:12:36,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 04:12:36,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 46 transitions. [2022-04-28 04:12:36,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:12:36,616 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2022-04-28 04:12:36,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 04:12:36,616 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:12:36,616 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:12:36,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 04:12:36,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:12:36,835 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:12:36,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:12:36,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1061128656, now seen corresponding path program 1 times [2022-04-28 04:12:36,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:12:36,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1453584278] [2022-04-28 04:12:36,836 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:12:36,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1061128656, now seen corresponding path program 2 times [2022-04-28 04:12:36,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:12:36,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27515329] [2022-04-28 04:12:36,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:12:36,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:12:36,846 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:12:36,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1242966017] [2022-04-28 04:12:36,847 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:12:36,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:12:36,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:12:36,848 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 04:12:36,849 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 04:12:36,876 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:12:36,876 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:12:36,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 04:12:36,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:12:36,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:12:36,967 INFO L272 TraceCheckUtils]: 0: Hoare triple {760#true} call ULTIMATE.init(); {760#true} is VALID [2022-04-28 04:12:36,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {760#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(13, 2);call #Ultimate.allocInit(12, 3); {760#true} is VALID [2022-04-28 04:12:36,967 INFO L290 TraceCheckUtils]: 2: Hoare triple {760#true} assume true; {760#true} is VALID [2022-04-28 04:12:36,968 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {760#true} {760#true} #80#return; {760#true} is VALID [2022-04-28 04:12:36,968 INFO L272 TraceCheckUtils]: 4: Hoare triple {760#true} call #t~ret5 := main(); {760#true} is VALID [2022-04-28 04:12:36,971 INFO L290 TraceCheckUtils]: 5: Hoare triple {760#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {780#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-28 04:12:36,973 INFO L290 TraceCheckUtils]: 6: Hoare triple {780#(and (= main_~x~0 0) (= main_~n~0 0))} assume !false; {780#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-28 04:12:36,973 INFO L272 TraceCheckUtils]: 7: Hoare triple {780#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {760#true} is VALID [2022-04-28 04:12:36,973 INFO L290 TraceCheckUtils]: 8: Hoare triple {760#true} ~cond := #in~cond; {760#true} is VALID [2022-04-28 04:12:36,973 INFO L290 TraceCheckUtils]: 9: Hoare triple {760#true} assume !(0 == ~cond); {760#true} is VALID [2022-04-28 04:12:36,974 INFO L290 TraceCheckUtils]: 10: Hoare triple {760#true} assume true; {760#true} is VALID [2022-04-28 04:12:36,975 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {760#true} {780#(and (= main_~x~0 0) (= main_~n~0 0))} #58#return; {780#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-28 04:12:36,976 INFO L272 TraceCheckUtils]: 12: Hoare triple {780#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {760#true} is VALID [2022-04-28 04:12:36,976 INFO L290 TraceCheckUtils]: 13: Hoare triple {760#true} ~cond := #in~cond; {760#true} is VALID [2022-04-28 04:12:36,976 INFO L290 TraceCheckUtils]: 14: Hoare triple {760#true} assume !(0 == ~cond); {760#true} is VALID [2022-04-28 04:12:36,976 INFO L290 TraceCheckUtils]: 15: Hoare triple {760#true} assume true; {760#true} is VALID [2022-04-28 04:12:36,978 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {760#true} {780#(and (= main_~x~0 0) (= main_~n~0 0))} #60#return; {780#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-28 04:12:36,979 INFO L272 TraceCheckUtils]: 17: Hoare triple {780#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {817#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:12:36,979 INFO L290 TraceCheckUtils]: 18: Hoare triple {817#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {821#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:12:36,980 INFO L290 TraceCheckUtils]: 19: Hoare triple {821#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {761#false} is VALID [2022-04-28 04:12:36,980 INFO L290 TraceCheckUtils]: 20: Hoare triple {761#false} assume !false; {761#false} is VALID [2022-04-28 04:12:36,980 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 04:12:36,980 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:12:36,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:12:36,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27515329] [2022-04-28 04:12:36,981 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:12:36,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242966017] [2022-04-28 04:12:36,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242966017] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:12:36,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:12:36,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:12:36,982 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:12:36,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1453584278] [2022-04-28 04:12:36,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1453584278] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:12:36,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:12:36,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:12:36,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808448861] [2022-04-28 04:12:36,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:12:36,982 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2022-04-28 04:12:36,982 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:12:36,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 04:12:36,995 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 04:12:36,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 04:12:36,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:12:36,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 04:12:36,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 04:12:36,996 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 04:12:37,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:37,186 INFO L93 Difference]: Finished difference Result 52 states and 70 transitions. [2022-04-28 04:12:37,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 04:12:37,186 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2022-04-28 04:12:37,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:12:37,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 04:12:37,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-28 04:12:37,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 04:12:37,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-28 04:12:37,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-28 04:12:37,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:12:37,245 INFO L225 Difference]: With dead ends: 52 [2022-04-28 04:12:37,245 INFO L226 Difference]: Without dead ends: 50 [2022-04-28 04:12:37,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 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 04:12:37,246 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:12:37,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 126 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:12:37,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-28 04:12:37,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2022-04-28 04:12:37,259 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:12:37,260 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 46 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 04:12:37,260 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 46 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 04:12:37,260 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 46 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 04:12:37,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:37,262 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2022-04-28 04:12:37,262 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2022-04-28 04:12:37,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:12:37,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:12:37,263 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 50 states. [2022-04-28 04:12:37,263 INFO L87 Difference]: Start difference. First operand has 46 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 50 states. [2022-04-28 04:12:37,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:37,265 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2022-04-28 04:12:37,265 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2022-04-28 04:12:37,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:12:37,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:12:37,266 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:12:37,266 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:12:37,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 04:12:37,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 61 transitions. [2022-04-28 04:12:37,267 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 61 transitions. Word has length 21 [2022-04-28 04:12:37,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:12:37,268 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 61 transitions. [2022-04-28 04:12:37,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 04:12:37,268 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 61 transitions. [2022-04-28 04:12:37,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:12:37,327 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 61 transitions. [2022-04-28 04:12:37,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 04:12:37,328 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:12:37,328 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:12:37,347 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 04:12:37,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-28 04:12:37,543 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:12:37,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:12:37,544 INFO L85 PathProgramCache]: Analyzing trace with hash 2039501471, now seen corresponding path program 1 times [2022-04-28 04:12:37,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:12:37,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1782643540] [2022-04-28 04:12:37,544 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:12:37,544 INFO L85 PathProgramCache]: Analyzing trace with hash 2039501471, now seen corresponding path program 2 times [2022-04-28 04:12:37,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:12:37,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733934473] [2022-04-28 04:12:37,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:12:37,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:12:37,553 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:12:37,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2023124465] [2022-04-28 04:12:37,553 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:12:37,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:12:37,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:12:37,554 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 04:12:37,555 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 04:12:37,584 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:12:37,585 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:12:37,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 04:12:37,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:12:37,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:12:37,722 INFO L272 TraceCheckUtils]: 0: Hoare triple {1125#true} call ULTIMATE.init(); {1125#true} is VALID [2022-04-28 04:12:37,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {1125#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(13, 2);call #Ultimate.allocInit(12, 3); {1125#true} is VALID [2022-04-28 04:12:37,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {1125#true} assume true; {1125#true} is VALID [2022-04-28 04:12:37,723 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1125#true} {1125#true} #80#return; {1125#true} is VALID [2022-04-28 04:12:37,723 INFO L272 TraceCheckUtils]: 4: Hoare triple {1125#true} call #t~ret5 := main(); {1125#true} is VALID [2022-04-28 04:12:37,724 INFO L290 TraceCheckUtils]: 5: Hoare triple {1125#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1145#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 04:12:37,724 INFO L290 TraceCheckUtils]: 6: Hoare triple {1145#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {1145#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 04:12:37,724 INFO L272 TraceCheckUtils]: 7: Hoare triple {1145#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1125#true} is VALID [2022-04-28 04:12:37,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {1125#true} ~cond := #in~cond; {1125#true} is VALID [2022-04-28 04:12:37,724 INFO L290 TraceCheckUtils]: 9: Hoare triple {1125#true} assume !(0 == ~cond); {1125#true} is VALID [2022-04-28 04:12:37,724 INFO L290 TraceCheckUtils]: 10: Hoare triple {1125#true} assume true; {1125#true} is VALID [2022-04-28 04:12:37,725 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1125#true} {1145#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #58#return; {1145#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 04:12:37,725 INFO L272 TraceCheckUtils]: 12: Hoare triple {1145#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1125#true} is VALID [2022-04-28 04:12:37,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {1125#true} ~cond := #in~cond; {1125#true} is VALID [2022-04-28 04:12:37,725 INFO L290 TraceCheckUtils]: 14: Hoare triple {1125#true} assume !(0 == ~cond); {1125#true} is VALID [2022-04-28 04:12:37,726 INFO L290 TraceCheckUtils]: 15: Hoare triple {1125#true} assume true; {1125#true} is VALID [2022-04-28 04:12:37,726 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1125#true} {1145#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #60#return; {1145#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 04:12:37,726 INFO L272 TraceCheckUtils]: 17: Hoare triple {1145#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1125#true} is VALID [2022-04-28 04:12:37,726 INFO L290 TraceCheckUtils]: 18: Hoare triple {1125#true} ~cond := #in~cond; {1125#true} is VALID [2022-04-28 04:12:37,726 INFO L290 TraceCheckUtils]: 19: Hoare triple {1125#true} assume !(0 == ~cond); {1125#true} is VALID [2022-04-28 04:12:37,727 INFO L290 TraceCheckUtils]: 20: Hoare triple {1125#true} assume true; {1125#true} is VALID [2022-04-28 04:12:37,727 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1125#true} {1145#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {1145#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 04:12:37,731 INFO L272 TraceCheckUtils]: 22: Hoare triple {1145#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {1197#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:12:37,733 INFO L290 TraceCheckUtils]: 23: Hoare triple {1197#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1201#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:12:37,734 INFO L290 TraceCheckUtils]: 24: Hoare triple {1201#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1126#false} is VALID [2022-04-28 04:12:37,734 INFO L290 TraceCheckUtils]: 25: Hoare triple {1126#false} assume !false; {1126#false} is VALID [2022-04-28 04:12:37,734 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 04:12:37,734 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:12:37,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:12:37,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733934473] [2022-04-28 04:12:37,734 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:12:37,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023124465] [2022-04-28 04:12:37,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023124465] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:12:37,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:12:37,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:12:37,735 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:12:37,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1782643540] [2022-04-28 04:12:37,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1782643540] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:12:37,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:12:37,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:12:37,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366787481] [2022-04-28 04:12:37,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:12:37,735 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 26 [2022-04-28 04:12:37,736 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:12:37,736 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 04:12:37,749 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 04:12:37,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 04:12:37,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:12:37,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 04:12:37,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 04:12:37,750 INFO L87 Difference]: Start difference. First operand 46 states and 61 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 04:12:38,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:38,005 INFO L93 Difference]: Finished difference Result 60 states and 76 transitions. [2022-04-28 04:12:38,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 04:12:38,005 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 26 [2022-04-28 04:12:38,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:12:38,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 04:12:38,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-28 04:12:38,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 04:12:38,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-28 04:12:38,008 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-28 04:12:38,065 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:12:38,066 INFO L225 Difference]: With dead ends: 60 [2022-04-28 04:12:38,066 INFO L226 Difference]: Without dead ends: 48 [2022-04-28 04:12:38,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 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 04:12:38,067 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 6 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:12:38,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 112 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 04:12:38,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-28 04:12:38,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-28 04:12:38,087 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:12:38,088 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 24 states have internal predecessors, (25), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 04:12:38,088 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 24 states have internal predecessors, (25), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 04:12:38,088 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 24 states have internal predecessors, (25), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 04:12:38,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:38,090 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2022-04-28 04:12:38,090 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2022-04-28 04:12:38,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:12:38,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:12:38,091 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 24 states have internal predecessors, (25), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 48 states. [2022-04-28 04:12:38,091 INFO L87 Difference]: Start difference. First operand has 48 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 24 states have internal predecessors, (25), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 48 states. [2022-04-28 04:12:38,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:38,093 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2022-04-28 04:12:38,093 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2022-04-28 04:12:38,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:12:38,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:12:38,094 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:12:38,094 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:12:38,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 24 states have internal predecessors, (25), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 04:12:38,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2022-04-28 04:12:38,120 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 26 [2022-04-28 04:12:38,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:12:38,120 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2022-04-28 04:12:38,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 04:12:38,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 59 transitions. [2022-04-28 04:12:38,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:12:38,186 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2022-04-28 04:12:38,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 04:12:38,187 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:12:38,187 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:12:38,203 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 04:12:38,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:12:38,391 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:12:38,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:12:38,392 INFO L85 PathProgramCache]: Analyzing trace with hash 542006608, now seen corresponding path program 1 times [2022-04-28 04:12:38,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:12:38,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [387642672] [2022-04-28 04:15:10,171 WARN L232 SmtUtils]: Spent 2.52m on a formula simplification. DAG size of input: 192 DAG size of output: 183 (called from [L 564] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.buildAccelerationFormula) [2022-04-28 04:15:10,206 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 4=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:15:10,210 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:15:10,215 INFO L85 PathProgramCache]: Analyzing trace with hash 688371743, now seen corresponding path program 1 times [2022-04-28 04:15:10,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:15:10,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152449249] [2022-04-28 04:15:10,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:15:10,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:15:10,227 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:15:10,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [358324342] [2022-04-28 04:15:10,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:15:10,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:15:10,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:15:10,239 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 04:15:10,240 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 04:15:10,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:15:10,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 04:15:10,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:15:10,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:15:12,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:15:12,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152449249] [2022-04-28 04:15:12,353 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:15:12,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358324342] [2022-04-28 04:15:12,353 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-04-28 04:15:12,361 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 04:15:12,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:15:12,562 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Illegal for the call above at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushUtilsForLocalEliminatees.findSomePushableLocalEliminateeSet(QuantifierPushUtilsForLocalEliminatees.java:177) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushUtilsForLocalEliminatees.pushLocalEliminateesOverCorrespondingFiniteJunction(QuantifierPushUtilsForLocalEliminatees.java:74) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushUtils.preprocessDualFiniteJunction(QuantifierPushUtils.java:174) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:330) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:175) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:264) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:250) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.runStrategy(AcceleratedInterpolationCore.java:300) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:289) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:195) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-28 04:15:12,565 INFO L158 Benchmark]: Toolchain (without parser) took 158265.85ms. Allocated memory was 196.1MB in the beginning and 293.6MB in the end (delta: 97.5MB). Free memory was 142.6MB in the beginning and 181.6MB in the end (delta: -39.0MB). Peak memory consumption was 59.2MB. Max. memory is 8.0GB. [2022-04-28 04:15:12,565 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 196.1MB. Free memory is still 159.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 04:15:12,566 INFO L158 Benchmark]: CACSL2BoogieTranslator took 187.61ms. Allocated memory is still 196.1MB. Free memory was 142.4MB in the beginning and 171.1MB in the end (delta: -28.7MB). Peak memory consumption was 11.0MB. Max. memory is 8.0GB. [2022-04-28 04:15:12,566 INFO L158 Benchmark]: Boogie Preprocessor took 32.67ms. Allocated memory is still 196.1MB. Free memory was 171.1MB in the beginning and 169.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 04:15:12,566 INFO L158 Benchmark]: RCFGBuilder took 213.78ms. Allocated memory is still 196.1MB. Free memory was 169.5MB in the beginning and 158.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 04:15:12,566 INFO L158 Benchmark]: TraceAbstraction took 157827.06ms. Allocated memory was 196.1MB in the beginning and 293.6MB in the end (delta: 97.5MB). Free memory was 157.5MB in the beginning and 181.6MB in the end (delta: -24.1MB). Peak memory consumption was 74.4MB. Max. memory is 8.0GB. [2022-04-28 04:15:12,567 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.10ms. Allocated memory is still 196.1MB. Free memory is still 159.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 187.61ms. Allocated memory is still 196.1MB. Free memory was 142.4MB in the beginning and 171.1MB in the end (delta: -28.7MB). Peak memory consumption was 11.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.67ms. Allocated memory is still 196.1MB. Free memory was 171.1MB in the beginning and 169.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 213.78ms. Allocated memory is still 196.1MB. Free memory was 169.5MB in the beginning and 158.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 157827.06ms. Allocated memory was 196.1MB in the beginning and 293.6MB in the end (delta: 97.5MB). Free memory was 157.5MB in the beginning and 181.6MB in the end (delta: -24.1MB). Peak memory consumption was 74.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Illegal for the call above de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Illegal for the call above: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushUtilsForLocalEliminatees.findSomePushableLocalEliminateeSet(QuantifierPushUtilsForLocalEliminatees.java:177) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-28 04:15:12,773 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-04-28 04:15:12,808 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 137 Received shutdown request...