/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/cohencu-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 13:17:47,182 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 13:17:47,195 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 13:17:47,236 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 13:17:47,236 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 13:17:47,237 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 13:17:47,238 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 13:17:47,239 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 13:17:47,240 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 13:17:47,241 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 13:17:47,241 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 13:17:47,242 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 13:17:47,242 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 13:17:47,246 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 13:17:47,247 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 13:17:47,249 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 13:17:47,250 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 13:17:47,253 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 13:17:47,256 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 13:17:47,257 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 13:17:47,258 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 13:17:47,259 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 13:17:47,259 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 13:17:47,260 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 13:17:47,260 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 13:17:47,262 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 13:17:47,262 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 13:17:47,262 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 13:17:47,262 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 13:17:47,263 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 13:17:47,263 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 13:17:47,263 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 13:17:47,264 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 13:17:47,264 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 13:17:47,265 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 13:17:47,265 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 13:17:47,265 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 13:17:47,266 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 13:17:47,266 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 13:17:47,266 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 13:17:47,266 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 13:17:47,273 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 13:17:47,273 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 13:17:47,281 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 13:17:47,281 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 13:17:47,283 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 13:17:47,283 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 13:17:47,283 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 13:17:47,283 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 13:17:47,283 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 13:17:47,283 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 13:17:47,284 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 13:17:47,284 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 13:17:47,284 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 13:17:47,284 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 13:17:47,285 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 13:17:47,285 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 13:17:47,285 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 13:17:47,285 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:17:47,285 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 13:17:47,285 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 13:17:47,285 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 13:17:47,285 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 13:17:47,285 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 13:17:47,285 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 13:17:47,285 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-15 13:17:47,471 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 13:17:47,486 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 13:17:47,488 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 13:17:47,488 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 13:17:47,489 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 13:17:47,490 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/cohencu-ll.c [2022-04-15 13:17:47,536 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c76555b6/e2646e843caa4c3193f041b43b73a458/FLAG349c10b59 [2022-04-15 13:17:47,862 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 13:17:47,863 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/cohencu-ll.c [2022-04-15 13:17:47,870 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c76555b6/e2646e843caa4c3193f041b43b73a458/FLAG349c10b59 [2022-04-15 13:17:48,271 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c76555b6/e2646e843caa4c3193f041b43b73a458 [2022-04-15 13:17:48,273 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 13:17:48,275 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 13:17:48,277 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 13:17:48,277 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 13:17:48,279 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 13:17:48,280 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:17:48" (1/1) ... [2022-04-15 13:17:48,281 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cf4afc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:17:48, skipping insertion in model container [2022-04-15 13:17:48,281 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:17:48" (1/1) ... [2022-04-15 13:17:48,285 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 13:17:48,295 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 13:17:48,439 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/cohencu-ll.c[588,601] [2022-04-15 13:17:48,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:17:48,475 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 13:17:48,487 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/cohencu-ll.c[588,601] [2022-04-15 13:17:48,513 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:17:48,521 INFO L208 MainTranslator]: Completed translation [2022-04-15 13:17:48,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:17:48 WrapperNode [2022-04-15 13:17:48,522 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 13:17:48,523 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 13:17:48,523 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 13:17:48,523 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 13:17:48,533 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:17:48" (1/1) ... [2022-04-15 13:17:48,534 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:17:48" (1/1) ... [2022-04-15 13:17:48,548 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:17:48" (1/1) ... [2022-04-15 13:17:48,549 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:17:48" (1/1) ... [2022-04-15 13:17:48,560 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:17:48" (1/1) ... [2022-04-15 13:17:48,563 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:17:48" (1/1) ... [2022-04-15 13:17:48,564 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:17:48" (1/1) ... [2022-04-15 13:17:48,565 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 13:17:48,566 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 13:17:48,566 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 13:17:48,566 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 13:17:48,568 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:17:48" (1/1) ... [2022-04-15 13:17:48,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:17:48,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:17:48,595 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-15 13:17:48,619 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-15 13:17:48,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 13:17:48,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 13:17:48,631 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 13:17:48,631 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 13:17:48,631 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 13:17:48,631 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 13:17:48,631 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 13:17:48,631 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 13:17:48,631 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 13:17:48,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 13:17:48,632 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2022-04-15 13:17:48,632 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 13:17:48,632 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 13:17:48,632 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 13:17:48,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 13:17:48,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 13:17:48,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 13:17:48,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 13:17:48,632 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 13:17:48,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 13:17:48,683 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 13:17:48,684 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 13:17:48,801 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 13:17:48,805 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 13:17:48,805 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 13:17:48,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:17:48 BoogieIcfgContainer [2022-04-15 13:17:48,807 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 13:17:48,808 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 13:17:48,808 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 13:17:48,810 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 13:17:48,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 01:17:48" (1/3) ... [2022-04-15 13:17:48,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@168bd196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:17:48, skipping insertion in model container [2022-04-15 13:17:48,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:17:48" (2/3) ... [2022-04-15 13:17:48,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@168bd196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:17:48, skipping insertion in model container [2022-04-15 13:17:48,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:17:48" (3/3) ... [2022-04-15 13:17:48,812 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll.c [2022-04-15 13:17:48,815 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 13:17:48,815 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 13:17:48,841 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 13:17:48,845 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-15 13:17:48,845 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 13:17:48,857 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 13:17:48,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 13:17:48,862 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:17:48,862 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:17:48,862 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:17:48,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:17:48,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1298655804, now seen corresponding path program 1 times [2022-04-15 13:17:48,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:17:48,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2094558881] [2022-04-15 13:17:48,884 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:17:48,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1298655804, now seen corresponding path program 2 times [2022-04-15 13:17:48,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:17:48,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150306319] [2022-04-15 13:17:48,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:17:48,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:17:48,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:49,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:17:49,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:49,064 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {33#true} is VALID [2022-04-15 13:17:49,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-15 13:17:49,065 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #80#return; {33#true} is VALID [2022-04-15 13:17:49,066 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {38#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:17:49,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {33#true} is VALID [2022-04-15 13:17:49,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-15 13:17:49,067 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #80#return; {33#true} is VALID [2022-04-15 13:17:49,067 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret5 := main(); {33#true} is VALID [2022-04-15 13:17:49,067 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {33#true} is VALID [2022-04-15 13:17:49,068 INFO L290 TraceCheckUtils]: 6: Hoare triple {33#true} assume false; {34#false} is VALID [2022-04-15 13:17:49,068 INFO L272 TraceCheckUtils]: 7: Hoare triple {34#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {34#false} is VALID [2022-04-15 13:17:49,068 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2022-04-15 13:17:49,068 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2022-04-15 13:17:49,069 INFO L290 TraceCheckUtils]: 10: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-04-15 13:17:49,069 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-15 13:17:49,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:17:49,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150306319] [2022-04-15 13:17:49,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150306319] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:17:49,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:17:49,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 13:17:49,072 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:17:49,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2094558881] [2022-04-15 13:17:49,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2094558881] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:17:49,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:17:49,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 13:17:49,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959367357] [2022-04-15 13:17:49,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:17:49,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 13:17:49,077 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:17:49,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:17:49,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:17:49,091 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 13:17:49,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:17:49,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 13:17:49,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 13:17:49,105 INFO L87 Difference]: Start difference. First operand has 30 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:17:49,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:17:49,309 INFO L93 Difference]: Finished difference Result 54 states and 91 transitions. [2022-04-15 13:17:49,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 13:17:49,310 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 13:17:49,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:17:49,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:17:49,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-04-15 13:17:49,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:17:49,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-04-15 13:17:49,331 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 91 transitions. [2022-04-15 13:17:49,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:17:49,443 INFO L225 Difference]: With dead ends: 54 [2022-04-15 13:17:49,444 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 13:17:49,446 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 13:17:49,448 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:17:49,448 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 32 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:17:49,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 13:17:49,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-15 13:17:49,468 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:17:49,469 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 13:17:49,469 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 13:17:49,469 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 13:17:49,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:17:49,472 INFO L93 Difference]: Finished difference Result 25 states and 35 transitions. [2022-04-15 13:17:49,472 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2022-04-15 13:17:49,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:17:49,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:17:49,474 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 25 states. [2022-04-15 13:17:49,474 INFO L87 Difference]: Start difference. First operand has 25 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 25 states. [2022-04-15 13:17:49,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:17:49,476 INFO L93 Difference]: Finished difference Result 25 states and 35 transitions. [2022-04-15 13:17:49,476 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2022-04-15 13:17:49,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:17:49,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:17:49,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:17:49,477 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:17:49,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 13:17:49,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2022-04-15 13:17:49,480 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 11 [2022-04-15 13:17:49,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:17:49,480 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2022-04-15 13:17:49,481 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:17:49,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 35 transitions. [2022-04-15 13:17:49,516 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-15 13:17:49,516 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2022-04-15 13:17:49,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 13:17:49,517 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:17:49,517 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:17:49,517 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 13:17:49,517 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:17:49,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:17:49,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1297106672, now seen corresponding path program 1 times [2022-04-15 13:17:49,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:17:49,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1002189159] [2022-04-15 13:17:49,519 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:17:49,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1297106672, now seen corresponding path program 2 times [2022-04-15 13:17:49,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:17:49,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182195026] [2022-04-15 13:17:49,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:17:49,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:17:49,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:49,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:17:49,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:49,652 INFO L290 TraceCheckUtils]: 0: Hoare triple {257#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {249#true} is VALID [2022-04-15 13:17:49,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {249#true} assume true; {249#true} is VALID [2022-04-15 13:17:49,653 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {249#true} {249#true} #80#return; {249#true} is VALID [2022-04-15 13:17:49,653 INFO L272 TraceCheckUtils]: 0: Hoare triple {249#true} call ULTIMATE.init(); {257#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:17:49,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {257#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {249#true} is VALID [2022-04-15 13:17:49,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {249#true} assume true; {249#true} is VALID [2022-04-15 13:17:49,654 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {249#true} {249#true} #80#return; {249#true} is VALID [2022-04-15 13:17:49,654 INFO L272 TraceCheckUtils]: 4: Hoare triple {249#true} call #t~ret5 := main(); {249#true} is VALID [2022-04-15 13:17:49,656 INFO L290 TraceCheckUtils]: 5: Hoare triple {249#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {254#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-15 13:17:49,657 INFO L290 TraceCheckUtils]: 6: Hoare triple {254#(= (+ (* main_~n~0 6) 6) main_~z~0)} assume !false; {254#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-15 13:17:49,658 INFO L272 TraceCheckUtils]: 7: Hoare triple {254#(= (+ (* main_~n~0 6) 6) main_~z~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {255#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:17:49,659 INFO L290 TraceCheckUtils]: 8: Hoare triple {255#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {256#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 13:17:49,659 INFO L290 TraceCheckUtils]: 9: Hoare triple {256#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {250#false} is VALID [2022-04-15 13:17:49,660 INFO L290 TraceCheckUtils]: 10: Hoare triple {250#false} assume !false; {250#false} is VALID [2022-04-15 13:17:49,660 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-15 13:17:49,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:17:49,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182195026] [2022-04-15 13:17:49,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182195026] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:17:49,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:17:49,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 13:17:49,663 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:17:49,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1002189159] [2022-04-15 13:17:49,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1002189159] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:17:49,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:17:49,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 13:17:49,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470160603] [2022-04-15 13:17:49,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:17:49,664 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 13:17:49,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:17:49,665 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:17:49,677 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:17:49,677 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 13:17:49,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:17:49,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 13:17:49,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 13:17:49,678 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:17:50,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:17:50,053 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2022-04-15 13:17:50,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 13:17:50,053 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 13:17:50,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:17:50,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:17:50,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2022-04-15 13:17:50,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:17:50,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2022-04-15 13:17:50,056 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 40 transitions. [2022-04-15 13:17:50,100 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:17:50,102 INFO L225 Difference]: With dead ends: 31 [2022-04-15 13:17:50,103 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 13:17:50,103 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-15 13:17:50,106 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 18 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 13:17:50,107 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 38 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 13:17:50,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 13:17:50,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-15 13:17:50,119 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:17:50,119 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 13:17:50,120 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 13:17:50,120 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 13:17:50,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:17:50,124 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2022-04-15 13:17:50,125 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2022-04-15 13:17:50,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:17:50,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:17:50,125 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 29 states. [2022-04-15 13:17:50,126 INFO L87 Difference]: Start difference. First operand has 29 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 29 states. [2022-04-15 13:17:50,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:17:50,127 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2022-04-15 13:17:50,128 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2022-04-15 13:17:50,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:17:50,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:17:50,128 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:17:50,128 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:17:50,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 13:17:50,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2022-04-15 13:17:50,130 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 11 [2022-04-15 13:17:50,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:17:50,130 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2022-04-15 13:17:50,130 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:17:50,130 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 38 transitions. [2022-04-15 13:17:50,165 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-15 13:17:50,165 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2022-04-15 13:17:50,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 13:17:50,166 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:17:50,166 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:17:50,166 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 13:17:50,166 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:17:50,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:17:50,166 INFO L85 PathProgramCache]: Analyzing trace with hash -2099401665, now seen corresponding path program 1 times [2022-04-15 13:17:50,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:17:50,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1661487728] [2022-04-15 13:17:50,167 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:17:50,167 INFO L85 PathProgramCache]: Analyzing trace with hash -2099401665, now seen corresponding path program 2 times [2022-04-15 13:17:50,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:17:50,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867638770] [2022-04-15 13:17:50,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:17:50,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:17:50,188 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:17:50,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [393404583] [2022-04-15 13:17:50,189 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:17:50,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:17:50,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:17:50,190 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-15 13:17:50,191 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-15 13:17:50,220 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:17:50,221 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:17:50,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 13:17:50,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:50,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:17:50,342 INFO L272 TraceCheckUtils]: 0: Hoare triple {446#true} call ULTIMATE.init(); {446#true} is VALID [2022-04-15 13:17:50,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {446#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {446#true} is VALID [2022-04-15 13:17:50,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {446#true} assume true; {446#true} is VALID [2022-04-15 13:17:50,342 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {446#true} {446#true} #80#return; {446#true} is VALID [2022-04-15 13:17:50,343 INFO L272 TraceCheckUtils]: 4: Hoare triple {446#true} call #t~ret5 := main(); {446#true} is VALID [2022-04-15 13:17:50,343 INFO L290 TraceCheckUtils]: 5: Hoare triple {446#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {466#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-15 13:17:50,343 INFO L290 TraceCheckUtils]: 6: Hoare triple {466#(and (= main_~n~0 0) (= main_~y~0 1))} assume !false; {466#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-15 13:17:50,344 INFO L272 TraceCheckUtils]: 7: Hoare triple {466#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {446#true} is VALID [2022-04-15 13:17:50,344 INFO L290 TraceCheckUtils]: 8: Hoare triple {446#true} ~cond := #in~cond; {446#true} is VALID [2022-04-15 13:17:50,344 INFO L290 TraceCheckUtils]: 9: Hoare triple {446#true} assume !(0 == ~cond); {446#true} is VALID [2022-04-15 13:17:50,344 INFO L290 TraceCheckUtils]: 10: Hoare triple {446#true} assume true; {446#true} is VALID [2022-04-15 13:17:50,345 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {446#true} {466#(and (= main_~n~0 0) (= main_~y~0 1))} #58#return; {466#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-15 13:17:50,345 INFO L272 TraceCheckUtils]: 12: Hoare triple {466#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {488#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:17:50,346 INFO L290 TraceCheckUtils]: 13: Hoare triple {488#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {492#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:17:50,346 INFO L290 TraceCheckUtils]: 14: Hoare triple {492#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {447#false} is VALID [2022-04-15 13:17:50,346 INFO L290 TraceCheckUtils]: 15: Hoare triple {447#false} assume !false; {447#false} is VALID [2022-04-15 13:17:50,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:17:50,347 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:17:50,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:17:50,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867638770] [2022-04-15 13:17:50,347 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:17:50,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393404583] [2022-04-15 13:17:50,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393404583] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:17:50,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:17:50,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:17:50,348 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:17:50,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1661487728] [2022-04-15 13:17:50,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1661487728] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:17:50,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:17:50,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:17:50,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535575719] [2022-04-15 13:17:50,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:17:50,349 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-04-15 13:17:50,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:17:50,349 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:17:50,369 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:17:50,369 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 13:17:50,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:17:50,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 13:17:50,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 13:17:50,370 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:17:50,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:17:50,566 INFO L93 Difference]: Finished difference Result 48 states and 67 transitions. [2022-04-15 13:17:50,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 13:17:50,566 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-04-15 13:17:50,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:17:50,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:17:50,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-15 13:17:50,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:17:50,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-15 13:17:50,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-15 13:17:50,633 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:17:50,634 INFO L225 Difference]: With dead ends: 48 [2022-04-15 13:17:50,634 INFO L226 Difference]: Without dead ends: 46 [2022-04-15 13:17:50,635 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 13:17:50,635 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 6 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:17:50,636 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 125 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:17:50,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-15 13:17:50,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 36. [2022-04-15 13:17:50,645 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:17:50,645 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 36 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 13:17:50,646 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 36 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 13:17:50,646 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 36 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 13:17:50,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:17:50,649 INFO L93 Difference]: Finished difference Result 46 states and 65 transitions. [2022-04-15 13:17:50,649 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 65 transitions. [2022-04-15 13:17:50,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:17:50,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:17:50,650 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 46 states. [2022-04-15 13:17:50,650 INFO L87 Difference]: Start difference. First operand has 36 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 46 states. [2022-04-15 13:17:50,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:17:50,652 INFO L93 Difference]: Finished difference Result 46 states and 65 transitions. [2022-04-15 13:17:50,652 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 65 transitions. [2022-04-15 13:17:50,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:17:50,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:17:50,653 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:17:50,653 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:17:50,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 13:17:50,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2022-04-15 13:17:50,655 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 16 [2022-04-15 13:17:50,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:17:50,655 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 46 transitions. [2022-04-15 13:17:50,656 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:17:50,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 46 transitions. [2022-04-15 13:17:50,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:17:50,712 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2022-04-15 13:17:50,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 13:17:50,713 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:17:50,713 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:17:50,732 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-15 13:17:50,919 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:17:50,920 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:17:50,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:17:50,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1061128656, now seen corresponding path program 1 times [2022-04-15 13:17:50,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:17:50,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [249416879] [2022-04-15 13:17:50,921 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:17:50,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1061128656, now seen corresponding path program 2 times [2022-04-15 13:17:50,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:17:50,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190474025] [2022-04-15 13:17:50,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:17:50,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:17:50,931 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:17:50,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [901502155] [2022-04-15 13:17:50,932 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:17:50,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:17:50,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:17:50,936 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-15 13:17:50,937 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-15 13:17:50,969 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:17:50,969 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:17:50,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 13:17:50,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:50,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:17:51,089 INFO L272 TraceCheckUtils]: 0: Hoare triple {760#true} call ULTIMATE.init(); {760#true} is VALID [2022-04-15 13:17:51,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {760#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {760#true} is VALID [2022-04-15 13:17:51,090 INFO L290 TraceCheckUtils]: 2: Hoare triple {760#true} assume true; {760#true} is VALID [2022-04-15 13:17:51,090 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {760#true} {760#true} #80#return; {760#true} is VALID [2022-04-15 13:17:51,090 INFO L272 TraceCheckUtils]: 4: Hoare triple {760#true} call #t~ret5 := main(); {760#true} is VALID [2022-04-15 13:17:51,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {760#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {780#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-15 13:17:51,095 INFO L290 TraceCheckUtils]: 6: Hoare triple {780#(and (= main_~x~0 0) (= main_~n~0 0))} assume !false; {780#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-15 13:17:51,095 INFO L272 TraceCheckUtils]: 7: Hoare triple {780#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {760#true} is VALID [2022-04-15 13:17:51,095 INFO L290 TraceCheckUtils]: 8: Hoare triple {760#true} ~cond := #in~cond; {760#true} is VALID [2022-04-15 13:17:51,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {760#true} assume !(0 == ~cond); {760#true} is VALID [2022-04-15 13:17:51,096 INFO L290 TraceCheckUtils]: 10: Hoare triple {760#true} assume true; {760#true} is VALID [2022-04-15 13:17:51,096 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {760#true} {780#(and (= main_~x~0 0) (= main_~n~0 0))} #58#return; {780#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-15 13:17:51,096 INFO L272 TraceCheckUtils]: 12: Hoare triple {780#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {760#true} is VALID [2022-04-15 13:17:51,097 INFO L290 TraceCheckUtils]: 13: Hoare triple {760#true} ~cond := #in~cond; {760#true} is VALID [2022-04-15 13:17:51,097 INFO L290 TraceCheckUtils]: 14: Hoare triple {760#true} assume !(0 == ~cond); {760#true} is VALID [2022-04-15 13:17:51,097 INFO L290 TraceCheckUtils]: 15: Hoare triple {760#true} assume true; {760#true} is VALID [2022-04-15 13:17:51,099 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {760#true} {780#(and (= main_~x~0 0) (= main_~n~0 0))} #60#return; {780#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-15 13:17:51,102 INFO L272 TraceCheckUtils]: 17: Hoare triple {780#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {817#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:17:51,103 INFO L290 TraceCheckUtils]: 18: Hoare triple {817#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {821#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:17:51,107 INFO L290 TraceCheckUtils]: 19: Hoare triple {821#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {761#false} is VALID [2022-04-15 13:17:51,107 INFO L290 TraceCheckUtils]: 20: Hoare triple {761#false} assume !false; {761#false} is VALID [2022-04-15 13:17:51,108 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 13:17:51,108 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:17:51,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:17:51,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190474025] [2022-04-15 13:17:51,108 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:17:51,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901502155] [2022-04-15 13:17:51,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901502155] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:17:51,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:17:51,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:17:51,109 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:17:51,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [249416879] [2022-04-15 13:17:51,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [249416879] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:17:51,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:17:51,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:17:51,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429719380] [2022-04-15 13:17:51,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:17:51,110 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2022-04-15 13:17:51,110 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:17:51,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 13:17:51,124 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:17:51,125 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 13:17:51,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:17:51,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 13:17:51,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 13:17:51,126 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 13:17:51,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:17:51,359 INFO L93 Difference]: Finished difference Result 52 states and 70 transitions. [2022-04-15 13:17:51,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 13:17:51,360 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2022-04-15 13:17:51,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:17:51,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 13:17:51,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-15 13:17:51,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 13:17:51,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-15 13:17:51,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-15 13:17:51,431 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:17:51,435 INFO L225 Difference]: With dead ends: 52 [2022-04-15 13:17:51,435 INFO L226 Difference]: Without dead ends: 50 [2022-04-15 13:17:51,435 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 13:17:51,437 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:17:51,438 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 126 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:17:51,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-15 13:17:51,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2022-04-15 13:17:51,462 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:17:51,464 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 46 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 13:17:51,465 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 46 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 13:17:51,466 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 46 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 13:17:51,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:17:51,472 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2022-04-15 13:17:51,472 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2022-04-15 13:17:51,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:17:51,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:17:51,480 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 50 states. [2022-04-15 13:17:51,481 INFO L87 Difference]: Start difference. First operand has 46 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 50 states. [2022-04-15 13:17:51,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:17:51,484 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2022-04-15 13:17:51,484 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2022-04-15 13:17:51,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:17:51,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:17:51,485 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:17:51,485 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:17:51,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 13:17:51,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 61 transitions. [2022-04-15 13:17:51,488 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 61 transitions. Word has length 21 [2022-04-15 13:17:51,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:17:51,489 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 61 transitions. [2022-04-15 13:17:51,489 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 13:17:51,489 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 61 transitions. [2022-04-15 13:17:51,561 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-15 13:17:51,562 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 61 transitions. [2022-04-15 13:17:51,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 13:17:51,562 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:17:51,562 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:17:51,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-15 13:17:51,779 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,SelfDestructingSolverStorable3 [2022-04-15 13:17:51,780 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:17:51,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:17:51,780 INFO L85 PathProgramCache]: Analyzing trace with hash 2039501471, now seen corresponding path program 1 times [2022-04-15 13:17:51,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:17:51,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [460063316] [2022-04-15 13:17:51,781 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:17:51,781 INFO L85 PathProgramCache]: Analyzing trace with hash 2039501471, now seen corresponding path program 2 times [2022-04-15 13:17:51,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:17:51,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588295737] [2022-04-15 13:17:51,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:17:51,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:17:51,788 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:17:51,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1112873244] [2022-04-15 13:17:51,789 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:17:51,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:17:51,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:17:51,790 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-15 13:17:51,791 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-15 13:17:51,818 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:17:51,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:17:51,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 13:17:51,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:51,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:17:51,928 INFO L272 TraceCheckUtils]: 0: Hoare triple {1125#true} call ULTIMATE.init(); {1125#true} is VALID [2022-04-15 13:17:51,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {1125#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1125#true} is VALID [2022-04-15 13:17:51,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {1125#true} assume true; {1125#true} is VALID [2022-04-15 13:17:51,929 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1125#true} {1125#true} #80#return; {1125#true} is VALID [2022-04-15 13:17:51,929 INFO L272 TraceCheckUtils]: 4: Hoare triple {1125#true} call #t~ret5 := main(); {1125#true} is VALID [2022-04-15 13:17:51,930 INFO L290 TraceCheckUtils]: 5: Hoare triple {1125#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1145#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-15 13:17:51,930 INFO L290 TraceCheckUtils]: 6: Hoare triple {1145#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {1145#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-15 13:17:51,931 INFO L272 TraceCheckUtils]: 7: Hoare triple {1145#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1125#true} is VALID [2022-04-15 13:17:51,931 INFO L290 TraceCheckUtils]: 8: Hoare triple {1125#true} ~cond := #in~cond; {1125#true} is VALID [2022-04-15 13:17:51,931 INFO L290 TraceCheckUtils]: 9: Hoare triple {1125#true} assume !(0 == ~cond); {1125#true} is VALID [2022-04-15 13:17:51,932 INFO L290 TraceCheckUtils]: 10: Hoare triple {1125#true} assume true; {1125#true} is VALID [2022-04-15 13:17:51,932 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1125#true} {1145#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #58#return; {1145#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-15 13:17:51,932 INFO L272 TraceCheckUtils]: 12: Hoare triple {1145#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1125#true} is VALID [2022-04-15 13:17:51,932 INFO L290 TraceCheckUtils]: 13: Hoare triple {1125#true} ~cond := #in~cond; {1125#true} is VALID [2022-04-15 13:17:51,933 INFO L290 TraceCheckUtils]: 14: Hoare triple {1125#true} assume !(0 == ~cond); {1125#true} is VALID [2022-04-15 13:17:51,933 INFO L290 TraceCheckUtils]: 15: Hoare triple {1125#true} assume true; {1125#true} is VALID [2022-04-15 13:17:51,933 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1125#true} {1145#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #60#return; {1145#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-15 13:17:51,933 INFO L272 TraceCheckUtils]: 17: Hoare triple {1145#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1125#true} is VALID [2022-04-15 13:17:51,933 INFO L290 TraceCheckUtils]: 18: Hoare triple {1125#true} ~cond := #in~cond; {1125#true} is VALID [2022-04-15 13:17:51,934 INFO L290 TraceCheckUtils]: 19: Hoare triple {1125#true} assume !(0 == ~cond); {1125#true} is VALID [2022-04-15 13:17:51,934 INFO L290 TraceCheckUtils]: 20: Hoare triple {1125#true} assume true; {1125#true} is VALID [2022-04-15 13:17:51,934 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1125#true} {1145#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {1145#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-15 13:17:51,935 INFO L272 TraceCheckUtils]: 22: Hoare triple {1145#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {1197#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:17:51,936 INFO L290 TraceCheckUtils]: 23: Hoare triple {1197#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1201#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:17:51,936 INFO L290 TraceCheckUtils]: 24: Hoare triple {1201#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1126#false} is VALID [2022-04-15 13:17:51,937 INFO L290 TraceCheckUtils]: 25: Hoare triple {1126#false} assume !false; {1126#false} is VALID [2022-04-15 13:17:51,938 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 13:17:51,939 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:17:51,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:17:51,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588295737] [2022-04-15 13:17:51,941 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:17:51,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112873244] [2022-04-15 13:17:51,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112873244] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:17:51,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:17:51,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:17:51,942 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:17:51,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [460063316] [2022-04-15 13:17:51,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [460063316] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:17:51,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:17:51,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:17:51,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213565078] [2022-04-15 13:17:51,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:17:51,944 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 26 [2022-04-15 13:17:51,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:17:51,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 13:17:51,959 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:17:51,959 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 13:17:51,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:17:51,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 13:17:51,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 13:17:51,961 INFO L87 Difference]: Start difference. First operand 46 states and 61 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 13:17:52,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:17:52,243 INFO L93 Difference]: Finished difference Result 60 states and 76 transitions. [2022-04-15 13:17:52,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 13:17:52,243 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 26 [2022-04-15 13:17:52,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:17:52,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 13:17:52,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-15 13:17:52,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 13:17:52,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-15 13:17:52,246 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-15 13:17:52,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:17:52,298 INFO L225 Difference]: With dead ends: 60 [2022-04-15 13:17:52,298 INFO L226 Difference]: Without dead ends: 48 [2022-04-15 13:17:52,299 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 13:17:52,299 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 6 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:17:52,299 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 112 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:17:52,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-15 13:17:52,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-15 13:17:52,326 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:17:52,327 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 24 states have internal predecessors, (25), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 13:17:52,327 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 24 states have internal predecessors, (25), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 13:17:52,327 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 24 states have internal predecessors, (25), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 13:17:52,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:17:52,330 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2022-04-15 13:17:52,330 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2022-04-15 13:17:52,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:17:52,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:17:52,330 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 24 states have internal predecessors, (25), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 48 states. [2022-04-15 13:17:52,331 INFO L87 Difference]: Start difference. First operand has 48 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 24 states have internal predecessors, (25), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 48 states. [2022-04-15 13:17:52,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:17:52,333 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2022-04-15 13:17:52,333 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2022-04-15 13:17:52,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:17:52,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:17:52,334 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:17:52,334 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:17:52,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 24 states have internal predecessors, (25), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 13:17:52,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2022-04-15 13:17:52,337 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 26 [2022-04-15 13:17:52,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:17:52,337 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2022-04-15 13:17:52,337 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 13:17:52,337 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 59 transitions. [2022-04-15 13:17:52,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:17:52,409 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2022-04-15 13:17:52,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 13:17:52,409 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:17:52,410 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:17:52,436 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-15 13:17:52,623 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:17:52,623 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:17:52,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:17:52,624 INFO L85 PathProgramCache]: Analyzing trace with hash 542006608, now seen corresponding path program 1 times [2022-04-15 13:17:52,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:17:52,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2126125586] [2022-04-15 13:18:35,494 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:18:35,496 INFO L85 PathProgramCache]: Analyzing trace with hash 688371743, now seen corresponding path program 1 times [2022-04-15 13:18:35,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:18:35,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098938517] [2022-04-15 13:18:35,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:18:35,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:18:35,503 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:18:35,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1818927207] [2022-04-15 13:18:35,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:18:35,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:18:35,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:18:35,504 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-15 13:18:35,505 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-15 13:18:35,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:18:35,536 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:18:35,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:18:35,562 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:18:35,562 INFO L85 PathProgramCache]: Analyzing trace with hash 542006608, now seen corresponding path program 2 times [2022-04-15 13:18:35,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:18:35,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233325197] [2022-04-15 13:18:35,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:18:35,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:18:35,569 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:18:35,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1975419757] [2022-04-15 13:18:35,570 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:18:35,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:18:35,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:18:35,571 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:18:35,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 13:18:35,613 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:18:35,613 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:18:35,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 13:18:35,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:35,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:18:35,852 INFO L272 TraceCheckUtils]: 0: Hoare triple {1521#true} call ULTIMATE.init(); {1521#true} is VALID [2022-04-15 13:18:35,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {1521#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1521#true} is VALID [2022-04-15 13:18:35,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {1521#true} assume true; {1521#true} is VALID [2022-04-15 13:18:35,852 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1521#true} {1521#true} #80#return; {1521#true} is VALID [2022-04-15 13:18:35,852 INFO L272 TraceCheckUtils]: 4: Hoare triple {1521#true} call #t~ret5 := main(); {1521#true} is VALID [2022-04-15 13:18:35,853 INFO L290 TraceCheckUtils]: 5: Hoare triple {1521#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1541#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-15 13:18:35,853 INFO L290 TraceCheckUtils]: 6: Hoare triple {1541#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {1541#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-15 13:18:35,853 INFO L272 TraceCheckUtils]: 7: Hoare triple {1541#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1521#true} is VALID [2022-04-15 13:18:35,854 INFO L290 TraceCheckUtils]: 8: Hoare triple {1521#true} ~cond := #in~cond; {1521#true} is VALID [2022-04-15 13:18:35,854 INFO L290 TraceCheckUtils]: 9: Hoare triple {1521#true} assume !(0 == ~cond); {1521#true} is VALID [2022-04-15 13:18:35,854 INFO L290 TraceCheckUtils]: 10: Hoare triple {1521#true} assume true; {1521#true} is VALID [2022-04-15 13:18:35,858 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1521#true} {1541#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #58#return; {1541#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-15 13:18:35,858 INFO L272 TraceCheckUtils]: 12: Hoare triple {1541#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1521#true} is VALID [2022-04-15 13:18:35,858 INFO L290 TraceCheckUtils]: 13: Hoare triple {1521#true} ~cond := #in~cond; {1521#true} is VALID [2022-04-15 13:18:35,858 INFO L290 TraceCheckUtils]: 14: Hoare triple {1521#true} assume !(0 == ~cond); {1521#true} is VALID [2022-04-15 13:18:35,859 INFO L290 TraceCheckUtils]: 15: Hoare triple {1521#true} assume true; {1521#true} is VALID [2022-04-15 13:18:35,859 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1521#true} {1541#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #60#return; {1541#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-15 13:18:35,859 INFO L272 TraceCheckUtils]: 17: Hoare triple {1541#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1521#true} is VALID [2022-04-15 13:18:35,859 INFO L290 TraceCheckUtils]: 18: Hoare triple {1521#true} ~cond := #in~cond; {1521#true} is VALID [2022-04-15 13:18:35,860 INFO L290 TraceCheckUtils]: 19: Hoare triple {1521#true} assume !(0 == ~cond); {1521#true} is VALID [2022-04-15 13:18:35,860 INFO L290 TraceCheckUtils]: 20: Hoare triple {1521#true} assume true; {1521#true} is VALID [2022-04-15 13:18:35,860 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1521#true} {1541#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {1541#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-15 13:18:35,860 INFO L272 TraceCheckUtils]: 22: Hoare triple {1541#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {1521#true} is VALID [2022-04-15 13:18:35,860 INFO L290 TraceCheckUtils]: 23: Hoare triple {1521#true} ~cond := #in~cond; {1521#true} is VALID [2022-04-15 13:18:35,861 INFO L290 TraceCheckUtils]: 24: Hoare triple {1521#true} assume !(0 == ~cond); {1521#true} is VALID [2022-04-15 13:18:35,861 INFO L290 TraceCheckUtils]: 25: Hoare triple {1521#true} assume true; {1521#true} is VALID [2022-04-15 13:18:35,862 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1521#true} {1541#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {1541#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-15 13:18:35,863 INFO L272 TraceCheckUtils]: 27: Hoare triple {1541#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {1521#true} is VALID [2022-04-15 13:18:35,863 INFO L290 TraceCheckUtils]: 28: Hoare triple {1521#true} ~cond := #in~cond; {1521#true} is VALID [2022-04-15 13:18:35,864 INFO L290 TraceCheckUtils]: 29: Hoare triple {1521#true} assume !(0 == ~cond); {1521#true} is VALID [2022-04-15 13:18:35,864 INFO L290 TraceCheckUtils]: 30: Hoare triple {1521#true} assume true; {1521#true} is VALID [2022-04-15 13:18:35,874 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1521#true} {1541#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {1541#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-15 13:18:35,875 INFO L290 TraceCheckUtils]: 32: Hoare triple {1541#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {1623#(and (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-15 13:18:35,879 INFO L290 TraceCheckUtils]: 33: Hoare triple {1623#(and (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} assume !false; {1623#(and (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-15 13:18:35,879 INFO L272 TraceCheckUtils]: 34: Hoare triple {1623#(and (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1521#true} is VALID [2022-04-15 13:18:35,879 INFO L290 TraceCheckUtils]: 35: Hoare triple {1521#true} ~cond := #in~cond; {1521#true} is VALID [2022-04-15 13:18:35,879 INFO L290 TraceCheckUtils]: 36: Hoare triple {1521#true} assume !(0 == ~cond); {1521#true} is VALID [2022-04-15 13:18:35,879 INFO L290 TraceCheckUtils]: 37: Hoare triple {1521#true} assume true; {1521#true} is VALID [2022-04-15 13:18:35,880 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1521#true} {1623#(and (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} #58#return; {1623#(and (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-15 13:18:35,881 INFO L272 TraceCheckUtils]: 39: Hoare triple {1623#(and (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1645#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:18:35,881 INFO L290 TraceCheckUtils]: 40: Hoare triple {1645#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1649#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:18:35,881 INFO L290 TraceCheckUtils]: 41: Hoare triple {1649#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1522#false} is VALID [2022-04-15 13:18:35,881 INFO L290 TraceCheckUtils]: 42: Hoare triple {1522#false} assume !false; {1522#false} is VALID [2022-04-15 13:18:35,882 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-15 13:18:35,882 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:18:36,063 INFO L290 TraceCheckUtils]: 42: Hoare triple {1522#false} assume !false; {1522#false} is VALID [2022-04-15 13:18:36,063 INFO L290 TraceCheckUtils]: 41: Hoare triple {1649#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1522#false} is VALID [2022-04-15 13:18:36,063 INFO L290 TraceCheckUtils]: 40: Hoare triple {1645#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1649#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:18:36,064 INFO L272 TraceCheckUtils]: 39: Hoare triple {1665#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1645#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:18:36,065 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1521#true} {1665#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #58#return; {1665#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-15 13:18:36,065 INFO L290 TraceCheckUtils]: 37: Hoare triple {1521#true} assume true; {1521#true} is VALID [2022-04-15 13:18:36,065 INFO L290 TraceCheckUtils]: 36: Hoare triple {1521#true} assume !(0 == ~cond); {1521#true} is VALID [2022-04-15 13:18:36,065 INFO L290 TraceCheckUtils]: 35: Hoare triple {1521#true} ~cond := #in~cond; {1521#true} is VALID [2022-04-15 13:18:36,065 INFO L272 TraceCheckUtils]: 34: Hoare triple {1665#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1521#true} is VALID [2022-04-15 13:18:36,065 INFO L290 TraceCheckUtils]: 33: Hoare triple {1665#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} assume !false; {1665#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-15 13:18:36,068 INFO L290 TraceCheckUtils]: 32: Hoare triple {1687#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {1665#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-15 13:18:36,069 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1521#true} {1687#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #66#return; {1687#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-15 13:18:36,069 INFO L290 TraceCheckUtils]: 30: Hoare triple {1521#true} assume true; {1521#true} is VALID [2022-04-15 13:18:36,069 INFO L290 TraceCheckUtils]: 29: Hoare triple {1521#true} assume !(0 == ~cond); {1521#true} is VALID [2022-04-15 13:18:36,069 INFO L290 TraceCheckUtils]: 28: Hoare triple {1521#true} ~cond := #in~cond; {1521#true} is VALID [2022-04-15 13:18:36,069 INFO L272 TraceCheckUtils]: 27: Hoare triple {1687#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {1521#true} is VALID [2022-04-15 13:18:36,070 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1521#true} {1687#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #64#return; {1687#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-15 13:18:36,070 INFO L290 TraceCheckUtils]: 25: Hoare triple {1521#true} assume true; {1521#true} is VALID [2022-04-15 13:18:36,070 INFO L290 TraceCheckUtils]: 24: Hoare triple {1521#true} assume !(0 == ~cond); {1521#true} is VALID [2022-04-15 13:18:36,070 INFO L290 TraceCheckUtils]: 23: Hoare triple {1521#true} ~cond := #in~cond; {1521#true} is VALID [2022-04-15 13:18:36,070 INFO L272 TraceCheckUtils]: 22: Hoare triple {1687#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {1521#true} is VALID [2022-04-15 13:18:36,071 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1521#true} {1687#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #62#return; {1687#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-15 13:18:36,071 INFO L290 TraceCheckUtils]: 20: Hoare triple {1521#true} assume true; {1521#true} is VALID [2022-04-15 13:18:36,071 INFO L290 TraceCheckUtils]: 19: Hoare triple {1521#true} assume !(0 == ~cond); {1521#true} is VALID [2022-04-15 13:18:36,071 INFO L290 TraceCheckUtils]: 18: Hoare triple {1521#true} ~cond := #in~cond; {1521#true} is VALID [2022-04-15 13:18:36,071 INFO L272 TraceCheckUtils]: 17: Hoare triple {1687#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1521#true} is VALID [2022-04-15 13:18:36,072 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1521#true} {1687#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #60#return; {1687#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-15 13:18:36,072 INFO L290 TraceCheckUtils]: 15: Hoare triple {1521#true} assume true; {1521#true} is VALID [2022-04-15 13:18:36,072 INFO L290 TraceCheckUtils]: 14: Hoare triple {1521#true} assume !(0 == ~cond); {1521#true} is VALID [2022-04-15 13:18:36,072 INFO L290 TraceCheckUtils]: 13: Hoare triple {1521#true} ~cond := #in~cond; {1521#true} is VALID [2022-04-15 13:18:36,072 INFO L272 TraceCheckUtils]: 12: Hoare triple {1687#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1521#true} is VALID [2022-04-15 13:18:36,073 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1521#true} {1687#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #58#return; {1687#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-15 13:18:36,073 INFO L290 TraceCheckUtils]: 10: Hoare triple {1521#true} assume true; {1521#true} is VALID [2022-04-15 13:18:36,073 INFO L290 TraceCheckUtils]: 9: Hoare triple {1521#true} assume !(0 == ~cond); {1521#true} is VALID [2022-04-15 13:18:36,073 INFO L290 TraceCheckUtils]: 8: Hoare triple {1521#true} ~cond := #in~cond; {1521#true} is VALID [2022-04-15 13:18:36,073 INFO L272 TraceCheckUtils]: 7: Hoare triple {1687#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1521#true} is VALID [2022-04-15 13:18:36,073 INFO L290 TraceCheckUtils]: 6: Hoare triple {1687#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} assume !false; {1687#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-15 13:18:36,074 INFO L290 TraceCheckUtils]: 5: Hoare triple {1521#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1687#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-15 13:18:36,074 INFO L272 TraceCheckUtils]: 4: Hoare triple {1521#true} call #t~ret5 := main(); {1521#true} is VALID [2022-04-15 13:18:36,074 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1521#true} {1521#true} #80#return; {1521#true} is VALID [2022-04-15 13:18:36,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {1521#true} assume true; {1521#true} is VALID [2022-04-15 13:18:36,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {1521#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1521#true} is VALID [2022-04-15 13:18:36,075 INFO L272 TraceCheckUtils]: 0: Hoare triple {1521#true} call ULTIMATE.init(); {1521#true} is VALID [2022-04-15 13:18:36,076 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-15 13:18:36,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:18:36,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233325197] [2022-04-15 13:18:36,076 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:18:36,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975419757] [2022-04-15 13:18:36,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975419757] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:18:36,076 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 13:18:36,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-15 13:18:36,076 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:18:36,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2126125586] [2022-04-15 13:18:36,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2126125586] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:18:36,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:18:36,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 13:18:36,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173847773] [2022-04-15 13:18:36,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:18:36,078 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 43 [2022-04-15 13:18:36,079 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:18:36,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-15 13:18:36,101 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:18:36,101 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 13:18:36,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:18:36,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 13:18:36,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-15 13:18:36,102 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-15 13:18:36,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:36,489 INFO L93 Difference]: Finished difference Result 75 states and 94 transitions. [2022-04-15 13:18:36,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 13:18:36,490 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 43 [2022-04-15 13:18:36,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:18:36,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-15 13:18:36,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2022-04-15 13:18:36,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-15 13:18:36,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2022-04-15 13:18:36,493 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 76 transitions. [2022-04-15 13:18:36,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:18:36,556 INFO L225 Difference]: With dead ends: 75 [2022-04-15 13:18:36,556 INFO L226 Difference]: Without dead ends: 73 [2022-04-15 13:18:36,556 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-15 13:18:36,557 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:18:36,557 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 152 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:18:36,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-15 13:18:36,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 63. [2022-04-15 13:18:36,585 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:18:36,587 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 63 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 35 states have internal predecessors, (35), 20 states have call successors, (20), 10 states have call predecessors, (20), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 13:18:36,587 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 63 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 35 states have internal predecessors, (35), 20 states have call successors, (20), 10 states have call predecessors, (20), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 13:18:36,587 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 63 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 35 states have internal predecessors, (35), 20 states have call successors, (20), 10 states have call predecessors, (20), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 13:18:36,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:36,590 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2022-04-15 13:18:36,590 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 92 transitions. [2022-04-15 13:18:36,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:18:36,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:18:36,591 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 35 states have internal predecessors, (35), 20 states have call successors, (20), 10 states have call predecessors, (20), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 73 states. [2022-04-15 13:18:36,592 INFO L87 Difference]: Start difference. First operand has 63 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 35 states have internal predecessors, (35), 20 states have call successors, (20), 10 states have call predecessors, (20), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 73 states. [2022-04-15 13:18:36,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:36,596 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2022-04-15 13:18:36,596 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 92 transitions. [2022-04-15 13:18:36,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:18:36,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:18:36,597 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:18:36,597 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:18:36,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 35 states have internal predecessors, (35), 20 states have call successors, (20), 10 states have call predecessors, (20), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 13:18:36,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2022-04-15 13:18:36,599 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 73 transitions. Word has length 43 [2022-04-15 13:18:36,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:18:36,599 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 73 transitions. [2022-04-15 13:18:36,599 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-15 13:18:36,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 73 transitions. [2022-04-15 13:18:36,679 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:18:36,680 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2022-04-15 13:18:36,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-15 13:18:36,682 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:18:36,682 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:18:36,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 13:18:36,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-15 13:18:37,101 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:18:37,101 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:18:37,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:18:37,101 INFO L85 PathProgramCache]: Analyzing trace with hash 806930367, now seen corresponding path program 3 times [2022-04-15 13:18:37,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:18:37,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [736563788]