/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/ps2-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 04:25:36,015 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 04:25:36,042 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 04:25:36,092 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 04:25:36,092 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 04:25:36,093 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 04:25:36,096 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 04:25:36,101 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 04:25:36,103 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 04:25:36,105 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 04:25:36,105 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 04:25:36,106 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 04:25:36,106 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 04:25:36,107 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 04:25:36,108 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 04:25:36,109 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 04:25:36,109 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 04:25:36,110 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 04:25:36,111 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 04:25:36,112 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 04:25:36,113 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 04:25:36,119 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 04:25:36,121 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 04:25:36,125 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 04:25:36,126 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 04:25:36,132 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 04:25:36,132 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 04:25:36,132 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 04:25:36,133 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 04:25:36,133 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 04:25:36,134 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 04:25:36,134 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 04:25:36,134 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 04:25:36,135 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 04:25:36,135 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 04:25:36,136 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 04:25:36,136 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 04:25:36,137 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 04:25:36,137 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 04:25:36,137 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 04:25:36,138 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 04:25:36,143 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 04:25:36,144 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:25:36,157 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 04:25:36,158 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 04:25:36,159 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 04:25:36,159 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 04:25:36,159 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 04:25:36,159 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 04:25:36,159 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 04:25:36,159 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 04:25:36,160 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 04:25:36,160 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 04:25:36,160 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 04:25:36,161 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 04:25:36,161 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 04:25:36,161 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 04:25:36,161 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 04:25:36,161 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 04:25:36,161 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 04:25:36,161 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 04:25:36,162 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:25:36,162 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 04:25:36,162 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 04:25:36,162 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 04:25:36,162 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 04:25:36,162 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 04:25:36,162 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 04:25:36,162 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:25:36,359 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 04:25:36,377 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 04:25:36,380 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 04:25:36,380 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 04:25:36,381 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 04:25:36,382 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/ps2-ll.c [2022-04-28 04:25:36,436 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2282f4d0a/b50d3abb22c6424eb0d3ab70a6d0f4d9/FLAG5b29aacbd [2022-04-28 04:25:36,783 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 04:25:36,784 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/ps2-ll.c [2022-04-28 04:25:36,792 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2282f4d0a/b50d3abb22c6424eb0d3ab70a6d0f4d9/FLAG5b29aacbd [2022-04-28 04:25:37,212 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2282f4d0a/b50d3abb22c6424eb0d3ab70a6d0f4d9 [2022-04-28 04:25:37,214 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 04:25:37,215 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 04:25:37,219 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 04:25:37,219 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 04:25:37,221 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 04:25:37,222 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:25:37" (1/1) ... [2022-04-28 04:25:37,222 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e921bf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:25:37, skipping insertion in model container [2022-04-28 04:25:37,222 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:25:37" (1/1) ... [2022-04-28 04:25:37,230 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 04:25:37,242 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 04:25:37,386 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/ps2-ll.c[454,467] [2022-04-28 04:25:37,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:25:37,403 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 04:25:37,412 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/ps2-ll.c[454,467] [2022-04-28 04:25:37,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:25:37,427 INFO L208 MainTranslator]: Completed translation [2022-04-28 04:25:37,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:25:37 WrapperNode [2022-04-28 04:25:37,428 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 04:25:37,429 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 04:25:37,429 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 04:25:37,429 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 04:25:37,440 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:25:37" (1/1) ... [2022-04-28 04:25:37,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:25:37" (1/1) ... [2022-04-28 04:25:37,445 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:25:37" (1/1) ... [2022-04-28 04:25:37,446 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:25:37" (1/1) ... [2022-04-28 04:25:37,458 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:25:37" (1/1) ... [2022-04-28 04:25:37,462 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:25:37" (1/1) ... [2022-04-28 04:25:37,463 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:25:37" (1/1) ... [2022-04-28 04:25:37,469 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 04:25:37,470 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 04:25:37,470 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 04:25:37,470 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 04:25:37,472 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:25:37" (1/1) ... [2022-04-28 04:25:37,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:25:37,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:25:37,500 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:25:37,529 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:25:37,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 04:25:37,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 04:25:37,542 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 04:25:37,542 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 04:25:37,542 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 04:25:37,542 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 04:25:37,542 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 04:25:37,542 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 04:25:37,543 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 04:25:37,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 04:25:37,543 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 04:25:37,544 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 04:25:37,545 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 04:25:37,546 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 04:25:37,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 04:25:37,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 04:25:37,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 04:25:37,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 04:25:37,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 04:25:37,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 04:25:37,602 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 04:25:37,604 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 04:25:37,740 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 04:25:37,750 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 04:25:37,750 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 04:25:37,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:25:37 BoogieIcfgContainer [2022-04-28 04:25:37,752 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 04:25:37,766 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 04:25:37,767 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 04:25:37,780 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 04:25:37,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 04:25:37" (1/3) ... [2022-04-28 04:25:37,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@121deb1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:25:37, skipping insertion in model container [2022-04-28 04:25:37,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:25:37" (2/3) ... [2022-04-28 04:25:37,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@121deb1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:25:37, skipping insertion in model container [2022-04-28 04:25:37,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:25:37" (3/3) ... [2022-04-28 04:25:37,782 INFO L111 eAbstractionObserver]: Analyzing ICFG ps2-ll.c [2022-04-28 04:25:37,793 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 04:25:37,793 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 04:25:37,848 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 04:25:37,853 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@76a88258, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@31f46a1c [2022-04-28 04:25:37,853 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 04:25:37,860 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 04:25:37,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 04:25:37,865 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:25:37,866 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:25:37,866 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:25:37,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:25:37,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1469283919, now seen corresponding path program 1 times [2022-04-28 04:25:37,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:25:37,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [122210918] [2022-04-28 04:25:37,887 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:25:37,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1469283919, now seen corresponding path program 2 times [2022-04-28 04:25:37,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:25:37,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831401776] [2022-04-28 04:25:37,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:25:37,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:25:37,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:25:38,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:25:38,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:25:38,088 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(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(9, 2);call #Ultimate.allocInit(12, 3); {24#true} is VALID [2022-04-28 04:25:38,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-28 04:25:38,089 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #53#return; {24#true} is VALID [2022-04-28 04:25:38,093 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:25:38,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(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(9, 2);call #Ultimate.allocInit(12, 3); {24#true} is VALID [2022-04-28 04:25:38,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-28 04:25:38,093 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #53#return; {24#true} is VALID [2022-04-28 04:25:38,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret5 := main(); {24#true} is VALID [2022-04-28 04:25:38,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {24#true} is VALID [2022-04-28 04:25:38,095 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume false; {25#false} is VALID [2022-04-28 04:25:38,096 INFO L272 TraceCheckUtils]: 7: Hoare triple {25#false} call __VERIFIER_assert((if 0 == ~y~0 * ~y~0 - 2 * ~x~0 + ~y~0 then 1 else 0)); {25#false} is VALID [2022-04-28 04:25:38,096 INFO L290 TraceCheckUtils]: 8: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2022-04-28 04:25:38,097 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2022-04-28 04:25:38,097 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-28 04:25:38,097 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:25:38,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:25:38,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831401776] [2022-04-28 04:25:38,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831401776] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:25:38,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:25:38,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 04:25:38,101 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:25:38,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [122210918] [2022-04-28 04:25:38,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [122210918] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:25:38,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:25:38,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 04:25:38,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464529157] [2022-04-28 04:25:38,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:25:38,107 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:25:38,109 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:25:38,111 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:25:38,129 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:25:38,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 04:25:38,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:25:38,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 04:25:38,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 04:25:38,155 INFO L87 Difference]: Start difference. First operand has 21 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:25:38,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:25:38,258 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2022-04-28 04:25:38,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 04:25:38,259 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:25:38,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:25:38,260 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:25:38,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-04-28 04:25:38,269 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:25:38,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-04-28 04:25:38,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 46 transitions. [2022-04-28 04:25:38,342 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:25:38,350 INFO L225 Difference]: With dead ends: 36 [2022-04-28 04:25:38,351 INFO L226 Difference]: Without dead ends: 16 [2022-04-28 04:25:38,354 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:25:38,358 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:25:38,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 23 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:25:38,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-28 04:25:38,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-28 04:25:38,397 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:25:38,398 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:25:38,398 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:25:38,399 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:25:38,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:25:38,404 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-04-28 04:25:38,404 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-28 04:25:38,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:25:38,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:25:38,405 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 16 states. [2022-04-28 04:25:38,406 INFO L87 Difference]: Start difference. First operand has 16 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 16 states. [2022-04-28 04:25:38,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:25:38,408 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-04-28 04:25:38,408 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-28 04:25:38,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:25:38,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:25:38,409 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:25:38,409 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:25:38,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:25:38,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-04-28 04:25:38,412 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2022-04-28 04:25:38,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:25:38,413 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-04-28 04:25:38,414 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:25:38,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 17 transitions. [2022-04-28 04:25:38,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:25:38,444 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-28 04:25:38,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 04:25:38,447 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:25:38,447 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:25:38,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 04:25:38,448 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:25:38,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:25:38,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1467496459, now seen corresponding path program 1 times [2022-04-28 04:25:38,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:25:38,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1120302942] [2022-04-28 04:25:38,451 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:25:38,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1467496459, now seen corresponding path program 2 times [2022-04-28 04:25:38,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:25:38,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112129710] [2022-04-28 04:25:38,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:25:38,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:25:38,469 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:25:38,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [743182073] [2022-04-28 04:25:38,471 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:25:38,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:25:38,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:25:38,479 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:25:38,511 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:25:38,537 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 04:25:38,537 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:25:38,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 04:25:38,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:25:38,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:25:38,691 INFO L272 TraceCheckUtils]: 0: Hoare triple {168#true} call ULTIMATE.init(); {168#true} is VALID [2022-04-28 04:25:38,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {168#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {168#true} is VALID [2022-04-28 04:25:38,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {168#true} assume true; {168#true} is VALID [2022-04-28 04:25:38,693 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {168#true} {168#true} #53#return; {168#true} is VALID [2022-04-28 04:25:38,694 INFO L272 TraceCheckUtils]: 4: Hoare triple {168#true} call #t~ret5 := main(); {168#true} is VALID [2022-04-28 04:25:38,694 INFO L290 TraceCheckUtils]: 5: Hoare triple {168#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {188#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 04:25:38,695 INFO L290 TraceCheckUtils]: 6: Hoare triple {188#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {188#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 04:25:38,696 INFO L272 TraceCheckUtils]: 7: Hoare triple {188#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == ~y~0 * ~y~0 - 2 * ~x~0 + ~y~0 then 1 else 0)); {195#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:25:38,696 INFO L290 TraceCheckUtils]: 8: Hoare triple {195#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {199#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:25:38,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {199#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {169#false} is VALID [2022-04-28 04:25:38,697 INFO L290 TraceCheckUtils]: 10: Hoare triple {169#false} assume !false; {169#false} is VALID [2022-04-28 04:25:38,697 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:25:38,698 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:25:38,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:25:38,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112129710] [2022-04-28 04:25:38,698 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:25:38,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743182073] [2022-04-28 04:25:38,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743182073] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:25:38,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:25:38,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:25:38,701 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:25:38,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1120302942] [2022-04-28 04:25:38,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1120302942] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:25:38,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:25:38,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:25:38,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669861903] [2022-04-28 04:25:38,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:25:38,702 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 04:25:38,702 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:25:38,702 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:25:38,712 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:25:38,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 04:25:38,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:25:38,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 04:25:38,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 04:25:38,715 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:25:38,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:25:38,829 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-28 04:25:38,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 04:25:38,830 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 04:25:38,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:25:38,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:25:38,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-04-28 04:25:38,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:25:38,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-04-28 04:25:38,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 28 transitions. [2022-04-28 04:25:38,864 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:25:38,865 INFO L225 Difference]: With dead ends: 26 [2022-04-28 04:25:38,865 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 04:25:38,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 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:25:38,867 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:25:38,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 49 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:25:38,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 04:25:38,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-28 04:25:38,877 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:25:38,877 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:25:38,877 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:25:38,878 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:25:38,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:25:38,879 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-04-28 04:25:38,879 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-04-28 04:25:38,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:25:38,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:25:38,880 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 23 states. [2022-04-28 04:25:38,880 INFO L87 Difference]: Start difference. First operand has 23 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 23 states. [2022-04-28 04:25:38,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:25:38,882 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-04-28 04:25:38,882 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-04-28 04:25:38,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:25:38,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:25:38,883 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:25:38,883 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:25:38,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:25:38,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2022-04-28 04:25:38,884 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 11 [2022-04-28 04:25:38,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:25:38,885 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2022-04-28 04:25:38,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:25:38,885 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 24 transitions. [2022-04-28 04:25:38,921 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:25:38,921 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-04-28 04:25:38,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 04:25:38,922 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:25:38,922 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:25:38,948 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:25:39,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:25:39,136 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:25:39,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:25:39,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1366100723, now seen corresponding path program 1 times [2022-04-28 04:25:39,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:25:39,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1406801819] [2022-04-28 04:25:43,228 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 3=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:25:43,231 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:25:43,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1447096565, now seen corresponding path program 1 times [2022-04-28 04:25:43,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:25:43,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588277467] [2022-04-28 04:25:43,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:25:43,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:25:43,250 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:25:43,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1315466613] [2022-04-28 04:25:43,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:25:43,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:25:43,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:25:43,252 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:25:43,286 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:25:43,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:25:43,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 04:25:44,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:25:44,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:25:49,126 INFO L272 TraceCheckUtils]: 0: Hoare triple {351#true} call ULTIMATE.init(); {351#true} is VALID [2022-04-28 04:25:49,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {351#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {351#true} is VALID [2022-04-28 04:25:49,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {351#true} assume true; {351#true} is VALID [2022-04-28 04:25:49,127 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {351#true} {351#true} #53#return; {351#true} is VALID [2022-04-28 04:25:49,127 INFO L272 TraceCheckUtils]: 4: Hoare triple {351#true} call #t~ret5 := main(); {351#true} is VALID [2022-04-28 04:25:49,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {351#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {371#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 04:25:49,130 INFO L290 TraceCheckUtils]: 6: Hoare triple {371#(and (= main_~x~0 0) (= main_~y~0 0))} [57] L26-2-->L27_primed: Formula: (let ((.cse2 (* (- 1) v_main_~c~0_8)) (.cse3 (* (- 1) v_main_~y~0_12)) (.cse1 (= (+ v_main_~y~0_13 (* v_main_~y~0_13 v_main_~y~0_13)) (* v_main_~x~0_13 2))) (.cse4 (= v_main_~x~0_13 v_main_~x~0_12)) (.cse5 (= v_main_~c~0_8 v_main_~c~0_7)) (.cse6 (= v_main_~y~0_13 v_main_~y~0_12))) (or (let ((.cse0 (div (+ v_main_~y~0_13 .cse3 1) (- 2)))) (and (<= 0 .cse0) (= (mod (+ v_main_~y~0_13 v_main_~y~0_12 1) 2) 0) (= v_main_~c~0_7 (+ v_main_~c~0_8 (* 2 .cse0) 1)) .cse1 (< .cse0 (+ (div (+ (- 1) v_main_~k~0_6 .cse2) 2) 1)) (= v_main_~x~0_12 (+ v_main_~x~0_13 v_main_~y~0_13 (* 2 (* .cse0 .cse0)) (* 2 (* v_main_~y~0_13 .cse0)) (* 3 .cse0) 1)))) (and .cse4 (= v_main_~k~0_6 v_main_~k~0_6) .cse5 .cse6) (let ((.cse7 (div (+ v_main_~y~0_13 .cse3) (- 2)))) (and (< 0 .cse7) .cse1 (= v_main_~x~0_12 (+ (* (* .cse7 .cse7) 2) v_main_~x~0_13 (* 2 (* v_main_~y~0_13 .cse7)) .cse7)) (= v_main_~c~0_7 (+ v_main_~c~0_8 (* 2 .cse7))) (= (mod (+ v_main_~y~0_13 v_main_~y~0_12) 2) 0) (< .cse7 (+ 2 (div (+ (- 2) v_main_~k~0_6 .cse2) 2))))) (and (or (not .cse1) (not (< v_main_~c~0_8 v_main_~k~0_6))) .cse4 .cse5 .cse6))) InVars {main_~y~0=v_main_~y~0_13, main_~c~0=v_main_~c~0_8, main_~x~0=v_main_~x~0_13, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_12, main_~c~0=v_main_~c~0_7, main_~x~0=v_main_~x~0_12, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {375#(or (and (= main_~x~0 0) (= main_~y~0 0)) (and (< 0 (div (* (- 1) main_~y~0) (- 2))) (= main_~x~0 (+ (div (* (- 1) main_~y~0) (- 2)) (* (* (div (* (- 1) main_~y~0) (- 2)) (div (* (- 1) main_~y~0) (- 2))) 2))) (= (mod main_~y~0 2) 0)) (and (= main_~x~0 (+ (* (* (div (+ (* (- 1) main_~y~0) 1) (- 2)) (div (+ (* (- 1) main_~y~0) 1) (- 2))) 2) (* 3 (div (+ (* (- 1) main_~y~0) 1) (- 2))) 1)) (= (mod (+ main_~y~0 1) 2) 0) (<= 0 (div (+ (* (- 1) main_~y~0) 1) (- 2)))))} is VALID [2022-04-28 04:25:49,131 INFO L290 TraceCheckUtils]: 7: Hoare triple {375#(or (and (= main_~x~0 0) (= main_~y~0 0)) (and (< 0 (div (* (- 1) main_~y~0) (- 2))) (= main_~x~0 (+ (div (* (- 1) main_~y~0) (- 2)) (* (* (div (* (- 1) main_~y~0) (- 2)) (div (* (- 1) main_~y~0) (- 2))) 2))) (= (mod main_~y~0 2) 0)) (and (= main_~x~0 (+ (* (* (div (+ (* (- 1) main_~y~0) 1) (- 2)) (div (+ (* (- 1) main_~y~0) 1) (- 2))) 2) (* 3 (div (+ (* (- 1) main_~y~0) 1) (- 2))) 1)) (= (mod (+ main_~y~0 1) 2) 0) (<= 0 (div (+ (* (- 1) main_~y~0) 1) (- 2)))))} [56] L27_primed-->L27: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {375#(or (and (= main_~x~0 0) (= main_~y~0 0)) (and (< 0 (div (* (- 1) main_~y~0) (- 2))) (= main_~x~0 (+ (div (* (- 1) main_~y~0) (- 2)) (* (* (div (* (- 1) main_~y~0) (- 2)) (div (* (- 1) main_~y~0) (- 2))) 2))) (= (mod main_~y~0 2) 0)) (and (= main_~x~0 (+ (* (* (div (+ (* (- 1) main_~y~0) 1) (- 2)) (div (+ (* (- 1) main_~y~0) 1) (- 2))) 2) (* 3 (div (+ (* (- 1) main_~y~0) 1) (- 2))) 1)) (= (mod (+ main_~y~0 1) 2) 0) (<= 0 (div (+ (* (- 1) main_~y~0) 1) (- 2)))))} is VALID [2022-04-28 04:25:49,906 INFO L272 TraceCheckUtils]: 8: Hoare triple {375#(or (and (= main_~x~0 0) (= main_~y~0 0)) (and (< 0 (div (* (- 1) main_~y~0) (- 2))) (= main_~x~0 (+ (div (* (- 1) main_~y~0) (- 2)) (* (* (div (* (- 1) main_~y~0) (- 2)) (div (* (- 1) main_~y~0) (- 2))) 2))) (= (mod main_~y~0 2) 0)) (and (= main_~x~0 (+ (* (* (div (+ (* (- 1) main_~y~0) 1) (- 2)) (div (+ (* (- 1) main_~y~0) 1) (- 2))) 2) (* 3 (div (+ (* (- 1) main_~y~0) 1) (- 2))) 1)) (= (mod (+ main_~y~0 1) 2) 0) (<= 0 (div (+ (* (- 1) main_~y~0) 1) (- 2)))))} call __VERIFIER_assert((if 0 == ~y~0 * ~y~0 - 2 * ~x~0 + ~y~0 then 1 else 0)); {382#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:25:49,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {382#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {386#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:25:49,912 INFO L290 TraceCheckUtils]: 10: Hoare triple {386#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {352#false} is VALID [2022-04-28 04:25:49,912 INFO L290 TraceCheckUtils]: 11: Hoare triple {352#false} assume !false; {352#false} is VALID [2022-04-28 04:25:49,913 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:25:49,913 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:25:49,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:25:49,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588277467] [2022-04-28 04:25:49,913 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:25:49,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315466613] [2022-04-28 04:25:49,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315466613] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:25:49,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:25:49,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 04:26:10,040 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_main_~y~0_16 Int) (v_main_~x~0_16 Int) (v___VERIFIER_assert_~cond_BEFORE_RETURN_2 Int)) (let ((.cse5 (= v___VERIFIER_assert_~cond_BEFORE_RETURN_2 0)) (.cse6 (= v___VERIFIER_assert_~cond_BEFORE_RETURN_2 1))) (and (let ((.cse1 (exists ((aux_mod_v_main_~c~0_BEFORE_RETURN_1_126 Int)) (and (<= 0 aux_mod_v_main_~c~0_BEFORE_RETURN_1_126) (< aux_mod_v_main_~c~0_BEFORE_RETURN_1_126 2)))) (.cse2 (* (- 1) v_main_~y~0_16))) (or (let ((.cse0 (div (+ .cse2 1) (- 2)))) (and (= v_main_~x~0_16 (+ (* .cse0 3) (* (* .cse0 .cse0) 2) 1)) (= (mod (+ v_main_~y~0_16 1) 2) 0) (exists ((aux_div_v_main_~c~0_BEFORE_RETURN_1_126 Int)) (< (div (+ (* (- 1) v_main_~y~0_16) 1) (- 2)) (+ aux_div_v_main_~c~0_BEFORE_RETURN_1_126 1))) .cse1 (<= 0 .cse0))) (and (= v_main_~y~0_16 0) (= v_main_~x~0_16 0)) (let ((.cse3 (div .cse2 (- 2)))) (and (exists ((aux_div_v_main_~c~0_BEFORE_RETURN_1_126 Int)) (< (div (* (- 1) v_main_~y~0_16) (- 2)) (+ 2 aux_div_v_main_~c~0_BEFORE_RETURN_1_126))) (< 0 .cse3) (= v_main_~x~0_16 (+ .cse3 (* 2 (* .cse3 .cse3)))) (= (mod v_main_~y~0_16 2) 0) .cse1)))) (let ((.cse4 (= (+ (* (- 2) c_main_~x~0) c_main_~y~0 (* c_main_~y~0 c_main_~y~0)) 0))) (or (and (not .cse4) .cse5) (and .cse6 .cse4))) (let ((.cse7 (= (+ v_main_~y~0_16 (* v_main_~x~0_16 (- 2)) (* v_main_~y~0_16 v_main_~y~0_16)) 0))) (or (and (not .cse7) .cse5) (and .cse6 .cse7)))))) is different from true [2022-04-28 04:26:13,811 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:26:13,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1406801819] [2022-04-28 04:26:13,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1406801819] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:26:13,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:26:13,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 04:26:13,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492322794] [2022-04-28 04:26:13,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:26:13,813 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-28 04:26:13,813 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:26:13,813 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:26:14,639 WARN L143 InductivityCheck]: Transition 395#(and (exists ((v_main_~y~0_16 Int) (v_main_~x~0_16 Int) (v___VERIFIER_assert_~cond_BEFORE_RETURN_2 Int)) (and (or (and (not (= (+ v_main_~y~0_16 (* v_main_~x~0_16 (- 2)) (* v_main_~y~0_16 v_main_~y~0_16)) 0)) (= v___VERIFIER_assert_~cond_BEFORE_RETURN_2 0)) (and (= v___VERIFIER_assert_~cond_BEFORE_RETURN_2 1) (= (+ v_main_~y~0_16 (* v_main_~x~0_16 (- 2)) (* v_main_~y~0_16 v_main_~y~0_16)) 0))) (or (and (< 0 (div (* (- 1) v_main_~y~0_16) (- 2))) (= v_main_~x~0_16 (+ (div (* (- 1) v_main_~y~0_16) (- 2)) (* 2 (* (div (* (- 1) v_main_~y~0_16) (- 2)) (div (* (- 1) v_main_~y~0_16) (- 2)))))) (= (mod v_main_~y~0_16 2) 0)) (and (= v_main_~y~0_16 0) (= v_main_~x~0_16 0)) (and (= v_main_~x~0_16 (+ (* (div (+ (* (- 1) v_main_~y~0_16) 1) (- 2)) 3) (* (* (div (+ (* (- 1) v_main_~y~0_16) 1) (- 2)) (div (+ (* (- 1) v_main_~y~0_16) 1) (- 2))) 2) 1)) (= (mod (+ v_main_~y~0_16 1) 2) 0) (<= 0 (div (+ (* (- 1) v_main_~y~0_16) 1) (- 2))))) (or (and (= (+ (- 1) (* (- 2) main_~x~0) (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (* main_~y~0 3)) 0) (= v___VERIFIER_assert_~cond_BEFORE_RETURN_2 1)) (and (not (= (+ (- 1) (* (- 2) main_~x~0) (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (* main_~y~0 3)) 0)) (= v___VERIFIER_assert_~cond_BEFORE_RETURN_2 0))))) (< main_~c~0 (+ main_~k~0 1))) ( _ , assume !false; , 375#(or (and (= main_~x~0 0) (= main_~y~0 0)) (and (< 0 (div (* (- 1) main_~y~0) (- 2))) (= main_~x~0 (+ (div (* (- 1) main_~y~0) (- 2)) (* (* (div (* (- 1) main_~y~0) (- 2)) (div (* (- 1) main_~y~0) (- 2))) 2))) (= (mod main_~y~0 2) 0)) (and (= main_~x~0 (+ (* (* (div (+ (* (- 1) main_~y~0) 1) (- 2)) (div (+ (* (- 1) main_~y~0) 1) (- 2))) 2) (* 3 (div (+ (* (- 1) main_~y~0) 1) (- 2))) 1)) (= (mod (+ main_~y~0 1) 2) 0) (<= 0 (div (+ (* (- 1) main_~y~0) 1) (- 2))))) ) not inductive [2022-04-28 04:26:14,646 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:26:14,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-28 04:26:14,841 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:103) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:335) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.constructRefinementAutomaton(AbstractCegarLoop.java:564) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:437) 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:26:14,844 INFO L158 Benchmark]: Toolchain (without parser) took 37628.48ms. Allocated memory was 175.1MB in the beginning and 210.8MB in the end (delta: 35.7MB). Free memory was 128.5MB in the beginning and 174.0MB in the end (delta: -45.5MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 04:26:14,844 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 175.1MB. Free memory is still 144.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 04:26:14,845 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.38ms. Allocated memory is still 175.1MB. Free memory was 128.4MB in the beginning and 152.7MB in the end (delta: -24.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 04:26:14,845 INFO L158 Benchmark]: Boogie Preprocessor took 40.31ms. Allocated memory is still 175.1MB. Free memory was 152.7MB in the beginning and 151.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 04:26:14,846 INFO L158 Benchmark]: RCFGBuilder took 281.88ms. Allocated memory is still 175.1MB. Free memory was 150.9MB in the beginning and 140.8MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 04:26:14,846 INFO L158 Benchmark]: TraceAbstraction took 37076.72ms. Allocated memory was 175.1MB in the beginning and 210.8MB in the end (delta: 35.7MB). Free memory was 140.4MB in the beginning and 174.0MB in the end (delta: -33.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-04-28 04:26:14,848 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 175.1MB. Free memory is still 144.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 209.38ms. Allocated memory is still 175.1MB. Free memory was 128.4MB in the beginning and 152.7MB in the end (delta: -24.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.31ms. Allocated memory is still 175.1MB. Free memory was 152.7MB in the beginning and 151.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 281.88ms. Allocated memory is still 175.1MB. Free memory was 150.9MB in the beginning and 140.8MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 37076.72ms. Allocated memory was 175.1MB in the beginning and 210.8MB in the end (delta: 35.7MB). Free memory was 140.4MB in the beginning and 174.0MB in the end (delta: -33.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-28 04:26:15,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...