/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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 14:17:38,735 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 14:17:38,736 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 14:17:38,793 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 14:17:38,793 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 14:17:38,794 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 14:17:38,796 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 14:17:38,800 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 14:17:38,802 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 14:17:38,802 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 14:17:38,803 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 14:17:38,804 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 14:17:38,804 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 14:17:38,805 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 14:17:38,806 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 14:17:38,806 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 14:17:38,807 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 14:17:38,807 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 14:17:38,809 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 14:17:38,810 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 14:17:38,811 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 14:17:38,813 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 14:17:38,814 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 14:17:38,815 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 14:17:38,815 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 14:17:38,817 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 14:17:38,817 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 14:17:38,818 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 14:17:38,818 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 14:17:38,818 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 14:17:38,819 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 14:17:38,819 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 14:17:38,820 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 14:17:38,820 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 14:17:38,821 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 14:17:38,822 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 14:17:38,822 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 14:17:38,822 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 14:17:38,823 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 14:17:38,823 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 14:17:38,824 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 14:17:38,831 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 14:17:38,832 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 14:17:38,843 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 14:17:38,844 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 14:17:38,845 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 14:17:38,845 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 14:17:38,845 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 14:17:38,845 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 14:17:38,845 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 14:17:38,845 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 14:17:38,845 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 14:17:38,845 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 14:17:38,845 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 14:17:38,846 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 14:17:38,846 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 14:17:38,846 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 14:17:38,846 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 14:17:38,846 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 14:17:38,846 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 14:17:38,846 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 14:17:38,846 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 14:17:38,847 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 14:17:38,847 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 14:17:38,847 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 14:17:38,847 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-08 14:17:39,058 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 14:17:39,080 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 14:17:39,082 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 14:17:39,082 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 14:17:39,083 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 14:17:39,084 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound1.c [2022-04-08 14:17:39,136 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf70f94b4/c78f1e0105c74702a5c05f5fb97b9e68/FLAG4fdd96e09 [2022-04-08 14:17:39,477 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 14:17:39,477 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound1.c [2022-04-08 14:17:39,484 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf70f94b4/c78f1e0105c74702a5c05f5fb97b9e68/FLAG4fdd96e09 [2022-04-08 14:17:39,899 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf70f94b4/c78f1e0105c74702a5c05f5fb97b9e68 [2022-04-08 14:17:39,901 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 14:17:39,902 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 14:17:39,903 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 14:17:39,903 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 14:17:39,905 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 14:17:39,906 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:17:39" (1/1) ... [2022-04-08 14:17:39,907 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c521617 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:17:39, skipping insertion in model container [2022-04-08 14:17:39,907 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:17:39" (1/1) ... [2022-04-08 14:17:39,913 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 14:17:39,923 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 14:17:40,115 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound1.c[458,471] [2022-04-08 14:17:40,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 14:17:40,161 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 14:17:40,174 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound1.c[458,471] [2022-04-08 14:17:40,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 14:17:40,190 INFO L208 MainTranslator]: Completed translation [2022-04-08 14:17:40,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:17:40 WrapperNode [2022-04-08 14:17:40,190 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 14:17:40,191 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 14:17:40,191 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 14:17:40,191 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 14:17:40,201 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:17:40" (1/1) ... [2022-04-08 14:17:40,201 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:17:40" (1/1) ... [2022-04-08 14:17:40,206 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:17:40" (1/1) ... [2022-04-08 14:17:40,206 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:17:40" (1/1) ... [2022-04-08 14:17:40,210 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:17:40" (1/1) ... [2022-04-08 14:17:40,217 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:17:40" (1/1) ... [2022-04-08 14:17:40,218 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:17:40" (1/1) ... [2022-04-08 14:17:40,219 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 14:17:40,220 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 14:17:40,220 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 14:17:40,220 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 14:17:40,222 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:17:40" (1/1) ... [2022-04-08 14:17:40,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 14:17:40,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:17:40,244 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-08 14:17:40,251 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-08 14:17:40,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 14:17:40,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 14:17:40,280 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 14:17:40,280 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 14:17:40,280 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 14:17:40,280 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 14:17:40,280 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 14:17:40,280 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 14:17:40,280 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 14:17:40,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 14:17:40,280 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-08 14:17:40,281 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 14:17:40,281 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 14:17:40,281 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 14:17:40,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 14:17:40,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 14:17:40,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 14:17:40,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 14:17:40,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 14:17:40,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 14:17:40,324 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 14:17:40,325 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 14:17:40,434 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 14:17:40,440 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 14:17:40,440 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 14:17:40,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:17:40 BoogieIcfgContainer [2022-04-08 14:17:40,442 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 14:17:40,443 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 14:17:40,443 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 14:17:40,446 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 14:17:40,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 02:17:39" (1/3) ... [2022-04-08 14:17:40,447 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50799b68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:17:40, skipping insertion in model container [2022-04-08 14:17:40,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:17:40" (2/3) ... [2022-04-08 14:17:40,447 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50799b68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:17:40, skipping insertion in model container [2022-04-08 14:17:40,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:17:40" (3/3) ... [2022-04-08 14:17:40,448 INFO L111 eAbstractionObserver]: Analyzing ICFG ps4-ll_valuebound1.c [2022-04-08 14:17:40,452 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 14:17:40,452 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 14:17:40,485 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 14:17:40,491 INFO L340 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 [2022-04-08 14:17:40,491 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 14:17:40,524 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:17:40,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 14:17:40,529 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:17:40,530 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:17:40,530 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:17:40,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:17:40,534 INFO L85 PathProgramCache]: Analyzing trace with hash -630235283, now seen corresponding path program 1 times [2022-04-08 14:17:40,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:17:40,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [456686313] [2022-04-08 14:17:40,557 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:17:40,557 INFO L85 PathProgramCache]: Analyzing trace with hash -630235283, now seen corresponding path program 2 times [2022-04-08 14:17:40,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:17:40,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383854487] [2022-04-08 14:17:40,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:17:40,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:17:40,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:17:40,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:17:40,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:17:40,706 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#(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); {31#true} is VALID [2022-04-08 14:17:40,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-08 14:17:40,707 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #60#return; {31#true} is VALID [2022-04-08 14:17:40,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 14:17:40,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:17:40,715 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-04-08 14:17:40,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-04-08 14:17:40,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#false} assume true; {32#false} is VALID [2022-04-08 14:17:40,717 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#false} {31#true} #52#return; {32#false} is VALID [2022-04-08 14:17:40,718 INFO L272 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {40#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:17:40,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#(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); {31#true} is VALID [2022-04-08 14:17:40,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-08 14:17:40,718 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #60#return; {31#true} is VALID [2022-04-08 14:17:40,719 INFO L272 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret5 := main(); {31#true} is VALID [2022-04-08 14:17:40,719 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {31#true} is VALID [2022-04-08 14:17:40,719 INFO L272 TraceCheckUtils]: 6: Hoare triple {31#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 1 then 1 else 0)); {31#true} is VALID [2022-04-08 14:17:40,719 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-04-08 14:17:40,720 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-04-08 14:17:40,720 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#false} assume true; {32#false} is VALID [2022-04-08 14:17:40,721 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {32#false} {31#true} #52#return; {32#false} is VALID [2022-04-08 14:17:40,721 INFO L290 TraceCheckUtils]: 11: Hoare triple {32#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {32#false} is VALID [2022-04-08 14:17:40,721 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#false} assume false; {32#false} is VALID [2022-04-08 14:17:40,721 INFO L272 TraceCheckUtils]: 13: Hoare triple {32#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {32#false} is VALID [2022-04-08 14:17:40,721 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2022-04-08 14:17:40,722 INFO L290 TraceCheckUtils]: 15: Hoare triple {32#false} assume 0 == ~cond; {32#false} is VALID [2022-04-08 14:17:40,722 INFO L290 TraceCheckUtils]: 16: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-04-08 14:17:40,722 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-08 14:17:40,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:17:40,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383854487] [2022-04-08 14:17:40,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383854487] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:17:40,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:17:40,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 14:17:40,726 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:17:40,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [456686313] [2022-04-08 14:17:40,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [456686313] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:17:40,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:17:40,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 14:17:40,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983808090] [2022-04-08 14:17:40,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:17:40,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-08 14:17:40,733 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:17:40,736 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 14:17:40,768 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-08 14:17:40,768 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 14:17:40,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:17:40,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 14:17:40,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 14:17:40,797 INFO L87 Difference]: Start difference. First operand has 28 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 14:17:40,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:17:40,960 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2022-04-08 14:17:40,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 14:17:40,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-08 14:17:40,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:17:40,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 14:17:40,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-04-08 14:17:40,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 14:17:40,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-04-08 14:17:40,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2022-04-08 14:17:41,076 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-08 14:17:41,086 INFO L225 Difference]: With dead ends: 47 [2022-04-08 14:17:41,087 INFO L226 Difference]: Without dead ends: 23 [2022-04-08 14:17:41,089 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 14:17:41,093 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:17:41,095 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 29 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:17:41,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-08 14:17:41,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-08 14:17:41,127 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:17:41,127 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:17:41,128 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:17:41,129 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:17:41,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:17:41,139 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-08 14:17:41,139 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-08 14:17:41,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:17:41,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:17:41,140 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 23 states. [2022-04-08 14:17:41,141 INFO L87 Difference]: Start difference. First operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 23 states. [2022-04-08 14:17:41,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:17:41,144 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-08 14:17:41,144 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-08 14:17:41,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:17:41,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:17:41,148 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:17:41,148 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:17:41,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:17:41,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-04-08 14:17:41,156 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 17 [2022-04-08 14:17:41,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:17:41,157 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-04-08 14:17:41,157 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 14:17:41,157 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 25 transitions. [2022-04-08 14:17:41,189 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:17:41,190 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-08 14:17:41,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 14:17:41,191 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:17:41,191 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:17:41,192 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 14:17:41,192 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:17:41,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:17:41,194 INFO L85 PathProgramCache]: Analyzing trace with hash 51610547, now seen corresponding path program 1 times [2022-04-08 14:17:41,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:17:41,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [492103827] [2022-04-08 14:17:41,198 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:17:41,198 INFO L85 PathProgramCache]: Analyzing trace with hash 51610547, now seen corresponding path program 2 times [2022-04-08 14:17:41,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:17:41,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355791680] [2022-04-08 14:17:41,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:17:41,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:17:41,219 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:17:41,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [330427549] [2022-04-08 14:17:41,219 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:17:41,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:17:41,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:17:41,221 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-08 14:17:41,227 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-08 14:17:41,264 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 14:17:41,265 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:17:41,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 14:17:41,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:17:41,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:17:41,448 INFO L272 TraceCheckUtils]: 0: Hoare triple {229#true} call ULTIMATE.init(); {229#true} is VALID [2022-04-08 14:17:41,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {229#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); {229#true} is VALID [2022-04-08 14:17:41,448 INFO L290 TraceCheckUtils]: 2: Hoare triple {229#true} assume true; {229#true} is VALID [2022-04-08 14:17:41,449 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {229#true} {229#true} #60#return; {229#true} is VALID [2022-04-08 14:17:41,449 INFO L272 TraceCheckUtils]: 4: Hoare triple {229#true} call #t~ret5 := main(); {229#true} is VALID [2022-04-08 14:17:41,449 INFO L290 TraceCheckUtils]: 5: Hoare triple {229#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {229#true} is VALID [2022-04-08 14:17:41,449 INFO L272 TraceCheckUtils]: 6: Hoare triple {229#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 1 then 1 else 0)); {229#true} is VALID [2022-04-08 14:17:41,450 INFO L290 TraceCheckUtils]: 7: Hoare triple {229#true} ~cond := #in~cond; {229#true} is VALID [2022-04-08 14:17:41,450 INFO L290 TraceCheckUtils]: 8: Hoare triple {229#true} assume !(0 == ~cond); {229#true} is VALID [2022-04-08 14:17:41,450 INFO L290 TraceCheckUtils]: 9: Hoare triple {229#true} assume true; {229#true} is VALID [2022-04-08 14:17:41,450 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {229#true} {229#true} #52#return; {229#true} is VALID [2022-04-08 14:17:41,451 INFO L290 TraceCheckUtils]: 11: Hoare triple {229#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {267#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:17:41,452 INFO L290 TraceCheckUtils]: 12: Hoare triple {267#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {267#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:17:41,453 INFO L272 TraceCheckUtils]: 13: Hoare triple {267#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {274#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:17:41,453 INFO L290 TraceCheckUtils]: 14: Hoare triple {274#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {278#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:17:41,454 INFO L290 TraceCheckUtils]: 15: Hoare triple {278#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {230#false} is VALID [2022-04-08 14:17:41,454 INFO L290 TraceCheckUtils]: 16: Hoare triple {230#false} assume !false; {230#false} is VALID [2022-04-08 14:17:41,454 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-08 14:17:41,455 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 14:17:41,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:17:41,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355791680] [2022-04-08 14:17:41,455 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:17:41,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330427549] [2022-04-08 14:17:41,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330427549] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:17:41,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:17:41,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:17:41,457 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:17:41,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [492103827] [2022-04-08 14:17:41,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [492103827] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:17:41,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:17:41,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:17:41,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645215672] [2022-04-08 14:17:41,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:17:41,458 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-08 14:17:41,459 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:17:41,459 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 14:17:41,474 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-08 14:17:41,474 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 14:17:41,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:17:41,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 14:17:41,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:17:41,475 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 14:17:41,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:17:41,838 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-08 14:17:41,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 14:17:41,839 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-08 14:17:41,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:17:41,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 14:17:41,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-08 14:17:41,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 14:17:41,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-08 14:17:41,843 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2022-04-08 14:17:41,881 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-08 14:17:41,882 INFO L225 Difference]: With dead ends: 34 [2022-04-08 14:17:41,883 INFO L226 Difference]: Without dead ends: 30 [2022-04-08 14:17:41,883 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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-08 14:17:41,884 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:17:41,885 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 77 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:17:41,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-08 14:17:41,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-08 14:17:41,898 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:17:41,899 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:17:41,899 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:17:41,899 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:17:41,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:17:41,903 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-08 14:17:41,904 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-08 14:17:41,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:17:41,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:17:41,905 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 30 states. [2022-04-08 14:17:41,906 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 30 states. [2022-04-08 14:17:41,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:17:41,909 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-08 14:17:41,909 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-08 14:17:41,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:17:41,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:17:41,911 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:17:41,911 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:17:41,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:17:41,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-04-08 14:17:41,915 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 17 [2022-04-08 14:17:41,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:17:41,915 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-04-08 14:17:41,916 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 14:17:41,916 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 32 transitions. [2022-04-08 14:17:41,955 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:17:41,955 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-08 14:17:41,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 14:17:41,956 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:17:41,956 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:17:41,982 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-08 14:17:42,174 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:17:42,174 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:17:42,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:17:42,175 INFO L85 PathProgramCache]: Analyzing trace with hash 311787922, now seen corresponding path program 1 times [2022-04-08 14:17:42,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:17:42,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [429009718] [2022-04-08 14:17:42,381 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:17:42,381 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:17:42,381 INFO L85 PathProgramCache]: Analyzing trace with hash 311787922, now seen corresponding path program 2 times [2022-04-08 14:17:42,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:17:42,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811018973] [2022-04-08 14:17:42,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:17:42,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:17:42,397 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:17:42,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1921709188] [2022-04-08 14:17:42,397 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:17:42,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:17:42,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:17:42,399 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-08 14:17:42,400 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-08 14:17:42,440 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:17:42,440 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:17:42,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 14:17:42,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:17:42,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:17:42,564 INFO L272 TraceCheckUtils]: 0: Hoare triple {474#true} call ULTIMATE.init(); {474#true} is VALID [2022-04-08 14:17:42,565 INFO L290 TraceCheckUtils]: 1: Hoare triple {474#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); {474#true} is VALID [2022-04-08 14:17:42,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-08 14:17:42,565 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {474#true} {474#true} #60#return; {474#true} is VALID [2022-04-08 14:17:42,565 INFO L272 TraceCheckUtils]: 4: Hoare triple {474#true} call #t~ret5 := main(); {474#true} is VALID [2022-04-08 14:17:42,566 INFO L290 TraceCheckUtils]: 5: Hoare triple {474#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {474#true} is VALID [2022-04-08 14:17:42,566 INFO L272 TraceCheckUtils]: 6: Hoare triple {474#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 1 then 1 else 0)); {474#true} is VALID [2022-04-08 14:17:42,566 INFO L290 TraceCheckUtils]: 7: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-08 14:17:42,566 INFO L290 TraceCheckUtils]: 8: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-08 14:17:42,566 INFO L290 TraceCheckUtils]: 9: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-08 14:17:42,567 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {474#true} {474#true} #52#return; {474#true} is VALID [2022-04-08 14:17:42,567 INFO L290 TraceCheckUtils]: 11: Hoare triple {474#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {512#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:17:42,568 INFO L290 TraceCheckUtils]: 12: Hoare triple {512#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {512#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:17:42,568 INFO L272 TraceCheckUtils]: 13: Hoare triple {512#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {474#true} is VALID [2022-04-08 14:17:42,568 INFO L290 TraceCheckUtils]: 14: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-08 14:17:42,568 INFO L290 TraceCheckUtils]: 15: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-08 14:17:42,568 INFO L290 TraceCheckUtils]: 16: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-08 14:17:42,569 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {474#true} {512#(and (= main_~x~0 0) (= main_~y~0 0))} #54#return; {512#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:17:42,570 INFO L290 TraceCheckUtils]: 18: Hoare triple {512#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {534#(and (= main_~y~0 1) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} is VALID [2022-04-08 14:17:42,570 INFO L290 TraceCheckUtils]: 19: Hoare triple {534#(and (= main_~y~0 1) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} assume !false; {534#(and (= main_~y~0 1) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} is VALID [2022-04-08 14:17:42,571 INFO L272 TraceCheckUtils]: 20: Hoare triple {534#(and (= main_~y~0 1) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {541#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:17:42,572 INFO L290 TraceCheckUtils]: 21: Hoare triple {541#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {545#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:17:42,572 INFO L290 TraceCheckUtils]: 22: Hoare triple {545#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {475#false} is VALID [2022-04-08 14:17:42,572 INFO L290 TraceCheckUtils]: 23: Hoare triple {475#false} assume !false; {475#false} is VALID [2022-04-08 14:17:42,573 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:17:42,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:17:42,744 INFO L290 TraceCheckUtils]: 23: Hoare triple {475#false} assume !false; {475#false} is VALID [2022-04-08 14:17:42,745 INFO L290 TraceCheckUtils]: 22: Hoare triple {545#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {475#false} is VALID [2022-04-08 14:17:42,745 INFO L290 TraceCheckUtils]: 21: Hoare triple {541#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {545#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:17:42,746 INFO L272 TraceCheckUtils]: 20: Hoare triple {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {541#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:17:42,747 INFO L290 TraceCheckUtils]: 19: Hoare triple {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !false; {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-08 14:17:42,755 INFO L290 TraceCheckUtils]: 18: Hoare triple {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-08 14:17:42,756 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {474#true} {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} #54#return; {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-08 14:17:42,756 INFO L290 TraceCheckUtils]: 16: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-08 14:17:42,756 INFO L290 TraceCheckUtils]: 15: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-08 14:17:42,756 INFO L290 TraceCheckUtils]: 14: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-08 14:17:42,757 INFO L272 TraceCheckUtils]: 13: Hoare triple {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {474#true} is VALID [2022-04-08 14:17:42,757 INFO L290 TraceCheckUtils]: 12: Hoare triple {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !false; {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-08 14:17:42,758 INFO L290 TraceCheckUtils]: 11: Hoare triple {474#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-08 14:17:42,758 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {474#true} {474#true} #52#return; {474#true} is VALID [2022-04-08 14:17:42,758 INFO L290 TraceCheckUtils]: 9: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-08 14:17:42,758 INFO L290 TraceCheckUtils]: 8: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-08 14:17:42,758 INFO L290 TraceCheckUtils]: 7: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-08 14:17:42,759 INFO L272 TraceCheckUtils]: 6: Hoare triple {474#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 1 then 1 else 0)); {474#true} is VALID [2022-04-08 14:17:42,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {474#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {474#true} is VALID [2022-04-08 14:17:42,759 INFO L272 TraceCheckUtils]: 4: Hoare triple {474#true} call #t~ret5 := main(); {474#true} is VALID [2022-04-08 14:17:42,759 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {474#true} {474#true} #60#return; {474#true} is VALID [2022-04-08 14:17:42,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-08 14:17:42,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {474#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); {474#true} is VALID [2022-04-08 14:17:42,760 INFO L272 TraceCheckUtils]: 0: Hoare triple {474#true} call ULTIMATE.init(); {474#true} is VALID [2022-04-08 14:17:42,760 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 14:17:42,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:17:42,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811018973] [2022-04-08 14:17:42,761 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:17:42,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921709188] [2022-04-08 14:17:42,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921709188] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 14:17:42,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:17:42,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-08 14:17:42,761 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:17:42,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [429009718] [2022-04-08 14:17:42,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [429009718] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:17:42,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:17:42,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:17:42,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947440597] [2022-04-08 14:17:42,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:17:42,763 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (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 24 [2022-04-08 14:17:42,763 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:17:42,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (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-08 14:17:42,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:17:42,796 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 14:17:42,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:17:42,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 14:17:42,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 14:17:42,797 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (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-08 14:17:42,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:17:42,909 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2022-04-08 14:17:42,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 14:17:42,909 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (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 24 [2022-04-08 14:17:42,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:17:42,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (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-08 14:17:42,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-08 14:17:42,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (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-08 14:17:42,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-08 14:17:42,912 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 30 transitions. [2022-04-08 14:17:42,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:17:42,948 INFO L225 Difference]: With dead ends: 36 [2022-04-08 14:17:42,948 INFO L226 Difference]: Without dead ends: 31 [2022-04-08 14:17:42,949 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-08 14:17:42,950 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:17:42,950 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 70 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:17:42,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-08 14:17:42,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-08 14:17:42,963 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:17:42,964 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:17:42,964 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:17:42,964 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:17:42,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:17:42,966 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-08 14:17:42,966 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-08 14:17:42,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:17:42,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:17:42,967 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 31 states. [2022-04-08 14:17:42,967 INFO L87 Difference]: Start difference. First operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 31 states. [2022-04-08 14:17:42,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:17:42,968 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-08 14:17:42,968 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-08 14:17:42,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:17:42,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:17:42,969 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:17:42,969 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:17:42,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:17:42,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-04-08 14:17:42,970 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 24 [2022-04-08 14:17:42,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:17:42,971 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-04-08 14:17:42,971 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (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-08 14:17:42,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 31 transitions. [2022-04-08 14:17:43,015 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:17:43,015 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-08 14:17:43,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 14:17:43,016 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:17:43,016 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:17:43,037 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-08 14:17:43,217 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-08 14:17:43,217 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:17:43,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:17:43,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1417466424, now seen corresponding path program 1 times [2022-04-08 14:17:43,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:17:43,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [548502082] [2022-04-08 14:17:43,323 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:17:43,324 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:17:43,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1417466424, now seen corresponding path program 2 times [2022-04-08 14:17:43,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:17:43,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730712987] [2022-04-08 14:17:43,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:17:43,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:17:43,347 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:17:43,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1183090938] [2022-04-08 14:17:43,347 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:17:43,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:17:43,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:17:43,350 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-08 14:17:43,352 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-08 14:17:43,388 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:17:43,389 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:17:43,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 14:17:43,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:17:43,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:17:43,662 INFO L272 TraceCheckUtils]: 0: Hoare triple {822#true} call ULTIMATE.init(); {822#true} is VALID [2022-04-08 14:17:43,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {822#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); {822#true} is VALID [2022-04-08 14:17:43,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-08 14:17:43,663 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {822#true} {822#true} #60#return; {822#true} is VALID [2022-04-08 14:17:43,663 INFO L272 TraceCheckUtils]: 4: Hoare triple {822#true} call #t~ret5 := main(); {822#true} is VALID [2022-04-08 14:17:43,663 INFO L290 TraceCheckUtils]: 5: Hoare triple {822#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {822#true} is VALID [2022-04-08 14:17:43,663 INFO L272 TraceCheckUtils]: 6: Hoare triple {822#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 1 then 1 else 0)); {822#true} is VALID [2022-04-08 14:17:43,664 INFO L290 TraceCheckUtils]: 7: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-08 14:17:43,664 INFO L290 TraceCheckUtils]: 8: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-08 14:17:43,664 INFO L290 TraceCheckUtils]: 9: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-08 14:17:43,664 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {822#true} {822#true} #52#return; {822#true} is VALID [2022-04-08 14:17:43,665 INFO L290 TraceCheckUtils]: 11: Hoare triple {822#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {860#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:17:43,668 INFO L290 TraceCheckUtils]: 12: Hoare triple {860#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {860#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:17:43,668 INFO L272 TraceCheckUtils]: 13: Hoare triple {860#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {822#true} is VALID [2022-04-08 14:17:43,668 INFO L290 TraceCheckUtils]: 14: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-08 14:17:43,668 INFO L290 TraceCheckUtils]: 15: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-08 14:17:43,668 INFO L290 TraceCheckUtils]: 16: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-08 14:17:43,669 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {822#true} {860#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {860#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:17:43,670 INFO L290 TraceCheckUtils]: 18: Hoare triple {860#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 14:17:43,671 INFO L290 TraceCheckUtils]: 19: Hoare triple {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !false; {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 14:17:43,672 INFO L272 TraceCheckUtils]: 20: Hoare triple {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {822#true} is VALID [2022-04-08 14:17:43,672 INFO L290 TraceCheckUtils]: 21: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-08 14:17:43,673 INFO L290 TraceCheckUtils]: 22: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-08 14:17:43,673 INFO L290 TraceCheckUtils]: 23: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-08 14:17:43,683 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {822#true} {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #54#return; {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 14:17:43,684 INFO L290 TraceCheckUtils]: 25: Hoare triple {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {904#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-08 14:17:43,685 INFO L272 TraceCheckUtils]: 26: Hoare triple {904#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {908#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:17:43,685 INFO L290 TraceCheckUtils]: 27: Hoare triple {908#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {912#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:17:43,685 INFO L290 TraceCheckUtils]: 28: Hoare triple {912#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {823#false} is VALID [2022-04-08 14:17:43,686 INFO L290 TraceCheckUtils]: 29: Hoare triple {823#false} assume !false; {823#false} is VALID [2022-04-08 14:17:43,686 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 14:17:43,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:17:43,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:17:43,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730712987] [2022-04-08 14:17:43,985 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:17:43,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183090938] [2022-04-08 14:17:43,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183090938] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:17:43,985 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:17:43,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-08 14:17:43,985 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:17:43,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [548502082] [2022-04-08 14:17:43,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [548502082] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:17:43,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:17:43,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 14:17:43,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885005477] [2022-04-08 14:17:43,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:17:43,986 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2022-04-08 14:17:43,987 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:17:43,987 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 14:17:44,013 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:17:44,013 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 14:17:44,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:17:44,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 14:17:44,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-08 14:17:44,015 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 14:17:44,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:17:44,228 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2022-04-08 14:17:44,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 14:17:44,228 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2022-04-08 14:17:44,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:17:44,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 14:17:44,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-08 14:17:44,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 14:17:44,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-08 14:17:44,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 36 transitions. [2022-04-08 14:17:44,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:17:44,263 INFO L225 Difference]: With dead ends: 39 [2022-04-08 14:17:44,263 INFO L226 Difference]: Without dead ends: 34 [2022-04-08 14:17:44,263 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-08 14:17:44,264 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:17:44,264 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 115 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:17:44,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-08 14:17:44,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-08 14:17:44,284 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:17:44,285 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:17:44,285 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:17:44,285 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:17:44,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:17:44,287 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-04-08 14:17:44,287 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-08 14:17:44,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:17:44,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:17:44,288 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 34 states. [2022-04-08 14:17:44,288 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 34 states. [2022-04-08 14:17:44,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:17:44,289 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-04-08 14:17:44,289 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-08 14:17:44,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:17:44,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:17:44,290 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:17:44,290 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:17:44,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:17:44,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2022-04-08 14:17:44,291 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 30 [2022-04-08 14:17:44,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:17:44,292 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2022-04-08 14:17:44,292 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 14:17:44,292 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 35 transitions. [2022-04-08 14:17:44,337 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-08 14:17:44,338 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-08 14:17:44,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-08 14:17:44,338 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:17:44,338 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:17:44,364 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-08 14:17:44,547 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:17:44,548 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:17:44,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:17:44,548 INFO L85 PathProgramCache]: Analyzing trace with hash -2045316535, now seen corresponding path program 3 times [2022-04-08 14:17:44,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:17:44,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [370101012] [2022-04-08 14:17:44,649 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:17:44,649 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:17:44,649 INFO L85 PathProgramCache]: Analyzing trace with hash -2045316535, now seen corresponding path program 4 times [2022-04-08 14:17:44,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:17:44,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956256500] [2022-04-08 14:17:44,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:17:44,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:17:44,661 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:17:44,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [591462421] [2022-04-08 14:17:44,661 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:17:44,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:17:44,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:17:44,662 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-08 14:17:44,688 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-08 14:17:44,711 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:17:44,712 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:17:44,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 14:17:44,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:17:44,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:17:44,940 INFO L272 TraceCheckUtils]: 0: Hoare triple {1178#true} call ULTIMATE.init(); {1178#true} is VALID [2022-04-08 14:17:44,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {1178#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); {1178#true} is VALID [2022-04-08 14:17:44,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-08 14:17:44,940 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1178#true} {1178#true} #60#return; {1178#true} is VALID [2022-04-08 14:17:44,940 INFO L272 TraceCheckUtils]: 4: Hoare triple {1178#true} call #t~ret5 := main(); {1178#true} is VALID [2022-04-08 14:17:44,941 INFO L290 TraceCheckUtils]: 5: Hoare triple {1178#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1178#true} is VALID [2022-04-08 14:17:44,941 INFO L272 TraceCheckUtils]: 6: Hoare triple {1178#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 1 then 1 else 0)); {1178#true} is VALID [2022-04-08 14:17:44,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {1178#true} ~cond := #in~cond; {1204#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 14:17:44,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {1204#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1208#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 14:17:44,942 INFO L290 TraceCheckUtils]: 9: Hoare triple {1208#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1208#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 14:17:44,943 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1208#(not (= |assume_abort_if_not_#in~cond| 0))} {1178#true} #52#return; {1215#(and (<= 0 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-08 14:17:44,943 INFO L290 TraceCheckUtils]: 11: Hoare triple {1215#(and (<= 0 main_~k~0) (<= main_~k~0 1))} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1219#(and (<= 0 main_~k~0) (<= main_~k~0 1) (<= 0 main_~c~0))} is VALID [2022-04-08 14:17:44,944 INFO L290 TraceCheckUtils]: 12: Hoare triple {1219#(and (<= 0 main_~k~0) (<= main_~k~0 1) (<= 0 main_~c~0))} assume !false; {1219#(and (<= 0 main_~k~0) (<= main_~k~0 1) (<= 0 main_~c~0))} is VALID [2022-04-08 14:17:44,944 INFO L272 TraceCheckUtils]: 13: Hoare triple {1219#(and (<= 0 main_~k~0) (<= main_~k~0 1) (<= 0 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1178#true} is VALID [2022-04-08 14:17:44,944 INFO L290 TraceCheckUtils]: 14: Hoare triple {1178#true} ~cond := #in~cond; {1178#true} is VALID [2022-04-08 14:17:44,944 INFO L290 TraceCheckUtils]: 15: Hoare triple {1178#true} assume !(0 == ~cond); {1178#true} is VALID [2022-04-08 14:17:44,944 INFO L290 TraceCheckUtils]: 16: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-08 14:17:44,945 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1178#true} {1219#(and (<= 0 main_~k~0) (<= main_~k~0 1) (<= 0 main_~c~0))} #54#return; {1219#(and (<= 0 main_~k~0) (<= main_~k~0 1) (<= 0 main_~c~0))} is VALID [2022-04-08 14:17:44,946 INFO L290 TraceCheckUtils]: 18: Hoare triple {1219#(and (<= 0 main_~k~0) (<= main_~k~0 1) (<= 0 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1241#(and (<= 1 main_~c~0) (<= 0 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-08 14:17:44,946 INFO L290 TraceCheckUtils]: 19: Hoare triple {1241#(and (<= 1 main_~c~0) (<= 0 main_~k~0) (<= main_~k~0 1))} assume !false; {1241#(and (<= 1 main_~c~0) (<= 0 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-08 14:17:44,946 INFO L272 TraceCheckUtils]: 20: Hoare triple {1241#(and (<= 1 main_~c~0) (<= 0 main_~k~0) (<= main_~k~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1178#true} is VALID [2022-04-08 14:17:44,946 INFO L290 TraceCheckUtils]: 21: Hoare triple {1178#true} ~cond := #in~cond; {1178#true} is VALID [2022-04-08 14:17:44,947 INFO L290 TraceCheckUtils]: 22: Hoare triple {1178#true} assume !(0 == ~cond); {1178#true} is VALID [2022-04-08 14:17:44,947 INFO L290 TraceCheckUtils]: 23: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-08 14:17:44,947 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1178#true} {1241#(and (<= 1 main_~c~0) (<= 0 main_~k~0) (<= main_~k~0 1))} #54#return; {1241#(and (<= 1 main_~c~0) (<= 0 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-08 14:17:44,948 INFO L290 TraceCheckUtils]: 25: Hoare triple {1241#(and (<= 1 main_~c~0) (<= 0 main_~k~0) (<= main_~k~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1179#false} is VALID [2022-04-08 14:17:44,948 INFO L290 TraceCheckUtils]: 26: Hoare triple {1179#false} assume !false; {1179#false} is VALID [2022-04-08 14:17:44,948 INFO L272 TraceCheckUtils]: 27: Hoare triple {1179#false} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1179#false} is VALID [2022-04-08 14:17:44,948 INFO L290 TraceCheckUtils]: 28: Hoare triple {1179#false} ~cond := #in~cond; {1179#false} is VALID [2022-04-08 14:17:44,949 INFO L290 TraceCheckUtils]: 29: Hoare triple {1179#false} assume !(0 == ~cond); {1179#false} is VALID [2022-04-08 14:17:44,949 INFO L290 TraceCheckUtils]: 30: Hoare triple {1179#false} assume true; {1179#false} is VALID [2022-04-08 14:17:44,949 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1179#false} {1179#false} #54#return; {1179#false} is VALID [2022-04-08 14:17:44,949 INFO L290 TraceCheckUtils]: 32: Hoare triple {1179#false} assume !(~c~0 < ~k~0); {1179#false} is VALID [2022-04-08 14:17:44,949 INFO L272 TraceCheckUtils]: 33: Hoare triple {1179#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1179#false} is VALID [2022-04-08 14:17:44,949 INFO L290 TraceCheckUtils]: 34: Hoare triple {1179#false} ~cond := #in~cond; {1179#false} is VALID [2022-04-08 14:17:44,949 INFO L290 TraceCheckUtils]: 35: Hoare triple {1179#false} assume 0 == ~cond; {1179#false} is VALID [2022-04-08 14:17:44,950 INFO L290 TraceCheckUtils]: 36: Hoare triple {1179#false} assume !false; {1179#false} is VALID [2022-04-08 14:17:44,950 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 14:17:44,950 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 14:17:44,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:17:44,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956256500] [2022-04-08 14:17:44,950 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:17:44,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591462421] [2022-04-08 14:17:44,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591462421] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:17:44,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:17:44,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 14:17:44,951 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:17:44,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [370101012] [2022-04-08 14:17:44,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [370101012] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:17:44,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:17:44,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 14:17:44,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775897786] [2022-04-08 14:17:44,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:17:44,952 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2022-04-08 14:17:44,952 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:17:44,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 14:17:44,978 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:17:44,978 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 14:17:44,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:17:44,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 14:17:44,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-08 14:17:44,979 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 14:17:45,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:17:45,077 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-08 14:17:45,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 14:17:45,077 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2022-04-08 14:17:45,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:17:45,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 14:17:45,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-04-08 14:17:45,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 14:17:45,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-04-08 14:17:45,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 34 transitions. [2022-04-08 14:17:45,112 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:17:45,112 INFO L225 Difference]: With dead ends: 38 [2022-04-08 14:17:45,112 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 14:17:45,112 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-04-08 14:17:45,113 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 4 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:17:45,113 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 64 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:17:45,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 14:17:45,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 14:17:45,114 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:17:45,114 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 14:17:45,114 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 14:17:45,115 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 14:17:45,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:17:45,115 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 14:17:45,115 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 14:17:45,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:17:45,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:17:45,115 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 14:17:45,115 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 14:17:45,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:17:45,115 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 14:17:45,116 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 14:17:45,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:17:45,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:17:45,116 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:17:45,116 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:17:45,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 14:17:45,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 14:17:45,116 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2022-04-08 14:17:45,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:17:45,116 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 14:17:45,117 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 14:17:45,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 14:17:45,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:17:45,129 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 14:17:45,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:17:45,131 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 14:17:45,155 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-08 14:17:45,355 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:17:45,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 14:17:45,640 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-08 14:17:45,640 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-08 14:17:45,640 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-08 14:17:45,641 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 6 8) the Hoare annotation is: true [2022-04-08 14:17:45,641 INFO L878 garLoopResultBuilder]: At program point L7(line 7) the Hoare annotation is: (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) [2022-04-08 14:17:45,641 INFO L878 garLoopResultBuilder]: At program point L7-2(lines 6 8) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-04-08 14:17:45,641 INFO L878 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 6 8) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-04-08 14:17:45,641 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 17 40) the Hoare annotation is: true [2022-04-08 14:17:45,641 INFO L878 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 1)) (.cse1 (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)))) (or (and (<= 1 main_~c~0) .cse0 (= main_~y~0 1) (< 0 main_~k~0) .cse1 (<= main_~c~0 1)) (and (<= 0 main_~k~0) .cse0 (= main_~c~0 0) (= main_~y~0 0) .cse1))) [2022-04-08 14:17:45,641 INFO L878 garLoopResultBuilder]: At program point L28-1(lines 27 36) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 1)) (.cse1 (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)))) (or (and (<= 1 main_~c~0) .cse0 (= main_~y~0 1) (< 0 main_~k~0) .cse1 (<= main_~c~0 1)) (and (<= 0 main_~k~0) .cse0 (= main_~c~0 0) (= main_~y~0 0) .cse1))) [2022-04-08 14:17:45,641 INFO L878 garLoopResultBuilder]: At program point L27-2(lines 27 36) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 1)) (.cse1 (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)))) (or (and (<= 1 main_~c~0) .cse0 (= main_~y~0 1) (< 0 main_~k~0) .cse1 (<= main_~c~0 1)) (and (<= 0 main_~k~0) .cse0 (= main_~c~0 0) (= main_~y~0 0) .cse1))) [2022-04-08 14:17:45,641 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 17 40) the Hoare annotation is: true [2022-04-08 14:17:45,642 INFO L878 garLoopResultBuilder]: At program point L27-3(lines 27 36) the Hoare annotation is: (or (and (= main_~x~0 0) (= main_~y~0 0)) (and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0) (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)) (<= main_~c~0 1))) [2022-04-08 14:17:45,642 INFO L885 garLoopResultBuilder]: At program point L21(line 21) the Hoare annotation is: true [2022-04-08 14:17:45,642 INFO L878 garLoopResultBuilder]: At program point L21-1(line 21) the Hoare annotation is: (and (<= 0 main_~k~0) (<= main_~k~0 1)) [2022-04-08 14:17:45,642 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 17 40) the Hoare annotation is: true [2022-04-08 14:17:45,642 INFO L885 garLoopResultBuilder]: At program point L38(line 38) the Hoare annotation is: true [2022-04-08 14:17:45,642 INFO L878 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)) [2022-04-08 14:17:45,642 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 14:17:45,642 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 14:17:45,642 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 14:17:45,642 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 14:17:45,643 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 14:17:45,643 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 14:17:45,643 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 14:17:45,643 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 9 15) the Hoare annotation is: true [2022-04-08 14:17:45,643 INFO L878 garLoopResultBuilder]: At program point L11(lines 11 12) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-08 14:17:45,643 INFO L878 garLoopResultBuilder]: At program point L10(lines 10 13) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-08 14:17:45,643 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 9 15) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-08 14:17:45,643 INFO L878 garLoopResultBuilder]: At program point L10-2(lines 9 15) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-08 14:17:45,643 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-08 14:17:45,646 INFO L719 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2] [2022-04-08 14:17:45,647 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 14:17:45,649 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 14:17:45,651 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 14:17:45,679 INFO L163 areAnnotationChecker]: CFG has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 14:17:45,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 02:17:45 BoogieIcfgContainer [2022-04-08 14:17:45,695 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 14:17:45,696 INFO L158 Benchmark]: Toolchain (without parser) took 5794.07ms. Allocated memory was 186.6MB in the beginning and 230.7MB in the end (delta: 44.0MB). Free memory was 136.8MB in the beginning and 180.2MB in the end (delta: -43.3MB). Peak memory consumption was 1.7MB. Max. memory is 8.0GB. [2022-04-08 14:17:45,696 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 186.6MB. Free memory is still 153.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 14:17:45,696 INFO L158 Benchmark]: CACSL2BoogieTranslator took 287.89ms. Allocated memory is still 186.6MB. Free memory was 136.6MB in the beginning and 162.2MB in the end (delta: -25.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 14:17:45,696 INFO L158 Benchmark]: Boogie Preprocessor took 28.32ms. Allocated memory is still 186.6MB. Free memory was 162.2MB in the beginning and 160.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 14:17:45,697 INFO L158 Benchmark]: RCFGBuilder took 221.98ms. Allocated memory is still 186.6MB. Free memory was 160.7MB in the beginning and 149.8MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-08 14:17:45,697 INFO L158 Benchmark]: TraceAbstraction took 5251.63ms. Allocated memory was 186.6MB in the beginning and 230.7MB in the end (delta: 44.0MB). Free memory was 149.2MB in the beginning and 180.7MB in the end (delta: -31.5MB). Peak memory consumption was 13.5MB. Max. memory is 8.0GB. [2022-04-08 14:17:45,698 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 186.6MB. Free memory is still 153.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 287.89ms. Allocated memory is still 186.6MB. Free memory was 136.6MB in the beginning and 162.2MB in the end (delta: -25.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.32ms. Allocated memory is still 186.6MB. Free memory was 162.2MB in the beginning and 160.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 221.98ms. Allocated memory is still 186.6MB. Free memory was 160.7MB in the beginning and 149.8MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 5251.63ms. Allocated memory was 186.6MB in the beginning and 230.7MB in the end (delta: 44.0MB). Free memory was 149.2MB in the beginning and 180.7MB in the end (delta: -31.5MB). Peak memory consumption was 13.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.2s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 40 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 33 mSDsluCounter, 355 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 242 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 124 IncrementalHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 113 mSDtfsCounter, 124 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 153 GetRequests, 123 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=4, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 88 PreInvPairs, 124 NumberOfFragments, 343 HoareAnnotationTreeSize, 88 FomulaSimplifications, 24 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 28 FomulaSimplificationsInter, 29 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: (((((1 <= c && k <= 1) && y == 1) && 0 < k) && y * y * y * y + y * y + y * y * y * 2 == x * 4) && c <= 1) || ((((0 <= k && k <= 1) && c == 0) && y == 0) && y * y * y * y + y * y + y * y * y * 2 == x * 4) - ProcedureContractResult [Line: 6]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: !(\old(cond) == 0) && cond == \old(cond) - ProcedureContractResult [Line: 17]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 9]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: !(1 <= \old(cond)) || 1 <= cond RESULT: Ultimate proved your program to be correct! [2022-04-08 14:17:45,713 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...